Fast equivalence-checking for quantum circuits

MaRDI QIDQ3171609zbMATH OpenFDO

Authors S. Yamasita, Igor L. Markov

Publication date 5 October 2011

Full work available at URL https://arxiv.org/abs/0909.4119

zbMATH Keywords

quantum circuitequivalence-checkingcircuit simplificationreversible miters

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Towards large-scale functional verification of universal quantum circuits
• Model Checking for Verification of Quantum Circuits
• Property checking of quantum circuits using quantum multiple-valued decision diagrams
• Automated equivalence checking of concurrent quantum systems
• Equivalence checking of quantum finite-state machines

Cited in

(11)

• An automated deductive verification framework for circuit-building quantum programs
• Towards large-scale functional verification of universal quantum circuits
• scientific article; zbMATH DE number 2021815 (Why is no real title available?)
• Property checking of quantum circuits using quantum multiple-valued decision diagrams
• A modeling and verification framework for optical quantum circuits
• Advanced exact synthesis of Clifford+T circuits
• \textit{Re}\(\mathcal{Q}\)\textsc{wire}: reasoning about reversible quantum circuits
• \textsf{symQV}: automated symbolic verification of quantum programs
• Efficient Construction of Functional Representations for Quantum Algorithms
• Equivalence checking in multi-level quantum systems
• Verifying the Steane code with Quantomatic

This page was built for publication: Fast equivalence-checking for quantum circuits

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