Skip to main content Accessibility help
×
Home

On a measurement-free quantum lambda calculus with classical control

  • UGO DAL LAGO (a1), ANDREA MASINI (a2) and MARGHERITA ZORZI (a3)

Abstract

We study a measurement-free, untyped λ-calculus with quantum data and classical control. This work arises from previous proposals by Selinger and Valiron, and Van Tonder. We focus on operational and expressiveness issues, rather than (denotational) semantics. We prove subject reduction and confluence, and a standardisation theorem. Moreover, we prove the computational equivalence of the proposed calculus with a suitable class of quantum circuit families.

Copyright

References

Hide All
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 J. Comput. 37 (1)166194.
Altenkirch, T, and Grattage, J. (2005) A functional quantum programming language. Proc. of the 20th Annual IEEE Symposium on Logic in Computer Science 249–258.
Arrighi, P. and Dowek, G. (2008) Linear-algebraic lambda-calculus: higher-order, encodings and confluence. Springer-Verlag Lecture Notes in Computer Science 5117 1781.
Basdevant, J. L. and Dalibard, J. (2005) Quantum mechanics, Springer-Verlag.
Bernstein, E. and Vazirani, U. (1997) Quantum Complexity Theory. SIAM J. Comput. 26 (5)14111473.
Danos, V. and Kashefi, E. and Panangaden, P. (2007) The measurement calculus. Journal of the ACM 54 (2).
Deutsch, D. (1985) Quantum theory, the Church–Turing principle and the universal quantum computer. Proceedings of the Royal Society of London Ser. A A400 97117.
Feynman, R. P. (1982) Simulating physics with computers. Internat. J. Theoret. Phys. 21 (6–7)467488.
Grover, L. K. (1999) Quantum search on structured problems. In: Quantum computing and quantum communications (Palm Springs, CA, 1998). Springer-Verlag Lecture Notes in Computer Science 1509 126139.
Kleene, S. C. (1936) λ-definability and recursiveness. Duke Math. J. 2 (2)340353.
Knill, E. (1996) Conventions for quantum pseudocode. Tech. Rep. LAUR-96-2724, Los Alamos National Laboratory.
Maymin, P. (1996) Extending the lambda calculus to express randomized and quantumized algorithms. arXiv:quant-ph/9612052.
Maymin, P. (1997) The lambda-q calculus can efficiently simulate quantum computers. arXiv:quant-ph/9702057.
Nielsen, M. A. and Chuang, I. L. (2000) Quantum computation and quantum information, Cambridge University Press.
Nishimura, H. and Ozawa, M. (2002) Computational complexity of uniform quantum circuit families and quantum Turing machines. Theor. Comput. Sci. 276 (1–2)147181.
Perdrix, S. (2007) Quantum Patterns and Types for Entanglement and Separability. Electr. Notes Theor. Comput. Sci. 170 125138.
Selinger, P. (2004) Towards a Quantum Programming Language. Mathematical Structures in Computer Science 14 (4)527586.
Selinger, P. and Valiron, B. (2006) A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16 (3)527552.
Shor, P. W. (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proc. 35th Annual Symposium on Foundations of Computer Science 124–134.
Simpson, A. (2005) Reduction in a linear lambda-calculus with applications to operational semantics. In: Proc. of Proc. of the 16th Annual Conference on Term Rewriting and Applications. Springer-Verlag Lecture Notes in Computer Science 3467 219234.
van Tonder, A. (2004) A lambda calculus for quantum computation. SIAM J. Comput. 33 (5)11091135.
Wadler, P. (1994) A syntax for linear logic. In: Proc. of the 9th International Conference on Mathematical Foundations of Programming Semantics. Springer-Verlag Lecture Notes in Computer Science 802 513529.
Wadsworth, C. (1980) Some unusual λ-calculus numeral systems. In: Seldin, J. and Hindley, J. (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press.
Yao, A. (1993) Quantum Circuit Complexity. In: Proc. 34th Annual Symposium on Foundations of Computer Science, IEEE 352–360.

Related content

Powered by UNSILO

On a measurement-free quantum lambda calculus with classical control

  • UGO DAL LAGO (a1), ANDREA MASINI (a2) and MARGHERITA ZORZI (a3)

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.