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!
|
| _version_ | 1846112364078825472 |
|---|---|
| author | Matthew Steinberg Medina Bandić Sacha Szkudlarek Carmen G. Almudever Aritra Sarkar Sebastian Feld |
| author_facet | Matthew Steinberg Medina Bandić Sacha Szkudlarek Carmen G. Almudever Aritra Sarkar Sebastian Feld |
| author_sort | Matthew Steinberg |
| collection | DOAJ |
| description | 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 prioritized as a cost metric. We reconstitute quantum circuit mapping using tools from quantum information theory, showing that a lower bound, which we dub the lightcone bound, emerges for a circuit executed on hardware. We also develop an initial placement algorithm based on graph similarity search, aiding us in optimally placing circuit qubits onto a device. 600 realistic benchmarks using the IBM Qiskit compiler and a brute-force method are then tested against the lightcone bound, with results unambiguously verifying the veracity of the bound, while permitting trustworthy estimations of minimal overhead in near-term realizations of quantum algorithms. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing. |
| format | Article |
| id | doaj-art-af1bf09271274776be0f349444887859 |
| institution | Kabale University |
| issn | 2056-6387 |
| language | English |
| publishDate | 2024-11-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | npj Quantum Information |
| spelling | doaj-art-af1bf09271274776be0f3494448878592024-12-22T12:39:38ZengNature Portfolionpj Quantum Information2056-63872024-11-0110111310.1038/s41534-024-00909-7Lightcone bounds for quantum circuit mapping via uncomplexityMatthew Steinberg0Medina Bandić1Sacha Szkudlarek2Carmen G. Almudever3Aritra Sarkar4Sebastian Feld5Quantum Computing Division, QuTech, Delft University of TechnologyQuantum Computing Division, QuTech, Delft University of TechnologyQuantum Computing Division, QuTech, Delft University of TechnologyDepartamento de Informática de Sistemas y Computadores, Universitat Politècnica de ValènciaQuantum Computing Division, QuTech, Delft University of TechnologyQuantum Computing Division, QuTech, Delft University of TechnologyAbstract 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 prioritized as a cost metric. We reconstitute quantum circuit mapping using tools from quantum information theory, showing that a lower bound, which we dub the lightcone bound, emerges for a circuit executed on hardware. We also develop an initial placement algorithm based on graph similarity search, aiding us in optimally placing circuit qubits onto a device. 600 realistic benchmarks using the IBM Qiskit compiler and a brute-force method are then tested against the lightcone bound, with results unambiguously verifying the veracity of the bound, while permitting trustworthy estimations of minimal overhead in near-term realizations of quantum algorithms. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.https://doi.org/10.1038/s41534-024-00909-7 |
| spellingShingle | Matthew Steinberg Medina Bandić Sacha Szkudlarek Carmen G. Almudever Aritra Sarkar Sebastian Feld Lightcone bounds for quantum circuit mapping via uncomplexity npj Quantum Information |
| title | Lightcone bounds for quantum circuit mapping via uncomplexity |
| title_full | Lightcone bounds for quantum circuit mapping via uncomplexity |
| title_fullStr | Lightcone bounds for quantum circuit mapping via uncomplexity |
| title_full_unstemmed | Lightcone bounds for quantum circuit mapping via uncomplexity |
| title_short | Lightcone bounds for quantum circuit mapping via uncomplexity |
| title_sort | lightcone bounds for quantum circuit mapping via uncomplexity |
| url | https://doi.org/10.1038/s41534-024-00909-7 |
| work_keys_str_mv | AT matthewsteinberg lightconeboundsforquantumcircuitmappingviauncomplexity AT medinabandic lightconeboundsforquantumcircuitmappingviauncomplexity AT sachaszkudlarek lightconeboundsforquantumcircuitmappingviauncomplexity AT carmengalmudever lightconeboundsforquantumcircuitmappingviauncomplexity AT aritrasarkar lightconeboundsforquantumcircuitmappingviauncomplexity AT sebastianfeld lightconeboundsforquantumcircuitmappingviauncomplexity |