Fast Equivalence-checking for Quantum Circuits Export

@article{citeulike:5838548, abstract = {We perform formal verification of quantum circuits by integrating several techniques specialized to particular classes of circuits. Our verification methodology is based on the new notion of a reversible miter that allows one to leverage existing techniques for circuit simplification of quantum circuits. For reversible circuits which arise as runtime bottlenecks of key quantum algorithms, we develop several verification techniques and empirically compare them. We also combine existing quantum verification tools with the use of SAT-solvers. Experiments with circuits for Shor's number-factoring algorithm, containing thousands of gates, show improvements in efficiency by four orders of magnitude.}, archivePrefix = {arXiv}, author = {Yamashita, Shigeru and Markov, Igor}, citeulike-article-id = {5838548}, citeulike-linkout-0 = {http://arxiv.org/abs/0909.4119}, citeulike-linkout-1 = {http://arxiv.org/pdf/0909.4119}, day = {23}, eprint = {0909.4119}, keywords = {algorithms, computation, quantum-computation}, month = {Sep}, posted-at = {2009-09-25 00:07:05}, priority = {2}, title = {Fast Equivalence-checking for Quantum Circuits}, url = {http://arxiv.org/abs/0909.4119}, year = {2009} }

TY - JOUR ID - citeulike:5838548 L3 - citeulike-article-id:5838548 N2 - We perform formal verification of quantum circuits by integrating several techniques specialized to particular classes of circuits. Our verification methodology is based on the new notion of a reversible miter that allows one to leverage existing techniques for circuit simplification of quantum circuits. For reversible circuits which arise as runtime bottlenecks of key quantum algorithms, we develop several verification techniques and empirically compare them. We also combine existing quantum verification tools with the use of SAT-solvers. Experiments with circuits for Shor's number-factoring algorithm, containing thousands of gates, show improvements in efficiency by four orders of magnitude. TI - Fast Equivalence-checking for Quantum Circuits KW - algorithms KW - computation KW - quantum-computation AU - Yamashita, Shigeru AU - Markov, Igor PY - 2009/Sep/23/ UR - http://arxiv.org/abs/0909.4119 ER -