arXiv · 2611.12049
Parameterized equivalence checking of quantum circuit generators via weighted automata
Abstract
A generator builds a quantum circuit from the number of qubits and a bit string. We check a generator against a reference for all parameter values under six equivalence relations. For ladder programs, we prove that above a computable threshold the circuit matrices form a uniform matrix product operator, a weighted automaton of dimension independent of the number of qubits. Equivalence reduces to the zeroness of a difference automaton, checked modulo primes. The answer is a counterexample or "equal", exact or with a computed error bound. Experimentally, the method found errors missed by fixed-size checks and produced no incorrect verdicts.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Pavel Chuklanov. 2026-11-09. Parameterized equivalence checking of quantum circuit generators via weighted automata. https://searcharxiv.com/abs/2611.12049
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.