D. Aharonov, I. Arad, Z. Landau, and U. Vazirani, The Detectability Lemma and Quantum Gap Amplification, Proceedings of the 41th Annual ACM Symposium on Theory of Computing (STOC '09), pp.417-426, 2009.

S. Aaronson, On perfect completeness for QMA, Quantum Information & Computation, vol.9, pp.81-89, 2009.

D. Aharonov, I. Arad, and T. Vidick, Guest column: the quantum PCP conjecture, SIGACT News, vol.44, issue.2, pp.47-79, 2013.

S. Arora and B. Barak, Computational Complexity -A Modern Approach, 2009.

S. Agrawal, D. Boneh, and X. Boyen, Efficient Lattice (H)IBE in the Standard Model, Advances in Cryptology -EUROCRYPT 2010, pp.553-572, 2010.

S. Scott-aaronson, A. Beigi, B. Drucker, and P. W. Fefferman,

. Shor, The power of unentanglement, Theory of Computing, vol.5, issue.1, pp.1-42, 2009.

D. Aharonov, M. Ben-or, and E. Eban, Interactive proofs for quantum computations, Innovations in Computer Science -ICS 2010, pp.453-469, 2010.

D. Aharonov, M. Ben-or, E. Eban, and U. Mahadev, Interactive proofs for quantum computations, 2017.

A. Scott-aaronson, A. Cojocaru, E. Gheorghiu, and . Kashefi, On the implausibility of classical client blind quantum computing, 2017.

D. Aharonov and L. Eldar, The Commuting Local Hamiltonian Problem on Locally Expanding Graphs is Approximable in NP, Quantum Information Processing, vol.14, pp.83-101, 2015.

S. Arora and R. Ge, New Algorithms for Learning in Presence of Errors, Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, pp.403-415, 2011.

D. Aharonov-;-andris-ambainis, K. Iwama, A. Kawachi, H. Masuda, H. Raymond et al., Quantum Identification of Boolean Oracles, 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004, pp.105-116, 2003.

S. Aaronson, G. Arora, C. Lund, R. Motwani, M. Sudan et al., Proof Verification and the Hardness of Approximation Problems, Theory of Computing, vol.3, pp.501-555, 1998.

D. Aharonov and T. Naveh, Quantum NP -A Survey, 2002.

I. Arad, A Note About a Partial No-go Theorem for Quantum PCP. Quantum Information & Computation, vol.11, pp.1019-1027, 2011.

A. Ambainis, A. Rosmanis, and D. Unruh, Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding, 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, pp.474-483, 2014.

S. Arora and S. Safra, Probabilistic Checking of Proofs: A New Characterization of NP, Journal of the ACM, vol.45, issue.1, pp.70-122, 1998.

I. Arad, M. Santha, A. Sundaram, and S. Zhang, Linear time algorithm for quantum 2SAT, 43rd International Colloquium on Automata, Languages, and Programming, vol.15, pp.1-15, 2016.

D. Aharonov and A. Ta-shma, Adiabatic Quantum State Generation and Statistical Zero Knowledge, Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, STOC '03, pp.20-29, 2003.

A. Anshu, D. Touchette, P. Yao, and N. Yu, Exponential separation of quantum communication and classical information, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp.277-288, 2017.

D. Aharonov, J. Wim-van-dam, Z. Kempe, S. Landau, O. Lloyd et al., Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation, 45th Symposium on Foundations of Computer Science (FOCS 2004), pp.42-51, 2004.

L. Babai, Trading group theory for randomness, Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC '85, pp.421-429, 1985.

H. Charles, G. Bennett, and . Brassard, Quantum cryptography: Public key distribution and coin tossing, Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, 1984.

J. Bausch and E. Crosson, Increasing the quantum UN-SAT penalty of the circuit-to-Hamiltonian construction, 2016.

H. Buhrman, N. Chandran, and S. Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, and Christian Schaffner. Position-Based Quantum Cryptography: Impossibility and Constructions, CRYPTO 2011: 31st Annual Cryptology Conference, pp.429-446, 2011.

S. John and . Bell, On the Einstein-Podolsky-Rosen Paradox, Physics, vol.1, pp.195-200, 1964.

A. Broadbent, J. F. Fitzsimons, and E. Kashefi, Universal blind quantum computation, 50th Annual IEEE Symposium on Foundations of Computer Science, pp.517-526, 2009.

L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two-prover interactive protocols, Computational Complexity, vol.1, issue.1, pp.3-40, 1991.

G. S. Fernando, A. W. Brandão, and . Harrow, Product-state approximations to quantum ground states, Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC '13), pp.871-880, 2013.

A. Broadbent, Z. Ji, F. Song, and J. Watrous, Zero-Knowledge Proof Systems for QMA, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, pp.31-40, 2016.

G. S. Fernando, A. Brandão, T. Kalev, C. Li, and . Lin,

K. M. Svore and X. Wu, Exponential quantum speed-ups for semidefinite programming with applications to quantum learning, 2017.

A. Blum, A. Kalai, and H. Wasserman, Noise-tolerant Learning, the Parity Problem, and the Statistical Query Model, Journal of the ACM, vol.50, issue.4, pp.506-519, 2003.

S. Q. Black and . Entanglement, , pp.2018-2019

M. Ben-or, S. Goldwasser, J. Kilian, and A. Wigderson, Multi-prover Interactive Proofs: How to Remove Intractability Assumptions, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC '88, pp.113-131, 1988.

D. Adam and . Bookatz, , 2013.

S. Bravyi, Efficient algorithm for a quantum analogue of 2-SAT, 2006.

G. S. Fernando and . Brandão, Entanglement Theory and the Quantum Simulation of Many-Body Physics, 2008.

A. Broadbent, How to verify a quantum computation, 2015.

A. Broadbent and C. Schaffner, Quantum cryptography beyond quantum key distribution, Des. Codes Cryptography, vol.78, issue.1, pp.351-382, 2016.

H. Blier and A. Tapp, All Languages in NP Have Very Short Quantum Proofs, Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies, ICQNM '09, pp.34-37, 2009.

P. Nikolas, B. M. Breuckmann, and . Terhal, Space-time circuit-to

, Hamiltonian construction and its applications, Journal of Physics A: Mathematical and Theoretical, vol.47, issue.19, 2014.

E. Bernstein and U. Vazirani, Quantum Complexity Theory. SIAM Journal on Computing, vol.26, issue.5, 1997.

Z. Brakerski and V. Vaikuntanathan, Efficient fully homomorphic encryption from (standard) LWE, SIAM Journal on Computing, vol.43, issue.2, pp.831-871, 2014.

D. Boneh and M. Zhandry, Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World, Advances in Cryptology -CRYPTO 2013, pp.361-379, 2013.

D. Castelvecchi, IBM's quantum cloud computer goes commercial, Nature News, vol.543, issue.7644, 2017.

K. Chakraborty, A. Chailloux, and A. Leverrier, Arbitrarily Long Relativistic Bit Commitment, Physical Review Letters, vol.115, issue.25, p.250501, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01237241

J. Chen and A. Drucker, Short multi-prover quantum proofs for SAT without entangled measurements, 2010.

A. Coladangelo, A. Grilo, S. Jeffery, and T. Vidick, Verifieron-a-Leash: new schemes for verifiable delegated quantum computation, 2017.

N. Chandran, V. Goyal, R. Moriarty, and R. Ostrovsky, Position Based Cryptography, CRYPTO 2009: 29th Annual International Cryptology Conference, pp.391-407, 2009.

D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, Bonsai Trees, or How to Delegate a Lattice Basis, J. Cryptology, vol.25, issue.4, pp.601-639, 2012.

J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, Proposed experiment to test local hidden-variable theories, Phys. Rev. Lett, vol.23, pp.880-884, 1969.

K. Chakraborty and A. Leverrier, Practical position-based quantum cryptography, Physical Review A, vol.92, issue.5, p.52304, 2015.
DOI : 10.1103/physreva.92.052304

URL : https://hal.archives-ouvertes.fr/hal-01237233

A. Chailloux and A. Leverrier, Relativistic (or 2-Prover 1-Round)
URL : https://hal.archives-ouvertes.fr/hal-01650985

. Zero-knowledge, Protocol for NP Secure Against Quantum Adversaries, Advances in Cryptology -EUROCRYPT 2017 -36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.369-396, 2017.

, Clay Mathematics Institue. P vs NP

, Clay Mathematics Institue. The Millennium Prize Problems

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms, Third Edition, 2009.

S. Toby, A. Cubitt, and . Montanaro, Complexity Classification of Local Hamiltonian Problems, Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science (FOCS '14), pp.120-129, 2014.

M. Coudron and A. Natarajan, The Parallel-Repeated Magic Square Game is Rigid, 2016.

A. Coladangelo, Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH and the magic square game, Quantum Information & Computation, vol.17, pp.831-865, 2017.

A. Stephen and . Cook, The complexity of theorem proving procedures, Proceedings of the Third Annual ACM Symposium, pp.151-158, 1971.

R. Colbeck and R. Renner, Free randomness can be amplified, Nature News, vol.8, pp.450-453, 2012.
DOI : 10.1038/nphys2300

R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Physical Review A, vol.54, p.1098, 1996.
DOI : 10.1103/physreva.54.1098

URL : http://arxiv.org/pdf/quant-ph/9512032

W. Andrew, G. Cross, J. Smith, and . Smolin, Quantum learning robust against noise, Physical Review A, vol.92, issue.1, p.12327, 2015.

S. Niel-de-beaudrap and . Gharibian, A linear time algorithm for quantum 2-SAT, 31st Conference on Computational Complexity, CCC 2016, vol.27, pp.1-27, 2016.

D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society of London A, vol.400, pp.97-117, 1985.
DOI : 10.1098/rspa.1985.0070

URL : http://www.cs.berkeley.edu/~christos/classics/Deutsch_quantum_theory.pdf

D. Deutsch, Quantum computational networks, Royal Society of London Proceedings Series A, vol.425, pp.73-90, 1989.
DOI : 10.1098/rspa.1989.0099

I. Damgård, J. Funder, J. Buus-nielsen, and L. Salvail, Superposition Attacks on Cryptographic Protocols, Information Theoretic Security: 7th International Conference, 2013.

I. Dinur, The PCP Theorem by Gap Amplification, Journal of the ACM, vol.54, issue.3, 2007.
DOI : 10.1145/1132516.1132553

D. Deutsch and R. Jozsa, Rapid solutions of problems by quantum computation, Proceedings of the Royal Society of London A, vol.439, pp.553-558, 1992.

L. Eldar and A. W. Harrow, Local hamiltonians whose ground states are hard to approximate, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pp.427-438, 2017.

A. Einstein, Zur Elektrodynamik bewegter Körper, Annalen der Physik, vol.17, issue.10, pp.891-921, 1905.

. Richard-p-feynman, Quantum mechanical computers, Foundations of Physics, vol.16, issue.6, pp.507-531, 1986.

E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum computation by adiabatic evolution, 2000.

F. Joseph, M. Fitzsimons, and . Hajdu?ek, Post hoc verification of quantum computation, 2015.

J. Fitzsimons, Private quantum computation: an introduction to blind quantum computing and related protocols, npj Quantum Information, vol.3, 2016.

F. Joseph, E. Fitzsimons, and . Kashefi, Unconditionally verifiable blind quantum computation, Physical Review A, vol.96, 2012.

B. Fefferman and S. Kimmel, Quantum vs classical proofs and subset verification, 2015.

S. Ferracin, T. Kapourniotis, and A. Datta, A trap based technique for verification of quantum computations, 2017.

F. Joseph, T. Fitzsimons, and . Vidick, A Multiprover Interactive Proof System for the Local Hamiltonian Problem, Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, (ITCS '15), pp.103-112, 2015.

Y. Sevag-gharibian, Z. Huang, S. Landau, and . Shin, Quantum Hamiltonian Complexity. Foundations and Trends in Theoretical Computer Science, vol.10, issue.3, pp.159-282, 2015.

R. Michael, D. S. Garey, J. Johnson-;-dmitry-gavinsky, and . Kempe, Iordanis Kerenidis, Ran Raz, and Ronald de Wolf. Exponential separation for one-way quantum communication complexity, with applications to cryptography, SIAM Journal on Computing, vol.38, issue.5, pp.1695-1708, 1979.

A. Gheorghiu, T. Kapourniotis, and E. Kashefi, Verification of quantum computation: An overview of existing approaches, 2017.

A. B. Grilo, I. Kerenidis, and A. Pereszlényi, Pointer Quantum PCPs and Multi-Prover Games, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), vol.58, p.14, 2016.

D. Gavinsky, J. Kempe, O. Regev, and R. Wolf, Boundederror quantum state identification and exponential separations in communication complexity, SIAM Journal on Computing, vol.39, issue.1, pp.1-24, 2009.

A. B. Grilo, I. Kerenidis, and J. Sikora, Qma with subset state witnesses, Mathematical Foundations of Computer Science, pp.163-174, 2015.

A. B. Grilo, I. Kerenidis, and J. Sikora, QMA with subset state witnesses, Chicago Journal of Theoretical Computer Science, issue.4, 2016.

A. Gheorghiu, E. Kashefi, and P. Wallden, Robustness and device independence of verifiable blind quantum computing, New Journal of Physics, p.17, 2015.

A. B. Grilo, I. Kerenidis, and T. Zijlstra, Learning with errors is easy with quantum samples, 2017.

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC '85, pp.291-304, 1985.

D. Gosset and D. Nagaj, Quantum 3-SAT is QMA 1 -complete, SIAM Journal on Computing, vol.45, issue.3, pp.1080-1128, 2016.
DOI : 10.1109/focs.2013.86

URL : http://arxiv.org/pdf/1302.0290

D. Gottesman, Stabilizer Codes and Quantum Error Correction, 1997.

D. Gottesman, An Introduction to Quantum Error Correction and FaultTolerant Quantum Computation, 2009.

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008, pp.197-206, 2008.
DOI : 10.1145/1374376.1374407

URL : http://eprint.iacr.org/2007/432.pdf

A. B. Grilo, Relativistic verifiable delegation of quantum computation, 2017.

L. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, STOC '96, pp.212-219, 1996.

S. Goldwasser and M. Sipser, Private coins versus public coins in interactive proof systems, Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC '86, pp.59-68, 1986.

J. Sevag-gharibian, S. Sikora, and . Upadhyay, QMA variants with polynomially many provers, Quantum Information & Computation, vol.13, pp.135-157, 2013.

O. Goldreich and D. Zuckerman, Another proof that BPP ? PH (and more), Studies in Complexity and Cryptography, pp.40-53, 2011.

A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Physical Review Letters, vol.103, p.150502, 2009.

A. W. Harrow and A. Montanaro, Testing Product States

M. , Games and Tensor Optimization, Journal of the ACM, vol.60, issue.1, p.43, 2013.

S. Hallgren, D. Nagaj, and S. Narayanaswami, The Local Hamiltonian Problem on a Line with Eight States is QMA-complete. Quantum Information & Computation, vol.13, pp.721-750, 2013.

A. Holevo, Bounds for the quantity of information transmitted by a quantum communication channel, Problemy Peredachi Informatsii, vol.9, issue.3, 1973.

M. Hajdu?ek, C. A. Pérez-delgado, and J. F. Fitzsimons,

, Device-independent verifiable blind quantum computation, 2015.

T. Ito and T. Vidick, A multi-prover interactive proof for NEXP sound against entangled provers, 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, pp.243-252, 2012.

R. Impagliazzo and A. Wigderson, P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma, Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC '97, 1997.

Z. Ji, Classical verification of quantum proofs, Proceedings of the Forty-eighth Annual ACM SIGACT Symposium on Theory of Computing (STOC 2016), pp.885-898, 2016.

H. Stephen-p-jordan, D. Kobayashi, H. Nagaj, and . Nishimura, Achieving perfect completeness in classical-witness quantum

M. , systems. Quantum Information & Computation, vol.12, issue.5-6, pp.461-471, 2012.

R. Jain, S. Upadhyay, and J. Watrous, Two-Message Quantum Interactive Proofs Are in PSPACE, 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp.534-543, 2009.
DOI : 10.1109/focs.2009.30

URL : http://arxiv.org/pdf/0905.1300

T. Kapourniotis, V. Dunjko, and E. Kashefi, On optimising quantum communication in verifiable quantum computing, 2015.

A. Kent, Unconditionally Secure Bit Commitment, Physical Review Letters, vol.83, issue.7, pp.1447-1450, 1999.
DOI : 10.1103/physrevlett.83.1447

URL : http://arxiv.org/pdf/quant-ph/9810068

A. Kent, Unconditionally secure bit commitment with flying qudits, New Journal of Physics, vol.13, issue.11, p.113015, 2011.
DOI : 10.1088/1367-2630/13/11/113015

URL : http://iopscience.iop.org/article/10.1088/1367-2630/13/11/113015/pdf

A. Kent, Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes, Physical Review Letters, vol.109, issue.13, p.130501, 2012.
DOI : 10.1103/physrevlett.109.130501

URL : http://arxiv.org/pdf/1108.2879

T. Kapourniotis, E. Kashefi, and A. Datta, Verified Delegated Quantum Computing with One Pure Qubit, 2014.

J. Kempe, H. Kobayashi, K. Matsumoto, and T. Vidick, Using Entanglement in Quantum Multi-Prover Interactive Proofs, Proceedings of 23rd IEEE Conference on Computational Complexity (CCC), pp.211-222, 2008.
DOI : 10.1109/ccc.2008.6

URL : https://authors.library.caltech.edu/49520/1/04558824.pdf

J. Kempe, A. Y. Kitaev, and O. Regev, The Complexity of the Local Hamiltonian Problem, SIAM Journal on Computing, vol.35, issue.5, pp.1070-1097, 2006.

M. Kaplan, G. Leurent, A. Leverrier, and M. Naya-plasencia,

, Breaking Symmetric Cryptosystems Using Quantum Period Finding, Advances in Cryptology -CRYPTO 2016, 2016.

H. Kobayashi, F. L. Gall, and H. Nishimura, Stronger methods of making quantum interactive proofs perfectly complete, pp.329-352, 2013.

A. Kent, J. William, T. P. Munro, and . Spiller, Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints, Physical Review A, vol.84, issue.1, p.12326, 2011.
DOI : 10.1103/physreva.84.012326

URL : http://arxiv.org/pdf/1008.2147

H. Kobayashi, K. Matsumoto, and T. Yamakami, Quantum merlin-arthur proof systems: Are multiple merlins more helpful to arthur?, Chicago J. Theor. Comput. Sci, 2009.

J. Kempe and O. Regev, 3-local Hamiltonian is QMA-complete, QIC, vol.3, issue.3, pp.258-264, 2003.

G. Steven and . Krantz, The history and concept of mathematical proof, 2007.

A. Kitaev, M. Shen, and . Vyalyi, Classical and quantum computation, 2002.

A. Y. Kitaev and J. Watrous, Parallelization, amplification, and exponential time simulation of quantum interactive proof systems, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing STOC '00, pp.608-617, 2000.

A. Leonid and . Levin, Universal sequential search problems. Problems of Information Transmission, vol.9, pp.265-266, 1973.

C. Lund, L. Fortnow, H. Karloff, and N. Nisan, Algebraic Methods for Interactive Proof Systems, Journal of the ACM, vol.39, issue.4, pp.859-868, 1992.
DOI : 10.1109/fscs.1990.89518

Y. Liu-;-tommaso-lunghi, J. Kaniewski, F. Bussières, R. Houlmann, M. Tomamichel et al., Experimental bit commitment based on quantum communication and special relativity, Consistency of local density matrices is qma-complete. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, vol.111, p.30502, 2006.

H. Hoi-kwan-lau and . Lo, Insecurity of position-based quantumcryptography protocols against entanglement attacks, Physical Review A, vol.83, issue.1, p.12322, 2011.

S. François-le-gall, H. Nakagawa, and . Nishimura, On qma protocols with two short quantum proofs, Quantum Information & Computation, vol.12, issue.7-8, pp.589-600, 2012.

V. Lyubashevsky, The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem, Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques APPROX-RANDOM 2005, pp.378-389, 2005.

M. Mckague, Interactive Proofs for BQP via Self-Tested Graph States, Theory of Computing, vol.12, issue.3, pp.1-42, 2016.

D. Mermin, Simple unified form for the major no-hidden-variables theorems, Physical Review Letters, vol.65, pp.3373-3376, 1990.
DOI : 10.1103/physrevlett.65.3373

T. Morimae and J. F. Fitzsimons, Post hoc verification with a single prover, 2016.

A. Montanaro, Quantum algorithms: an overview. npj Quantum Information, vol.2, 2016.
DOI : 10.1038/npjqi.2015.23

URL : https://www.nature.com/articles/npjqi201523.pdf

T. Morimae, Verification for measurement-only blind quantum computing, Physical Review A, vol.89, 2014.
DOI : 10.1103/physreva.89.060302

URL : http://arxiv.org/pdf/1208.1495

D. Micciancio and O. Regev, Worst-Case to Average-Case Reductions Based on Gaussian Measures, SIAM Journal on Computing, vol.37, issue.1, pp.267-302, 2007.
DOI : 10.1109/focs.2004.72

C. Marriott and J. Watrous, Quantum Arthur-Merlin games, Computational Complexity, vol.14, 2005.
DOI : 10.1109/ccc.2004.1313850

URL : http://arxiv.org/pdf/cs/0506068

D. Mayers and A. Yao, Self testing quantum apparatus, Quantum Information & Computation, vol.4, pp.273-286, 2004.

M. Mckague, H. Tzyh, V. Yang, and . Scarani, Robust self-testing of the singlet, Journal of Physics A: Mathematical and Theoretical, vol.45, issue.45, p.455304, 2012.

A. Michael, . Nielsen, L. Isaac, and . Chuang, Quantum computation and quantum information. Cambridge Series on Information and the Natural Sciences, 2000.

A. Natarajan and T. Vidick, A quantum linearity test for robustly verifying entanglement, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2017), pp.1003-1015, 2017.

A. Natarajan and T. Vidick, Low-degree testing for quantum states, 2018.

D. Nagaj, P. Wocjan, and Y. Zhang, Fast amplification of QMA, Quantum Information & Computation, vol.9, pp.1053-1068, 2009.

E. Origami, About | Endless Origami -A Webcomic, pp.2018-2019

, Endless Origami. Finish up that Essay

J. Tobias and . Osborne, Hamiltonian complexity. Reports on Progress in Physics, vol.75, issue.2, p.22001, 2012.

R. Oliveira, M. Barbara, and . Terhal, The complexity of quantum spin systems on a two-dimensional square lattice, Quantum Information & Computation, vol.8, issue.10, pp.900-924, 2010.

C. Peikert, A Decade of Lattice Cryptography, Foundations and Trends in Theoretical Computer Science, vol.10, issue.4, pp.283-424, 2016.

A. Peres, Incompatible results of quantum measurements, Physics Letters A, vol.151, issue.3, pp.107-108, 1990.
DOI : 10.1016/0375-9601(90)90172-k

A. Pereszlényi, One-sided error QMA with shared EPR pairs -A simpler proof, 2013.

D. Pitalúa-garcía, Spacetime-constrained oblivious transfer. Physical Review A, vol.93, p.62346, 2016.

C. Peikert, V. Vaikuntanathan, and B. Waters, A Framework for Efficient and Composable Oblivious Transfer, Advances in Cryptology -CRYPTO 2008, pp.554-571, 2008.
DOI : 10.1007/978-3-540-85174-5_31

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-85174-5_31.pdf

R. Raz, A Parallel Repetition Theorem, SIAM Journal on Computing, vol.27, issue.3, pp.763-803, 1998.
DOI : 10.1145/225058.225181

R. Raz, Quantum Information and the PCP Theorem, Proceedings of 46th
DOI : 10.1007/s00453-007-9033-6

URL : http://arxiv.org/pdf/quant-ph/0504075v1.pdf

, Annual IEEE Symposium on Foundations of Computer Science (FOCS '05), 2005.

D. Ristè, M. Silva, A. Colm, A. W. Ryan, J. A. Cross et al., Demonstration of quantum advantage in machine learning, 2015.

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC 2005, pp.84-93, 2005.
DOI : 10.1145/1568318.1568324

F. Ben-w-reichardt, U. Unger, and . Vazirani, Classical Command of Quantum Systems, Nature, vol.496, pp.456-460, 2013.

A. Shamir and . Ip-=-pspace, Journal of the ACM, vol.39, issue.4, pp.869-877, 1992.

Y. Shi, Both Toffoli and controlled-NOT Need Little Help to Do Universal Quantum Computing, Quantum Information & Computation, vol.3, issue.1, pp.84-92, 2003.

P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings 35th Annual Symposium on Foundations of Computer Science, vol.35, pp.124-134, 1994.
DOI : 10.1109/sfcs.1994.365700

A. Steane, Multiple-particle interference and quantum error correction, Proceedings: Mathematical, Physical and Engineering Sciences, vol.452, pp.2551-2577, 1954.

M. Szegedy, Quantum speed-up of markov chain based algorithms, 45th Symposium on Foundations of Computer Science (FOCS 2004), pp.32-41, 2004.

D. Unruh, Quantum Position Verification in the Random Oracle Model, CRYPTO 2014: 34th Annual Cryptology Conference, 2014.

A. Joran-van-apeldoorn, S. Gilyén, R. Gribling, and . Wolf, Quantum sdp-solvers: Better upper and lower bounds, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pp.403-414, 2017.

G. Leslie and . Valiant, A Theory of the Learnable, Commun. ACM, vol.27, issue.11, pp.1134-1142, 1984.

T. Vidick and J. Watrous, Quantum proofs, Foundations and Trends in Theoretical Computer Science, vol.11, issue.1-2, pp.1-215, 2016.

J. Watrous, Succinct Quantum Proofs for Properties of Finite Groups, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, FOCS '00, p.537, 2000.

J. Watrous, Quantum Computational Complexity, Encyclopedia of Complexity and Systems Science, pp.7174-7201, 2009.

J. Watrous, Zero-Knowledge against Quantum Attacks, SIAM Journal on Computing, vol.39, issue.1, pp.25-58, 2009.

X. Wu, J. Bancal, M. Mckague, and V. Scarani,

, Device-independent parallel self-testing of two singlets, Physical Review A, vol.93, p.62121, 2016.

S. Wiesner, Conjugate coding. SIGACT News, vol.15, pp.78-88, 1983.

P. Wocjan, D. Janzing, and T. Beth, Two QCMA-complete problems, Quantum Information & Computation, vol.3, pp.2018-2019, 2003.

, Bell's theorem, pp.2018-2019

, Quantum Mechanics, pp.2018-2019

, Quantum Teleportation, pp.2018-2019

A. Yao, Quantum circuit complexity, 34th Annual Symposium on Foundations of Computer Science, FOCS 1993, pp.352-361, 1993.

S. Zachos and M. Furer, Probabilistic quantifiers vs. distrustful adversaries, Seventh Conference on Foundations of Software Technology and Theoretical Computer Science, pp.443-455, 1987.

M. Zhandry, How to Construct Quantum Random Functions, 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, pp.679-687, 2012.