| Publication | Date of Publication | Type |
|---|
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
SIAM Journal on Computing | 2023-12-19 | Paper |
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7758330 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7651037 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Mean estimation when you have the source code; or, quantum Monte Carlo methods | 2022-08-16 | Paper |
Quantum lower bounds for approximate counting via Laurent polynomials
(available as arXiv preprint) | 2022-07-21 | Paper |
Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge
(available as arXiv preprint) | 2022-07-18 | Paper |
Quantum algorithm for simulating real time evolution of lattice Hamiltonians
SIAM Journal on Computing | 2021-02-08 | Paper |
The polynomial method strikes back: tight quantum query bounds via dual polynomials
Theory of Computing | 2020-12-17 | Paper |
scientific article; zbMATH DE number 7204275 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Quantum algorithms and approximating polynomials for composed functions with shared inputs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The polynomial method strikes back: tight quantum query bounds via dual polynomials
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Nested Quantum Walks with Quantum Data Structures
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
scientific article; zbMATH DE number 6913819 (Why is no real title available?)
Theory of Computing | 2018-08-06 | Paper |
Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
SIAM Journal on Computing | 2018-01-10 | Paper |
| Randomized query complexity of sabotaged and composed functions | 2017-12-19 | Paper |
Nearly optimal separations between communication (or query) complexity and partitions
(available as arXiv preprint) | 2017-10-10 | Paper |
Separations in query complexity using cheat sheets
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Separating decision tree complexity from subcube partition complexity
(available as arXiv preprint) | 2017-08-31 | Paper |
Exponential improvement in precision for simulating sparse Hamiltonians
Forum of Mathematics, Sigma | 2017-04-04 | Paper |
An optimal quantum algorithm for the oracle identification problem
(available as arXiv preprint) | 2017-03-03 | Paper |
scientific article; zbMATH DE number 6679846 (Why is no real title available?)
(available as arXiv preprint) | 2017-02-01 | Paper |
Dequantizing read-once quantum formulas
(available as arXiv preprint) | 2017-02-01 | Paper |
Improving quantum query complexity of Boolean matrix multiplication using graph collision
Algorithmica | 2016-11-01 | Paper |
Exponential improvement in precision for simulating sparse Hamiltonians
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Improving quantum query complexity of Boolean matrix multiplication using graph collision
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Time-efficient quantum walks for 3-distinctness
Automata, Languages, and Programming | 2013-08-06 | Paper |
Quantum query complexity of minor-closed graph properties
SIAM Journal on Computing | 2013-03-19 | Paper |
The quantum query complexity of read-many formulas
Algorithms – ESA 2012 | 2012-09-25 | Paper |
| Quantum query complexity of minor-closed graph properties | 2012-01-23 | Paper |
Quantum query complexity of minor-closed graph properties
(available as arXiv preprint) | 2012-01-23 | Paper |
Limitations on the simulation of non-sparse Hamiltonians
(available as arXiv preprint) | 2011-10-05 | Paper |
Simulating Sparse Hamiltonians with Star Decompositions
Theory of Quantum Computation, Communication, and Cryptography | 2011-01-28 | Paper |
