Publications

2025

Logical Channels in Approximate Gottesman-kitaev-preskill Error Correction

M. Jafarzadeh; J. Conrad; R. N. Alexander; B. Q. Baragiola 

PHYSICAL REVIEW A. 2025. Vol. 112, num. 6. DOI : 10.1103/c8hk-v1qf.

Detailed record

View at publisher

Quantum Interactive Oracle Proofs

B. Sun; T. Vidick 

2025. 23rd Theory of Cryptography Conference, Aarhus, Denmark, 2025-12-01 – 2025-12-05. p. 409 – 426. DOI : 10.1007/978-3-032-12296-4_14.

Detailed record

View at publisher

Continuous-variable Designs and Design-based Shadow Tomography From Random Lattices

J. Conrad; J. T. Iosue; A. G. Burchards; V. V. Albert 

PHYSICAL REVIEW LETTERS. 2025. Vol. 135, num. 6. DOI : 10.1103/dy4m-gq5c.

Detailed record

View at publisher

2024

Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes

I. Dinur; T-C. Lin; T. Vidick 

2024. 65th Annual Symposium on Foundations of Computer Science, Chicago, United States, 2024-10-27 – 2024-10-30. p. 379 – 385. DOI : 10.1109/FOCS61266.2024.00031.

Detailed record

View at publisher

Experimental implementation of an efficient test of quantumness

L. Lewis; D. Zhu; A. Gheorghiu; C. Noel; O. Katz et al. 

Physical Review A. 2024. Vol. 109, num. 1, p. 012610. DOI : 10.1103/PhysRevA.109.012610.

Detailed record

View at publisher

Quantum Protocols for ML, Physics, and Finance

G. A. Gluch / M. Kapralov; R. Urbanke (Dir.)  

Lausanne, EPFL, 2024. 

Detailed record

View at publisher

Verifier-on-a-leash: New schemes for verifiable delegated quantum computation, with quasilinear resources

A. Coladangelo; A. B. Grilo; S. Jeffery; T. Vidick 

Theory of Computing. 2024. Vol. 20, num. 1, p. 1 – 87. DOI : 10.4086/toc.2024.v020a003.

Detailed record

View at publisher

2023

MIP* = RE: A negative resolution to Connes’ embedding problem and Tsirelson’s problem

T. Vidick 

ICM International Congress of Mathematicians 2022 July 6-14. Sections 12-14; Berlin, Germany: EMS Press, 2023. p. 4996 – 5025.

Detailed record

View at publisher

Interactive cryptographic proofs of quantumness using mid-circuit measurements

D. Zhu; G. D. Kahanamoku-Meyer; L. Lewis; C. Noel; O. Katz et al. 

Nature Physics. 2023. Vol. 19, num. 11, p. 1725 – 1731. DOI : 10.1038/s41567-023-02162-9.

Detailed record

View at publisher

Quantum Key Distribution Protocols

T. Vidick; S. Wehner 

Introduction to Quantum Cryptography; Cambridge University Press, 2023. p. 194 – 217.

Detailed record

View at publisher

Introduction to Quantum Cryptography

T. Vidick; S. Wehner 

Cambridge University Press, 2023.

Detailed record

View at publisher

Quantum Cryptography beyond Key Distribution

T. Vidick; S. Wehner 

Introduction to Quantum Cryptography; Cambridge University Press, 2023. p. 241 – 269.

Detailed record

View at publisher

Good Quantum LDPC Codes with Linear Time Decoders

I. Dinur; M. H. Hsieh; T. C. Lin; T. Vidick 

2023. 55th Annual ACM Symposium on Theory of Computing (STOC) part of the ACM Federated Computing Research Conference (FCRC), Orlando, FL, 2023-06-20 – 2023-06-23. p. 905 – 918. DOI : 10.1145/3564246.3585101.

Detailed record

View at publisher

Simple Tests of Quantumness Also Certify Qubits

Z. Brakerski; A. Gheorghiu; G. D. Kahanamoku-Meyer; E. Porat; T. Vidick 

2023. 43rd Annual International Cryptology Conference (CRYPTO 2023), Santa Barbara, California, USA, 2023-08-20 – 2023-08-24. p. 162 – 191. DOI : 10.1007/978-3-031-38554-4_6.

