CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Vidick-T"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2006 | 2005
Number of items: 70.

2019

Aggarwal, Divesh and Chung, Kai-Min and Lin, Han-Hsuan et al. (2019) A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries. In: Advances in Cryptology - EUROCRYPT 2019. Lecture Notes in Computer Science. No.11477. Springer , Cham, pp. 442-469. ISBN 978-3-030-17655-6. https://resolver.caltech.edu/CaltechAUTHORS:20190320-102401828

Coladangelo, Andrea and Grilo, Alex B. and Jeffery, Stacey et al. (2019) Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources. In: Advances in Cryptology - EUROCRYPT 2019. Lecture Notes in Computer Science. No.11478. Springer , Cham, pp. 247-277. ISBN 978-3-030-17658-7. https://resolver.caltech.edu/CaltechAUTHORS:20190320-123759874

Vazirani, Umesh and Vidick, Thomas (2019) Fully device independent quantum key distribution. Communications of the ACM, 62 (4). p. 133. ISSN 0001-0782. https://resolver.caltech.edu/CaltechAUTHORS:20190321-152633091

Arnon-Friedman, Rotem and Renner, Renato and Vidick, Thomas (2019) Simple and tight device-independent security proofs. SIAM Journal on Computing, 48 (1). pp. 181-225. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:20190206-150209557

Vidick, Thomas and Zhang, Tina (2019) Classical zero-knowledge arguments for quantum computations. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-095213331

Regev, Oded and Vidick, Thomas (2019) Bounds on Dimension Reduction in the Nuclear Norm. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-095834301

2018

Coudron, Matthew and Stark, Jalex and Vidick, Thomas (2018) Trading locality for time: certifiable randomness from low-depth circuits. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-100502117

Brakerski, Zvika and Christiano, Paul and Mahadev, Urmila et al. (2018) A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE , Piscataway, NJ, pp. 320-331. ISBN 9781538642306. https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229032

Slofstra, William and Vidick, Thomas (2018) Entanglement in Non-local Games and the Hyperlinear Profile of Groups. Annales Henri Poincaré, 19 (10). pp. 2979-3005. ISSN 1424-0637. https://resolver.caltech.edu/CaltechAUTHORS:20180926-132554192

Natarajan, Anand and Vidick, Thomas (2018) Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE , Piscataway, NJ, pp. 731-742. ISBN 9781538642306. https://resolver.caltech.edu/CaltechAUTHORS:20190201-143229217

Chao, Rui and Reichardt, Ben W. and Sutherland, Chris et al. (2018) Test for a large amount of entanglement, using few measurements. Quantum, 2 . Art. No. 92. ISSN 2521-327X. https://resolver.caltech.edu/CaltechAUTHORS:20171108-142443122

Ostrev, Dimiter and Vidick, Thomas (2018) Entanglement of approximate quantum strategies in XOR games. Quantum Information and Computation, 18 (7-8). pp. 617-631. ISSN 1533-7146. https://resolver.caltech.edu/CaltechAUTHORS:20180926-101512002

Natarajan, Anand and Vidick, Thomas (2018) Two-Player Entangled Games are NP-Hard. In: 33rd Computational Complexity Conference (CCC 2018). Leibniz International Proceedings in Informatics. Schloss Dagstuhl – Leibniz-Zentrum für Informatik , Wadern, Germany, Art. No. 20. ISBN 978-3-95977-069-9. https://resolver.caltech.edu/CaltechAUTHORS:20180822-141142977

Fitzsimons, Joseph and Ji, Zhengfeng and Vidick, Thomas et al. (2018) Quantum proof systems for iterated exponential time, and beyond. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20190204-112657116

Ji, Zhengfeng and Leung, Debbie and Vidick, Thomas (2018) A three-player coherent state embezzlement game. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20190204-154622144

Arnon-Friedman, Rotem and Dupuis, Frédéric and Fawzi, Omar et al. (2018) Practical device-independent quantum cryptography via entropy accumulation. Nature Communications, 9 . Art. No. 459. ISSN 2041-1723. PMCID PMC5792631. https://resolver.caltech.edu/CaltechAUTHORS:20180130-110708768

2017

Roberts, Brenden and Vidick, Thomas and Motrunich, Olexei I. (2017) Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians. Physical Review B, 96 (21). Art. No. 214203. ISSN 2469-9950. https://resolver.caltech.edu/CaltechAUTHORS:20170627-090122309

Arad, Itai and Landau, Zeph and Vazirani, Umesh et al. (2017) Rigorous RG algorithms and area laws for low energy eigenstates in 1D. Communications in Mathematical Physics, 356 (1). pp. 65-105. ISSN 0010-3616. https://resolver.caltech.edu/CaltechAUTHORS:20160321-072746620

