{{Short description|System comprising multiple qubits}} thumb | right | Qubit Registry In quantum computing, a '''quantum register''' is a system comprising multiple qubits.<ref>{{cite book |last1=Ekert |first1=Artur |last2=Hayden |first2=Patrick |last3=Inamori |first3=Hitoshi |date=2008 |title=Coherent atomic matter waves |chapter=Basic Concepts in Quantum Computation |series=Les Houches - Ecole d'Ete de Physique Theorique |volume=72 |pages=661–701 |doi=10.1007/3-540-45338-5_10 |arxiv=quant-ph/0011013|isbn=978-3-540-41047-8 |s2cid=53402188 }}</ref> It is the quantum analogue of the classical processor register. Quantum computers perform calculations by manipulating qubits within a quantum register.<ref>{{cite thesis |last=Ömer |first=Bernhard |date=2000-01-20 |title=Quantum Programming in QCL |url=http://tph.tuwien.ac.at/~oemer/doc/quprog.pdf |access-date=2021-05-24 |pages=52}}</ref>
== Definition == {{Further|Mathematical formulation of quantum mechanics#Description of the state of a system}} It is usually assumed that the register consists of qubits. It is also generally assumed that registers are not density matrices, but that they are pure, although the definition of "register" can be extended to density matrices.
An <math>n</math> size quantum register is a quantum system comprising <math>n</math> pure qubits.
The Hilbert space, <math>\mathcal{H}</math>, in which the data is stored in a quantum register is given by <math>\mathcal{H} = \mathcal{H_{n-1}}\otimes\mathcal{H_{n-2}}\otimes\ldots\otimes\mathcal{H_0}</math> where <math>\otimes</math> is the tensor product.<ref>{{cite book|last1=Major|first1=Günther W., V.N. Gheorghe, F.G.|title=Charged particle traps II : applications|date=2009|publisher=Springer|location=Berlin|isbn=978-3540922605|page=220}}</ref>
The number of dimensions of the Hilbert spaces depends on what kind of quantum systems the register is composed of. Qubits are 2-dimensional complex spaces (<math>\mathbb{C}^2</math>), while qutrits are 3-dimensional complex spaces (<math>\mathbb{C}^3</math>), etc. For a register composed of ''N'' number of ''d''-dimensional (or ''d''-level) quantum systems we have the Hilbert space <math>\mathcal{H}=(\mathbb{C}^d)^{\otimes N} = \underbrace{\mathbb{C}^d \otimes \mathbb{C}^d \otimes \dots \otimes \mathbb{C}^d }_{N\text{ times}} \cong \mathbb{C}^{d^N}.</math>
The registers quantum state vector <math>\psi</math> of this <math>d^N</math>-dimensional Hilbert space can in the bra-ket notation be written as a linear combination of some set of orthogonal basis vectors labeled <math>|0\rangle</math> to <math>|d^N-1\rangle,</math> as <math>|\psi\rangle = \sum_{k=0}^{d^N-1} a_k|k\rangle = a_0|0\rangle + a_1|1\rangle + \dots + a_{d^N-1}|d^N-1\rangle.</math> Such linear combinations are in quantum mechanics called superpositions and the values <math>a_k</math> are probability amplitudes. Because of the Born rule and the 2nd axiom of probability theory, <math>\sum_{k=0}^{d^N-1} |a_k|^2 = 1,</math> so the possible state space of the register is the surface of the unit sphere in <math>\mathbb{C}^{d^N}.</math>
'''Examples:''' * The quantum state vector of a 5-qubit register is a unit vector in <math>\mathbb{C}^{2^5}=\mathbb{C}^{32}.</math> * A register of four qutrits similarly is a unit vector in <math>\mathbb{C}^{3^4}=\mathbb{C}^{81}.</math>
== Quantum vs. classical register == There are both structural and functional differences between quantum and classical registers. Structurally, an <math>n</math> size classical register is an array of <math>n</math> flip flops, whereas an <math>n</math> size quantum register is a collection of <math>n</math> qubits. Functionally, an <math>n</math> size classical register stores a single value of the <math>2^n</math> possibilities spanned by <math>n</math> bits, whereas a quantum register is able to simultaneously store all <math>2^n</math> possibilities spanned by quantum pure qubits.
For example, consider a two-bit register. A classical register is able to store only one of the possible values represented by 2 bits - <math> 00, 01, 10, 11 \quad(0, 1, 2, 3)</math> accordingly.
If we consider two pure qubits in superpositions <math>|a_0\rangle=\frac{1}{\sqrt2}(|0\rangle + |1\rangle)</math> and <math>|a_1\rangle=\frac{1}{\sqrt2}(|0\rangle - |1\rangle)</math>, using the quantum register definition <math>|a\rangle=|a_{0}\rangle\otimes|a_{1}\rangle = \frac{1}{2}(|00\rangle - |01\rangle + |10\rangle - |11\rangle)</math> it follows that it is capable of storing all the possible values (by having non-zero probability amplitude for all outcomes) spanned by two qubits simultaneously.
== See also == * List of proposed quantum registers * Quantum circuit * Quantum logic gate * Qudit
== References == {{Reflist}}
==Further reading== * {{cite book |last1=Arora |first1=Sanjeev|author1-link=Sanjeev Arora (computer scientist) |last2=Barak |first2=Boaz|author2-link=Boaz Barak |title=Computational Complexity: A Modern Approach |date=2016 |publisher=Cambridge University Press |isbn=978-0-521-42426-4 |pages=201–236}}
{{DEFAULTSORT:Quantum Register}} Category:Quantum information science