Full Characterization of the Depth Overhead for Quantum Circuit Compilation with Arbitrary Qubit Connectivity Constraint
In some physical implementations of quantum computers, 2-qubit operations can be applied only on certain pairs of qubits. Compilation of a quantum circuit into one compliant to such qubit connectivity constraint results in an increase of circuit depth. Various compilation algorithms were studied, ye...
Saved in:
| Main Authors: | Pei Yuan, Shengyu Zhang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2025-05-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2025-05-28-1757/pdf/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Stabilization of Kerr-cat qubits with quantum circuit refrigerator
by: Shumpei Masuda, et al.
Published: (2025-02-01) -
Computational Power of Random Quantum Circuits in Arbitrary Geometries
by: M. DeCross, et al.
Published: (2025-05-01) -
Reducing Quantum Error Correction Overhead With Versatile Flag-Sharing Syndrome Extraction Circuits
by: Pei-Hao Liou, et al.
Published: (2025-01-01) -
Quantum Circuit Compilation for Trapped-Ion Processors With the Drive-Through Architecture
by: Che-Ming Chang, et al.
Published: (2025-01-01) -
Global variational quantum circuits for arbitrary symmetric state preparation
by: Liam J. Bond, et al.
Published: (2025-06-01)