A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting

Abstract

Circuit knitting emerges as a promising technique to overcome the limitation of the few physical qubits in near-term quantum hardware by cutting large quantum circuits into smaller subcircuits. Recent research in this area has been primarily oriented towards reducing subcircuit sampling overhead. Unfortunately, these works neglect hardware information during circuit cutting, thus posing significant challenges to the follow on stages. In fact, direct compilation and execution of these partitioned subcircuits yields low-fidelity results, highlighting the need for a more holistic optimization strategy. In this work, we propose a hardware-aware framework aiming to advance the practicability of circuit knitting. Drawing a contrast with prior methodologies, the presented framework designs a cutting scheme that concurrently optimizes the number of gate cuttings and SWAP insertions during circuit cutting. In particular, we leverage the graph similarity between qubits interactions and chip layout as a heuristic guide to reduces potential SWAPs in the subsequent step of qubit routing. Building upon this, the circuit knitting framework we developed has been evaluated on several quantum algorithms, leading to reduction of total subcircuits depth by up to 64% (48% on average) compared to the state-of-the-art approach, and enhancing the relative fidelity up to 2.7$\times$.

arXiv commentAccepted to the 2024 IEEE/ACM International Conference on Computer-Aided Design (ICCAD '24)

References in corpus (14)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum optimization using variational algorithms on near-term quantum devices
• Trading classical and quantum computational resources
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Approximate Quantum Fourier Transform and Decoherence
• Doubling the size of quantum simulators by entanglement forging
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Optimality Study of Existing Quantum Computing Layout Synthesis Tools
• Constructing a virtual two-qubit gate by sampling single-qubit operations
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures
• JigSaw: Boosting Fidelity of NISQ Programs via Measurement Subsetting
• Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques
• Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation

Cited by in corpus (2)

• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• Circuit Folding: Scalable and Graph-Based Circuit Cutting via Modular Structure Exploitation