A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting
- URL: http://arxiv.org/abs/2409.03870v1
- Date: Thu, 5 Sep 2024 19:18:30 GMT
- Title: A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting
- Authors: Xiangyu Ren, Mengyu Zhang, Antonio Barbalace,
- Abstract summary: Circuit knitting emerges as a promising technique to overcome the limitation of the few physical qubits in near-term quantum hardware.
We propose a hardware-aware framework aiming to advance the practicability of circuit knitting.
We show that our framework reduces total subcircuits depth by up to 64% (48% on average) compared to the state-of-the-art approach.
- Score: 0.9968037829925942
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Circuit knitting emerges as a promising technique to overcome the limitation of the few physical qubits in near-term quantum hardware by cutting large quantum circuits into smaller subcircuits. Recent research in this area has been primarily oriented towards reducing subcircuit sampling overhead. Unfortunately, these works neglect hardware information during circuit cutting, thus posing significant challenges to the follow on stages. In fact, direct compilation and execution of these partitioned subcircuits yields low-fidelity results, highlighting the need for a more holistic optimization strategy. In this work, we propose a hardware-aware framework aiming to advance the practicability of circuit knitting. Drawing a contrast with prior methodologies, the presented framework designs a cutting scheme that concurrently optimizes the number of gate cuttings and SWAP insertions during circuit cutting. In particular, we leverage the graph similarity between qubits interactions and chip layout as a heuristic guide to reduces potential SWAPs in the subsequent step of qubit routing. Building upon this, the circuit knitting framework we developed has been evaluated on several quantum algorithms, leading to reduction of total subcircuits depth by up to 64% (48% on average) compared to the state-of-the-art approach, and enhancing the relative fidelity up to 2.7$\times$.
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) - Improving Quantum and Classical Decomposition Methods for Vehicle Routing [2.4646794072984477]
We propose an elaborate combination of two decomposition methods, namely graph shrinking and circuit cutting.
Our results offer insights into the performance of algorithms for optimization problems within the constraints of current quantum technology.
arXiv Detail & Related papers (2024-04-08T14:19:25Z) - Integrated Qubit Reuse and Circuit Cutting for Large Quantum Circuit
Evaluation [9.644229176158465]
The size of quantum circuits that can run with high fidelity is constrained by the limited quantity and quality of physical qubits.
We propose IQRC, an integrated approach that exploits qubit reuse and circuit cutting to run large circuits on small quantum computers.
arXiv Detail & Related papers (2023-12-16T02:49:28Z) - FragQC: An Efficient Quantum Error Reduction Technique using Quantum
Circuit Fragmentation [4.2754140179767415]
We present it FragQC, a software tool that cuts a quantum circuit into sub-circuits when its error probability exceeds a certain threshold.
We achieve an increase of fidelity by 14.83% compared to direct execution without cutting the circuit, and 8.45% over the state-of-the-art ILP-based method.
arXiv Detail & Related papers (2023-09-30T17:38:31Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices.
circuit cutting techniques enable the distribution of quantum computations through classical communication.
Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots.
We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
arXiv Detail & Related papers (2023-06-21T08:03:34Z) - Doubly optimal parallel wire cutting without ancilla qubits [0.4394730767364254]
A restriction in the quality and quantity of available qubits presents a substantial obstacle to the application of near-term and early fault-tolerant quantum computers.
This paper studies the problem of decomposing the parallel $n$-qubit identity channel into a set of local operations and classical communication.
We give an optimal wire-cutting method comprised of channels based on mutually unbiased bases, that achieves minimal overheads in both the sampling overhead and the number of channels.
arXiv Detail & Related papers (2023-03-13T17:59:18Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - 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) - Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
We propose that quantum circuits can be modeled as queuing networks.
Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
arXiv Detail & Related papers (2021-06-26T10:55:52Z)
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.