Integrated Qubit Reuse and Circuit Cutting for Large Quantum Circuit
Evaluation
- URL: http://arxiv.org/abs/2312.10298v1
- Date: Sat, 16 Dec 2023 02:49:28 GMT
- Title: Integrated Qubit Reuse and Circuit Cutting for Large Quantum Circuit
Evaluation
- Authors: Aditya Pawar, Yingheng Li, Zewei Mo, Yanan Guo, Youtao Zhang, Xulong
Tang, Jun Yang
- Abstract summary: 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.
- Score: 9.644229176158465
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum computing has recently emerged as a promising computing paradigm for
many application domains. However, the size of quantum circuits that can run
with high fidelity is constrained by the limited quantity and quality of
physical qubits. Recently proposed schemes, such as wire cutting and qubit
reuse, mitigate the problem but produce sub-optimal results as they address the
problem individually. In addition, gate cutting, an alternative circuit-cutting
strategy, has not been fully explored in the field.
In this paper, we propose IQRC, an integrated approach that exploits qubit
reuse and circuit cutting (including wire cutting and gate cutting) to run
large circuits on small quantum computers. Circuit-cutting techniques introduce
non-negligible post-processing overhead, which increases exponentially with the
number of cuts. IQRC exploits qubit reuse to find better cutting solutions to
minimize the cut numbers and thus the post-processing overhead. Our evaluation
results show that on average we reduce the number of cuts by 34\% and
additional reduction when considering gate cuts.
Related papers
- A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting [0.9968037829925942]
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.
arXiv Detail & Related papers (2024-09-05T19:18:30Z) - 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) - 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) - 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) - All this for one qubit? Bounds on local circuit cutting schemes [0.0]
We show that a locally-acting circuit cutting scheme can efficiently partition even a single qubit from the rest of a circuit.
We also show that any (local or otherwise) circuit cutting scheme cannot function by only applying unital channels.
arXiv Detail & Related papers (2023-03-23T16:44:38Z) - Approximate Quantum Circuit Cutting [4.3186101474291325]
Current and imminent quantum hardware lacks reliability and applicability due to noise and limited qubit counts.
Quantum circuit cutting -- a technique dividing large quantum circuits into smaller subcircuits with sizes appropriate for the limited quantum resource at hand -- is used to mitigate these problems.
This article introduces the notion of approximate circuit reconstruction.
arXiv Detail & Related papers (2022-12-02T16:04:52Z) - 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) - On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
We show that commonly held intuitions when designing quantum circuits can be misleading.
We show that reducing the T-count can increase the total depth.
We illustrate our method on addition and multiplication circuits using ripple-carry.
arXiv Detail & Related papers (2021-01-12T21:36:16Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
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.