Qutrit

Last updated

A qutrit (or quantum trit) is a unit of quantum information that is realized by a 3-level quantum system, that may be in a superposition of three mutually orthogonal quantum states. [1]

Contents

The qutrit is analogous to the classical radix-3 trit, just as the qubit, a quantum system described by a superposition of two orthogonal states, is analogous to the classical radix-2 bit.

There is ongoing work to develop quantum computers using qutrits and qudits with multiple states. [2]

Representation

A qutrit has three orthonormal basis states or vectors, often denoted , , and in Dirac or bra–ket notation. These are used to describe the qutrit as a superposition state vector in the form of a linear combination of the three orthonormal basis states:

,

where the coefficients are complex probability amplitudes, such that the sum of their squares is unity (normalization):

The qubit's orthonormal basis states span the two-dimensional complex Hilbert space , corresponding to spin-up and spin-down of a spin-1/2 particle. Qutrits require a Hilbert space of higher dimension, namely the three-dimensional spanned by the qutrit's basis , [3] which can be realized by a three-level quantum system.

An n-qutrit register can represent 3n different states simultaneously, i.e., a superposition state vector in 3n-dimensional complex Hilbert space. [4]

Qutrits have several peculiar features when used for storing quantum information. For example, they are more robust to decoherence under certain environmental interactions. [5] In reality, manipulating qutrits directly might be tricky, and one way to do that is by using an entanglement with a qubit. [6]

Qutrit quantum gates

The quantum logic gates operating on single qutrits are unitary matrices and gates that act on registers of qutrits are unitary matrices (the elements of the unitary groups U(3) and U(3n) respectively). [7]

The rotation operator gates [lower-alpha 1] for SU(3) are , where is the a'th Gell-Mann matrix, and is a real value (with period ). The Lie algebra of the matrix exponential is provided here. The same rotation operators are used for gluon interactions, where the three basis states are the three colors () of the strong interaction. [8] [9] [lower-alpha 2]

The global phase shift gate for the qutrit [lower-alpha 3] is where the phase factor is called the global phase.

This phase gate performs the mapping and together with the 8 rotation operators is capable of expressing any single-qutrit gate in U(3), as a series circuit of at most 9 gates.

See also

Notes

  1. This can be compared with the three rotation operator gates for qubits. We get eight linearly independent rotation operators by selecting appropriate . For example, we get the 1st rotation operator for SU(3) by setting and all others to zero.
  2. Note: Quarks and gluons have color charge interactions in SU(3), not U(3), meaning their color charge can not have global phase. If they could have global phase, it would mean that there would be a 9th gluon, but there is only 8. [10] Qutrits can however have global phase.
  3. Comparable with the global phase shift gate for qubits.
    The global phase shift gate can also be understood as the 0th rotation operator, by taking the 0th Gell-Mann matrix to be the identity matrix, and summing from 0 instead of 1: and The unitary group U(3) is a 9-dimensional real Lie group.

Related Research Articles

<span class="mw-page-title-main">Pauli matrices</span> Matrices important in quantum mechanics and the study of spin

In mathematical physics and mathematics, the Pauli matrices are a set of three 2 × 2 complex matrices which are Hermitian, involutory and unitary. Usually indicated by the Greek letter sigma, they are occasionally denoted by tau when used in connection with isospin symmetries.

<span class="mw-page-title-main">Qubit</span> Basic unit of quantum information

In quantum computing, a qubit or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically realized with a two-state device. A qubit is a two-state quantum-mechanical system, one of the simplest quantum systems displaying the peculiarity of quantum mechanics. Examples include the spin of the electron in which the two levels can be taken as spin up and spin down; or the polarization of a single photon in which the two states can be taken to be the vertical polarization and the horizontal polarization. In a classical system, a bit would have to be in one state or the other. However, quantum mechanics allows the qubit to be in a coherent superposition of both states simultaneously, a property that is fundamental to quantum mechanics and quantum computing.

