| Publication | Date of Publication | Type |
|---|
| Efficient Quantum Algorithms for Simulating Lindblad Evolution | 2020-05-27 | Paper |
| Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement | 2018-11-29 | Paper |
| EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS | 2017-04-04 | Paper |
| Perfect embezzlement of entanglement | 2017-02-13 | Paper |
| Perfect commuting-operator strategies for linear system games | 2017-02-13 | Paper |
| EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS | 2015-06-26 | Paper |
| Computing with a full memory | 2015-06-26 | Paper |
| Efficient discrete-time simulations of continuous-time quantum query algorithms | 2015-02-04 | Paper |
| Characterization of Binary Constraint System Games | 2014-07-01 | Paper |
| Quantum entanglement and the communication complexity of the inner product function | 2013-12-11 | Paper |
| Reconstructing Strings from Substrings with Quantum Queries | 2012-08-14 | Paper |
| Discrete-query quantum algorithm for NAND trees | 2011-05-24 | Paper |
| Exponential algorithmic speedup by a quantum walk | 2010-08-16 | Paper |
| Quantum lower bounds for the Goldreich-Levin problem | 2009-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3181590 | 2009-10-12 | Paper |
| Quantum Algorithms for Evaluating Min-Max Trees | 2009-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522527 | 2008-09-03 | Paper |
| Perfect parallel repetition theorem for quantum XOR proof systems | 2008-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5448348 | 2008-03-20 | Paper |
| Quantum lower bounds by polynomials | 2008-02-11 | Paper |
| Efficient quantum algorithms for simulating sparse Hamiltonians | 2007-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736850 | 2004-08-11 | Paper |
| The query complexity of order-finding | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542521 | 2004-01-27 | Paper |
| Sharp quantum versus classical query complexity separations | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230376 | 2002-01-20 | Paper |
| Quantum entanglement and communication complexity | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407925 | 2001-01-01 | Paper |
| Teleportation as a quantum computation. | 2000-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939137 | 2000-02-23 | Paper |
| Quantum algorithms revisited | 1999-01-06 | Paper |
| Interpolating Arithmetic Read-Once Formulas in Parallel | 1998-05-10 | Paper |
| Oracles and queries that are sufficient for exact learning | 1996-11-26 | Paper |
| Size-Depth Tradeoffs for Algebraic Formulas | 1995-11-01 | Paper |
| Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. | 1994-09-20 | Paper |
| Towards optimal simulations of formulas by bounded-width programs | 1993-10-10 | Paper |
| A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\) | 1993-03-10 | Paper |
| Computing Algebraic Formulas Using a Constant Number of Registers | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210165 | 1990-01-01 | Paper |
