Quantum Circuit Cutting with Maximum Likelihood Tomography
- URL: http://arxiv.org/abs/2005.12702v4
- Date: Tue, 16 Mar 2021 20:54:50 GMT
- Title: Quantum Circuit Cutting with Maximum Likelihood Tomography
- Authors: Michael A. Perlin, Zain H. Saleem, Martin Suchara, James C. Osborn
- Abstract summary: We introduce maximum likelihood fragment tomography (MLFT) as an improved circuit cutting technique for running clustered quantum circuits on quantum devices.
In addition to minimizing the classical computing overhead of circuit cutting methods, MLFT finds the most likely probability distribution for the output of a quantum circuit.
- Score: 0.22940141855172036
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce maximum likelihood fragment tomography (MLFT) as an improved
circuit cutting technique for running clustered quantum circuits on quantum
devices with a limited number of qubits. In addition to minimizing the
classical computing overhead of circuit cutting methods, MLFT finds the most
likely probability distribution for the output of a quantum circuit, given the
measurement data obtained from the circuit's fragments. We demonstrate the
benefits of MLFT for accurately estimating the output of a fragmented quantum
circuit with numerical experiments on random unitary circuits. Finally, we show
that circuit cutting can estimate the output of a clustered circuit with higher
fidelity than full circuit execution, thereby motivating the use of circuit
cutting as a standard tool for running clustered circuits on quantum hardware.
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) - Reducing Mid-Circuit Measurements via Probabilistic Circuits [0.13108652488669736]
Mid-circuit measurements and measurement-controlled gates are supported by an increasing number of quantum hardware platforms.
This work presents a static circuit optimization that can substitute some of these measurements with an equivalent circuit with randomized gate applications.
arXiv Detail & Related papers (2024-05-22T15:33:19Z) - 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) - 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) - Rotation-inspired circuit cut optimization [7.562843347215286]
Recent works have demonstrated that large quantum circuits can be cut and decomposed into smaller clusters of quantum circuits.
We propose Rotation-Inspired Circuit Cut Optimization (RICCO), an alternative method which reduces the post-processing overhead of circuit cutting.
We demonstrate practical application of RICCO to VQE by classically simulating a small instance of VQE and comparing it to one of the existing circuit-cutting methods.
arXiv Detail & Related papers (2022-11-14T13:57:22Z) - 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) - Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP.
The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth.
We present empiric evidence for the feasibility of learning the layout method using approximation.
arXiv Detail & Related papers (2020-07-29T05:26:19Z) - 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.