Automatic Test Pattern Generation for Robust Quantum Circuit Testing
arXiv:2202.10697 · doi:10.1145/3689333
Abstract
Quantum circuit testing is essential for detecting potential faults in realistic quantum devices, while the testing process itself also suffers from the inexactness and unreliability of quantum operations. This paper alleviates the issue by proposing a novel framework of automatic test pattern generation (ATPG) for robust testing of logical quantum circuits. We introduce the stabilizer projector decomposition (SPD) for representing the quantum test pattern, and construct the test application (i.e., state preparation and measurement) using Clifford-only circuits, which are rather robust and efficient as evidenced in the fault-tolerant quantum computation. However, it is generally hard to generate SPDs due to the exponentially growing number of the stabilizer projectors. To circumvent this difficulty, we develop an SPD generation algorithm, as well as several acceleration techniques which can exploit both locality and sparsity in generating SPDs. The effectiveness of our algorithms are validated by 1) theoretical guarantees under reasonable conditions, 2) experimental results on commonly used benchmark circuits, such as Quantum Fourier Transform (QFT), Quantum Volume (QV) and Bernstein-Vazirani (BV) in IBM Qiskit.
36 pages, 8 figures, 4 tables
References in corpus (26)
- Quantum algorithm for solving linear systems of equations
- Surface codes: Towards practical large-scale quantum computation
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Improved Simulation of Stabilizer Circuits
- Integrated Photonic Quantum Technologies
- Robust randomized benchmarking of quantum processes
- Distance measures to compare real and ideal quantum processes
- Quantum optimization using variational algorithms on near-term quantum devices
- Scalable Noise Estimation with Random Unitary Operators
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- High threshold universal quantum computation on the surface code
- Efficient, Compact and Low Loss Thermo-Optic Phase Shifter in Silicon
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Methodology for quantum logic gate constructions
- Hudson's Theorem for finite-dimensional quantum systems
- Demonstration of fault-tolerant universal quantum gate operations
- Statistical distinguishability between unitary operations
- Efficient learning of quantum noise
- Estimating outcome probabilities of quantum circuits using quasiprobabilities
- Fault-Tolerant Logical Gates in the IBM Quantum Experience
- Identification and Distance Measures of Measurement Apparatus
- Unbiased Simulation of Near-Clifford Quantum Circuits
- Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
- Equivalence Checking of Sequential Quantum Circuits
- Clifford recompilation for faster classical simulation of quantum circuits