| Publication | Date of Publication | Type |
|---|
| Symmetries, graph properties, and quantum speedups | 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 | 2023-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874395 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089148 | 2022-07-18 | Paper |
| Non-interactive classical verification of quantum computation | 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 | 2020-04-21 | Paper |
| Can graph properties have exponential quantum speedup? | 2020-01-28 | Paper |
| Toward the first quantum simulation with quantum speedup | 2019-07-03 | Paper |
| Quantum algorithm for multivariate polynomial interpolation | 2018-11-28 | Paper |
| Quantum algorithm for systems of linear equations with exponentially improved dependence on precision | 2018-01-10 | Paper |
| Quantum algorithm for linear differential equations with exponentially improved dependence on precision | 2017-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598149 | 2017-12-19 | Paper |
| EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS | 2017-04-04 | Paper |
| Universal computation by multiparticle quantum walk | 2017-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2958409 | 2017-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3467512 | 2016-02-02 | Paper |
| EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS | 2015-06-26 | Paper |
| Quantum computation of discrete logarithms in semigroups | 2015-01-22 | Paper |
| Quantum algorithm for a generalized hidden shift problem | 2014-12-18 | Paper |
| The Bose-Hubbard model is QMA-complete | 2014-07-01 | Paper |
| Interpolatability distinguishes LOCC from separable von Neumann measurements | 2014-04-17 | Paper |
| Product formulas for exponentials of commutators | 2014-03-06 | Paper |
| Constructing elliptic curve isogenies in quantum subexponential time | 2014-02-05 | Paper |
| Levinson's theorem for graphs. II | 2014-01-14 | Paper |
| A framework for bounding nonlocality of state discrimination | 2013-11-11 | Paper |
| Levinson's theorem for graphs | 2013-09-24 | Paper |
| Time-efficient quantum walks for 3-distinctness | 2013-08-06 | Paper |
| Quantum query complexity of minor-closed graph properties | 2013-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4903867 | 2013-01-28 | Paper |
| Black-box Hamiltonian simulation and unitary implementation | 2012-10-21 | Paper |
| The quantum query complexity of read-many formulas | 2012-09-25 | Paper |
| Quantum query complexity of minor-closed graph properties | 2012-01-23 | Paper |
| Spatial search and the Dirac equation | 2011-12-04 | Paper |
| The quantum query complexity of certification | 2011-10-05 | Paper |
| Characterization of universal two-qubit Hamiltonians | 2011-10-05 | Paper |
| Limitations on the simulation of non-sparse Hamiltonians | 2011-10-05 | Paper |
| Quantum property testing for bounded-degree graphs | 2011-08-17 | Paper |
| Discrete-query quantum algorithm for NAND trees | 2011-05-24 | Paper |
| Quantum algorithms for algebraic problems | 2011-02-21 | Paper |
| On the relationship between continuous- and discrete-time quantum walk | 2011-02-17 | Paper |
| Simulating Sparse Hamiltonians with Star Decompositions | 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 | 2011-01-17 | Paper |
| Exponential algorithmic speedup by a quantum walk | 2010-08-16 | Paper |
| Reversible Simulation of Bipartite Product Hamiltonians | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522370 | 2008-09-03 | Paper |
| Secure assisted quantum computation | 2008-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522560 | 2008-09-03 | Paper |
| Asymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions | 2008-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522638 | 2008-09-03 | Paper |
| Optimal Quantum Adversary Lower Bounds for Ordered Search | 2008-08-28 | Paper |
| Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem | 2007-09-03 | Paper |
| Optimal measurements for the dihedral hidden subgroup problem | 2007-08-08 | Paper |
| The limitations of nice mutually unbiased bases | 2007-03-16 | Paper |
| TWO-WAY QUANTUM COMMUNICATION CHANNELS | 2006-05-10 | Paper |
| An example of the difference between quantum and classical random walks | 2005-11-07 | Paper |
| Exact sampling from non-attractive distributions using summary states | 2000-05-08 | Paper |