The Gell-Mann matrices, developed by Murray Gell-Mann, are a set of eight linearly independent 3×3 traceless Hermitian matrices used in the study of the strong interaction in particle physics. They span the Lie algebra of the SU(3) group in the defining representation.

<span class="mw-page-title-main">Rabi cycle</span> Quantum mechanical phenomenon

In physics, the Rabi cycle is the cyclic behaviour of a two-level quantum system in the presence of an oscillatory driving field. A great variety of physical processes belonging to the areas of quantum computing, condensed matter, atomic and molecular physics, and nuclear and particle physics can be conveniently studied in terms of two-level quantum mechanical systems, and exhibit Rabi flopping when coupled to an optical driving field. The effect is important in quantum optics, magnetic resonance and quantum computing, and is named after Isidor Isaac Rabi.

<span class="mw-page-title-main">Quantum circuit</span> Model of quantum computing

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.

<span class="mw-page-title-main">Bloch sphere</span> Geometrical representation of the pure state space of a two-level quantum mechanical system

In quantum mechanics and computing, the Bloch sphere is a geometrical representation of the pure state space of a two-level quantum mechanical system (qubit), named after the physicist Felix Bloch.

In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate is a basic quantum circuit operating on a small number of qubits. They are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits.

<span class="mw-page-title-main">Controlled NOT gate</span> Quantum logic gate

In computer science, the controlled NOT gate, controlled-X gate, controlled-bit-flip gate, Feynman gate or controlled Pauli-X is a quantum logic gate that is an essential component in the construction of a gate-based quantum computer. It can be used to entangle and disentangle Bell states. Any quantum circuit can be simulated to an arbitrary degree of accuracy using a combination of CNOT gates and single qubit rotations. The gate is sometimes named after Richard Feynman who developed an early notation for quantum gate diagrams in 1986.

Photon polarization is the quantum mechanical description of the classical polarized sinusoidal plane electromagnetic wave. An individual photon can be described as having right or left circular polarization, or a superposition of the two. Equivalently, a photon can be described as having horizontal or vertical linear polarization, or a superposition of the two.

<span class="mw-page-title-main">One-way quantum computer</span> Method of quantum computing

The one-way or measurement-based quantum computer (MBQC) is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is "one-way" because the resource state is destroyed by the measurements.

Amplitude amplification is a technique in quantum computing which generalizes the idea behind Grover's search algorithm, and gives rise to a family of quantum algorithms. It was discovered by Gilles Brassard and Peter Høyer in 1997, and independently rediscovered by Lov Grover in 1998.

<span class="mw-page-title-main">Optical phase space</span> Phase space used in quantum optics

In quantum optics, an optical phase space is a phase space in which all quantum states of an optical system are described. Each point in the optical phase space corresponds to a unique state of an optical system. For any such system, a plot of the quadratures against each other, possibly as functions of time, is called a phase diagram. If the quadratures are functions of time then the optical phase diagram can show the evolution of a quantum optical system with time.

In quantum computing, the quantum phase estimation algorithm is a quantum algorithm to estimate the phase corresponding to an eigenvalue of a given unitary operator. Because the eigenvalues of a unitary operator always have unit modulus, they are characterized by their phase, and therefore the algorithm can be equivalently described as retrieving either the phase or the eigenvalue itself. The algorithm was initially introduced by Alexei Kitaev in 1995.

<span class="mw-page-title-main">Symmetry in quantum mechanics</span> Properties underlying modern physics

Symmetries in quantum mechanics describe features of spacetime and particles which are unchanged under some transformation, in the context of quantum mechanics, relativistic quantum mechanics and quantum field theory, and with applications in the mathematical formulation of the standard model and condensed matter physics. In general, symmetry in physics, invariance, and conservation laws, are fundamentally important constraints for formulating physical theories and models. In practice, they are powerful methods for solving problems and predicting what can happen. While conservation laws do not always give the answer to the problem directly, they form the correct constraints and the first steps to solving a multitude of problems.

