Pith. sign in

REVIEW 1 cited by

Equivalence checking of quantum circuits via intermediary matrix product operator

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.10946 v2 pith:HGWOR7BC submitted 2024-10-14 quant-ph cs.ET

classification quant-phcs.ET
keywords quantumcircuitsequivalencecheckingcircuitintermediarymatrixmethod
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Entangled Threats: A Unified Kill Chain Model for Quantum Machine Learning Security

    quant-ph 2025-07 conditional novelty 6.0 of 10

    The paper adapts kill chain methodology from classical IT security to quantum machine learning, organizing published QML attacks into a five-stage lifecycle with attacker roles, capabilities, and defenses.

Pith tools