Vidick, Thomas
Ji, Zhengfeng and Natarajan, Anand, et el. (2022) Quantum soundness of testing tensor codes ; ISBN 978-1-6654-2056-3; 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS); 586-597; 10.1109/FOCS52979.2021.00064
Vidick, Thomas and Zhang, Tina (2021) Classical Proofs of Quantum Knowledge ; ISBN 9783030778859; Advances in Cryptology – EUROCRYPT 2021; 630-660; 10.1007/978-3-030-77886-6_22
Regev, Oded and Vidick, Thomas (2020) Bounds on Dimension Reduction in the Nuclear Norm ; ISBN 978-3-030-46761-6; Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II; 279-299; 10.1007/978-3-030-46762-3_13
Brakerski, Zvika and Koppula, Venkata, et el. (2020) Simpler Proofs of Quantumness ; 10.4230/LIPIcs.TQC.2020.8
Gheorghiu, Alexandru and Vidick, Thomas (2019) Computationally-Secure and Composable Remote State Preparation ; ISBN 9781728149523; 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS); 1024-1033; 10.1109/focs.2019.00066
Fitzsimons, Joseph and Ji, Zhengfeng, et el. (2019) Quantum proof systems for iterated exponential time, and beyond ; ISBN 978-1-4503-6705-9; Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC '19); 473-480; 10.1145/3313276.3316343
Coladangelo, Andrea and Grilo, Alex B., et el. (2019) Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources ; ISBN 978-3-030-17658-7; Advances in Cryptology - EUROCRYPT 2019; 247-277; 10.1007/978-3-030-17659-4_9
Aggarwal, Divesh and Chung, Kai-Min, et el. (2019) A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries ; ISBN 978-3-030-17655-6; Advances in Cryptology - EUROCRYPT 2019; 442-469; 10.1007/978-3-030-17656-3_16
Brakerski, Zvika and Christiano, Paul, et el. (2018) A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device ; ISBN 9781538642306; 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS); 320-331; 10.1109/focs.2018.00038
Natarajan, Anand and Vidick, Thomas (2018) Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA ; ISBN 9781538642306; 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS); 731-742; 10.1109/focs.2018.00075
Natarajan, Anand and Vidick, Thomas (2018) Two-Player Entangled Games are NP-Hard ; ISBN 978-3-95977-069-9; 33rd Computational Complexity Conference (CCC 2018); Art. No. 20; 10.4230/LIPIcs.CCC.2018.20
Arad, Itai and Landau, Zeph, et el. (2017) Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D ; 10.4230/LIPIcs.ITCS.2017.46
Bavarian, Mohammad and Vidick, Thomas, et el. (2017) Parallel repetition via fortification: analytic view and
the quantum case ; ISBN 9783959770293; 8th Innovations in Theoretical Computer Science Conference; Art. No. 22; 10.4230/LIPIcs.ITCS.2017.22
Natarajan, Anand and Vidick, Thomas (2017) A quantum linearity test for robustly verifying entanglement ; ISBN 978-1-4503-4528-6; Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017; 1003-1015; 10.1145/3055399.3055468
Bavarian, Mohammad and Vidick, Thomas, et el. (2017) Hardness amplification for entangled games via anchoring ; ISBN 978-1-4503-4528-6; Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017; 303-316; 10.1145/3055399.3055433
Chao, Rui and Reichardt, Ben W., et el. (2017) Overlapping Qubits ; ISBN 9783959770293; 8th Innovations in Theoretical Computer Science Conference (ITCS 2017); Art. No. 48; 10.4230/LIPIcs.ITCS.2017.48
Vidick, Thomas and Watrous, John (2016) Quantum Proofs ; ISBN 978-1-68083-126-9; Foundations and Trends in Theoretical Computer Science; 1-215; 10.1561/0400000068
Coudron, Matthew and Vidick, Thomas (2015) Interactive Proofs with Approximately Commuting Provers ; ISBN 978-3-662-47671-0; Automata, Languages, and Programming; 355-366; 10.1007/978-3-662-47672-7_29
Fitzsimons, Joseph and Vidick, Thomas (2015) A Multiprover Interactive Proof System for the Local Hamiltonian Problem ; ISBN 978-1-4503-3333-7; ITCS'15 Innovations in Theoretical Computer Science; 103-112; 10.1145/2688073.2688094
Dinur, Irit and Steurer, David, et el. (2014) A parallel repetition theorem for entangled projection games ; ISBN 978-1-4799-3626-7; Proceedings of the Annual IEEE Conference on Computational Complexity; 197-208; 10.1109/CCC.2014.28
Vazirani, Umesh and Vidick, Thomas (2014) Robust device independent quantum key distribution ; ISBN 978-1-4503-2698-8; Proceedings of the 5th conference on Innovations in theoretical computer science; 35-36; 10.1145/2554797.2554802
Landau, Zeph and Vazirani, Umesh, et el. (2014) An efficient algorithm for finding the ground state of 1D gapped local hamiltonians ; ISBN 978-1-4503-2698-8; Proceedings of the 5th conference on Innovations in theoretical computer science; 301; 10.1145/2554797.2554825
Mančinska, Laura and Vidick, Thomas (2014) Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability ; ISBN 978-3-662-43947-0; Automata, Languages, and Programming; 835-846; 10.1007/978-3-662-43948-7_69
Vidick, Thomas (2013) Three-player entangled XOR games are NP-hard to approximate ; ISBN 978-0-7695-5135-7; IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS); 766-775; 10.1109/FOCS.2013.87
Naor, Assaf and Regev, Oded, et el. (2013) Efficient Rounding for the Noncommutative Grothendieck Inequality ; ISBN 978-1-4503-2029-0; Proceedings of the forty-fifth annual ACM symposium on Theory of computing; 71-80; 10.1145/2488608.2488618
Regev, Oded and Vidick, Thomas (2013) Quantum XOR Games ; ISBN 978-0-7695-4997-2; 28th Annual IEEE Conference on Computational Complexity (CCC); 144-155; 10.1109/CCC.2013.23
Coudron, Matthew and Vidick, Thomas, et el. (2013) Robust Randomness Amplifiers: Upper and Lower Bounds ; ISBN 978-3-642-40327-9; Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; 468-483; 10.1007/978-3-642-40328-6_33
Molina, Abel and Vidick, Thomas, et el. (2013) Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money ; ISBN 978-3-642-35655-1; Theory of Quantum Computation, Communication, and Cryptography; 45-64; 10.1007/978-3-642-35656-8_4
Ito, Tsuyoshi and Vidick, Thomas (2012) A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers ; ISBN 978-1-4673-4383-1; IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS); 243-252; 10.1109/FOCS.2012.11
Vazirani, Umesh and Vidick, Thomas (2012) Certifiable Quantum Dice Or, True Random Number Generation Secure Against Quantum Adversaries ; ISBN 978-1-4503-1245-5; STOC'12 Symposium on Theory of Computing Conference; 61-76; 10.1145/2213977.2213984
Kempe, Julia and Vidick, Thomas (2011) Parallel Repetition of Entangled Games ; ISBN 978-1-4503-0691-1; Proceedings of the 43rd annual ACM symposium on Theory of computing; 353-362; 10.1145/1993636.1993684
De, Anindya and Vidick, Thomas (2010) Near-Optimal Extractors Against Quantum Storage ; ISBN 978-1-4503-0050-6; Proceedings of the 42nd ACM symposium on Theory of computing; 161-170; 10.1145/1806689.1806713
Kempe, J. and Vidick, T. (2010) Quantum Algorithms ; ISBN 978-3-642-11913-2; Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments; 309-342; 10.1007/978-3-642-11914-9_10
Brody, Joshua and Chakrabarti, Amit, et el. (2010) Better Gap-Hamming Lower Bounds via Better Round Elimination ; ISBN 978-3-642-15368-6; Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; 476-489; 10.1007/978-3-642-15369-3_36
Kempe, Julia and Kobayashi, Hirotada, et el. (2008) Entangled games are hard to approximate ; ISBN 978-0-7695-3436-7; 49th Annual Symposium on Foundations-of-Computer-Science (FOCS); 447-456; 10.1109/FOCS.2008.8
Kempe, Julia and Kobayashi, Hirotada, et el. (2008) Using Entanglement in Quantum Multi-Prover Interactive Proofs ; ISBN 978-0-7695-3169-4; 23rd Annual IEEE Conference on Computational Complexity; 211-222; 10.1109/CCC.2008.6
