A programming language characterizing quantum polynomial time
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909854504845312 |
|---|---|
| author | Hainry, Emmanuel Péchoux, Romain Silva, Mário |
| author_facet | Hainry, Emmanuel Péchoux, Romain Silva, Mário |
| contents | We introduce a first-order quantum programming language, named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset, named PFOQ, of terminating programs with bounded width, that provides a first programming language-based characterization of the quantum complexity class FBQP. Finally, we present a tractable semantics-preserving algorithm compiling a PFOQ program to a quantum circuit of size polynomial in the number of input qubits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_06656 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | A programming language characterizing quantum polynomial time Hainry, Emmanuel Péchoux, Romain Silva, Mário Logic in Computer Science Programming Languages We introduce a first-order quantum programming language, named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset, named PFOQ, of terminating programs with bounded width, that provides a first programming language-based characterization of the quantum complexity class FBQP. Finally, we present a tractable semantics-preserving algorithm compiling a PFOQ program to a quantum circuit of size polynomial in the number of input qubits. |
| title | A programming language characterizing quantum polynomial time |
| topic | Logic in Computer Science Programming Languages |
| url | https://arxiv.org/abs/2212.06656 |