Detailed record

View at publisher

Security in the Presence of Quantum Adversaries

K. Barooti / S. Vaudenay (Dir.)  

Lausanne, EPFL, 2023. 

Detailed record

View at publisher

2022

Almost synchronous quantum correlations

T. Vidick 

Journal of Mathematical Physics. 2022. Vol. 63, num. 2, p. 022201. DOI : 10.1063/5.0056512.

Detailed record

View at publisher

Quantum soundness of testing tensor codes

Z. Ji; A. Natarajan; T. Vidick; J. Wright; H. Yuen 

2022. 62nd IEEE Annual Symposium on Foundations of Computer Science (FOCS), ELECTR NETWORK, 2022-02-07 – 2022-02-07. p. 586 – 597. DOI : 10.1109/FOCS52979.2021.00064.

Detailed record

View at publisher

A monogamy-of-entanglement game for subspace coset states

E. Culf; T. Vidick 

Quantum. 2022. Vol. 6, p. 791. DOI : 10.22331/Q-2022-09-01-791.

Detailed record

View at publisher

Succinct Classical Verification of Quantum Computation

J. Bartusek; Y. T. Kalai; A. Lombardi; F. Ma; G. Malavolta et al. 

2022. 42nd Annual International Cryptology Conference (CRYPTO 2022), Santa Barbara, United States, 2022-08-15 – 2022-08-18. p. 195 – 211. DOI : 10.1007/978-3-031-15979-4_7.

Detailed record

View at publisher

Anchored Parallel Repetition for Nonlocal Games

M. Bavarian; T. Vidick; H. Yuen 

SIAM Journal on Computing. 2022. Vol. 51, num. 2, p. 214 – 253. DOI : 10.1137/21M1405927.

Detailed record

View at publisher

2021

MIP∗= RE

Z. Ji; A. Natarajan; T. Vidick; J. Wright; H. Yuen 

Communications of the ACM. 2021. Vol. 64, num. 11, p. 131 – 138. DOI : 10.1145/3485628.

Detailed record

View at publisher

Self-testing of a single quantum device under computational assumptions

T. Metger; T. Vidick 

Quantum. 2021. num. 5, p. 19. DOI : 10.22331/Q-2021-09-16-544.

Detailed record

View at publisher

A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device

Z. Brakerski; P. Christiano; U. Mahadev; U. Vazirani; T. Vidick 

Journal of the ACM. 2021. Vol. 68, num. 5. DOI : 10.1145/3441309.

Detailed record

View at publisher

Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits

M. Coudron; J. Stark; T. Vidick 

Communications in Mathematical Physics. 2021. Vol. 382, num. 1, p. 49 – 86. DOI : 10.1007/s00220-021-03963-w.

Detailed record

View at publisher

Classical Proofs of Quantum Knowledge

T. Vidick; T. Zhang 

2021. 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Zagreb, CROATIA, 2021-10-17 – 2021-10-21. p. 630 – 660. DOI : 10.1007/978-3-030-77886-6_22.

Detailed record

View at publisher

2020

A three-player coherent state embezzlement game

Z. Ji; D. Leung; T. Vidick 

Quantum. 2020. Vol. 4, p. 1 – 19. DOI : 10.22331/Q-2020-10-26-349.

Detailed record

View at publisher

Simpler proofs of quantumness

Z. Brakerski; V. Koppula; U. Vazirani; T. Vidick 

2020. 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), Riga, Latvia, 2020-06-09 – 2020-06-12. DOI : 10.4230/LIPIcs.TQC.2020.8.

Detailed record

View at publisher

Classical zero-knowledge arguments for quantum computations

T. Vidick; T. Zhang 

Quantum. 2020. Vol. 4. DOI : 10.22331/q-2020-05-14-266.

Detailed record

View at publisher

Verifying quantum computations at scale: A cryptographic leash on quantum devices

T. Vidick 

Bulletin Of The American Mathematical Society. 2020. Vol. 57, num. 1, p. 1678. DOI : 10.1090/BULL/1678.

Detailed record

View at publisher

Bounds on Dimension Reduction in the Nuclear Norm

O. Regev; T. Vidick 

Geometric Aspects of Functional Analysis; Cham: Springer, 2020. p. 279 – 299.

Detailed record

View at publisher

Non-interactive zero-knowledge arguments for qma, with preprocessing

A. Coladangelo; T. Vidick; T. Zhang 

2020. 40th Annual International Cryptology Conference, Santa Barbara, United States, 2020-08-17 – 2020-08-21. p. 799 – 828. DOI : 10.1007/978-3-030-56877-1_28.

Detailed record

View at publisher

2019

Computationally-Secure and Composable Remote State Preparation

A. Gheorghiu; T. Vidick 

2019. 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS), Baltimore, MD, 2019-11-09 – 2019-11-12. p. 1024 – 1033. DOI : 10.1109/FOCS.2019.00066.

Detailed record

View at publisher

From Operator Algebras to Complexity Theory and Back

T. Vidick 

Notices of the American Mathematical Society. 2019. Vol. 66, num. 10. DOI : 10.1090/noti1980.

Detailed record

View at publisher

Quantum proof systems for iterated exponential time, and beyond

J. Fitzsimons; Z. Ji; T. Vidick; H. Yuen 

2019. 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), Phoenix, AZ, 2019-06-23 – 2019-06-26. p. 473 – 480. DOI : 10.1145/3313276.3316343.

Detailed record

View at publisher

Fully device independent quantum key distribution

U. Vazirani; T. Vidick 

Communications of the ACM. 2019. Vol. 62, num. 4, p. 133 – 142. DOI : 10.1145/3310974.

Detailed record

View at publisher

Simple and tight device-independent security proofs

R. Arnon-Friedman; R. Renner; T. Vidick 

SIAM Journal on Computing. 2019. Vol. 48, num. 1, p. 181 – 225. DOI : 10.1137/18M1174726.

Detailed record

View at publisher

A quantum-proof non-malleable extractor: With application to privacy amplification against active quantum adversaries

D. Aggarwal; K. M. Chung; H. H. Lin; T. Vidick 

2019. 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Darmstadt, Germany, 2019-05-19 – 2019-05-23. p. 442 – 469. DOI : 10.1007/978-3-030-17656-3_16.

Detailed record

View at publisher

Verifier-on-a-leash: New schemes for verifiable delegated quantum computation, with quasilinear resources

A. Coladangelo; A. B. Grilo; S. Jeffery; T. Vidick 

2019. 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Darmstadt, GERMANY, 2019-05-19 – 2019-05-23. p. 247 – 277. DOI : 10.1007/978-3-030-17659-4_9.

Detailed record

View at publisher

2018

Practical device-independent quantum cryptography via entropy accumulation

R. Arnon-Friedman; F. Dupuis; O. Fawzi; R. Renner; T. Vidick 

Nature communications. 2018. Vol. 9, num. 1. DOI : 10.1038/s41467-017-02307-4.

Detailed record

View at publisher

A cryptographic test of quantumness and certifiable randomness from a single quantum device

Z. Brakerski; P. Christiano; U. Mahadev; U. Vazirani; T. Vidick 

2018. 59th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2018), Paris, France, 2018-10-07 – 2018-10-09. p. 320 – 331. DOI : 10.1109/FOCS.2018.00038.

Detailed record

View at publisher

Low-degree testing for quantum states, and a quantum entangled games PCP for QMA

A. Natarajan; T. Vidick 

2018. 59th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2018), Paris, France, 2018-10-07 – 2018-10-09. p. 731 – 742. DOI : 10.1109/FOCS.2018.00075.

Detailed record

View at publisher

Entanglement in Non-local Games and the Hyperlinear Profile of Groups

W. Slofstra; T. Vidick 

Annales Henri Poincaré. 2018. Vol. 19, num. 10, p. 2979 – 3005. DOI : 10.1007/s00023-018-0718-y.

Detailed record

View at publisher

Test for a large amount of entanglement, using few measurements

R. Chao; B. W. Reichardt; C. Sutherland; T. Vidick 

Quantum. 2018. Vol. 2, p. 92. DOI : 10.22331/q-2018-09-03-92.

Detailed record

View at publisher

Entanglement of approximate quantum strategies in XOR games

D. Ostrev; T. Vidick 

Quantum Information & Computation. 2018. Vol. 18, num. 7-8, p. 617 – 631. DOI : 10.26421/qic18.7-8-6.