Gosset, David and Mehta, Jenish C. and Vidick, Thomas (2017) QCMA hardness of ground space connectivity for commuting Hamiltonians. Quantum, 1 . p. 16. ISSN 2521-327X. https://resolver.caltech.edu/CaltechAUTHORS:20171011-112512941

Bavarian, Mohammad and Vidick, Thomas and Yuen, Henry (2017) Hardness amplification for entangled games via anchoring. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017. ACM , New York, NY, pp. 303-316. ISBN 978-1-4503-4528-6 . https://resolver.caltech.edu/CaltechAUTHORS:20170710-152910604

Natarajan, Anand and Vidick, Thomas (2017) A quantum linearity test for robustly verifying entanglement. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017. ACM , New York, NY, pp. 1003-1015. ISBN 978-1-4503-4528-6. https://resolver.caltech.edu/CaltechAUTHORS:20170710-154654821

Vidick, Thomas (2017) Parallel DIQKD from parallel repetition. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-102806367

Chao, Rui and Reichardt, Ben W. and Sutherland, Chris et al. (2017) Overlapping Qubits. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics. No.67. Dagstuhl Publishing , Wadern, Germany, Art. No. 48. ISBN 9783959770293. https://resolver.caltech.edu/CaltechAUTHORS:20171011-113818136

2016

Pironio, S. and Scarani, V. and Vidick, T. (2016) Focus on device independent quantum information. New Journal of Physics, 18 (10). Art. No. 100202. ISSN 1367-2630. https://resolver.caltech.edu/CaltechAUTHORS:20161205-151744898

Vidick, Thomas and Yuen, Henry (2016) A simple proof of Renner's exponential de Finetti theorem. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-103022957

Vidick, Thomas (2016) Three-Player Entangled XOR Games are NP-Hard to Approximate. SIAM Journal on Computing, 45 (3). pp. 1007-1063. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:20161103-145636436

Anshu, Anurag and Arad, Itai and Vidick, Thomas (2016) A simple proof of the detectability lemma and spectral gap amplification. Physical Review B, 93 (20). Art. No. 205142. ISSN 1098-0121. https://resolver.caltech.edu/CaltechAUTHORS:20160318-153303794

Chung, Kai-Min and Cohen, Gil and Vidick, Thomas et al. (2016) Quantum-Proof Extractors: Optimal up to Constant Factors. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20160517-182619760

Vidick, Thomas and Watrous, John (2016) Quantum Proofs. In: Foundations and Trends in Theoretical Computer Science. Vol.11. No.1-2. Now Publishers , Boston, MA, pp. 1-215. ISBN 978-1-68083-126-9. https://resolver.caltech.edu/CaltechAUTHORS:20160622-144016671

Heilman, Steven and Vidick, Thomas (2016) A Moment Majorization principle for random matrix ensembles with applications to hardness of the noncommutative Grothendieck problem. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-103637958

Bavarian, Mohammad and Vidick, Thomas and Yuen, Henry (2016) Parallel repetition via fortification: analytic view and the quantum case. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20160321-071142064

Arnon-Friedman, Rotem and Renner, Renato and Vidick, Thomas (2016) Non-Signaling Parallel Repetition Using de Finetti Reductions. IEEE Transactions on Information Theory, 62 (3). pp. 1440-1457. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:20160318-101440389

Palazuelos, Carlos and Vidick, Thomas (2016) Survey on nonlocal games and operator space theory. Journal of Mathematical Physics, 57 (1). Art. No. 015220. ISSN 0022-2488. https://resolver.caltech.edu/CaltechAUTHORS:20160225-142342994

2015

Natarajan, Anand and Vidick, Thomas (2015) Constant-Soundness Interactive Proofs for Local Hamiltonians. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20160318-160143988

Mančinska, Laura and Vidick, Thomas (2015) Unbounded entanglement in nonlocal games. Quantum Information and Computation, 15 (15-16). pp. 1317-1332. ISSN 1533-7146. https://resolver.caltech.edu/CaltechAUTHORS:20160818-080941623

Bavarian, Mohammad and Vidick, Thomas and Yuen, Henry (2015) Anchoring games for parallel repetition. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20160318-152740730

Regev, Oded and Vidick, Thomas (2015) Quantum XOR Games. ACM Transactions on Computation Theory, 7 (4). Art. No. 15. ISSN 1942-3454. https://resolver.caltech.edu/CaltechAUTHORS:20160321-083901879

