| 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
Theory of Computing | 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
International Congress of Mathematicians | 2024-03-20 | Paper |
Simple tests of quantumness also certify qubits
Advances in Cryptology – CRYPTO 2023 | 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
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
scientific article; zbMATH DE number 7651035 (Why is no real title available?)
| 2023-02-07 | Paper |
Almost synchronous quantum correlations
Journal of Mathematical Physics | 2022-12-08 | Paper |
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
Journal of the ACM | 2022-12-08 | Paper |
Non-interactive zero-knowledge arguments for QMA, with preprocessing
| 2022-12-07 | Paper |
Anchored parallel repetition for nonlocal games
SIAM Journal on Computing | 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
Communications in Mathematical Physics | 2021-04-08 | Paper |
Erratum to: ``Three-player entangled XOR games are NP-hard to approximate
SIAM Journal on Computing | 2021-01-13 | Paper |
Quantum soundness of the classical low individual degree test
| 2020-09-27 | Paper |
scientific article; zbMATH DE number 7250160 (Why is no real title available?)
| 2020-09-22 | Paper |
Bounds on Dimension Reduction in the Nuclear Norm
Lecture Notes in Mathematics | 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
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
From operator algebras to complexity theory and back
Notices of the American Mathematical Society | 2019-12-20 | Paper |
Verifying quantum computations at scale: a cryptographic leash on quantum devices
Bulletin of the American Mathematical Society | 2019-12-10 | Paper |
Simple and tight device-independent security proofs
SIAM Journal on Computing | 2019-03-22 | Paper |
Entanglement in non-local games and the hyperlinear profile of groups
Annales Henri Poincaré | 2018-10-30 | Paper |
scientific article; zbMATH DE number 6866338 (Why is no real title available?)
| 2018-05-03 | Paper |
Parallel repetition via fortification: analytic view and the quantum case
| 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
Communications in Mathematical Physics | 2017-10-23 | Paper |
A quantum linearity test for robustly verifying entanglement
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Hardness amplification for entangled games via anchoring
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
A multiprover interactive proof system for the local Hamiltonian problem (extended abtract)
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Non-Signaling Parallel Repetition Using de Finetti Reductions
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Quantum XOR games
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Three-player entangled XOR games are NP-hard to approximate
SIAM Journal on Computing | 2016-07-04 | Paper |
Quantum proofs
Foundations and Trends in Theoretical Computer Science | 2016-05-23 | Paper |
Survey on nonlocal games and operator space theory
Journal of Mathematical Physics | 2016-02-15 | Paper |
Optimal counterfeiting attacks and generalizations for Wiesner's quantum money
Theory of Quantum Computation, Communication, and Cryptography | 2015-12-03 | Paper |
Interactive proofs with approximately commuting provers
Automata, Languages, and Programming | 2015-10-27 | Paper |
Certifiable quantum dice
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
A parallel repetition theorem for entangled projection games
Computational Complexity | 2015-06-23 | Paper |
Efficient Rounding for the Noncommutative Grothendieck Inequality
Theory of Computing | 2014-10-06 | Paper |
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Efficient rounding for the noncommutative Grothendieck inequality
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Elementary proofs of Grothendieck theorems for completely bounded norms
Journal of Operator Theory | 2014-07-14 | Paper |
Unbounded entanglement can be needed to achieve the optimal success probability
Automata, Languages, and Programming | 2014-07-01 | Paper |
Parallel repetition of entangled games
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Certifiable quantum dice, or, true random number generation secure against quantum adversaries
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
scientific article; zbMATH DE number 6292622 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Robust randomness amplifiers: upper and lower bounds
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Explicit lower and upper bounds on the entangled value of multiplayer XOR games
Communications in Mathematical Physics | 2013-07-26 | Paper |
Trevisan's extractor in the presence of quantum side information
SIAM Journal on Computing | 2012-11-29 | Paper |
All Schatten spaces endowed with the Schur product are \(Q\)-algebras
Journal of Functional Analysis | 2011-12-14 | Paper |
Entangled games are hard to approximate
SIAM Journal on Computing | 2011-10-18 | Paper |
Quantum Algorithms
Quantum Information, Computation and Cryptography | 2011-02-18 | Paper |
Using entanglement in quantum multi-prover interactive proofs
Computational Complexity | 2011-02-18 | Paper |
Better Gap-Hamming Lower Bounds via Better Round Elimination
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Hauteur asymptotique des points de Heegner
Canadian Journal of Mathematics | 2008-12-12 | Paper |
Sieve algorithms for the shortest vector problem are practical
Journal of Mathematical Cryptology | 2008-11-07 | Paper |
