QPCF: Higher-Order Languages and Quantum Circuits
| Autor: | Mauro Piccolo, Margherita Zorzi, Luca Paolini |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Quantum programming
Theoretical computer science Computer science 0102 computer and information sciences 02 engineering and technology 01 natural sciences Dependent type Operational semantics Computer Science::Hardware Architecture Quantum programming languages Dependent Type Theory Artificial Intelligence Quantum state Encoding (memory) 0202 electrical engineering electronic engineering information engineering PCF Quantum Programming Languages Quantum Circuits Quantum computer.programming_language Quantum computer 020207 software engineering Quantum computing Syntax Computational Theory and Mathematics 010201 computation theory & mathematics ComputerSystemsOrganization_MISCELLANEOUS Computer Science::Programming Languages computer Software |
| Zdroj: | Journal of Automated Reasoning. 63:941-966 |
| ISSN: | 1573-0670 0168-7433 |
| DOI: | 10.1007/s10817-019-09518-y |
| Popis: | qPCF 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink