Equivalence Checking of Quantum Circuits via Intermediary Matrix Product Operator
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 st...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
DOI: | 10.48550/arxiv.2410.10946 |