Resource Bounds for Quantum Circuit Mapping via Quantum Circuit
Complexity
- URL: http://arxiv.org/abs/2402.00478v1
- Date: Thu, 1 Feb 2024 10:32:05 GMT
- Title: Resource Bounds for Quantum Circuit Mapping via Quantum Circuit
Complexity
- Authors: Matthew Steinberg, Medina Bandic, Sacha Szkudlarek, Carmen G.
Almudever, Aritra Sarkar, Sebastian Feld
- Abstract summary: We show that a minimal SWAP gate count for executing a quantum circuit on a device emerges via the minimization of the distance between quantum states.
This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.
- Score: 1.0879875537360844
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Efficiently mapping quantum circuits onto hardware is an integral part of the
quantum compilation process, wherein a quantum circuit is modified in
accordance with the stringent architectural demands of a quantum processor.
Many techniques exist for solving the quantum circuit mapping problem, many of
which relate quantum circuit mapping to classical computer science. This work
considers a novel perspective on quantum circuit mapping, in which the routing
process of a simplified circuit is viewed as a composition of quantum
operations acting on density matrices representing the quantum circuit and
processor. Drawing on insight from recent advances in quantum information
theory and information geometry, we show that a minimal SWAP gate count for
executing a quantum circuit on a device emerges via the minimization of the
distance between quantum states using the quantum Jensen-Shannon divergence.
Additionally, we develop a novel initial placement algorithm based on a graph
similarity search that selects the partition nearest to a graph isomorphism
between interaction and coupling graphs. From these two ingredients, we then
construct a polynomial-time algorithm for calculating the SWAP gate lower
bound, which is directly compared alongside the IBM Qiskit compiler for over
600 realistic benchmark experiments, as well as against a brute-force method
for smaller benchmarks. In our simulations, we unambiguously find that neither
the brute-force method nor the Qiskit compiler surpass our bound, implying
utility as a precise estimation of minimal overhead when realizing quantum
algorithms on constrained quantum hardware. This work constitutes the first use
of quantum circuit uncomplexity to practically-relevant quantum computing. We
anticipate that this method may have diverse applicability outside of the scope
of quantum information science, and we discuss several of these possibilities.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Symmetry-Based Quantum Circuit Mapping [2.51705778594846]
We introduce a quantum circuit remapping algorithm that leverages the intrinsic symmetries in quantum processors.
This algorithm identifies all topologically equivalent circuit mappings by constraining the search space using symmetries and accelerates the scoring of each mapping using vector computation.
arXiv Detail & Related papers (2023-10-27T10:04:34Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Quantivine: A Visualization Approach for Large-scale Quantum Circuit
Representation and Analysis [31.203764035373677]
We develop Quantivine, an interactive system for exploring and understanding quantum circuits.
A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement.
The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
arXiv Detail & Related papers (2023-07-18T04:51:28Z) - Interaction graph-based characterization of quantum benchmarks for
improving quantum circuit mapping techniques [1.351147045576948]
We propose to extend the characterization of quantum circuits by including qubit interaction graph properties.
Our study reveals a correlation between interaction graph-based parameters and mapping performance metrics for various existing configurations of quantum devices.
arXiv Detail & Related papers (2022-12-13T15:24:37Z) - On Optimal Subarchitectures for Quantum Circuit Mapping [3.610459670994051]
One step in compiling a quantum circuit to some device is quantum circuit mapping.
Because the search space in quantum circuit mapping grows in the number of qubits, it is desirable to consider as few physical qubits as possible.
We show that determining subarchitectures that are of minimal size, i.e., of which no physical qubit can be removed without losing the optimal mapping solution for some quantum circuit, is a very hard problem.
arXiv Detail & Related papers (2022-10-17T18:00:02Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Quantum Gate Pattern Recognition and Circuit Optimization for Scientific
Applications [1.6329956884407544]
We introduce two ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL.
AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics.
Our technique is generic and can be useful for a wide variety of quantum algorithms.
arXiv Detail & Related papers (2021-02-19T16:20:31Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.