Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms

Simple item page
dc.creatorMaymin, Philip
dc.date1996-12-31
dc.date1997-01-09
dc.date.accessioned2026-07-07T09:08:57Z
dc.date.available2026-07-07T09:08:57Z
dc.descriptionThis 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.
dc.description26 pages, LaTeX2e, no figures. Revision changed \today to December 31, 1996
dc.identifierhttps://arxiv.org/abs/quant-ph/9612052
dc.identifierhttp://arxiv.org/abs/quant-ph/9612052
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/150911
dc.subjectQuantum Physics
dc.titleExtending the Lambda Calculus to Express Randomized and Quantumized Algorithms
dc.typetext

Files

Collections

arXiv