Fast Equivalence-checking for Quantum Circuits

Details Fast Equivalence-checking for Quantum Circuits Fast Equivalence-checking for Quantum Circuits

2009-09-23

arxiv.org/abs/0909.4119v2

Quant. Inf. and Comp., vol. 9, no. 9,10 (2010), pp. 721-734

Physics

Quantum Physics

Minor change of some wording

Scientific paper

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 3-4 orders of magnitude.

Affiliated with

Also associated with

No associations

Rating

Fast Equivalence-checking for Quantum Circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Equivalence-checking for Quantum Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Equivalence-checking for Quantum Circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-181239