Quantum circuit compilation with quantum computers
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908556010192896 |
|---|---|
| author | Rattacaso, Davide Jaschke, Daniel Ballarin, Marco Siloi, Ilaria Montangero, Simone |
| author_facet | Rattacaso, Davide Jaschke, Daniel Ballarin, Marco Siloi, Ilaria Montangero, Simone |
| contents | Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers, paving the way for a quantum advantage in compilation. We demonstrate the effectiveness of this approach via Quantum and Simulated Annealing-based compilation: we successfully compile a Trotterized Hamiltonian simulation with up to 64 qubits and 64 time-steps and a Quantum Fourier Transform with up to 40 qubits and 771 time steps. We show that, for a translationally invariant circuit, the compilation results in a fidelity gain that grows extensively in the size of the input circuit, outperforming any local or quasi-local compilation approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_00077 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum circuit compilation with quantum computers Rattacaso, Davide Jaschke, Daniel Ballarin, Marco Siloi, Ilaria Montangero, Simone Quantum Physics Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers, paving the way for a quantum advantage in compilation. We demonstrate the effectiveness of this approach via Quantum and Simulated Annealing-based compilation: we successfully compile a Trotterized Hamiltonian simulation with up to 64 qubits and 64 time-steps and a Quantum Fourier Transform with up to 40 qubits and 771 time steps. We show that, for a translationally invariant circuit, the compilation results in a fidelity gain that grows extensively in the size of the input circuit, outperforming any local or quasi-local compilation approach. |
| title | Quantum circuit compilation with quantum computers |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2408.00077 |