A feasible and unitary quantum programming language
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914701644922880 |
|---|---|
| author | Díaz-Caro, Alejandro Hainry, Emmanuel Péchoux, Romain Silva, Mário |
| author_facet | Díaz-Caro, Alejandro Hainry, Emmanuel Péchoux, Romain Silva, Mário |
| contents | We introduce a novel quantum programming language featuring higher-order programs and quantum controlflow which ensures that all qubit transformations are unitary. Our language boasts a type system guaranteeingboth unitarity and polynomial-time normalization. Unitarity is achieved by using a special modality forsuperpositions while requiring orthogonality among superposed terms. Polynomial-time normalization isachieved using a linear-logic-based type discipline employing Barber and Plotkin duality along with a specificmodality to account for potential duplications. This type discipline also guarantees that derived values havepolynomial size. Our language seamlessly combines the two modalities: quantum circuit programs upholdunitarity, and all programs are evaluated in polynomial time, ensuring their feasibility. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_01054 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A feasible and unitary quantum programming language Díaz-Caro, Alejandro Hainry, Emmanuel Péchoux, Romain Silva, Mário Logic in Computer Science Programming Languages We introduce a novel quantum programming language featuring higher-order programs and quantum controlflow which ensures that all qubit transformations are unitary. Our language boasts a type system guaranteeingboth unitarity and polynomial-time normalization. Unitarity is achieved by using a special modality forsuperpositions while requiring orthogonality among superposed terms. Polynomial-time normalization isachieved using a linear-logic-based type discipline employing Barber and Plotkin duality along with a specificmodality to account for potential duplications. This type discipline also guarantees that derived values havepolynomial size. Our language seamlessly combines the two modalities: quantum circuit programs upholdunitarity, and all programs are evaluated in polynomial time, ensuring their feasibility. |
| title | A feasible and unitary quantum programming language |
| topic | Logic in Computer Science Programming Languages |
| url | https://arxiv.org/abs/2311.01054 |