Verification of Quantum Computation and the Price of Trust

This is an extended abstract of the presentation made at CSR 2017. Complete details can be found in our upcoming paper [1].

[1]  E. Kashefi,et al.  Unconditionally verifiable blind computation , 2012 .

[2]  J. Fitzsimons,et al.  Overcoming efficiency constraints on blind quantum computation , 2014, 1411.4777.

[3]  Joseph Fitzsimons,et al.  Optimal Blind Quantum Computation , 2013, Physical review letters.

[4]  Elad Eban,et al.  Interactive Proofs For Quantum Computations , 2017, 1704.04487.

[5]  Peter W. Shor,et al.  Fault-tolerant quantum computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[6]  Dorit Aharonov,et al.  A Polynomial Quantum Algorithm for Approximating the Jones Polynomial , 2008, Algorithmica.

[7]  T. Morimae.  Measurement-only verifiable blind quantum computing with quantum input verification , 2016, 1606.06467.

[8]  Tomoyuki Morimae,et al.  Efficient universal blind quantum computation. , 2013, Physical review letters.

[9]  J. Eisert,et al.  Direct certification of a class of quantum simulations , 2016, 1602.00703.

[10]  Louis Salvail,et al.  BLIND QUANTUM COMPUTATION , 2003 .

[11]  Anne Broadbent,et al.  How to Verify a Quantum Computation , 2015, Theory Comput..

[12]  Petros Wallden,et al.  Optimised resource construction for verifiable quantum computation , 2015 .

[13]  Masahito Hayashi,et al.  Self-guaranteed measurement-based quantum computation , 2016, 1603.02195.

[14]  Elham Kashefi,et al.  On optimising quantum communication in verifiable quantum computing , 2015, 1506.06943.

[15]  Joseph Fitzsimons,et al.  Post hoc verification of quantum computation , 2015, Physical review letters.

[16]  Matthew McKague,et al.  Interactive Proofs for BQP via Self-Tested Graph States , 2013, Theory Comput..

[17]  T. Morimae,et al.  Ancilla-Driven Universal Blind Quantum Computation , 2012, 1210.7450.

[18]  Tomoyuki Morimae,et al.  Post hoc verification with a single prover , 2016 .

[19]  Masahito Hayashi,et al.  Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing. , 2015, Physical review letters.

[20]  T. Morimae,et al.  Blind quantum computation protocol in which Alice only makes measurements , 2012, 1201.3966.

[21]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[22]  Elham Kashefi,et al.  Robustness and device independence of verifiable blind quantum computing , 2015, 1502.02571.

[23]  Elham Kashefi,et al.  Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract) , 2017, 1704.01998.

[24]  Elham Kashefi,et al.  Universal Blind Quantum Computation , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[25]  Elham Kashefi,et al.  Blindness and Verification of Quantum Computation with One Pure Qubit , 2014, TQC.

[26]  Andrew M. Childs.  Secure assisted quantum computation , 2001, Quantum Inf. Comput..

[27]  Joseph Fitzsimons,et al.  Device-Independent Verifiable Blind Quantum Computation , 2015, ArXiv.

[28]  E. Kashefi,et al.  Experimental verification of quantum computation , 2013, Nature Physics.

[29]  Umesh V. Vazirani,et al.  Classical command of quantum systems , 2013, Nature.

[30]  Animesh Datta,et al.  Nonadaptive fault-tolerant verification of quantum supremacy with noise , 2017, Quantum.