Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Reasoning about Entanglement and Separability in Quantum Higher-Order Functions

  • Conference paper
Unconventional Computation (UC 2009)

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

Included in the following conference series:

  • 779 Accesses

Abstract

We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of aliasing for imperative functional programs. Both analyses share similarities notably because they are highly non-compositional. Nevertheless, the intrisic non determinism of quantum computation has a large impact on the definitions of the semantics and the validity of logical assertions. To the knowledge of the authors, it is the first proposal of an entanglement/separability analysis for a functional quantum programming language with higher-order functions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Altenkirch, T., Grattage, J.: A functional quantum programming language. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), pp. 249–258. IEEE Computer Society, Los Alamitos (2005)

    Chapter  Google Scholar 

  2. Barber, A.: Dual intuitionistic logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Science, University of Edimburgh (1996)

    Google Scholar 

  3. Berger, M., Honda, K., Yoshida, N.: A logical analysis of aliasing in imperative higher-order functions. In: Danvy, O., Pierce, B.C. (eds.) Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, pp. 280–293 (2005)

    Google Scholar 

  4. Chadha, R., Mateus, P., Sernadas, A.: Reasoning about imperative quantum programs. Electr. Notes Theoretical Computer Science 158, 19–39 (2006)

    Article  MATH  Google Scholar 

  5. Hoare, T.: An axiomatic basis of computer programming. CACM 12(10), 576–580 (1969)

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  7. Perdrix, S.: Quantum patterns and types for entanglement and separability. Electronic Notes Theoretical Computer Science 170, 125–138 (2007)

    Article  MATH  Google Scholar 

  8. Perdrix, S.: Quantum entanglement analysis based on abstract interpretation. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 270–282. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)

    MATH  Google Scholar 

  10. Prost, F.: Taming non-compositionality using new binders. In: Akl, S.G., Calude, C.S., Dinneen, M.J., Rozenberg, G., Wareham, H.T. (eds.) UC 2007. LNCS, vol. 4618, pp. 150–162. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Prost, F., Zerrari, C.: A logical analysis of entanglement and separability in quantum higher-order functions (2008), http://fr.arxiv.org/abs/0801.0649

  12. Smullyan, R.M.: First-Order Logic. Springer, Heidelberg (1968)

    Book  MATH  Google Scholar 

  13. Selinger, P., Valiron, B.: A lambda calculus for quantum computation with classical control. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 354–368. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Vidal, G.: Efficient classical simulation of slightly entangled quantum computations. Physical Review Letters 91(14) (2003)

    Google Scholar 

  15. van Tonder, A.: A lambda calculus for quantum computation. SIAM Journal on Computing 33(5), 1109–1135 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Grenoble Université, LIG, France

    Frédéric Prost

  2. VERIMAG, Grenoble Université, France

    Chaouki Zerrari

Authors
  1. Frédéric Prost
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chaouki Zerrari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Auckland, Science Centre, 38 Princes, 1142, St., Auckland, New Zealand

    Cristian S. Calude

  2. Centro de Matemática e Aplicações Fundamentais do Complexo Interdisciplinar, University of Lisbon, Av. Gama Pinto, 1649-003, Lisboa, Portugal

    José Félix Costa

  3. School of Computer Science, Tel Aviv University, 69978, Ramat Aviv, Israel

    Nachum Dershowitz

  4. Department of Mathematics, University of Azores, Rua da Mãe de Deus, 9501-855, Ponta Delgada, Portugal

    Elisabete Freire

  5. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prost, F., Zerrari, C. (2009). Reasoning about Entanglement and Separability in Quantum Higher-Order Functions. In: Calude, C.S., Costa, J.F., Dershowitz, N., Freire, E., Rozenberg, G. (eds) Unconventional Computation. UC 2009. Lecture Notes in Computer Science, vol 5715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03745-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03745-0_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03744-3

  • Online ISBN: 978-3-642-03745-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation