| Publication | Date of Publication | Type |
|---|
| Efficient tomography of non-interacting-fermion states | 2024-11-20 | Paper |
| The acrobatics of BQP | 2024-07-05 | Paper |
| Quantum approximate counting, simplified | 2024-05-14 | Paper |
| Certified randomness from quantum supremacy | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187012 | 2024-02-05 | Paper |
| Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem | 2023-11-14 | Paper |
| An automated approach to the Collatz conjecture | 2023-06-27 | Paper |
| Discrete bulk reconstruction | 2023-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091154 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092465 | 2022-07-21 | Paper |
| Quantum lower bounds for approximate counting via Laurent polynomials | 2022-07-21 | Paper |
| New approaches for quantum copy-protection | 2022-03-31 | Paper |
| An automated approach to the Collatz conjecture | 2021-12-01 | Paper |
| Online learning of quantum states | 2021-03-16 | Paper |
| On the classical hardness of spoofing linear cross-entropy benchmarking | 2020-12-17 | Paper |
| Shadow tomography of quantum states | 2020-10-29 | Paper |
| A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory | 2020-10-20 | Paper |
| Complexity-theoretic foundations of quantum supremacy experiments | 2020-05-26 | Paper |
| Gentle measurement of quantum states and differential privacy | 2020-01-30 | Paper |
| Shadow tomography of quantum states | 2019-08-22 | Paper |
| The fewest clues problem | 2018-11-23 | Paper |
| Forrelation: a problem that optimally separates quantum from classical computing | 2018-07-04 | Paper |
| The classification of reversible bit operations | 2018-05-03 | Paper |
| Polynomials, quantum query complexity, and Grothendieck's inequality | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368760 | 2017-10-10 | Paper |
| Separations in query complexity using cheat sheets | 2017-09-29 | Paper |
| The computational complexity of ball permutations | 2017-08-17 | Paper |
| The fewest clues problem | 2017-07-17 | Paper |
| \(\mathrm P \overset {?} {=} \mathrm{NP}\) | 2016-10-18 | Paper |
| The space ``just above BQP | 2016-04-15 | Paper |
| Algebrization: a new barrier in complexity theory | 2015-09-24 | Paper |
| Forrelation: a problem that optimally separates quantum from classical computing | 2015-08-21 | Paper |
| The equivalence of sampling and searching | 2015-02-05 | Paper |
| The computational complexity of linear optics | 2014-10-06 | Paper |
| The need for structure in quantum speedups | 2014-10-06 | Paper |
| Quantum money from hidden subspaces | 2014-10-06 | Paper |
| A full characterization of quantum advice | 2014-09-18 | Paper |
| BQP and the polynomial hierarchy | 2014-08-13 | Paper |
| A full characterization of quantum advice | 2014-08-13 | Paper |
| Weak parity | 2014-07-01 | Paper |
| The computational complexity of linear optics | 2014-06-05 | Paper |
| Quantum money from hidden subspaces | 2014-05-13 | Paper |
| The one-way communication complexity of subgroup membership | 2014-05-06 | Paper |
| Sophistication as randomness deficiency | 2013-08-09 | Paper |
| Skepticism of quantum computing | 2012-12-27 | Paper |
| Impossibility of succinct quantum proofs for collision-freeness | 2012-10-21 | Paper |
| On circuit lower bounds from derandomization | 2012-09-27 | Paper |
| A linear-optical proof that the permanent is \(\#\mathrm{P}\)-hard | 2012-07-31 | Paper |
| Quantum computing and hidden variables | 2011-12-04 | Paper |
| Advice coins for classical and quantum computation | 2011-07-06 | Paper |
| The equivalence of sampling and searching | 2011-06-17 | Paper |
| Quantum search of spatial regions | 2011-05-24 | Paper |
| Quantum versus classical proofs and advice | 2011-05-24 | Paper |
| The power of unentanglement | 2011-05-24 | Paper |
| Limitations of Quantum Advice and One-Way Communication | 2011-05-24 | Paper |
| The complexity of agreement | 2010-08-16 | Paper |
| Lower bounds for local search by quantum arguments | 2010-08-15 | Paper |
| Multilinear formulas and skepticism of quantum computing | 2010-08-15 | Paper |
| Quantum lower bound for the collision problem | 2010-08-05 | Paper |
| Closed timelike curves make quantum and classical computing equivalent | 2010-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395977 | 2009-09-15 | Paper |
| On perfect completeness for QMA | 2009-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302098 | 2009-01-05 | Paper |
| Quantum lower bound for recursive Fourier sampling | 2008-09-03 | Paper |
| The learnability of quantum states | 2008-06-27 | Paper |
| The Limits of Quantum Computers | 2008-06-03 | Paper |
| Quantum lower bounds for the collision and the element distinctness problems | 2008-05-17 | Paper |
| Quantum certificate complexity | 2008-03-11 | Paper |
| Quantum computing, postselection, and probabilistic polynomial-time | 2007-11-21 | Paper |
| Lower Bounds for Local Search by Quantum Arguments | 2006-06-01 | Paper |
| Algorithms for Boolean Function Query Properties | 2003-09-28 | Paper |