Detailed record

View at publisher

2017

Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians

B. Roberts; T. Vidick; O. I. Motrunich 

Physical Review B. 2017. Vol. 96, num. 21, p. 214203. DOI : 10.1103/PhysRevB.96.214203.

Detailed record

View at publisher

Overlapping Qubits

R. Chao; B. W. Reichardt; C. Sutherland; T. Vidick 

2017. 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), Berkeley, United States, 2017-01-09 – 2017-01-11. DOI : 10.4230/LIPIcs.ITCS.2017.48.

Detailed record

View at publisher

Parallel repetition via fortification: Analytic view and the quantum case

M. Bavarian; T. Vidick; H. Yuen 

2017. 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), Berkeley, United States, 2017-01-09 – 2017-01-11. DOI : 10.4230/LIPIcs.ITCS.2017.22.

Detailed record

View at publisher

Rigorous RG Algorithms and Area Laws for Low Energy Eigenstates in 1D

I. Arad; Z. Landau; U. Vazirani; T. Vidick 

Communications in Mathematical Physics. 2017. Vol. 356, num. 1, p. 65 – 105. DOI : 10.1007/s00220-017-2973-z.

Detailed record

View at publisher

QCMA hardness of ground space connectivity for commuting hamiltonians

D. Gosset; J. C. Mehta; T. Vidick 

Quantum. 2017. Vol. 1, p. 16. DOI : 10.22331/q-2017-07-14-16.

Detailed record

View at publisher

A quantum linearity test for robustly verifying entanglement

A. Natarajan; T. Vidick 

2017. 49 ACM SIGACT Symposium on Theory of Computing, Montreal, Canada, 2017-06-19 – 2017-06-23. p. 1003 – 1015. DOI : 10.1145/3055399.3055468.

Detailed record

View at publisher

Hardness amplification for entangled games via anchoring

M. Bavarian; T. Vidick; H. Yuen 

2017. 49 ACM SIGACT Symposium on Theory of Computing, Montreal, Canada, 2017-06-19 – 2017-06-23. p. 303 – 316. DOI : 10.1145/3055399.3055433.

Detailed record

View at publisher

2016

Simple proof of the detectability lemma and spectral gap amplification

A. Anshu; I. Arad; T. Vidick 

Physical Review B. 2016. Vol. 93, num. 20, p. 205142. DOI : 10.1103/PhysRevB.93.205142.

Detailed record

View at publisher

Quantum proofs

T. Vidick; J. Watrous 

Foundations and Trends in Theoretical Computer Science. 2016. Vol. 11, num. 1-2, p. 1 – 215. DOI : 10.1561/0400000068.

Detailed record

View at publisher

Non-signaling parallel repetition using de Finetti reductions

R. Arnon-Friedman; R. Renner; T. Vidick 

IEEE Transactions on Information Theory. 2016. Vol. 62, num. 3, p. 7377091. DOI : 10.1109/TIT.2016.2516022.

Detailed record

View at publisher

Focus on device independent quantum information

S. Pironio; V. Scarani; T. Vidick 

New Journal of Physics. 2016. Vol. 18, num. 10, p. 100202. DOI : 10.1088/1367-2630/18/10/100202.

Detailed record

View at publisher

Survey on nonlocal games and operator space theory

C. Palazuelos; T. Vidick 

Journal of Mathematical Physics. 2016. Vol. 57, num. 1, p. 015220. DOI : 10.1063/1.4938052.

Detailed record

View at publisher

Three-player entangled XOR games are np-hard to approximate

T. Vidick 

SIAM Journal on Computing. 2016. Vol. 45, num. 3, p. 1007 – 1063. DOI : 10.1137/140956622.

Detailed record

View at publisher

2015

Unbounded entanglement in nonlocal games

L. Mančinska; T. Vidick 

Quantum Information & Computation. 2015. Vol. 15, num. 15-16, p. 1317 – 1332. DOI : 10.26421/qic15.15-16-4.

Detailed record

View at publisher

Quantum XOR games

O. Regev; T. Vidick 

ACM Transactions On Computation Theory. 2015. Vol. 7, num. 4, p. 15. DOI : 10.1145/2799560.

Detailed record

View at publisher

A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians

Z. Landau; U. Vazirani; T. Vidick 

Nature Physics. 2015. Vol. 11, num. 7, p. 566 – 569. DOI : 10.1038/nphys3345.

Detailed record

View at publisher

A parallel repetition theorem for entangled projection games

I. Dinur; D. Steurer; T. Vidick 

Computational Complexity. 2015. Vol. 24, num. 2, p. 98. DOI : 10.1007/s00037-015-0098-3.

Detailed record

View at publisher

A multiprover interactive proof system for the local hamiltonian problem [extended abstract]

J. Fitzsimons; T. Vidick 

2015. 6th Conference on Innovations in Theoretical Computer Science, Rehovot, Israel, 2015-01-11 – 2015-01-13. p. 103 – 112. DOI : 10.1145/2688073.2688094.

Detailed record

View at publisher

Interactive proofs with approximately commuting provers

M. Coudron; T. Vidick 

2015. 42nd International Colloquium on Automata, Languages and Programming (ICALP2015), Kyoto, Japan, 2015-07-06 – 2015-07-10. p. 355 – 366. DOI : 10.1007/978-3-662-47672-7_29.

Detailed record

View at publisher

2014

Efficient rounding for the noncommutative grothendieck inequality

A. Naor; O. Regev; T. Vidick 

Theory Of Computing. 2014. Vol. 10, p. 257 – 295. DOI : 10.4086/toc.2014.v010a011.

Detailed record

View at publisher

Fully Device-Independent Quantum Key Distribution

U. Vazirani; T. Vidick 

Physical Review Letters. 2014. Vol. 113, num. 14. DOI : 10.1103/PhysRevLett.113.140501.

Detailed record

View at publisher

Elementary proofs of grothendieck theorems for completely bounded norms

O. Regev; T. Vidick 

Journal Of Operator Theory. 2014. Vol. 71, num. 2, p. 491 – 506. DOI : 10.7900/jot.2012jul02.1947.

Detailed record

View at publisher

Unbounded entanglement can be needed to achieve the optimal success probability

L. Mančinska; T. Vidick 

2014. 41st International Colloquium on Automata, Languages and Programming, Denmark, 2014-07-08 – 2014-07-11. p. 835 – 846. DOI : 10.1007/978-3-662-43948-7_69.

Detailed record

View at publisher

2013

Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games

J. Briët; T. Vidick 

Communications in Mathematical Physics. 2013. Vol. 321, num. 1, p. 181 – 207. DOI : 10.1007/s00220-012-1642-5.

Detailed record

View at publisher

Multipartite entanglement in XOR games

J. Briët; H. Buhrman; T. Lee; T. Vidick 

Quantum Information and Computation. 2013. Vol. 13, num. 3-4, p. 0334 – 0360. DOI : 10.26421/QIC13.3-4-11.

Detailed record

View at publisher

Quantum XOR games

O. Regev; T. Vidick 

2013. 2013 IEEE Conference on Computational Complexity (CCC 2013), Stanford, CA, USA, 2013-06-05 – 2013-06-07. p. 144 – 155. DOI : 10.1109/CCC.2013.23.

Detailed record

View at publisher

Robust randomness amplifiers: Upper and lower bounds

M. Coudron; T. Vidick; H. Yuen 

2013. 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013 and the 17th International Workshop on Randomization and Computation, RANDOM 2013, United States, 2013-08-21 – 2013-08-23. p. 468 – 483. DOI : 10.1007/978-3-642-40328-6_33.

Detailed record

View at publisher

Optimal counterfeiting attacks and generalizations for Wiesner’s quantum money

A. Molina; T. Vidick; J. Watrous 

2013. 7th Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC 2012), Tokyo, Japan, 2012-05-17 – 2012-05-19. p. 45 – 64. DOI : 10.1007/978-3-642-35656-8_4.

Detailed record

View at publisher

2012

Certifiable quantum dice

U. Vazirani; T. Vidick 

Philosophical Transactions of the Royal Society a-Mathematical Physical and Engineering Sciences. 2012. Vol. 370, num. 1971, p. 3432 – 3448. DOI : 10.1098/rsta.2011.0336.

Detailed record

View at publisher

Trevisan’s extractor in the presence of quantum side information

A. De; C. Portmann; T. Vidick; R. Renner 

