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.
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.
Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be executed more robustly using fewer quantum resources. We introduce a divide-and-conquer circuit cutting method for estimating the expectation values of observables using classical shadows. We derive a general formula for making predictions using the classical shadows of circuit fragments from arbitrarily cut circuits and provide the sample complexity analysis for the case when observables factorize across fragments. Then, we numerically show that our divide-and-conquer method outperforms traditional uncut shadow tomography when estimating high-weight observables that act non-trivially on many qubits and discuss the mechanisms for this advantage.
Near-term hardware is constrained by high error rates, small qubit counts, and relatively low output fidelity, making the execution of large, high performance quantum circuits difficult. Circuit partitioning (or circuit cutting) has emerged as a promising approach to circumvent these limitations by decomposing circuits into smaller subcircuits at two-qubit interaction points. However, it remains unclear which classes of circuits benefit the most from partitioning and under what hardware conditions it is most effective. In this work, we evaluate the suitability of quantum circuits for partitioning from three perspectives: improving fidelity, enabling distributed execution, and scaling to larger circuit sizes. Specifically, we compare uncut circuit execution against two circuit partitioning approaches: Qiskit's automatic cut finding technique and a custom performance optimized circuit cutting method. We also measure these across GHZ, QFT, brickwork, and random quantum circuits ranging from 4 to 14 qubits, using mean absolute error of expectation values and overall output fidelity. Our results show that partitioning benefits larger, highly interconnected circuits, with our custom method reducing error by up to 55\% and improve fidelity for GHZ circuits, but degrading performance for brickwork circuits at larger scales.
We investigate an error mitigated tomographic approach to the quantum circuit cutting problem in the presence of gate and measurement noise. We explore two tomography specific error mitigation techniques; readout error mitigated conditional fragment tomography, which uses knowledge of readout errors on all cut and conditional qubit measurements in the tomography reconstruction procedure; and dominant eigenvalue truncation (DEVT), which aims to improve the performance of circuit cutting by performing truncation of the individual conditional tomography fragments used in the reconstruction. We find that the performance of both readout error mitigated tomography and DEVT tomography are comparable for circuit cutting in the presence of symmetric measurement errors. For gate errors our numerical results show that probability estimates for the original circuit obtained using DEVT outperforms general circuit cutting for measurement, depolarization and weakly biased Pauli noise models, but does not improve performance for amplitude damping and coherent errors, and can greatly decrease performance for highly biased Pauli noise. In cases where DEVT was effective, it as also found to improve performance of partial tomographic reconstruction using at least 50% of the full tomographic data with a conditional least-squares tomographic fitter, while linear inversion tomography with or without DEVT mitigation was found to perform poorly with with partial data.
Significant efforts are being spent on building a quantum computer. At the same time, developments in quantum software are rapidly progressing. Insufficient quantum resources often are the problem when running quantum algorithms. New techniques can aid in using smaller quantum computers to run larger quantum algorithms. One of these techniques is circuit cutting. With this method, a circuit is broken into multiple pieces, each of which is run on quantum hardware independently and then recombined to obtain the overall answer. These circuit cutting techniques require additional circuit evaluations, which can form a bottleneck for algorithms requiring many interactions. This work explores the potential of circuit cutting techniques precisely in this regime of many interactions. We consider two different models, a standard method based on expectation values, and a novel method based on probability distribution reconstruction. Next, we compare two different training methods we call train-then-cut and cut-then-train and show that in practice, cut-then-train still produces good results. This observation brings closer the practical applicability of circuit cutting techniques, as a train-then-cut strategy is often infeasible. We conclude by implementing a cut and uncut circuit and find that circuit cutting helps achieve higher fidelity results.
Circuit cutting allows quantum circuits larger than the available hardware to be executed. Cutting techniques split circuits into smaller subcircuits, run them on the hardware, and recombine results through classical post-processing. Circuit cutting techniques have been extensively researched over the last five years and it been adopted by major quantum hardware vendors as part of their scaling roadmaps. We examine whether current circuit cutting techniques are practical for orchestrating executions on fault-tolerant quantum computers. We conduct a resource estimation-based benchmarking of important quantum applications and different types of circuit cutting techniques. Our applications include practically relevant algorithms, such as Hamiltonian simulation, kernels such as quantum Fourier transform and more. To cut these applications, we use IBM's Qiskit cutting tool. We estimate resources for subcircuits using Microsoft's Azure Quantum Resource Estimator and develop models to determine the qubit, quantum and classical runtime needs of circuit cutting. We demonstrate that while circuit cutting works for small-scale systems, the exponential growth of the quantum runtime and the classical post-processing overhead as the qubit count increases renders it impractical for larger quantum systems with current implementation strategies. As we transition from noisy quantum hardware to fault-tolerance, our work provides important guidance for the design of quantum software and runtime systems.
Quantum computing is progressing at a rapid pace, though still constrained by the limitations of Noisy Intermediate-Scale Quantum (NISQ) devices, such as restricted qubit counts and high susceptibility to noise. To address these constraints, researchers have begun adapting classical software engineering principles to the quantum realm, giving rise to the field of Quantum Software Engineering. Within this context, techniques like circuit cutting and shot- wise distribution have emerged as promising approaches to divide quantum circuits into smaller fragments and to improve the scalability and reliability of quantum computations. In this paper, we present our Cut&Shoot pipeline, which supports the cutting of quantum circuits and the flexible distribution of their shots across multiple quantum processing units (QPUs), in a unified execution strategy. We compare different policies to determine the number of shots for which each fragment should be executed on each QPU. Through 107,000+ experiments on simulated NISQ devices, we assess how circuit size, shot allocation, and QPU availability affect execution times and error rates. Our findings indicate that combining circuit cutting and shot- wise distribution provides a useful trade-off of execution times and error rates, while featuring high-qubit quantum computations as well as increased resilience and adaptiveness.