Verifying Fault-Tolerance of Quantum Error Correction Codes
Kean Chen, Yuhao Liu, Wang Fang, Jennifer Paykin, Xin-Chuan Wu, Albert Schmitz, Steve Zdancewic, Gushu Li
TL;DR
This paper introduces an automatic verification tool for quantum fault-tolerance, formalizing QECC properties using quantum symbolic execution to ensure reliable large-scale quantum computing.
Contribution
It presents a novel formalization and an automated verification method for quantum error correction codes' fault-tolerance properties.
Findings
The tool effectively verifies fault-tolerance across various QECCs.
Demonstrates scalability to complex quantum programs.
Validates fault-tolerance for a universal set of logical operations.
Abstract
Quantum computers have advanced rapidly in qubit count and gate fidelity. However, large-scale fault-tolerant quantum computing still relies on quantum error correction code (QECC) to suppress noise. Manually or experimentally verifying the fault-tolerance property of complex QECC implementation is impractical due to the vast error combinations. This paper formalizes the fault-tolerance of QECC implementations within the language of quantum programs. By incorporating the techniques of quantum symbolic execution, we provide an automatic verification tool for quantum fault-tolerance. We evaluate and demonstrate the effectiveness of our tool on a universal set of logical operations across different QECCs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Radiation Effects in Electronics · Cloud Computing and Resource Management