Landau, Zeph and Vazirani, Umesh and Vidick, Thomas (2015) A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians. Nature Physics, 11 (7). pp. 566-569. ISSN 1745-2473. https://resolver.caltech.edu/CaltechAUTHORS:20150422-093309397

Coudron, Matthew and Vidick, Thomas (2015) Interactive Proofs with Approximately Commuting Provers. In: Automata, Languages, and Programming. Lecture Notes in Computer Science. No.9134. Springer , Heidelberg, pp. 355-366. ISBN 978-3-662-47671-0. https://resolver.caltech.edu/CaltechAUTHORS:20151207-141218015

Dinur, Irit and Steurer, David and Vidick, Thomas (2015) A parallel repetition theorem for entangled projection games. Computational Complexity, 24 (2). pp. 201-254. ISSN 1016-3328. https://resolver.caltech.edu/CaltechAUTHORS:20150615-140934465

Fitzsimons, Joseph and Vidick, Thomas (2015) A Multiprover Interactive Proof System for the Local Hamiltonian Problem. In: ITCS'15 Innovations in Theoretical Computer Science. Association for Computing Machinery , New York, NY, pp. 103-112. ISBN 978-1-4503-3333-7. https://resolver.caltech.edu/CaltechAUTHORS:20150218-115725417

2014

Vazirani, Umesh and Vidick, Thomas (2014) Fully Device-Independent Quantum Key Distribution. Physical Review Letters, 113 (14). Art. No. 140501. ISSN 0031-9007. https://resolver.caltech.edu/CaltechAUTHORS:20150108-142044094

Dinur, Irit and Steurer, David and Vidick, Thomas (2014) A parallel repetition theorem for entangled projection games. In: Proceedings of the Annual IEEE Conference on Computational Complexity. IEEE , Piscataway, NJ, pp. 197-208. ISBN 978-1-4799-3626-7. https://resolver.caltech.edu/CaltechAUTHORS:20140910-132001940

Vazirani, Umesh and Vidick, Thomas (2014) Robust device independent quantum key distribution. In: Proceedings of the 5th conference on Innovations in theoretical computer science. Association for Computing Machinery , New York, pp. 35-36. ISBN 978-1-4503-2698-8. https://resolver.caltech.edu/CaltechAUTHORS:20140909-145320191

Landau, Zeph and Vazirani, Umesh and Vidick, Thomas (2014) An efficient algorithm for finding the ground state of 1D gapped local hamiltonians. In: Proceedings of the 5th conference on Innovations in theoretical computer science. Association for Computing Machinery , New York, p. 301. ISBN 978-1-4503-2698-8. https://resolver.caltech.edu/CaltechAUTHORS:20140909-142344205

2013

Vidick, Thomas (2013) Three-player entangled XOR games are NP-hard to approximate. In: IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS). IEEE , Piscataway, NJ, pp. 766-775. ISBN 978-0-7695-5135-7. https://resolver.caltech.edu/CaltechAUTHORS:20140910-100149541

Briët, Jop and Vidick, Thomas (2013) Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games. Communications in Mathematical Physics, 321 (1). pp. 181-207. ISSN 0010-3616. https://resolver.caltech.edu/CaltechAUTHORS:20160318-154623344

Naor, Assaf and Regev, Oded and Vidick, Thomas (2013) Efficient Rounding for the Noncommutative Grothendieck Inequality. In: Proceedings of the forty-fifth annual ACM symposium on Theory of computing. ACM , New York, NY, pp. 71-80. ISBN 978-1-4503-2029-0. https://resolver.caltech.edu/CaltechAUTHORS:20140910-115031387

Aharonov, Dorit and Arad, Itai and Vidick, Thomas (2013) Guest Column: The Quantum PCP Conjecture. ACM SIGACT News, 44 (2). pp. 47-79. ISSN 0163-5700. https://resolver.caltech.edu/CaltechAUTHORS:20140910-135821275

Regev, Oded and Vidick, Thomas (2013) Quantum XOR Games. In: 28th Annual IEEE Conference on Computational Complexity (CCC). IEEE , Piscataway, NJ, pp. 144-155. ISBN 978-0-7695-4997-2. https://resolver.caltech.edu/CaltechAUTHORS:20160329-155246836

Coudron, Matthew and Vidick, Thomas and Yuen, Henry (2013) Robust Randomness Amplifiers: Upper and Lower Bounds. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20160318-153752227

Briët, Jop and Buhrman, Harry and Lee, Troy et al. (2013) Multipartite entanglement in XOR games. Quantum Information and Computation, 13 (3-4). pp. 334-360. ISSN 1533-7146. https://resolver.caltech.edu/CaltechAUTHORS:20140909-144447941