Linear optical quantum computing or linear optics quantum computation (LOQC) is a paradigm of quantum computation, allowing universal quantum computation. LOQC uses photons as information carriers, mainly uses linear optical elements, or optical instruments to process quantum information, and uses photon detectors and quantum memories to detect and store quantum information.

The KLM scheme or KLM protocol is an implementation of linear optical quantum computing (LOQC), developed in 2000 by Emanuel Knill, Raymond Laflamme and Gerard J. Milburn. This protocol makes it possible to create universal quantum computers solely with linear optical tools. The KLM protocol uses linear optical elements, single-photon sources and photon detectors as resources to construct a quantum computation scheme involving only ancilla resources, quantum teleportations and error corrections.

Quantum counting algorithm is a quantum algorithm for efficiently counting the number of solutions for a given search problem. The algorithm is based on the quantum phase estimation algorithm and on Grover's search algorithm.

The quantum Cramér–Rao bound is the quantum analogue of the classical Cramér–Rao bound. It bounds the achievable precision in parameter estimation with a quantum system:

In the context of quantum computing, the quantum walk search is a quantum algorithm for finding a marked node in a graph.

References

  1. Nisbet-Jones, Peter B. R.; Dilley, Jerome; Holleczek, Annemarie; Barter, Oliver; Kuhn, Axel (2013). "Photonic qubits, qutrits and ququads accurately prepared and delivered on demand". New Journal of Physics. 15 (5): 053007. arXiv: 1203.5614 . Bibcode:2013NJPh...15e3007N. doi:10.1088/1367-2630/15/5/053007. ISSN   1367-2630. S2CID   110606655.
  2. "Qudits: The Real Future of Quantum Computing?". IEEE Spectrum. 28 June 2017. Retrieved 2021-05-24.
  3. Byrd, Mark (1998). "Differential geometry on SU(3) with applications to three state systems". Journal of Mathematical Physics. 39 (11): 6125–6136. arXiv: math-ph/9807032 . Bibcode:1998JMP....39.6125B. doi:10.1063/1.532618. ISSN   0022-2488. S2CID   17645992.
  4. Caves, Carlton M.; Milburn, Gerard J. (2000). "Qutrit entanglement". Optics Communications. 179 (1–6): 439–446. arXiv: quant-ph/9910001 . Bibcode:2000OptCo.179..439C. doi:10.1016/s0030-4018(99)00693-8. ISSN   0030-4018. S2CID   27185877.
  5. Melikidze, A.; Dobrovitski, V. V.; De Raedt, H. A.; Katsnelson, M. I.; Harmon, B. N. (2004). "Parity effects in spin decoherence". Physical Review B. 70 (1): 014435. arXiv: quant-ph/0212097 . Bibcode:2004PhRvB..70a4435M. doi:10.1103/PhysRevB.70.014435. S2CID   56567962.
  6. B. P. Lanyon,1 T. J. Weinhold, N. K. Langford, J. L. O'Brien, K. J. Resch, A. Gilchrist, and A. G. White, Manipulating Biphotonic Qutrits, Phys. Rev. Lett. 100, 060504 (2008) (link)
  7. Colin P. Williams (2011). Explorations in Quantum Computing. Springer. pp. 22–23. ISBN   978-1-84628-887-6.
  8. David J. Griffiths (2008). Introduction to Elementary Particles (2nd ed.). John Wiley & Sons. pp. 283–288, 366–369. ISBN   978-3-527-40601-2.
  9. Stefan Scherer; Matthias R. Schindler (31 May 2005). "A Chiral Perturbation Theory Primer". p. 1–2. arXiv: hep-ph/0505265 .
  10. Ethan Siegel (Nov 18, 2020). "Why Are There Only 8 Gluons?". Forbes .