Cutoff theorems for the equivalence of parameterized quantum circuits

DOI10.4230/LIPICS.MFCS.2025.85MaRDI QIDQ7310260zbMATH OpenFDO

Authors Neil J. Ross, Scott Wesley

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.85

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A probabilistic remark on algebraic program testing
• All for the price of few (parameterized verification through view abstraction)
• Canonical bases for cyclotomic fields
• Combinatorial Nullstellensatz
• Diagrammatic reasoning beyond Clifford+T quantum mechanics
• Exact synthesis of multiqubit Clifford-cyclotomic circuits
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• How to sum and exponentiate Hamiltonians in ZXW calculus
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• Integral bases for subfields of cyclotomic fields
• Linear Algebra Done Right
• On computable numbers, with an application to the Entscheidungsproblem.
• On Reasoning About Rings
• Parameterized compositional model checking
• Props in Network Theory
• Solving non-linear arithmetic
• Towards efficient parameterized synthesis

This page was built for publication: Cutoff theorems for the equivalence of parameterized quantum circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310260)