Quantum circuit

Circuit that performs teleportation of a qubit.[1] This circuit consists of both quantum gates and measurements. Measurement is a quantum phenomenon that does not occur in classical circuits.

In quantum information theory, a quantum circuit is a model for quantum computation, similar to classical circuits, in which a computation is a sequence of quantum gates, measurements, initializations of qubits to known values, and possibly other actions. The minimum set of actions that a circuit needs to be able to perform on the qubits to enable quantum computation is known as DiVincenzo's criteria.

Circuits are written such that the horizontal axis is time, starting at the left hand side and ending at the right. Horizontal lines are qubits, doubled lines represent classical bits. The items that are connected by these lines are operations performed on the qubits, such as measurements or gates. These lines define the sequence of events, and are usually not physical cables.[2][3][4]

The graphical depiction of quantum circuit elements is described using a variant of the Penrose graphical notation.[citation needed] Richard Feynman used an early version of the quantum circuit notation in 1986.[5]

  1. ^ Nielsen, Michael A.; Chuang, Isaac (2010). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. pp. 26–28. ISBN 978-1-10700-217-3. OCLC 43641333.
  2. ^ Colin P. Williams (2011). Explorations in Quantum Computing. Springer. pp. 123–200. ISBN 978-1-84628-887-6.
  3. ^ Nielsen, Michael A.; Chuang, Isaac (2010). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. pp. 171–215. ISBN 978-1-10700-217-3. OCLC 43641333.
  4. ^ Ömer, Bernhard (2000-01-20). Quantum Programming in QCL (PDF) (Thesis). Institute for Theoretical Physics, Vienna University of Technology. pp. 37–38. Retrieved 2021-10-12.
  5. ^ Feynman, Richard P. (1986). "Quantum mechanical computers". Foundations of Physics. 16 (6). Springer Science and Business Media LLC: 507–531. Bibcode:1986FoPh...16..507F. doi:10.1007/bf01886518. ISSN 0015-9018. S2CID 122076550.