Skip to main content
SpringerLink
Log in

Verification of Quantum Computation and the Price of Trust

  • Conference paper
  • First Online:
Book cover Computer Science – Theory and Applications (CSR 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10304))

Included in the following conference series:

  • 648 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gheorghiu, A., Kapourniotis, T., Kashefi, E.: Verification of quantum computation and the price of trust (2015)

    Google Scholar 

  2. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Aharonov, D., Jones, V., Landau, Z.: A polynomial quantum algorithm for approximating the Jones polynomial. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 427–436. ACM (2006)

    Google Scholar 

  4. Aharonov, D., Ben-Or, M., Eban, E.: Interactive proofs for quantum computations. In: Proceedings of Innovations in Computer Science 2010 (ICS 2010), p. 453 (2010)

    Google Scholar 

  5. Fitzsimons, J.F., Kashefi, E.: Unconditionally verifiable blind computation. arXiv preprint (2012). arXiv:1203.5217

  6. Broadbent, A.: How to verify a quantum computation. arXiv preprint (2015). arXiv:1509.09180

  7. Barz, S., Fitzsimons, J.F., Kashefi, E., Walther, P.: Experimental verification of quantum computation. Nat. Phys. 9(11), 727–731 (2013)

    Article  Google Scholar 

  8. Kapourniotis, T., Dunjko, V., Kashefi, E.: On optimising quantum communication in verifiable quantum computing. arXiv preprint (2015). arXiv:1506.06943

  9. Kashefi, E., Wallden, P.: Optimised resource construction for verifiable quantum computation. arXiv preprint (2015). arXiv:1510.07408

  10. Morimae, T.: Measurement-only verifiable blind quantum computing with quantum input verification (2016). arXiv preprint arXiv:1606.06467

  11. Hayashi, M., Morimae, T.: Verifiable measurement-only blind quantum computing with stabilizer testing. arXiv preprint (2015). arXiv:1505.07535

  12. Hayashi, M., Hajdusek, M.: Self-guaranteed measurement-based quantum computation. arXiv preprint (2016). arXiv:1603.02195

  13. Arrighi, P., Salvail, L.: Blind quantum computation. Int. J. Quantum Inform. 4(05), 883–898 (2006)

    Article  MATH  Google Scholar 

  14. Childs, A.: Secure assisted quantum computation. Quant. Inf. Compt. 5(6), 456 (2005)

    MathSciNet  MATH  Google Scholar 

  15. Broadbent, A., Fitzsimons, J., Kashefi, E.: Universal blind quantum computation. In: 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pp. 517–526. IEEE (2009)

    Google Scholar 

  16. Mantri, A., Perez-Delgado, C.A., Fitzsimons, J.F.: Optimal blind quantum computation. Phys. Rev. Lett. 111(23), 230502 (2013)

    Article  Google Scholar 

  17. Perez-Delgado, C.A., Fitzsimons, J.F.: Overcoming efficiency constraints on blind quantum computation. arXiv preprint (2014). arXiv:1411.4777

  18. Giovannetti, V., Maccone, L., Morimae, T., Rudolph, T.G.: Efficient universal blind quantum computation. Phys. Rev. Lett. 111(23), 230501 (2013)

    Article  Google Scholar 

  19. Morimae, T., Fujii, K.: Blind quantum computation protocol in which alice only makes measurements. Phys. Rev. A 87(5), 050301 (2013)

    Article  Google Scholar 

  20. Sueki, T., Koshiba, T., Morimae, T.: Ancilla-driven universal blind quantum computation. Phys. Rev. A 87(6), 060301 (2013)

    Article  Google Scholar 

  21. Gheorghiu, A., Kashefi, E., Wallden, P.: Robustness and device independence of verifiable blind quantum computing. arXiv preprint (2015). arXiv:1502.02571

  22. Hajdusek, M., Perez-Delgado, C.A., Fitzsimons, J.F.: Device-independent verifiable blind quantum computation. arXiv preprint (2015). arXiv:1502.02563

  23. Reichardt, B.W., Unger, F., Vazirani, U.: Classical command of quantum systems. Nature 496(7446), 456–460 (2013)

    Article  Google Scholar 

  24. McKague, M.: Interactive proofs for BQP via self-tested graph states (2013). arXiv:1309.5675

  25. Fitzsimons, J.F., Hajdušek, M.: Post hoc verification of quantum computation. arXiv preprint (2015). arXiv:1512.04375

  26. Morimae, T., Fitzsimons, J.F.: Post hoc verification with a single prover. arXiv preprint (2016). arXiv:1603.06046

  27. Hangleiter, D., Kliesch, M., Schwarz, M., Eisert, J.: Direct certification of a class of quantum simulations. arXiv preprint (2016). arXiv:1602.00703

  28. Kapourniotis, T., Kashefi, E., Datta, A.: Blindness and verification of quantum computation with one pure qubit. In: 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014), vol. 27, pp. 176–204 (2014)

    Google Scholar 

  29. Mills, D., Pappa, A., Kapourniotis, T., Kashefi, E.: Information theoretically secure hypothesis test for temporally unstructured quantum computation (2017)

    Google Scholar 

  30. Kapourniotis,T., Datta, A.: Nonadaptive fault-tolerant verification of quantum supremacy with noise (2017)

    Google Scholar 

  31. Shor, P.W.: Fault-tolerant quantum computation. In: 37th Annual Symposium on Foundations of Computer Science, Proceedings, pp. 56–65. IEEE (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics, University of Edinburgh, Edinburgh, UK

    Alexandru Gheorghiu & Elham Kashefi

  2. Department of Physics, University of Warwick, Coventry, UK

    Theodoros Kapourniotis

  3. CNRS LIP6, Université Pierre et Marie Curie, Paris, France

    Elham Kashefi

Authors
  1. Alexandru Gheorghiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Theodoros Kapourniotis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Elham Kashefi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Elham Kashefi .

Editor information

Editors and Affiliations

  1. University of Bordeaux , Talence, France

    Pascal Weil

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gheorghiu, A., Kapourniotis, T., Kashefi, E. (2017). Verification of Quantum Computation and the Price of Trust. In: Weil, P. (eds) Computer Science – Theory and Applications. CSR 2017. Lecture Notes in Computer Science(), vol 10304. Springer, Cham. https://doi.org/10.1007/978-3-319-58747-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-58747-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-58746-2

  • Online ISBN: 978-3-319-58747-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation