| Publication | Date of Publication | Type |
|---|
Symmetries, graph properties, and quantum speedups
SIAM Journal on Computing | 2024-12-20 | Paper |
| Quantum algorithms and the power of forgetting | 2024-09-25 | Paper |
Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice
Science | 2023-11-24 | Paper |
scientific article; zbMATH DE number 7651037 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7559364 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Non-interactive classical verification of quantum computation
(available as arXiv preprint) | 2022-03-23 | Paper |
| Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice | 2022-02-02 | Dataset |
| Efficient Product Formulas for Commutators and Applications to Quantum Simulation | 2021-11-23 | Paper |
Quantum spectral methods for differential equations
Communications in Mathematical Physics | 2020-04-21 | Paper |
| Can graph properties have exponential quantum speedup? | 2020-01-28 | Paper |
Toward the first quantum simulation with quantum speedup
Proceedings of the National Academy of Sciences | 2019-07-03 | Paper |
Quantum algorithm for multivariate polynomial interpolation
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2018-11-28 | Paper |
Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
SIAM Journal on Computing | 2018-01-10 | Paper |
Quantum algorithm for linear differential equations with exponentially improved dependence on precision
Communications in Mathematical Physics | 2017-12-20 | Paper |
scientific article; zbMATH DE number 6820205 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | Paper |
Exponential improvement in precision for simulating sparse Hamiltonians
Forum of Mathematics, Sigma | 2017-04-04 | Paper |
Universal computation by multiparticle quantum walk
Science | 2017-02-15 | Paper |
scientific article; zbMATH DE number 6679846 (Why is no real title available?)
(available as arXiv preprint) | 2017-02-01 | Paper |
scientific article; zbMATH DE number 6538680 (Why is no real title available?)
Theory of Computing | 2016-02-02 | 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 |
Quantum computation of discrete logarithms in semigroups
Journal of Mathematical Cryptology | 2015-01-22 | Paper |
Quantum computation of discrete logarithms in semigroups
Journal of Mathematical Cryptology | 2015-01-22 | Paper |
Quantum algorithm for a generalized hidden shift problem
(available as arXiv preprint) | 2014-12-18 | Paper |
The Bose-Hubbard model is QMA-complete
Automata, Languages, and Programming | 2014-07-01 | Paper |
Interpolatability distinguishes LOCC from separable von Neumann measurements
Journal of Mathematical Physics | 2014-04-17 | Paper |
Product formulas for exponentials of commutators
Journal of Mathematical Physics | 2014-03-06 | Paper |
Constructing elliptic curve isogenies in quantum subexponential time
Journal of Mathematical Cryptology | 2014-02-05 | Paper |
Levinson's theorem for graphs. II
Journal of Mathematical Physics | 2014-01-14 | Paper |
A framework for bounding nonlocality of state discrimination
Communications in Mathematical Physics | 2013-11-11 | Paper |
Levinson's theorem for graphs
Journal of Mathematical Physics | 2013-09-24 | 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 |
scientific article; zbMATH DE number 6131346 (Why is no real title available?)
(available as arXiv preprint) | 2013-01-28 | Paper |
Black-box Hamiltonian simulation and unitary implementation
(available as arXiv preprint) | 2012-10-21 | 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 |
Spatial search and the Dirac equation
Physical Review A | 2011-12-04 | Paper |
| The quantum query complexity of certification | 2011-10-05 | Paper |
Characterization of universal two-qubit Hamiltonians
(available as arXiv preprint) | 2011-10-05 | Paper |
Limitations on the simulation of non-sparse Hamiltonians
(available as arXiv preprint) | 2011-10-05 | Paper |
Quantum property testing for bounded-degree graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Discrete-query quantum algorithm for NAND trees
Theory of Computing | 2011-05-24 | Paper |
Quantum algorithms for algebraic problems
Reviews of Modern Physics | 2011-02-21 | Paper |
On the relationship between continuous- and discrete-time quantum walk
Communications in Mathematical Physics | 2011-02-17 | Paper |
Simulating Sparse Hamiltonians with Star Decompositions
Theory of Quantum Computation, Communication, and Cryptography | 2011-01-28 | Paper |
Any AND-OR formula of size \(N\) can be evaluated in time \(N^{1/2+o(1)}\) on a quantum computer
SIAM Journal on Computing | 2011-01-17 | Paper |
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Reversible Simulation of Bipartite Product Hamiltonians
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
scientific article; zbMATH DE number 5320186 (Why is no real title available?)
(available as arXiv preprint) | 2008-09-03 | Paper |
Secure assisted quantum computation
(available as arXiv preprint) | 2008-09-03 | Paper |
scientific article; zbMATH DE number 5320343 (Why is no real title available?)
(available as arXiv preprint) | 2008-09-03 | Paper |
Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions
(available as arXiv preprint) | 2008-09-03 | Paper |
scientific article; zbMATH DE number 5320411 (Why is no real title available?)
(available as arXiv preprint) | 2008-09-03 | Paper |
Optimal Quantum Adversary Lower Bounds for Ordered Search
Automata, Languages and Programming | 2008-08-28 | Paper |
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem
STACS 2007 | 2007-09-03 | Paper |
Optimal measurements for the dihedral hidden subgroup problem
Chicago Journal of Theoretical Computer Science | 2007-08-08 | Paper |
Optimal measurements for the dihedral hidden subgroup problem
Chicago Journal of Theoretical Computer Science | 2007-08-08 | Paper |
The limitations of nice mutually unbiased bases
Journal of Algebraic Combinatorics | 2007-03-16 | Paper |
TWO-WAY QUANTUM COMMUNICATION CHANNELS
International Journal of Quantum Information | 2006-05-10 | Paper |
An example of the difference between quantum and classical random walks
Quantum Information Processing | 2005-11-07 | Paper |
| Exact sampling from non-attractive distributions using summary states | 2000-05-08 | Paper |
