Fast equivalence-checking for quantum circuits

zbMATH Open1237.81059arXiv0909.4119MaRDI QIDQ3171609FDOQ3171609

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)

Cited In (5)

• Advanced exact synthesis of Clifford+T circuits
• Title not available (Why is that?)
• Efficient Construction of Functional Representations for Quantum Algorithms
• Title not available (Why is that?)
• A modeling and verification framework for optical quantum circuits

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)