SIAM Journal on Computing. 2012. Vol. 41, num. 4, p. 915 – 940. DOI : 10.1137/100813683.

Detailed record

View at publisher

All Schatten spaces endowed with the Schur product are Q-algebras

J. Briët; H. Buhrman; T. Lee; T. Vidick 

Journal of Functional Analysis. 2012. Vol. 262, num. 1, p. 1 – 9. DOI : 10.1016/j.jfa.2011.09.001.

Detailed record

View at publisher

A multi-prover interactive proof for NEXP sound against entangled provers

T. Ito; T. Vidick 

2012. 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), New Brunswick, NJ, USA, 2012-10-20 – 2012-10-23. p. 243 – 252. DOI : 10.1109/FOCS.2012.11.

Detailed record

View at publisher

Certifiable quantum dice: Or, true random number generation secure against quantum adversaries

U. Vazirani; T. Vidick 

2012. 44th Annual ACM Symposium on Theory of Computing (STOC 2012), New York, United States, 2012-05-19 – 2012-05-22. p. 61 – 76. DOI : 10.1145/2213977.2213984.

Detailed record

View at publisher

2011

Does ignorance of the whole imply ignorance of the parts? Large violations of noncontextuality in quantum theory

T. Vidick; S. Wehner 

Physical Review Letters. 2011. Vol. 107, num. 3, p. 030402. DOI : 10.1103/PhysRevLett.107.030402.

Detailed record

View at publisher

More nonlocality with less entanglement

T. Vidick; S. Wehner 

Physical Review A. 2011. Vol. 83, num. 5, p. 052310. DOI : 10.1103/PhysRevA.83.052310.

Detailed record

View at publisher

Parallel repetition of entangled games

J. Kempe; T. Vidick 

2011. 43rd ACM Symposium on Theory of Computing, San Jose, United States, 2011-06-06 – 2011-06-08. p. 353 – 362. DOI : 10.1145/1993636.1993684.

Detailed record

View at publisher

Entangled games are hard to approximate

J. Kempe; H. Kobayashi; K. Matsumoto; B. Toner; T. Vidick 

SIAM Journal on Computing. 2011. Vol. 40, num. 3, p. 848 – 877. DOI : 10.1137/090751293.

Detailed record

View at publisher

2010

Better Gap-Hamming lower bounds via better round elimination

J. Brody; A. Chakrabarti; O. Regev; T. Vidick; R. De Wolf 

2010. 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Barcelona, Spain, 2010-09-01 – 2010-09-03. p. 476 – 489. DOI : 10.1007/978-3-642-15369-3_36.

Detailed record

View at publisher

Near-optimal extractors against quantum storage

A. De; T. Vidick 

2010. 42nd ACM Symposium on Theory of Computing, STOC 2010, United States, 2010-06-05 – 2010-06-08. p. 161 – 170. DOI : 10.1145/1806689.1806713.

Detailed record

View at publisher

2009

Using entanglement in quantum multi-prover interactive proofs

J. Kempe; H. Kobayashi; K. Matsumoto; T. Vidick 

Computational Complexity. 2009. Vol. 18, num. 2, p. 273 – 307. DOI : 10.1007/s00037-009-0275-3.

Detailed record

View at publisher

2008

Hauteur asymptotique des points de Heegner

G. Ricotta; T. Vidick 

Canadian Journal Of Mathematics-Journal Canadien De Mathematiques. 2008. Vol. 60, num. 6, p. 1405 – 1436. DOI : 10.4153/cjm-2008-059-4.

Detailed record

View at publisher

Using entanglement in quantum multi-prover interactive proofs

J. Kempe; H. Kobayashi; K. Matsumoto; T. Vidick 

2008. 23rd Annual IEEE Conference on Computational Complexity (CCC 2008), College Park, MD, United States, 2008-06-23 – 2008-06-26. p. 211 – 222. DOI : 10.1109/CCC.2008.6.

Detailed record

View at publisher

Entangled games are hard to approximate

J. Kempe; H. Kobayashi; K. Matsumoto; B. Toner; T. Vidick 

2008. 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018), United States, 2008-10-25 – 2008-10-28. p. 447 – 456. DOI : 10.1109/FOCS.2008.8.

Detailed record

View at publisher