arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv quant-ph/9612052quant-ph
收藏

扩展Lambda演算表示随机化和量子化算法

Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms

Philip Maymin

摘要:

本文介绍了一种形式化的元语言,称为量子程序设计语言的规格说明的Q-Q演算。这种元语言是lambda演算的扩展,它为经典编程语言的规范提供了形式化的设置。作为一个中间步骤,我们引入了一个正式的元语言,称为PRANDA-P演算的编程语言,允许真正的随机数生成的规范。我们演示了如何选择随机算法可以直接编程的PRADDA-P演算。我们还演示了如何满足性可以解决的Zeroda-q演算。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