2
collaborators
2011–2017
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
1 Talk
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Multi-query Quantum Sums | TQC 2011 | regular ▸ presenter | James Pommersheim |
PARITY is the oracle (or black-box) problem of determining the parity of an n-bit string by querying positions in the string. We construct an n-r quantum query algorithm that computes the sum correctly with probability min{floor(n/r)/k,1}, for each 1 <= r <= n. This quantum algorithm utilizes the n-r queries sequentially and adaptively, like quantum search algorithms, but in a different way that is not amplitude amplification. We motivate the development of our algorithm by considering the simplest new instances of SUM and conclude by recalling the result of van Dam. |
|||
1 Poster
| Title | Conference | Co-authors |
|---|---|---|
| Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing | QIP 2017 | Thomas Wong |
Collaborators
| Co-author | Joint talks |
|---|---|
| James Pommersheim | 1 |
| Thomas Wong | 1 |