Skip to main content

Simple Sets of Measurements for Universal Quantum Computation and Graph State Preparation

  • Conference paper
Theory of Quantum Computation, Communication, and Cryptography (TQC 2010)

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

Included in the following conference series:

  • 1240 Accesses

Abstract

We show that the set of observables \(\{Z\otimes X, (\cos\theta) X + (\sin\theta) Y \ {\rm all} \ \theta \in [0,2\pi)\}\) with one ancillary qubit is universal for quantum computation. The set is simpler than a previous one in the sense that one-qubit projective measurements described by the observables in the set are ones only in the (X,Y) plane of the Bloch sphere. The proof of the universality implies a simple set of observables that is approximately universal for quantum computation. Moreover, it implies a simple set of observables for efficient graph state preparation.

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

Access this chapter

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Raussendorf, R., Briegel, H.J.: A One-Way Quantum Computer. Phys. Rev. Lett. 86, 5188–5191 (2001)

    Article  Google Scholar 

  2. Nielsen, M.A.: Quantum Computation by Measurement and Quantum Memory. Phys. Lett. A 308, 96–100 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Perdrix, S.: State Transfer Instead of Teleportation in Measurement-Based Quantum Computation. International Journal of Quantum Information 3(1), 219–223 (2005)

    Article  Google Scholar 

  4. Childs, A.M., Leung, D.W., Nielsen, M.A.: Unified Derivation of Measurement-Based Schemes for Quantum Computation. Phys. Rev. A 71, 032318 (2005)

    Article  Google Scholar 

  5. Leung, D.W.: Quantum Computation by Measurements. International Journal of Quantum Information 2(1), 33–43 (2004)

    Article  MATH  Google Scholar 

  6. Jorrand, P., Perdrix, S.: Unifying Quantum Computation with Projective Measurements Only and One-Way Quantum Computation. In: SPIE Quantum Informatics 2004, vol. 5833, pp. 44–51 (2005)

    Google Scholar 

  7. Perdrix, S.: Towards Minimal Resources of Measurement-Based Quantum Computation. New Journal of Physics 9, 206 (2007)

    Article  Google Scholar 

  8. Høyer, P., Mhalla, M., Perdrix, S.: Resources Required for Preparing Graph States. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 638–649. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Nielsen, M.A., Chuang, I.L.: Quantum Information and Quantum Computation. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  10. Danos, V., Kashefi, E., Panangaden, P.: Parsimonious and Robust Realizations of Unitary Maps in the One-Way Model. Phys. Rev. A 72, 064301 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takahashi, Y. (2011). Simple Sets of Measurements for Universal Quantum Computation and Graph State Preparation. In: van Dam, W., Kendon, V.M., Severini, S. (eds) Theory of Quantum Computation, Communication, and Cryptography. TQC 2010. Lecture Notes in Computer Science, vol 6519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18073-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18073-6_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18072-9

  • Online ISBN: 978-3-642-18073-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics