| Publication | Date of Publication | Type |
|---|
| Quantum codes, local testability and interactive proofs: state of the art and open questions (invited talk) | 2024-11-14 | Paper |
| Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources | 2024-10-29 | Paper |
| Good quantum LDPC codes with linear time decoders | 2024-05-08 | Paper |
| \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem | 2024-03-20 | Paper |
| Simple tests of quantumness also certify qubits | 2024-02-06 | Paper |
| Efficiently stable presentations from error-correcting codes | 2023-11-08 | Paper |
| Introduction to Quantum Cryptography | 2023-08-28 | Paper |
| Succinct classical verification of quantum computation | 2023-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874392 | 2023-02-07 | Paper |
| Almost synchronous quantum correlations | 2022-12-08 | Paper |
| A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device | 2022-12-08 | Paper |
| Non-interactive zero-knowledge arguments for QMA, with preprocessing | 2022-12-07 | Paper |
| Anchored Parallel Repetition for Nonlocal Games | 2022-04-01 | Paper |
| Classical proofs of quantum knowledge | 2021-12-08 | Paper |
| Quantum soundness of testing tensor codes | 2021-11-15 | Paper |
| Trading locality for time: certifiable randomness from low-depth circuits | 2021-04-08 | Paper |
| Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate | 2021-01-13 | Paper |
| Quantum soundness of the classical low individual degree test | 2020-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121908 | 2020-09-22 | Paper |
| Bounds on Dimension Reduction in the Nuclear Norm | 2020-08-21 | Paper |
| A quantum-proof non-malleable extractor. With application to privacy amplification against active quantum adversaries | 2020-02-06 | Paper |
| Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources | 2020-02-04 | Paper |
| Quantum proof systems for iterated exponential time, and beyond | 2020-01-30 | Paper |
| From Operator Algebras to Complexity Theory and Back | 2019-12-20 | Paper |
| Verifying quantum computations at scale: A cryptographic leash on quantum devices | 2019-12-10 | Paper |
| Simple and Tight Device-Independent Security Proofs | 2019-03-22 | Paper |
| Entanglement in non-local games and the hyperlinear profile of groups | 2018-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638103 | 2018-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638072 | 2018-05-03 | Paper |
| Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. | 2018-05-03 | Paper |
| Rigorous RG algorithms and area laws for low energy eigenstates in 1D | 2017-10-23 | Paper |
| A quantum linearity test for robustly verifying entanglement | 2017-08-17 | Paper |
| Hardness amplification for entangled games via anchoring | 2017-08-17 | Paper |
| A Multiprover Interactive Proof System for the Local Hamiltonian Problem | 2017-05-19 | Paper |
| Non-Signaling Parallel Repetition Using de Finetti Reductions | 2017-04-28 | Paper |
| Quantum XOR games | 2016-10-24 | Paper |
| Three-player entangled XOR games are NP-hard to approximate | 2016-07-04 | Paper |
| Quantum proofs | 2016-05-23 | Paper |
| Survey on nonlocal games and operator space theory | 2016-02-15 | Paper |
| Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money | 2015-12-03 | Paper |
| Interactive Proofs with Approximately Commuting Provers | 2015-10-27 | Paper |
| Certifiable quantum dice | 2015-08-21 | Paper |
| A parallel repetition theorem for entangled projection games | 2015-06-23 | Paper |
| Efficient Rounding for the Noncommutative Grothendieck Inequality | 2014-10-06 | Paper |
| Near-optimal extractors against quantum storage | 2014-08-13 | Paper |
| Efficient rounding for the noncommutative grothendieck inequality | 2014-08-07 | Paper |
| Elementary proofs of Grothendieck theorems for completely bounded norms | 2014-07-14 | Paper |
| Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability | 2014-07-01 | Paper |
| Parallel repetition of entangled games | 2014-06-05 | Paper |
| Certifiable quantum dice | 2014-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414596 | 2014-05-06 | Paper |
| Robust Randomness Amplifiers: Upper and Lower Bounds | 2013-10-04 | Paper |
| Explicit lower and upper bounds on the entangled value of multiplayer XOR games | 2013-07-26 | Paper |
| Trevisan's Extractor in the Presence of Quantum Side Information | 2012-11-29 | Paper |
| All Schatten spaces endowed with the Schur product are \(Q\)-algebras | 2011-12-14 | Paper |
| Entangled Games Are Hard to Approximate | 2011-10-18 | Paper |
| Quantum Algorithms | 2011-02-18 | Paper |
| Using entanglement in quantum multi-prover interactive proofs | 2011-02-18 | Paper |
| Better Gap-Hamming Lower Bounds via Better Round Elimination | 2010-09-10 | Paper |
| Hauteur asymptotique des points de Heegner | 2008-12-12 | Paper |
| Sieve algorithms for the shortest vector problem are practical | 2008-11-07 | Paper |
