Quantum circuit cutting is an emerging field of quantum computing allowing quantum circuits requiring a relatively large number of qubits to be executed on a quantum computer which has a smaller number of qubits. Current works focus mainly on choosing the optimal position to cut circuits, in order to minimise classical reconstruction costs. They do not consider the detrimental effects of cutting circuits on the entanglement shared between the circuit qubits. This paper presents, so far as the authors are aware, the first works to globally reconstruct circuit cutting fragments by maximising the underlying fidelity between quantum states used within circuit computation. Consequently, the original entanglement present that was broken, is reformed. Gradient-based techniques are used to design an optimisation protocol for how to maximise the fidelity between highly multipartite-entangled states. Using adaptive gradient descent this work presents how unit fidelities can be achieved with a relatively small number of optimisation iterations.
Quantum circuit cutting is an emerging field of quantum computing allowing quantum circuits requiring a relatively large number of qubits to be executed on a quantum computer which has a smaller number of qubits. Current works focus mainly on choosing the optimal position to cut circuits, in order to minimise classical reconstruction costs. They do not consider the detrimental effects of cutting circuits on the entanglement shared between the circuit qubits. This paper presents, so far as the authors are aware, the first works to globally reconstruct circuit cutting fragments by maximising the underlying fidelity between quantum states used within circuit computation. Consequently, the original entanglement present that was broken, is reformed. Gradient-based techniques are used to design an optimisation protocol for how to maximise the fidelity between highly multipartite-entangled states. Using adaptive gradient descent this work presents how unit fidelities can be achieved with a relatively small number of optimisation iterations.
Quantum circuit cutting allows an arbitrary circuit to be executed on a quantum computer with fewer qubits by fragmenting it into subcircuits, each with fewer qubits. If such a method is to be employed, it is critical that the quantum properties of the original circuit, such as entanglement, are not violated. This paper demonstrates, using circuit cutting tools, how to select circuit bipartitions while prioritising the preservation of underlying entanglement between the qubits. We present two entanglement-based criteria. The former minimises losses of reduced-state pairwise qubit entanglement, and has polynomial complexity in the number of qubits. The latter minimises loss of multipartite entanglement across qubit bipartitions, with exponential complexity. Violations of entanglement with frequencies up to 72% are observed in current circuit cutting software. This paper describes how to prevent such violations, or to minimise qubit entanglement losses, fragmenting circuits with pairwise qubit negativity losses of only 5%, and for certain circuits 0% von Neumann entropy losses across qubit bipartitions.
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.
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. These techniques involve partitioning a quantum circuit into smaller subcircuits, each containing fewer qubits. The original circuit's outcome can be replicated by executing these subcircuits on separate devices and combining their results. However, the number of shots required to achieve a fixed result accuracy with circuit cutting grows exponentially with the number of cuts, posing significant costs. In contrast, quantum teleportation allows the distribution of quantum computations without an exponential increase in shots. Nevertheless, each teleportation procedure requires a pre-shared pair of maximally entangled qubits for transmitting a quantum state, and non-maximally entangled qubits cannot be used for this purpose. To address this, we propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs, effectively reducing the cost associated with circuit cutting. By considering the degree of entanglement in the pre-shared qubit pairs, our technique provides a continuum between existing circuit cutting methods and quantum teleportation, adjusting the cost of circuit cutting accordingly.
Circuit cutting is a novel technique in the field of quantum computing that offers a promising approach for breaking up large quantum circuits into smaller ones that can be executed on smaller quantum computers. Circuit cutting offers a scalable and hybrid computing approach, by combining classical and quantum computers to run large quantum circuits. At the same time, quantum circuits represent the fundamental building blocks of quantum algorithms, and obfuscation techniques are crucial for protecting the sensitive information and intellectual property encoded in these circuits. This paper constitutes the first security analysis of circuit cutting techniques as a means to protect quantum circuits, and not just for cutting bigger quantum circuits to fit on smaller devices. As cloud providers are in control of quantum computers and give access to users, utilizing cloud-based quantum computers for executing quantum circuits involves considerable security risks. This work demonstrates that quantum circuits can be effectively obfuscated by using quantum circuit cutting techniques. If users are worried about an adversary who attempts to reverse-engineer the original quantum algorithm, circuit cutting can be used as a security measure. To further provide configurable obfuscation level, i.e. number of possible circuits that the cloud provider would have to guess, this work proposes a novel dummy-subcircuits technique. This technique introduces dummy subcircuits with additional qubit cut points to create more confusion for the cloud provider and further help to obfuscate the user's original circuits with limited cost.
Recent works have demonstrated that large quantum circuits can be cut and decomposed into smaller clusters of quantum circuits with fewer qubits that can be executed independently on a small quantum computer. Classical post-processing then combines the results from each cluster to reconstruct the output of the original quantum circuit. However, the runtime for such hybrid quantum-classical algorithms is exponential in the number of cuts on a circuit. We propose Rotation-Inspired Circuit Cut Optimization (RICCO), an alternative method which reduces the post-processing overhead of circuit cutting, at the cost of having to solve an optimization problem. RICCO introduces unitary rotations at cut locations to rotate the quantum state such that expectation values with respect to one set of observables are maximized and others are set to zero. We demonstrate practical application of RICCO to VQE by classically simulating a small instance of VQE and comparing it to one of the existing circuitcutting methods.
Today's Quantum Computers (QCs) face significant engineering challenges that limit their size and fidelity. To execute realistic applications, researchers must develop ways to move past these constraints. CutQC enables small QCs to run larger quantum circuits by cutting circuits into smaller subcircuits and then utilizing classical resources and Kronecker products to reproduce the desired output. In this work, we enhance the reconstruction process. In particular, we develop a distributed PyTorch implementation of CutQC's classical post-processing step, which can run across multiple nodes on either GPU or CPU devices. Our results show that our PyTorch implementation executes circuits of up to 35 qubits on 10- and 15-qubit QCs with efficient reconstruction. We use single-node computation as a baseline and then compare the results to the runtimes of our PyTorch workflows. By utilizing parallelism and specified devices, the reconstruction step of hybrid quantum-classical circuit execution can be improved. The original CutQC paper demonstrated a 60X to 8600X runtime speedup over classical simulation, and our work increases this speedup. These results show that large quantum circuits can be run on smaller QCs by leveraging circuit cutting with data parallelism techniques to maintain a reasonable runtime. This allows researchers to maintain the high fidelity of smaller machines while executing larger circuits.