| Publication | Date of Publication | Type |
|---|
| A polynomial-time classical algorithm for noisy random circuit sampling | 2024-05-08 | Paper |
| Deniable encryption in a Quantum world | 2023-12-08 | Paper |
| (Sub)Exponential advantage of adiabatic Quantum computation with no sign problem | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874392 | 2023-02-07 | Paper |
| Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract) | 2023-02-03 | Paper |
| A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device | 2022-12-08 | Paper |
| Quantum Supremacy and the Complexity of Random Circuit Sampling | 2022-07-18 | Paper |
| Reducibility Among Protocols | 2022-01-08 | Paper |
| RSA bits are .732 + ε secure | 2022-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002773 | 2021-07-28 | Paper |
| The duality gap for two-team zero-sum games | 2019-05-24 | Paper |
| Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. | 2018-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638111 | 2018-05-03 | Paper |
| Rigorous RG algorithms and area laws for low energy eigenstates in 1D | 2017-10-23 | Paper |
| Algorithms, games, and evolution | 2017-02-16 | Paper |
| Molecular scale heat engines and scalable quantum computation | 2016-09-29 | Paper |
| Dense quantum coding and a lower bound for 1-way quantum automata | 2016-09-29 | Paper |
| Simple and efficient leader election in the full information model | 2016-09-01 | Paper |
| Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) | 2016-09-01 | Paper |
| Dense quantum coding and quantum finite automata | 2015-12-07 | Paper |
| Expander flows, geometric embeddings and graph partitioning | 2015-11-11 | Paper |
| Graph partitioning using single commodity flows | 2015-11-11 | Paper |
| Certifiable quantum dice | 2015-08-21 | Paper |
| Quantum complexity theory | 2015-05-07 | Paper |
| Quantum walks on graphs | 2015-02-27 | Paper |
| Quantum mechanical algorithms for the nonabelian hidden subgroup problem | 2015-02-27 | Paper |
| The detectability lemma and quantum gap amplification | 2015-02-04 | Paper |
| Graph partitioning using single commodity flows | 2014-11-25 | Paper |
| Computing with highly mixed states (extended abstract) | 2014-09-26 | Paper |
| Quantum bit escrow | 2014-09-26 | Paper |
| The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach | 2014-07-30 | Paper |
| Certifiable quantum dice | 2014-05-13 | Paper |
| Approximation Algorithms for Union and Intersection Covering Problems | 2012-08-31 | Paper |
| An improved 1D area law for frustration-free systems | 2011-11-12 | Paper |
| Expander flows, geometric embeddings and graph partitioning | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549733 | 2009-01-05 | Paper |
| Computing with highly mixed states | 2008-12-21 | Paper |
| AdWords and generalized online matching | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024780 | 2005-07-04 | Paper |
| Quantum mechanical algorithms for the nonabelian hidden subgroup problem | 2005-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044310 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736886 | 2004-08-11 | Paper |
| The Quantum Communication Complexity of Sampling | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782696 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230355 | 1999-04-22 | Paper |
| On Syntactic versus Computational Views of Approximability | 1998-09-21 | Paper |
| Quantum Complexity Theory | 1998-02-10 | Paper |
| Strengths and Weaknesses of Quantum Computing | 1998-02-10 | Paper |
| Introduction to Special Section on Quantum Computation | 1998-02-10 | Paper |
| A mildly exponential approximation algorithm for the permanent | 1997-02-18 | Paper |
| A Markovian extension of Valiant's learning model | 1995-07-06 | Paper |
| A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem | 1994-04-28 | Paper |
| Parallel searching of multidimensional cubes | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976407 | 1992-06-26 | Paper |
| The Two-Processor Scheduling Problem is in Random NC | 1989-01-01 | Paper |
| Matching is as easy as matrix inversion | 1987-01-01 | Paper |
| Global wire routing in two-dimensional arrays | 1987-01-01 | Paper |
| Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources | 1987-01-01 | Paper |
| Generating quasi-random sequences from semi-random sources | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3702366 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732972 | 1985-01-01 | Paper |
| On two geometric problems related to the travelling salesman problem | 1984-01-01 | Paper |
| A natural encoding scheme proved probabilistic polynomial complete | 1983-01-01 | Paper |
