| ANCHORED PARALLEL REPETITION FOR NONLOCAL GAMES | 0 | 0.34 | 2022 |
| Self-testing of a single quantum device under computational assumptions | 0 | 0.34 | 2021 |
| Self-testing of a single quantum device under computational assumptions | 1 | 0.35 | 2021 |
| Quantum soundness of testing tensor codes | 0 | 0.34 | 2021 |
| MIP* = RE | 1 | 0.35 | 2021 |
| Special Section on the Fiftieth Annual ACM Symposium on Theory of Computing (STOC 2018). | 0 | 0.34 | 2020 |
| Simpler Proofs of Quantumness | 0 | 0.34 | 2020 |
| A three-player coherent state embezzlement game | 1 | 0.38 | 2020 |
| Erratum: Three-Player Entangled Xor Games Are Np-Hard To Approximate | 0 | 0.34 | 2020 |
| Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing. | 0 | 0.34 | 2020 |
| Classical zero-knowledge arguments for quantum computations. | 0 | 0.34 | 2019 |
| Fully device independent quantum key distribution | 0 | 0.34 | 2019 |
| SIMPLE AND TIGHT DEVICE-INDEPENDENT SECURITY PROOFS | 6 | 0.59 | 2019 |
| Verifier-on-a-Leash: New schemes for verifiable delegated quantum computation, with quasilinear resources | 5 | 0.45 | 2019 |
| Two-player entangled games are NP-hard. | 1 | 0.36 | 2018 |
| Certifiable Randomness from a Single Quantum Device. | 1 | 0.35 | 2018 |
| Quantum proof systems for iterated exponential time, and beyond. | 1 | 0.35 | 2018 |
| ENTANGLEMENT OF APPROXIMATE QUANTUM STRATEGIES IN XOR GAMES | 0 | 0.34 | 2018 |
| Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA | 5 | 0.45 | 2018 |
| A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries. | 0 | 0.34 | 2017 |
| Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. | 1 | 0.35 | 2017 |
| A quantum linearity test for robustly verifying entanglement. | 2 | 0.38 | 2017 |
| Overlapping Qubits. | 0 | 0.34 | 2017 |
| Hardness amplification for entangled games via anchoring. | 2 | 0.38 | 2017 |
| A Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem. | 0 | 0.34 | 2016 |
| Privacy Amplification Against Active Quantum Adversaries. | 0 | 0.34 | 2016 |
| QCMA hardness of ground space connectivity for commuting Hamiltonians. | 0 | 0.34 | 2016 |
| Quantum Proofs. | 1 | 0.36 | 2016 |
| Parallel repetition via fortification: analytic view and the quantum case. | 2 | 0.42 | 2016 |
| Quantum-Proof Extractors: Optimal up to Constant Factors. | 0 | 0.34 | 2016 |
| Robust self-testing of many-qubit states. | 4 | 0.47 | 2016 |
| A Multiprover Interactive Proof System for the Local Hamiltonian Problem | 15 | 0.80 | 2015 |
| A parallel repetition theorem for entangled projection games. | 16 | 0.89 | 2015 |
| Interactive Proofs with Approximately Commuting Provers | 0 | 0.34 | 2015 |
| Unbounded entanglement in nonlocal games | 0 | 0.34 | 2015 |
| Anchoring games for parallel repetition | 6 | 0.63 | 2015 |
| Constant-Soundness Interactive Proofs for Local Hamiltonians | 1 | 0.35 | 2015 |
| Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability. | 3 | 0.48 | 2014 |
| Robust device independent quantum key distribution | 3 | 0.40 | 2014 |
| An efficient algorithm for finding the ground state of 1D gapped local hamiltonians | 0 | 0.34 | 2014 |
| The Quantum PCP Conjecture. | 3 | 0.39 | 2013 |
| Three-Player Entangled XOR Games Are NP-Hard to Approximate | 7 | 0.50 | 2013 |
| Quantum XOR Games. | 3 | 0.43 | 2013 |
| Multipartite entanglement in XOR games | 2 | 0.39 | 2013 |
| Guest column: the quantum PCP conjecture | 14 | 0.65 | 2013 |
| Robust Randomness Amplifiers: Upper and Lower Bounds. | 3 | 0.45 | 2013 |
| Efficient Rounding for the Noncommutative Grothendieck Inequality. | 4 | 0.41 | 2012 |
| Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money. | 6 | 0.55 | 2012 |
| Trevisan's extractor in the presence of quantum side information | 28 | 1.06 | 2012 |
| A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers | 30 | 1.27 | 2012 |
