Thomas Vidick - RankMe

113 papers A* 16A 12Journal 71Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Quantum Interactive Oracle Proofs. CoRR Baocheng Sun, Thomas Vidick
2025	J	`jnl`	Approximating the quantum value of an LCS game is RE-hard. CoRR Aviv Taller, Thomas Vidick
2025	J	`jnl`	Derandomised tensor product gap amplification for quantum Hamiltonians. CoRR Thiago Bergamaschi, Tony Metger, Thomas Vidick, Tina Zhang
2025	—	`conf`	Quantum Interactive Oracle Proofs. TCC (3) Baocheng Sun, Thomas Vidick
2024	A*	`conf`	Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes. FOCS Irit Dinur, Ting-Chun Lin, Thomas Vidick
2024	J	`jnl`	Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes. CoRR Irit Dinur, Ting-Chun Lin, Thomas Vidick
2024	J	`jnl`	Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources. Theory Comput. Andrea Coladangelo, Alex B. Grilo, Stacey Jeffery, Thomas Vidick
2023	A*	`conf`	Good Quantum LDPC Codes with Linear Time Decoders. STOC Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick
2023	A*	`conf`	Quantum Codes, Local Testability and Interactive Proofs: State of the Art and Open Questions (Invited Talk). ICALP Thomas Vidick
2023	—	`conf`	Simple Tests of Quantumness Also Certify Qubits. CRYPTO (5) Zvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku-Meyer, Eitan Porat, Thomas Vidick
2022	J	`jnl`	A monogamy-of-entanglement game for subspace coset states. Quantum Eric Culf, Thomas Vidick
2022	J	`jnl`	Anchored Parallel Repetition for Nonlocal Games. SIAM J. Comput. Mohammad Bavarian, Thomas Vidick, Henry Yuen
2022	J	`jnl`	Efficient Certifiable Randomness from a Single Quantum Device. CoRR Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick
2022	J	`jnl`	Group coset monogamy games and an application to device-independent continuous-variable QKD. CoRR Eric Culf, Thomas Vidick, Victor V. Albert
2022	—	`conf`	Succinct Classical Verification of Quantum Computation. CRYPTO (2) James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang
2022	J	`jnl`	Succinct Classical Verification of Quantum Computation. CoRR James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang
2022	J	`jnl`	Succinct Classical Verification of Quantum Computation. IACR Cryptol. ePrint Arch. James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang
2021	J	`jnl`	A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. J. ACM Zvika Brakerski, Paul F. Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick
2021	J	`jnl`	A monogamy-of-entanglement game for subspace coset states. CoRR Eric Culf, Thomas Vidick
2021	—	`conf`	Classical Proofs of Quantum Knowledge. EUROCRYPT (2) Thomas Vidick, Tina Zhang
2021	J	`jnl`	MIP* = RE. Commun. ACM Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen
2021	A*	`conf`	Quantum soundness of testing tensor codes. FOCS Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen
2021	J	`jnl`	Quantum soundness of testing tensor codes. CoRR Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen
2021	A	`conf`	Self-Testing of a Single Quantum Device Under Computational Assumptions. ITCS Tony Metger, Thomas Vidick
2021	J	`jnl`	Self-testing of a single quantum device under computational assumptions. Quantum Tony Metger, Thomas Vidick
2020	A	`ed.`	11th Innovations in Theoretical Computer Science Conference, ITCS 2020, Seattle, Washington, USA, January 12-14, 2020 ITCS Thomas Vidick
2020	J	`jnl`	A three-player coherent state embezzlement game. Quantum Zhengfeng Ji, Debbie W. Leung, Thomas Vidick
2020	J	`jnl`	Classical zero-knowledge arguments for quantum computations. Quantum Thomas Vidick, Tina Zhang
2020	J	`jnl`	Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate. SIAM J. Comput. Thomas Vidick
2020	J	`jnl`	MIP*=RE. CoRR Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen
2020	—	`conf`	Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing. CRYPTO (3) Andrea Coladangelo, Thomas Vidick, Tina Zhang
2020	J	`jnl`	Quantum soundness of the classical low individual degree test. CoRR Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen
2020	—	`conf`	Simpler Proofs of Quantumness. TQC Zvika Brakerski, Venkata Koppula, Umesh V. Vazirani, Thomas Vidick
2020	J	`jnl`	Simpler Proofs of Quantumness. CoRR Zvika Brakerski, Venkata Koppula, Umesh V. Vazirani, Thomas Vidick
2020	J	`jnl`	Special Section on the Fiftieth Annual ACM Symposium on Theory of Computing (STOC 2018). SIAM J. Comput. Thomas Vidick, Danupon Nanongkai, Dimitris Achlioptas
2019	J	`jnl`	A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries. IACR Cryptol. ePrint Arch. Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick
2019	—	`conf`	A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries. EUROCRYPT (2) Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick
2019	J	`jnl`	Classical zero-knowledge arguments for quantum computations. IACR Cryptol. ePrint Arch. Thomas Vidick, Tina Zhang
2019	A*	`conf`	Computationally-Secure and Composable Remote State Preparation. FOCS Alexandru Gheorghiu, Thomas Vidick
2019	J	`jnl`	Computationally-secure and composable remote state preparation. CoRR Alexandru Gheorghiu, Thomas Vidick
2019	J	`jnl`	Fully device independent quantum key distribution. Commun. ACM Umesh V. Vazirani, Thomas Vidick
2019	J	`jnl`	Non-interactive zero-knowledge arguments for QMA, with preprocessing. CoRR Andrea Coladangelo, Thomas Vidick, Tina Zhang
2019	A*	`conf`	Quantum proof systems for iterated exponential time, and beyond. STOC Joseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen
2019	J	`jnl`	Simple and Tight Device-Independent Security Proofs. SIAM J. Comput. Rotem Arnon Friedman, Renato Renner, Thomas Vidick
2019	—	`conf`	Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources. EUROCRYPT (3) Andrea Coladangelo, Alex Bredariol Grilo, Stacey Jeffery, Thomas Vidick
2019	J	`jnl`	Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources. IACR Cryptol. ePrint Arch. Andrea Coladangelo, Alex Bredariol Grilo, Stacey Jeffery, Thomas Vidick
2018	A*	`conf`	A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. FOCS Zvika Brakerski, Paul F. Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick
2018	J	`jnl`	Certifiable Randomness from a Single Quantum Device. CoRR Zvika Brakerski, Paul F. Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick
2018	J	`jnl`	Entanglement of approximate quantum strategies in XOR games. Quantum Inf. Comput. Dimiter Ostrev, Thomas Vidick
2018	A*	`conf`	Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA. FOCS Anand Natarajan, Thomas Vidick
2018	J	`jnl`	Quantum proof systems for iterated exponential time, and beyond. CoRR Joseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen
2018	J	`jnl`	Quantum proof systems for iterated exponential time, and beyond. Electron. Colloquium Comput. Complex. Joseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen
2018	J	`jnl`	Test for a large amount of entanglement, using few measurements. Quantum Rui Chao, Ben W. Reichardt, Chris Sutherland, Thomas Vidick
2018	A	`conf`	Two-Player Entangled Games are NP-Hard. CCC Anand Natarajan, Thomas Vidick
2017	J	`jnl`	A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries. CoRR Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick
2017	A*	`conf`	A quantum linearity test for robustly verifying entanglement. STOC Anand Natarajan, Thomas Vidick
2017	A*	`conf`	Hardness amplification for entangled games via anchoring. STOC Mohammad Bavarian, Thomas Vidick, Henry Yuen
2017	A	`conf`	Overlapping Qubits. ITCS Rui Chao, Ben W. Reichardt, Chris Sutherland, Thomas Vidick
2017	A	`conf`	Parallel Repetition via Fortification: Analytic View and the Quantum Case. ITCS Mohammad Bavarian, Thomas Vidick, Henry Yuen
2017	J	`jnl`	QCMA hardness of ground space connectivity for commuting Hamiltonians. Quantum David Gosset, Jenish C. Mehta, Thomas Vidick
2017	A	`conf`	Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. ITCS Itai Arad, Zeph Landau, Umesh V. Vazirani, Thomas Vidick
2017	J	`jnl`	Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources. CoRR Andrea Coladangelo, Alex B. Grilo, Stacey Jeffery, Thomas Vidick
2016	J	`jnl`	A Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem. CoRR Steven Heilman, Thomas Vidick
2016	J	`jnl`	Non-Signaling Parallel Repetition Using de Finetti Reductions. IEEE Trans. Inf. Theory Rotem Arnon Friedman, Renato Renner, Thomas Vidick
2016	J	`jnl`	Parallel repetition via fortification: analytic view and the quantum case. CoRR Mohammad Bavarian, Thomas Vidick, Henry Yuen
2016	J	`jnl`	Parallel repetition via fortification: analytic view and the quantum case. Electron. Colloquium Comput. Complex. Mohammad Bavarian, Thomas Vidick, Henry Yuen
2016	J	`jnl`	QCMA hardness of ground space connectivity for commuting Hamiltonians. CoRR David Gosset, Jenish C. Mehta, Thomas Vidick
2016	J	`jnl`	Quantum Proofs. Found. Trends Theor. Comput. Sci. Thomas Vidick, John Watrous
2016	J	`jnl`	Robust self-testing of many-qubit states. CoRR Anand Natarajan, Thomas Vidick
2016	J	`jnl`	Simple and tight device-independent security proofs. CoRR Rotem Arnon Friedman, Renato Renner, Thomas Vidick
2016	J	`jnl`	Three-Player Entangled XOR Games are NP-Hard to Approximate. SIAM J. Comput. Thomas Vidick
2015	A	`conf`	A Multiprover Interactive Proof System for the Local Hamiltonian Problem. ITCS Joseph F. Fitzsimons, Thomas Vidick
2015	J	`jnl`	A parallel repetition theorem for entangled projection games. Comput. Complex. Irit Dinur, David Steurer, Thomas Vidick
2015	J	`jnl`	Anchoring games for parallel repetition. CoRR Mohammad Bavarian, Thomas Vidick, Henry Yuen
2015	J	`jnl`	Constant-Soundness Interactive Proofs for Local Hamiltonians. CoRR Anand Natarajan, Thomas Vidick
2015	—	`conf`	Interactive Proofs with Approximately Commuting Provers. ICALP (1) Matthew Coudron, Thomas Vidick
2015	J	`jnl`	Interactive proofs with approximately commuting provers. CoRR Matthew Coudron, Thomas Vidick
2015	J	`jnl`	Quantum XOR Games. ACM Trans. Comput. Theory Oded Regev, Thomas Vidick
2015	J	`jnl`	Unbounded entanglement in nonlocal games. Quantum Inf. Comput. Laura Mancinska, Thomas Vidick
2014	A	`conf`	A Parallel Repetition Theorem for Entangled Projection Games. CCC Irit Dinur, David Steurer, Thomas Vidick
2014	A	`conf`	An efficient algorithm for finding the ground state of 1D gapped local hamiltonians. ITCS Zeph Landau, Umesh V. Vazirani, Thomas Vidick
2014	J	`jnl`	Efficient Rounding for the Noncommutative Grothendieck Inequality. Theory Comput. Assaf Naor, Oded Regev, Thomas Vidick
2014	J	`jnl`	Non-signalling parallel repetition using de Finetti reductions. CoRR Rotem Arnon Friedman, Renato Renner, Thomas Vidick
2014	A	`conf`	Robust device independent quantum key distribution. ITCS Umesh V. Vazirani, Thomas Vidick
2014	—	`conf`	Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability. ICALP (1) Laura Mancinska, Thomas Vidick
2013	J	`jnl`	A parallel repetition theorem for entangled projection games. CoRR Irit Dinur, David Steurer, Thomas Vidick
2013	A*	`conf`	Efficient rounding for the noncommutative grothendieck inequality. STOC Assaf Naor, Oded Regev, Thomas Vidick
2013	J	`jnl`	Guest column: the quantum PCP conjecture. SIGACT News Dorit Aharonov, Itai Arad, Thomas Vidick
2013	J	`jnl`	Multipartite entanglement in XOR games. Quantum Inf. Comput. Jop Briët, Harry Buhrman, Troy Lee, Thomas Vidick
2013	A	`conf`	Quantum XOR Games. CCC Oded Regev, Thomas Vidick
2013	—	`conf`	Robust Randomness Amplifiers: Upper and Lower Bounds. APPROX-RANDOM Matthew Coudron, Thomas Vidick, Henry Yuen
2013	J	`jnl`	The Quantum PCP Conjecture. CoRR Dorit Aharonov, Itai Arad, Thomas Vidick
2012	A*	`conf`	A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers. FOCS Tsuyoshi Ito, Thomas Vidick
2012	J	`jnl`	A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem. Chic. J. Theor. Comput. Sci. Thomas Vidick
2012	J	`jnl`	A multi-prover interactive proof for NEXP sound against entangled provers CoRR Tsuyoshi Ito, Thomas Vidick
2012	J	`jnl`	A multi-prover interactive proof for NEXP sound against entangled provers. Electron. Colloquium Comput. Complex. Tsuyoshi Ito, Thomas Vidick
2012	A*	`conf`	Certifiable quantum dice: or, true random number generation secure against quantum adversaries. STOC Umesh V. Vazirani, Thomas Vidick
2012	J	`jnl`	Efficient rounding for the noncommutative Grothendieck inequality CoRR Assaf Naor, Oded Regev, Thomas Vidick
2012	—	`conf`	Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money. TQC Abel Molina, Thomas Vidick, John Watrous
2012	J	`jnl`	Trevisan's Extractor in the Presence of Quantum Side Information. SIAM J. Comput. Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner
2011	J	`jnl`	A concentration inequality for the overlap of a vector on a large set, With application to the communication complexity of the Gap-Hamming-Distance problem. Electron. Colloquium Comput. Complex. Thomas Vidick
2011	J	`jnl`	Entangled Games Are Hard to Approximate. SIAM J. Comput. Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick
2011	A*	`conf`	Parallel repetition of entangled games. STOC Julia Kempe, Thomas Vidick
2011	—	`—`	The Complexity of Entangled Games. Thomas Vidick
2010	—	`conf`	Better Gap-Hamming Lower Bounds via Better Round Elimination. APPROX-RANDOM Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf
2010	A*	`conf`	Near-optimal extractors against quantum storage. STOC Anindya De, Thomas Vidick
2009	J	`jnl`	Better Gap-Hamming Lower Bounds via Better Round Elimination CoRR Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf
2009	J	`jnl`	Near-optimal extractors against quantum storage. Electron. Colloquium Comput. Complex. Anindya De, Thomas Vidick
2009	J	`jnl`	Trevisan's extractor in the presence of quantum side information CoRR Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner
2009	J	`jnl`	Using Entanglement in Quantum Multi-Prover Interactive Proofs. Comput. Complex. Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
2008	A*	`conf`	Entangled Games are Hard to Approximate. FOCS Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick
2008	J	`jnl`	Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. Phong Q. Nguyen, Thomas Vidick
2008	A	`conf`	Using Entanglement in Quantum Multi-prover Interactive Proofs. CCC Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick