Skip to main content
SpringerLink
Log in

A Logic for Quantum Circuits and Protocols

  • Conference paper
Theoretical Aspects of Computing – ICTAC 2005 (ICTAC 2005)

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

Included in the following conference series:

Abstract

A logic for reasoning about quantum circuits and protocols is proposed. It incorporates the basic features of quantum theory-probability, unitary dynamics, tensor products and measurement. The underlying language could be used for verification and synthesis of quantum circuits. Important algorithms like the quantum search algorithm of Grover are discussed. The logic also forms the foundation on which more elaborate formal systems for reasoning about quantum protocols could be based. A sound and complete axiomatization is presented. Algorithms for circuit verification, circuit equivalence (exact and approximate) are outlined. Some related complexity issues are also discussed.

Work supported by a scholarship from an ARC Discovery Grant to Ron van der Meyden.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. Research Report RR-04-02, Oxford University Computing Laboratory (2004)

    Google Scholar 

  2. Ben-Or, M., Kozen, D., Reif, J.H.: The complexity of elementary algebra and geometry. Journal of Computer and System Sciences 32(1), 251–264 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  3. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in real algebraic geometry. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  4. Baltag, A., Smets, S.: A logic for quantum programs. In: Proc. of QPL 2004, pp. 39–56 (2004)

    Google Scholar 

  5. Bernstein, E., Vazirani, U.V.: Quantum complexity theory. SIAM. J. Computing 26(5), 1411–1473 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: Proc. 20th ACM Symp. on Theory of Computing, pp. 460–467 (1988)

    Google Scholar 

  7. Dalla Chiara, M.L., Guntini, R., Leporoni, R.: Quantum computational logics and fock space semantics. Int. Journal of quantum information 3(1), 9–16 (2005)

    Article  MATH  Google Scholar 

  8. Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Information and Computation 87(1/2), 78–128 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Grover, L.: A fast quantum mechanical algorithm for database search. In: Proc. 28th. annual ACM symposium on Theory of computing, pp. 210–212. ACM, New York (1996)

    Google Scholar 

  10. Immerman, N.: Descriptive and computational complexity. In: Computational complexity theory. In: Proc. Symp. App. Math., pp. 75–91. AMS (1989)

    Google Scholar 

  11. van der Meyden, R., Patra, M.: Knowledge in quantum systems. In: Theoretical aspects of knowledge and rationality. ACM, Bloomington (2003)

    Google Scholar 

  12. van der Meyden, R., Patra, M.: A logic for probability in quantum systems. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 427–440. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Mateus, P., Serandas, A.: Reasoning about quantum systems. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 239–251. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Nielsen, M.A., Chuang, I.L.: Quantum computation and information. CUP (2001)

    Google Scholar 

  15. Nielsen, M.: Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. Physics Lett. A 308(2-3), 96–100 (2003)

    Article  MATH  Google Scholar 

  16. Patra, M.: Logics for quantum computation and information, cse.unsw.edu.au/db/staff/info/mansp.html (2004)

  17. Grabowski, M., Busch, P., Lathi, P.J.: Operational Quantum Physics. Springer, Berlin (1995)

    MATH  Google Scholar 

  18. Leighton, R.B., Feynman, R.P., Sands, M.: Feynman Lectures on Physics, vol. III. Addison-Wesely, Reading (1965)

    MATH  Google Scholar 

  19. Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, Reading (1967)

    MATH  Google Scholar 

  20. Smullyan, R.M.: Theory of Formal Systems. Princeton University Press, Princeton (1961)

    MATH  Google Scholar 

  21. van Tonder, A.: A lambda calculus for quantum computation. arXiv e-Print (2003), http://arxiv.org/abs/quant-ph/03071509

  22. Yao, A.C.-C.: Quantum circuit complexity. In: Proc. 34th. Symp. on Foundations of computer science, pp. 352–360. IEEE, Los Alamitos (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, The University of New South Wales, Sydney, 2052, Australia

    Manas Patra

  2. CQCT, Macquarie University, Sydney, NSW 2109, Australia

    Manas Patra

Authors
  1. Manas Patra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Technology, Vietnam National University, Hanoi, Vietnam

    Dang Van Hung

  2. Institute of Computer Science, LMU Munich, Munich, Germany

    Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Patra, M. (2005). A Logic for Quantum Circuits and Protocols. In: Van Hung, D., Wirsing, M. (eds) Theoretical Aspects of Computing – ICTAC 2005. ICTAC 2005. Lecture Notes in Computer Science, vol 3722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560647_28

Download citation

  • DOI: https://doi.org/10.1007/11560647_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29107-7

  • Online ISBN: 978-3-540-32072-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation