Universal Quantum Computation via Superposed Orders of Single-Qubit Gates
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_ | 1866915838234198016 |
|---|---|
| author | Simonov, Kyrylo Caleffi, Marcello Illiano, Jessica Romero, Jacquiline Cacciapuoti, Angela Sara |
| author_facet | Simonov, Kyrylo Caleffi, Marcello Illiano, Jessica Romero, Jacquiline Cacciapuoti, Angela Sara |
| contents | Superposed orders of quantum channels have already been proved - both theoretically and experimentally - to enable unparalleled opportunities in the quantum communication domain. As a matter of fact, superposition of orders can be exploited within the quantum computing domain as well, by relaxing the (traditional) assumption underlying quantum computation about applying gates in a well-defined causal order. In this context, we address a fundamental question arising with quantum computing: whether superposed orders of single-qubit gates can enable universal quantum computation. As shown in this paper, the answer to this key question is a definitive "yes". Indeed, we prove that any two-qubit controlled quantum gate can be deterministically realized, including the so-called Barenco gate that alone enables universal quantum computation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_13654 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Universal Quantum Computation via Superposed Orders of Single-Qubit Gates Simonov, Kyrylo Caleffi, Marcello Illiano, Jessica Romero, Jacquiline Cacciapuoti, Angela Sara Quantum Physics Networking and Internet Architecture Superposed orders of quantum channels have already been proved - both theoretically and experimentally - to enable unparalleled opportunities in the quantum communication domain. As a matter of fact, superposition of orders can be exploited within the quantum computing domain as well, by relaxing the (traditional) assumption underlying quantum computation about applying gates in a well-defined causal order. In this context, we address a fundamental question arising with quantum computing: whether superposed orders of single-qubit gates can enable universal quantum computation. As shown in this paper, the answer to this key question is a definitive "yes". Indeed, we prove that any two-qubit controlled quantum gate can be deterministically realized, including the so-called Barenco gate that alone enables universal quantum computation. |
| title | Universal Quantum Computation via Superposed Orders of Single-Qubit Gates |
| topic | Quantum Physics Networking and Internet Architecture |
| url | https://arxiv.org/abs/2311.13654 |