Skip to main content Accessibility help
×
×
Home

On quantum lambda calculi: a foundational perspective

  • MARGHERITA ZORZI (a1)
Abstract

In this paper, we propose an approach to quantum λ-calculi. The ‘quantum data-classical control’ paradigm is considered. Starting from a measurement-free untyped quantum λ-calculus called Q, we will study standard properties such as confluence and subject reduction, and some good quantum properties. We will focus on the expressive power, analysing the relationship with other quantum computational models. Successively, we will add an explicit measurement operator to Q. On the resulting calculus, called Q*, we will propose a complete study of reduction sequences regardless of their finiteness, proving confluence results. Moreover, since the stronger motivation behind quantum computing is the research of new results in computational complexity, we will also propose a calculus which captures the three classes of quantum polytime complexity, showing an ICC-like approach in the quantum setting.

Copyright
References
Hide All
AA.VV. (2013) Website of the QML Project. Available at: http://fop.cs.nott.ac.uk/qml/.
Abramsky, S., Haghverdi, E. and Scott, P. J. (2002) Geometry of Interaction and Linear Combinatory Algebras. Mathematical Structures in Computer Science 12 (5) 625665.
Aharonov, D., Kitaev, A. and Nisan, N. (1998) Quantum circuits with mixed states. In: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing 20–30.
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S. and Regev, O. (2007) Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Journal on Computing 37 (1) 166194.
Altenkirch, T. and Grattage, J. (2005) A functional quantum programming language. In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science 249–258.
Altenkirch, T., Grattage, J., Vizzotto, J. and Sabry, A. (2007) An algebra of pure quantum programming. Electronic Notes in Theoretical Computer Science 210 (1) 2347.
Arora, S. and Barak, B. (2009) Computational Complexity: A Modern Approach, Cambridge University Press.
Arrighi, P., Díaz-Caro, A., Gadella, M. and Grattage, G. (2008) Measurements and confluence in quantum Lambda calculi with explicit qubits. Electronic Notes in Theoretical Computer Science 270 (1) 5974.
Arrighi, P., Díaz-Caro, A. and Valiron, B. (2012a) A system F accounting for scalars. Logical Methods in Computer Science 8 111.
Arrighi, P., Díaz-Caro, A. and Valiron, B. (2012b) A type system for the vectorial aspects of the linear-algebraic lambda-calculus. In: Proceedings of the 7th International Workshop on Developments of Computational Methods. Electronic Proceedings in Theoretical Computer Science 88 115.
Arrighi, P. and Dowek, G. (2008) Linear-algebraic lambda-calculus: Higher-order, encodings and confluence. In: Proceedings of the 19th Annual Conference on Term Rewriting and Applications 17–31.
Baillot, P., Coppola, P. and Dal Lago, U. (2011) Light logics and optimal reduction: Completeness and complexity. Information and Computation 209 (2) 118142.
Baillot, P., Marion, Y.-J., Ronchi Della Rocca, S. (eds.) (2009) Special issue on implicit complexity. ACM Transactions on Computational Logic 10 (4).
Baillot, P. and Mogbil, V. (2004) Soft lambda-calculus: A language for polynomial time computation. In: Proceedings of the 7th International Conference Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science 2987 2741.
Barebdregt, H. (1984) The lambda calculus: its Syntax and Semantics, North-Holland Publishing Co.
Basdevant, J. L. and Dalibard, J. (2005) Quantum Mechanics, Springer.
Benioff, P. (1980) The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. Journal of Statistical Physics 5 563591.
Bennett, C. H. and Landauer, R. (1985) The fundamental physical limits of computation. Scientific American 253 (1) 4856.
Bernstein, E. and Vazirani, U. (1997) Quantum complexity theory. SIAM Journal on Computing 26 (5) 14111473.
Birkhoff, G. and Mac Lane, S. (1967) Algebra, The Macmillan Co. press.
Brassard, G. (1994) Cryptology column–quantum computing: The end of classical cryptography? SIGACT News 25 (4) 1521.
Conway, J. (1990) A Course in Functional Analysis, Springer-Verlag.
Dalla Chiara, M. L., Giuntini, R. and Leporini, R (2003) Quantum computational logics. A survey. In: Proceedings of Trends in Logic. 50 Years of Studia Logica %, Hendricks, V. and Malinowski, J. (eds.), Kluwer.
Dal Lago, U., Masini, A. and Zorzi, M. (2009) On a measurement-free quantum lambda calculus with classical control. Mathematical Structures in Computer Science 19 (2) 297335.
Dal Lago, U., Masini, A. and Zorzi, M. (2010) Quantum implicit computational complexity. Theoretical Computer Science 411 (2) 377409.
Dal Lago, U., Masini, A. and Zorzi, M. (2011) Confluence results for a quantum lambda calculus with measurements. Electronics Notes in Theoretical Computer Science 207 (2) 251261.
Dal Lago, U. and Zorzi, M. (2012) Probabilistic operational semantics for the lambda calculus. RAIRO - Theoretical Informatics and Applications 46 (3) 413450.
Dal Lago, U. and Zorzi, M. (2013) Wave-style token machines and quantum lambda calculi. Long version available at: http://arxiv.org/abs/1307.0550.
Dal Lago, U. and Zorzi, M. (2014) Wave-style token machines and quantum lambda calculi. In: Informal Proceedings (with revision) of LINEARITY'14 (FloC'14), 13th July, Vienna 8 pp.
Danos, V., Kashefi, E. and Panangaden, P. (2005) Distributed measurement based quantum computation. Electronic Notes in Theoretical Computer Science 170 7394.
Danos, V., Kashefi, E. and Panangaden, P. (2007) The measurement calculus. Journal of the ACM 52 (2) Article No. 8.
Danos, V., Kashefi, E., Panangaden, P. and Perdrix, S. (2009) Extended measurement calculus. In: Semantic Techniques in Quantum Computation. Cambridge University Press 235310.
Deutsch, D. (1985) Quantum theory, the Church–Turing principle and the universal quantum computer. In: Proceedings of the Royal Society of London A 400 97117.
Deutsch, D., Ekert, A. and Lupacchini, R. (2000) Machines, logic and quantum physics. Bullettin of Symbolic Logic 6 (3) 265283.
Delbecque, Y. (2011) Game semantics for quantum data. Electronics Notes in Theoretical Computer Science 270 (1) 4157.
Dirac, P. (1947) Quantum theory, the Church–Turing principle and the universal quantum computer. In: Proceedings of the Royal Society of London A A400 97117.
Einstein, A., Podolsky, B. and Rosen, N. (1935) Can quantum-mechanical description of physical reality be considered complete? Physical Review 47 777780.
Feynman, R. P. (1982) Simulating physics with computers. International Journal of Theoretical Physics 21 (6–7) 467488.
Gaboardi, M., Marion, J.-Y. and Ronchi Della Rocca, S. (2013) An implicit characterization of PSPACE. ACM Transactions on Computational Logic 13 (2) 18:1–18:36.
Gay, S. (2011) Bibliography on quantum programming languages. Available at: http://www.dcs.gla.ac.uk/simon/quantum/.
Gay, S. and Makie, I. (eds.) (2009) Semantic Techniques in Quantum Computation, Cambridge University Press.
Girard, J.-Y. (1987) Linear logic. Theoretical Computer Science 50 (1) 1102.
Girard, J.-Y., Scedrov, A. and Scott, P. (1992) Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science 97 166.
Girard, J.-Y. (1998) Light linear logic. Information and Computation 14 (3) 175204.
Grattage, J. (2006) A Functional Quantum Programming Language, Ph.D. thesis, University of Nottingham.
Grattage, J. (2011) An overview of QML with a concrete implementation in Haskell. Electronic Notes in Theoretical Computer Science 270 (1) 165174.
Grover, L. K. (1999) Quantum search on structured problems. Quantum Computing and Quantum Communications 1509 126139.
Haghverdi, E. and Scott, P. J. (2002) Geometry of interaction and the dynamics of proof reduction: A tutorial. New Structures for Physics, Lectures Notes in Physics 813 357417.
Hashuo, I. and Hoshino, N. (2011) Semantics of higher-order quantum computation via geometry of interaction. In: Proceedings of 26th Annual Symposium on Logic in Computer Science 237–246.
Hirvensalo, M. (2004) Quantum Computing, Springer-Verlag.
Isham, C. (1995) Lectures on Quantum Theory, Imperial College Press.
Jain, R., Ji, Z., Upadhyay, S. and Watrous, J. (2011) QIP=PSPACE. Journal of the ACM 58 (6) Article No. 30.
Jain, R., Upadhyay, S. and Watrous, J. (2009) Two-message quantum interactive proofs are in PSPACE. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society 534–543.
Kaye, P., Laflamme, R. and Mosca, M (2007) An Introduction to Quantum Computing, Oxford University Press.
Kitaev, A., Shen, A. and Vyalyi, M. (2002) Classical and Quantum Computation, AMS press.
Kleene, S. C. (1936) λ-definability and recursiveness. Duke Mathematical Journal 2 (2) 340353.
Knill, E. (1996) Conventions for quantum pseudocode. Technical Report LAUR-96-2724, Los Alamos National Laboratory.
Lafont, Y. (2004) Soft linear logic and polynomial time. Theoretical Computer Science 318 163180.
Lanzagorta, M. and Uhlmann, J. (2009) Quantum Computer Science, Morgan and Claypool Press.
Maccone, L. and Salasnish, L. (2008) Fisica moderna. Meccanica quantistica, caos e sistemi complessi, Carocci Press.
Masini, A., Viganò, L. and Zorzi, M. (2008) A qualitative modal representation of quantum register transformations. In: Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (22–23 May 2008, Dallas, Texas, USA), IEEE CS Press 131–137.
Masini, A., Viganò, L. and Zorzi, M. (2011) Modal deduction systems for quantum state transformations. Multiple-Valued Logic and Soft Computing 17 (5–6) 475519.
Maymin, P. (1996) Extending the λ-calculus to express randomized and quantumized algorithms. ArXiv:quant-ph/9612052. Unpublished.
Maymin, P. (1997) The lambda-q calculus can efficiently simulate quantum computers. ArXiv:quant-ph/9702057. Unpublished.
Nakahara, M. and Ohmi, T. (2008) Quantum Computing. From Linear Algebra to Physical Realizations, CRC Press.
Nielsen, M. A. (2003) Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. Physical Letters A 308 (2–3) 96100.
Nielsen, M. A. and Chuang, I. L. (2000) Quantum Computation and Quantum Information. Physical Review, volume 308, Cambridge University Press.
Nishimura, H. and Ozawa, M. (2002) Computational complexity of uniform quantum circuit families and quantum Turing machines. Theoretical Computer Science 276 147181.
Nishimura, H. and Ozawa, M. (2009) Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families. Quantum Information Processing 8 (1) 1224.
Papadimitriou, C. (1994) Computational Complexity, Addison-Wesley.
Perdrix, S. (2006) Modèles formels du calcul quantique: Ressources, machines abstraites et calcul par mesure, Ph.D. thesis, Institut National Polytechnique de Grenoble.
Perdrix, S. (2007) Quantum patterns and types for entanglement and separability. Electronic Notes in Theoretical Computer Science 170 125138.
Perdrix, V. and Jorrand, P., (2006) Classically controlled quantum computation. Mathematical Structures in Computer Science 16 (4) 601620.
Preskill, J. (2006) Quantum Information and Computation, Lecture Notes in Physics volume 229, Rinton Press.
Roman, S. (2008) Advanced Linear Algebra, Springer.
Selinger, P. (2004) Towards a quantum programming language. Mathematical Structures in Computer Science 14 (4) 527586.
Selinger, P. and Valiron, B. (2006) A λ-calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16 (3) 527552.
Selinger, P. and Valiron, B. (2009) Quantum λ-calculus. In: Semantic Techniques in Quantum Computation, Cambridge University Press 135172.
Shor, P. W. (1994) Algorithms for quantum computation: Discrete logarithms and factoring. In: Proceedings of 35th Annual Symposium on Foundations of Computer Science 124–134.
Shor, P. W. (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26 14841509.
Simon, D. (1994) On the power of quantum computation. SIAM Journal on Computing 26 116123.
Simpson, A. (2005) Reduction in a linear lambda-calculus with applications to operational semantics. In: Proceedings of the 16th Annual Conference on Term Rewriting and Applications 219–234.
van Tonder, A. (2004) A λ-calculus for quantum computation. SIAM Journal on Computing 33 (5) 11091135.
Vaux, L. (2006) Lambda-calculus in an algebraic setting. Research report, Institut de Mathmatiques de Luminy.
Vaux, L. (2009) The algebraic lambda-calculus. Mathematical Structures in Computer Science 19 (5) 10291059.
Volpe, M., Viganò, L. and Zorzi, M. (2014) Quantum state transformations and branching distributed temporal logic. In: Proceedings of the 21st Workshop on Logic, Language, Information and Computation (1–4 September, 2014, Valparaiso, Chile). Lecture Notes in Computer Science 8652 119.
Wadler, P. (1994) A syntax for linear logic. In: Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics 513–529.
Wadsworth, C. (1980) Some unusual λ-calculus numeral systems. In: To H.B. Curry: Essays on Combinatory Logic, λ-Calculus and Formalism, Academic Press.
Wootters, W. K. and Zurek, W. H. (1982) A single quantum cannot be cloned. Nature 299 802803.
Yao, A. (1993) Quantum circuit complexity. In: Proceedings of the 34th Annual Symposium on Foundations of Computer Science 352–360.
Zorzi, M. (2009) Lambda Calculi and Logics for Quantum Computing, Ph.D. thesis, Dipartimento di Informatica, Università degli Studi di Verona.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed