Lightcone bounds for quantum circuit mapping via uncomplexity
Abstract Efficiently mapping quantum circuits onto hardware is integral for the quantum compilation process, wherein a circuit is modified in accordance with a quantum processor’s connectivity. Many techniques currently exist for solving this problem, wherein SWAP-gate overhead is usually prioritize...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2024-11-01
|
| Series: | npj Quantum Information |
| Online Access: | https://doi.org/10.1038/s41534-024-00909-7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|