| Publication | Date of Publication | Type |
|---|
Efficient Quantum Algorithms for Simulating Lindblad Evolution
(available as arXiv preprint) | 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
Forum of Mathematics, Sigma | 2017-04-04 | Paper |
Perfect embezzlement of entanglement
Journal of Mathematical Physics | 2017-02-13 | Paper |
Perfect commuting-operator strategies for linear system games
Journal of Mathematical Physics | 2017-02-13 | Paper |
Computing with a full memory: catalytic space
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | 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 |
Efficient discrete-time simulations of continuous-time quantum query algorithms
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Characterization of binary constraint system games
Automata, Languages, and Programming | 2014-07-01 | Paper |
Quantum entanglement and the communication complexity of the inner product function
Theoretical Computer Science | 2013-12-11 | Paper |
Reconstructing strings from substrings with quantum queries
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Discrete-query quantum algorithm for NAND trees
Theory of Computing | 2011-05-24 | Paper |
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Quantum lower bounds for the Goldreich-Levin problem
Information Processing Letters | 2009-12-18 | Paper |
| Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR's | 2009-10-12 | Paper |
Quantum Algorithms for Evaluating Min-Max Trees
Theory of Quantum Computation, Communication, and Cryptography | 2009-01-13 | Paper |
scientific article; zbMATH DE number 5320319 (Why is no real title available?)
(available as arXiv preprint) | 2008-09-03 | Paper |
Perfect parallel repetition theorem for quantum XOR proof systems
Computational Complexity | 2008-08-20 | Paper |
| Quantum algorithms for Hamiltonian simulation | 2008-03-20 | Paper |
Quantum lower bounds by polynomials
Journal of the ACM | 2008-02-11 | Paper |
Efficient quantum algorithms for simulating sparse Hamiltonians
Communications in Mathematical Physics | 2007-05-31 | Paper |
| scientific article; zbMATH DE number 2086396 (Why is no real title available?) | 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086396 (Why is no real title available?)
(available as arXiv preprint) | 2004-08-11 | Paper |
The query complexity of order-finding
Information and Computation | 2004-08-10 | Paper |
scientific article; zbMATH DE number 1775389 (Why is no real title available?)
(available as arXiv preprint) | 2004-01-27 | Paper |
Sharp quantum versus classical query complexity separations
Algorithmica | 2003-05-04 | Paper |
| scientific article; zbMATH DE number 1256689 (Why is no real title available?) | 2002-01-20 | Paper |
Quantum entanglement and communication complexity
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1944610 (Why is no real title available?) | 2001-01-01 | Paper |
Teleportation as a quantum computation.
Physica D | 2000-11-20 | Paper |
scientific article; zbMATH DE number 1406113 (Why is no real title available?)
(available as arXiv preprint) | 2000-02-23 | Paper |
Quantum algorithms revisited
Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences | 1999-01-06 | Paper |
Interpolating Arithmetic Read-Once Formulas in Parallel
SIAM Journal on Computing | 1998-05-10 | Paper |
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences | 1996-11-26 | Paper |
Size-Depth Tradeoffs for Algebraic Formulas
SIAM Journal on Computing | 1995-11-01 | Paper |
Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S.
Advances in Cryptology - CRYPTO '90. A conference on the theory and application of Cryptography, Univ. of California, Santa Barbara, USA, August 11--15, 1990. Proceedings | 1994-09-20 | Paper |
Towards optimal simulations of formulas by bounded-width programs
Computational Complexity | 1993-10-10 | Paper |
A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\)
Journal of Combinatorial Theory. Series B | 1993-03-10 | Paper |
Computing Algebraic Formulas Using a Constant Number of Registers
SIAM Journal on Computing | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4191105 (Why is no real title available?) | 1990-01-01 | Paper |
