当前位置: X-MOL 学术J. Autom. Reason. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
QPCF: Higher-Order Languages and Quantum Circuits
Journal of Automated Reasoning ( IF 0.9 ) Pub Date : 2019-03-13 , DOI: 10.1007/s10817-019-09518-y
Luca Paolini , Mauro Piccolo , Margherita Zorzi

AbstractqPCF is a paradigmatic quantum programming language that extends PCF with quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data that can be duplicated and manipulated in flexible ways by means of a dependent type system. The co-processor is essentially a standard QRAM device, albeit we avoid to store permanently quantum states in between two co-processor’s calls. Despite its quantum features, qPCF retains the classic programming approach of PCF. We introduce qPCF syntax, typing rules, and its operational semantics. We prove fundamental syntactic properties of the system. Moreover, we provide some higher-order examples of circuit encoding.

中文翻译:

QPCF:高阶语言和量子电路

AbstractqPCF 是一种范式量子编程语言,它通过量子电路和量子协处理器扩展了 PCF。量子电路被视为经典数据,可以通过依赖类型系统以灵活的方式复制和操作。协处理器本质上是一个标准的 QRAM 设备,尽管我们避免在两个协处理器的调用之间永久存储量子状态。尽管具有量子特性,qPCF 仍保留了 PCF 的经典编程方法。我们介绍了 qPCF 语法、类型规则及其操作语义。我们证明了系统的基本句法特性。此外,我们提供了一些电路编码的高阶示例。
更新日期:2019-03-13
down
wechat
bug