| Publication | Date of Publication | Type |
|---|
| Zero-knowledge proof systems for QMA | 2025-01-14 | Paper |
| Complexity limitations on one-turn quantum refereed games | 2023-05-02 | Paper |
| On the mixed-unitary rank of quantum channels | 2022-08-18 | Paper |
| Revisiting the simulation of quantum Turing machines by quantum circuits | 2021-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4578333 | 2018-08-08 | Paper |
| The Theory of Quantum Information | 2018-03-28 | Paper |
| Hedging bets with correlated quantum strategies | 2017-09-29 | Paper |
| Extended non-local games and monogamy-of-entanglement games | 2017-09-29 | Paper |
| Ancilla dimension in quantum channel discrimination | 2017-05-19 | Paper |
| Limitations on Separable Measurements by Convex Optimization | 2017-04-28 | Paper |
| Quantum interactive proofs with weak error bounds | 2016-10-07 | Paper |
| Quantum proofs | 2016-05-23 | Paper |
| Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money | 2015-12-03 | Paper |
| One-dimensional quantum walks | 2015-02-27 | Paper |
| Quantum algorithms for solvable groups | 2015-02-27 | Paper |
| Zero-knowledge against quantum attacks | 2014-11-25 | Paper |
| Parallelization, amplification, and exponential time simulation of quantum interactive proof systems | 2014-09-26 | Paper |
| \(\mathrm{QIP} = \mathrm{PSPACE}\) | 2014-08-13 | Paper |
| Two-Message Quantum Interactive Proofs Are in PSPACE | 2014-07-25 | Paper |
| Simpler semidefinite programs for completely bounded norms | 2014-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414630 | 2014-05-07 | Paper |
| QIP = PSPACE | 2014-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002832 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002811 | 2011-05-24 | Paper |
| Matchgate and space-bounded quantum computations are equivalent | 2010-10-02 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Closed timelike curves make quantum and classical computing equivalent | 2010-05-19 | Paper |
| Zero-knowledge against quantum attacks | 2010-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3633946 | 2009-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602395 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549656 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522509 | 2008-09-03 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| One-dimensional quantum walks with absorbing boundaries | 2005-02-23 | Paper |
| On the complexity of simulating space-bounded quantum computations | 2004-12-13 | Paper |
| PSPACE has constant-round quantum interactive proof systems | 2003-05-14 | Paper |
| Sharp quantum versus classical query complexity separations | 2003-05-04 | Paper |
| Two-way finite automata with quantum and classical states. | 2003-01-21 | Paper |
| Quantum simulations of classical random walks and undirected graph connectivity | 2001-09-09 | Paper |
| Space-bounded quantum complexity | 2000-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252737 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258586 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4855947 | 1996-09-03 | Paper |
