Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms
Philip Maymin
Abstract
This paper introduces a formal metalanguage called the lambda-q calculus for the specification of quantum programming languages. This metalanguage is an extension of the lambda calculus, which provides a formal setting for the specification of classical programming languages. As an intermediary step, we introduce a formal metalanguage called the lambda-p calculus for the specification of programming languages that allow true random number generation. We demonstrate how selected randomized algorithms can be programmed directly in the lambda-p calculus. We also demonstrate how satisfiability can be solved in the lambda-q calculus.
Create a lesson
Related papers
Spectral Fingerprints of Gauge Theories on a Quantum Computer
Graham Van Goffrier, Debasish Banerjee, Bipasha Chakraborty et al.
Dynamics of local quantum information in random unitary circuits
Ratul Thakur, Sthitadhi Roy
Factorized Boolean representations for efficient quantum synthesis
Mehul Shah, Robert Fiszer, Marek Perkowski
Detuning- and Stark-robust Rydberg gates
Elie Bataille, Gyohei Nomura, Manuel Endres
Krylov Break Times from an Inhomogeneous Lieb--Robinson Light Cone
Shunji Matsuura, Yoji Kawamura, Joseph Salfi et al.
Stochastic transport of a Goldstone mode in a self-organized atomic crystal
Zhanhai Yu, Di Xiang, Xiaotian Zhang et al.