Reqomp: Space-constrained Uncomputation for Quantum Circuits
- URL: http://arxiv.org/abs/2212.10395v2
- Date: Fri, 9 Feb 2024 16:16:25 GMT
- Title: Reqomp: Space-constrained Uncomputation for Quantum Circuits
- Authors: Anouk Paradis, Benjamin Bichsel, Martin Vechev
- Abstract summary: We present Reqomp, a method to automatically synthesize correct and efficient uncomputation of ancillae.
Our evaluation demonstrates that Reqomp can significantly reduce the number of required ancilla qubits by up to 96%.
- Score: 4.703757073704313
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum circuits must run on quantum computers with tight limits on qubit and
gate counts. To generate circuits respecting both limits, a promising
opportunity is exploiting uncomputation to trade qubits for gates. We present
Reqomp, a method to automatically synthesize correct and efficient
uncomputation of ancillae while respecting hardware constraints. For a given
circuit, Reqomp can offer a wide range of trade-offs between tightly
constraining qubit count or gate count. Our evaluation demonstrates that Reqomp
can significantly reduce the number of required ancilla qubits by up to 96%. On
80% of our benchmarks, the ancilla qubits required can be reduced by at least
25% while never incurring a gate count increase beyond 28%.
Related papers
- Realization of Conditional Operations through Transition Pathway Engineering [13.289258466005991]
We propose a transition composite gate (TCG) scheme grounded on state-selective transition path engineering.
To demonstrate the capability of circuit compression, we use TCG scheme to prepare 3-qubit Greenberger-Horne-Zeilinger (GHZ) and W states, with the fidelity of 96.77% and 95.72%.
The TCG scheme exhibits advantages in certain quantum circuits and shows significant potential for large-scale quantum algorithms.
arXiv Detail & Related papers (2024-07-09T09:01:04Z) - 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) - Quantum circuit synthesis via a random combinatorial search [0.0]
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets.
We show that the fraction of perfect-fidelity quantum circuits increases rapidly as soon as the circuit size exceeds the minimum circuit size required for achieving unit fidelity.
arXiv Detail & Related papers (2023-11-29T00:59:29Z) - Optimal Qubit Reuse for Near-Term Quantum Computers [0.18188255328029254]
Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse.
We introduce a formal model for qubit reuse optimization that delivers provably optimal solutions.
We show improvements in the number of qubits and swap gate insertions, estimated success probability, and Hellinger fidelity of the investigated quantum circuits.
arXiv Detail & Related papers (2023-07-31T23:15:45Z) - 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) - Optimization of Quantum Read-Only Memory Circuits [5.486046841722322]
In quantum machine learning applications, a quantum memory can simplify the data loading process and potentially accelerate the learning task.
Quantum Read Only Memory (QROM) scale exponentially with the number of address lines making them impractical in state-of-the-art Noisy Intermediate-Scale Quantum (NISQ) computers beyond 4-bit addresses.
We propose techniques such as, predecoding logic and qubit reset to reduce the depth and gate count of QROM circuits to target wider address ranges such as, 8-bits.
arXiv Detail & Related papers (2022-04-06T21:23:31Z) - Quantum thermodynamic methods to purify a qubit on a quantum processing
unit [68.8204255655161]
We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit equipped with identical qubits.
Our starting point is a three qubit design that emulates the well known two qubit swap engine.
We implement it on a publicly available superconducting qubit based QPU, and observe a purification capability down to 200 mK.
arXiv Detail & Related papers (2022-01-31T16:13:57Z) - Software mitigation of coherent two-qubit gate errors [55.878249096379804]
Two-qubit gates are important components of quantum computing.
But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications.
We present two software methods to mitigate parasitic two-qubit gate errors.
arXiv Detail & Related papers (2021-11-08T17:37:27Z) - Experimental implementation of non-Clifford interleaved randomized
benchmarking with a controlled-S gate [0.1759008116536278]
In some applications access to a non-Clifford two-qubit gate can result in more optimal circuit decompositions.
We demonstrate calibration of a low error non-Clifford Controlled-$fracpi2$ phase (CS) gate on a cloud based IBM Quantum computing.
arXiv Detail & Related papers (2020-07-16T18:00:02Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.