1 / 8

Symbolic Reduction of Quantum Circuits

Symbolic Reduction of Quantum Circuits. Motivation . In classical computation, it is desirable to find a “minimal” circuit to compute a given function In quantum computation this problem becomes essential, as longer circuits will necessarily be harder to insulate from decoherence.

owena
Download Presentation

Symbolic Reduction of Quantum Circuits

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Symbolic Reduction of Quantum Circuits

  2. Motivation • In classical computation, it is desirable to find a “minimal” circuit to compute a given function • In quantum computation this problem becomes essential, as longer circuits will necessarily be harder to insulate from decoherence.

  3. Background • Any quantum operator can be “simulated” using the controlled-not gate and (arbitrary) one qubit rotations. • An arbitrary one qubit rotation can be written as S(w)T(x)R(y)T(z), where R, S, T are elementary gate families parameterized by angle. • Furthermore, in a paper by Cybenko, an explicit decomposition of an arbitrary quantum operator into R, S, T and CNOT gates is given.

  4. Symbolic Reduction • The basic idea: take a circuit and a set of reduction rules – that is, transformations that preserve the operation performed by the circuit while decreasing the total number of gates – search the circuit for places to apply these. • Note that this is necessarily an iterative process; one reduction may allow another which was previously impossible.

  5. Some Reduction Rules • It happens that R(0), S(0), and T(0) are all the identity. These gates, if seen, may be removed. • If two NOT (or CNOT) gates occur “next to” each other, remove them both. • For X in {R,S,T}, if an X(a) is “next to” X(b), combine X(a) and X(b) into X(a + b).

  6. Obstacles to Reduction • For specific circuits, it is evident that the biggest obstacles to reduction are long chains of CNOT gates.

More Related