Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity
[EN] 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...
| Autores: | , , , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2024 |
| País: | España |
| Recursos: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/229877 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/229877 |
| Access Level: | acceso abierto |
| Palavra-chave: | Quantum circuit mapping Quantum compilation Lightcone bound Graph similarity Qubit placement Quantum information theory |
| Resumo: | [EN] 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. |
|---|