Equivalence checking of quantum circuits via intermediary matrix product operator

Abstract

As quantum computing advances, the complexity of quantum circuits is rapidly increasing, driving the need for robust methods to aid in their design. Equivalence checking plays a vital role in identifying errors that may arise during compilation and optimization of these circuits and is a critical step in quantum circuit verification. In this work, we introduce a novel method based on Matrix Product Operators (MPOs) for determining the equivalence of quantum circuits. Our approach contracts tensorized quantum gates from two circuits into an intermediary MPO, exploiting their reversibility to determine their equivalence or non-equivalence. Our results show that this method offers significant scalability improvements over existing methods, with polynomial scaling in circuit width and depth for the practical use cases we explore. We expect that this work sets the new standard for scalable equivalence checking of quantum circuits and will become a crucial tool for the validation of increasingly complex quantum systems.

14 pages, 7 figures

References in corpus (22)

• Array Programming with NumPy
• The density-matrix renormalization group in the age of matrix product states
• Efficient classical simulation of slightly entangled quantum computations
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Time-evolution methods for matrix-product states
• On the Entangling Power of Quantum Evolutions
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Matrix product operator representations
• Tangent-space methods for uniform matrix product states
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Hyper-optimized tensor network contraction
• Lecture Notes of Tensor Network Contractions
• Reducing T-count with the ZX-calculus
• Generic Construction of Efficient Matrix Product Operators
• The ZX-calculus is complete for stabilizer quantum mechanics
• Bugs in Quantum Computing Platforms: An Empirical Study
• The ZX-calculus is incomplete for quantum mechanics
• Equivalence Checking of Quantum Circuits with the ZX-Calculus
• Local Matrix Product Operators: Canonical Form, Compression, & Control Theory
• Light cone tensor network and time evolution
• Information flow in parameterized quantum circuits