Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms

Details Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms

1996-12-31

arxiv.org/abs/quant-ph/9612052v2

Physics

Quantum Physics

26 pages, LaTeX2e, no figures. Revision changed \today to December 31, 1996

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512365