Molina, Abel and Vidick, Thomas and Watrous, John (2013) Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money. In: Theory of Quantum Computation, Communication, and Cryptography. Lecture Notes in Computer Science. No.7582. Springer , Berlin, pp. 45-64. ISBN 978-3-642-35655-1. https://resolver.caltech.edu/CaltechAUTHORS:20160318-155200133

2012

Ito, Tsuyoshi and Vidick, Thomas (2012) A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers. In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE , Piscataway, NJ, pp. 243-252. ISBN 978-1-4673-4383-1. https://resolver.caltech.edu/CaltechAUTHORS:20140910-100733064

De, Anindya and Portmann, Christopher and Vidick, Thomas et al. (2012) Trevisan's Extractor in the Presence of Quantum Side Information. SIAM Journal on Computing, 41 (4). pp. 915-940. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:20160322-084353163

Regev, Oded and Vidick, Thomas (2012) Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20160318-152323237

Vazirani, Umesh and Vidick, Thomas (2012) Certifiable Quantum Dice Or, True Random Number Generation Secure Against Quantum Adversaries. In: STOC'12 Symposium on Theory of Computing Conference. ACM , New York, NY, pp. 61-76. ISBN 978-1-4503-1245-5. https://resolver.caltech.edu/CaltechAUTHORS:20140910-141425231

Molina, Abel and Vidick, Thomas and Watrous, John (2012) Optimal counterfeiting attacks and generalizations for Wiesner's quantum money. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-104220786

2011

Vazirani, Umesh and Vidick, Thomas (2011) Certifiable Quantum Dice - Or, testable exponential randomness expansion. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-104707093

Vidick, Thomas and Wehner, Stephanie (2011) Does Ignorance of the Whole Imply Ignorance of the Parts? Large Violations of Noncontextuality in Quantum Theory. Physical Review Letters, 107 (3). Art. No. 030402. ISSN 0031-9007. https://resolver.caltech.edu/CaltechAUTHORS:20160318-151328788

Kempe, Julia and Kobayashi, Hirotada and Matsumoto, Keiji et al. (2011) Entangled Games Are Hard to Approximate. SIAM Journal on Computing, 40 (3). pp. 848-877. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:20110713-155400829

Kempe, Julia and Vidick, Thomas (2011) Parallel Repetition of Entangled Games. In: Proceedings of the 43rd annual ACM symposium on Theory of computing. ACM , New York, NY, pp. 353-362. ISBN 978-1-4503-0691-1. https://resolver.caltech.edu/CaltechAUTHORS:20140910-135518364

Vidick, Thomas and Wehner, Stephanie (2011) More nonlocality with less entanglement. Physical Review A, 83 (5). Art. No. 052310. ISSN 1050-2947. https://resolver.caltech.edu/CaltechAUTHORS:20160318-115742532

2010

De, Anindya and Vidick, Thomas (2010) Near-Optimal Extractors Against Quantum Storage. In: Proceedings of the 42nd ACM symposium on Theory of computing. ACM , New York, NY, pp. 161-170. ISBN 978-1-4503-0050-6 . https://resolver.caltech.edu/CaltechAUTHORS:20140910-145258006

2009

Brody, Joshua and Chakrabarti, Amit and Regev, Oded et al. (2009) Better Gap-Hamming Lower Bounds via Better Round Elimination. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-105826650

Briët, Jop and Buhrman, Harry and Lee, Troy et al. (2009) Multiplayer XOR games and quantum communication complexity with clique-wise entanglement. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-111726313

2008

Kempe, Julia and Kobayashi, Hirotada and Matsumoto, Keiji et al. (2008) Entangled games are hard to approximate. In: 49th Annual Symposium on Foundations-of-Computer-Science (FOCS). IEEE Computer Society , Los Alamitos, CA, pp. 447-456. ISBN 978-0-7695-3436-7. https://resolver.caltech.edu/CaltechAUTHORS:20140910-085511133

Kempe, Julia and Kobayashi, Hirotada and Matsumoto, Keiji et al. (2008) Using Entanglement in Quantum Multi-Prover Interactive Proofs. In: 23rd Annual IEEE Conference on Computational Complexity. IEEE , Piscataway, NJ, pp. 211-222. ISBN 978-0-7695-3169-4. https://resolver.caltech.edu/CaltechAUTHORS:20140910-083116800

2006

Kempe, Julia and Vidick, Thomas (2006) On the Power of Entangled Quantum Provers. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20160322-085312434

2005

Ricotta, Guillaume and Vidick, Thomas (2005) Hauteur asymptotique des points de Heegner. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190320-142201374

This list was generated on Tue Oct 15 20:33:35 2019 PDT.