FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation
arXiv:2310.00444 · doi:10.1016/j.jss.2024.112085
Abstract
Quantum computers must meet extremely stringent qualitative and quantitative requirements on their qubits in order to solve real-life problems. Quantum circuit fragmentation techniques divide a large quantum circuit into a number of sub-circuits that can be executed on the smaller noisy quantum hardware available. However, the process of quantum circuit fragmentation involves finding an ideal cut that has exponential time complexity, and also classical post-processing required to reconstruct the output. In this paper, we represent a quantum circuit using a weighted graph and propose a novel classical graph partitioning algorithm for selecting an efficient fragmentation that reduces the entanglement between the sub-circuits along with balancing the estimated error in each sub-circuit. We also demonstrate a comparative study over different classical and quantum approaches of graph partitioning for finding such a cut. We present {\it FragQC}, a software tool that cuts a quantum circuit into sub-circuits when its error probability exceeds a certain threshold. With this proposed approach, 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, for the benchmark circuits.
arXiv comment30 pages, 9 figures
References in corpus (26)
- Quantum Computing in the NISQ era and beyond
- Quantum Computation with Quantum Dots
- Charge insensitive qubit design derived from the Cooper pair box
- Surface codes: Towards practical large-scale quantum computation
- Quantum Computing in Molecular Magnets
- Ising formulations of many NP problems
- Quantum Error Correction for Quantum Memories
- Trapped-Ion Quantum Computing: Progress and Challenges
- Quantum Error Mitigation
- Roads towards fault-tolerant universal quantum computation
- Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
- Quantum Computation by Adiabatic Evolution
- Quantum Internet: Networking Challenges in Distributed Quantum Computing
- Simulating Large Quantum Circuits on a Small Quantum Computer
- MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
- Optimizing Quantum Error Correction Codes with Reinforcement Learning
- Compiler Design for Distributed Quantum Computing
- QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation
- Benchmarking near-term devices with quantum error correction
- Asymptotically Improved Circuit for -ary Grover's Algorithm with Advanced Decomposition of -qudit Toffoli Gate
- Optimizing Ansatz Design in QAOA for Max-cut
- Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler
- ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors
- -QER: An Intelligent Approach towards Quantum Error Reduction
- Error tracing in linear and concatenated quantum circuits
- Distributed Scheduling of Quantum Circuits with Noise and Time Optimization