Pure states of two-qubit quantum systems are described by a four-dimensional vector of complex numbers, and unitary operators transferring a two-qubit quantum system from one state to another have the form of a 4 × 4 matrix with complex elements. This fact brings to mind the idea of studying the spaces of four-dimensional numbers with complex components. Moreover, the results obtained by the authors for four-dimensional numbers with real components inspire some optimism. In this paper we construct four-dimensional spaces of complex numbers by analogy with four-dimensional spaces of real numbers. Each four-dimensional number is mapped to a matrix formed from its components and it is proved that the constructed mapping is a bijection and a homomorphism. In the space of fourdimensional numbers, of the eight basis elements, half are real and half are imaginary. The presence of such symmetry distinguish these spaces from the space of quaternions, in which one basis element is real and the rest are imaginary. The symmetry of the basis numbers makes these spaces a natural generalization of one-dimensional and two-dimensional (complex) algebra. The conditions under which the corresponding matrices are gates for two-qubit quantum systems are defined. The notion of unitary state of a two-qubit quantum system is introduced, to which various gates from commutative groups of gates correspond. It is shown that any gate of a unitary state transforms a unitary state into a unitary state and a non-unitary state into a non-unitary state. Almost all gates used in the construction of quantum circuits, in particular H, SWAP, CX, CY, CZ, have the same properties. The problem of searching for a gate that transfers a quantum system from one unitary state to another unitary state has been solved. Thus, with the help of fourdimensional spaces of complex numbers it was possible to construct whole classes of two-qubit gates, which opens new possibilities for the construction of quantum algorithms. The results obtained have important theoretical and practical implications for quantum computing.
Pure states of two-qubit quantum systems are described by a four-dimensional vector of complex numbers, and unitary operators transferring a two-qubit quantum system from one state to another have the form of a 4 × 4 matrix with complex elements. This fact brings to mind the idea of studying the spaces of four-dimensional numbers with complex components. Moreover, the results obtained by the authors for four-dimensional numbers with real components inspire some optimism. In this paper we construct four-dimensional spaces of complex numbers by analogy with four-dimensional spaces of real numbers. Each four-dimensional number is mapped to a matrix formed from its components and it is proved that the constructed mapping is a bijection and a homomorphism. In the space of fourdimensional numbers, of the eight basis elements, half are real and half are imaginary. The presence of such symmetry distinguish these spaces from the space of quaternions, in which one basis element is real and the rest are imaginary. The symmetry of the basis numbers makes these spaces a natural generalization of one-dimensional and two-dimensional (complex) algebra. The conditions under which the corresponding matrices are gates for two-qubit quantum systems are defined. The notion of unitary state of a two-qubit quantum system is introduced, to which various gates from commutative groups of gates correspond. It is shown that any gate of a unitary state transforms a unitary state into a unitary state and a non-unitary state into a non-unitary state. Almost all gates used in the construction of quantum circuits, in particular H, SWAP, CX, CY, CZ, have the same properties. The problem of searching for a gate that transfers a quantum system from one unitary state to another unitary state has been solved. Thus, with the help of fourdimensional spaces of complex numbers it was possible to construct whole classes of two-qubit gates, which opens new possibilities for the construction of quantum algorithms. The results obtained have important theoretical and practical implications for quantum computing.
Pure states of three-qubit quantum systems are represented by eight-dimensional complex vectors, whereas their unitary transformations are described by 8×8 complex matrices. Motivated by this correspondence, we extend our algebraic model for two-qubit systems to eight-dimensional spaces endowed with commutative and associative multiplication. To each eight-dimensional number we assign a matrix and prove that the resulting correspondence is a homomorphic bijection. We derive conditions under which the associated matrix is unitary and hence represents a three-qubit quantum gate. This leads to a specific algebraic notion of a unitary state: a normalized state whose multiplication matrix is unitary. We construct 16,384 basis spaces; within each fixed space, multiplication generates a commuting family of quantum gates. For any two unitary states in the class considered, we give an explicit transition-gate construction within one of these algebraic families. For real components, the unitary states in a representative basis space form a union of thirty-two four-dimensional manifolds in R8. The construction therefore yields new structured classes of three-qubit unitary operators and invariant state sets, while its extension to larger multiqubit systems remains open.
This work is devoted to the construction and study of commutative gates for a two-qubit quantum system. Using four-dimensional algebra developed by the Kazakh mathematician Abenov M.M. all groups of commutative gates have been constructed, and among all states of a two-qubit quantum system, unitary states with which a specific gate is connected have been identified. An explicit type of gate is described that transfers a quantum system from one unitary state to another unitary state. The proposed approach opens up new possibilities for the design of quantum algorithms not only for two-qubit quantum systems, but also for n-qubit quantum systems.
As physical systems, qubits must evolve from input to output state. We describe a simple scheme in which the effect of a quantum gate is described by the action of an effective Hamiltonian acting for some characteristic time. This model shows that the action of common unary gates is to induce Bloch sphere trajectories along lines of latitude relative to an eigenvector of the gate. Such trajectories would immediately move a `rebit', initially confined to a line of latitude, off this line and acquire a complex phase. The role of the complex phase in bringing about the entanglement of two qubits is also highlighted. It is then asked whether such dynamics could be modelled using real QM. It is shown that the continuous evolution required for such dynamics can only be provided by members of the special orthogonal group of the vector space. Since the matrices representing many quantum gates of interest have determinant -1, no real special orthogonal operators can model their evolution if the dimension of the real vector space is the same as that of the complex space. Next we look at the mapping from a complex vector space of dimension N to a real space of dimension 2N that is often used to construct `real' QM. It is shown that this is just an isomorphic mapping from the scalar representation of complex numbers to their 2×2 matrix equivalents, so that the resulting matrices are actually represent complex matrices. Finally, we investigate the endomorphism of real vector spaces of dimension N=2n, where n∈Z+, suitable for the modelling of n−1 qubits. We confirm that the mapping from C2n−1→R2n only maps elements of End(C2n−1) to a restricted subspace of End(R2n) that reproduces the `real' representation of complex matrices.
In principle, the lattice of elementary propositions of a generic quantum system admits a representation in real, complex or quaternionic Hilbert spaces as established by Solèr’s theorem (1995) closing a long standing problem that can be traced back to von Neumann’s mathematical formulation of quantum mechanics. However up to now there are no examples of quantum systems described in Hilbert spaces whose scalar field is different from the set of complex numbers. We show that elementary relativistic systems cannot be described by irreducible strongly-continuous unitary representations of SL(2, C) on real or quaternionic Hilbert spaces as a consequence of some peculiarity of the generators related with the theory of polar decomposition of operators. Indeed such a ”naive” attempt leads necessarily to an equivalent formulation on a complex Hilbert space. Although this conclusion seems to give a definitive answer to the real/quaternionic-quantum-mechanics issue, it lacks consistency since it does not derive from more general physical hypotheses as the complex one does. Trying a more solid approach, in both situations we end up with three possibilities: an equivalent description in terms of a Wigner unitary representation in a real, complex or quaternionic Hilbert space. At this point the ”naive” result turns out to be a definitely important technical lemma, for it forbids the two extreme possibilities. \nIn conclusion, the real/quaternionic theory is actually complex. This improved approach is based upon the concept of von Neumann algebra of observables. Unfortunately, while \nthere exists a thorough literature about these algebras on real and complex Hilbert spaces, an analysis on the notion of von Neumann algebra over a quaternionic Hilbert space is \ncompletely absent to our knowledge. There are several issues in trying to define such a mathematical object, first of all the inability to construct linear combination of operators \nwith quaternionic coeffients. Restricting ourselves to unital real *-algebras of operators we are able to prove the von Neumann Double Commutant Theorem also on quaternionc \nHilbert spaces. Clearly, this property turns out to be crucial.
Quantum computation is, at bottom, a branch of applied algebra and functional analysis: the state of a quantum register is a unit vector in a finite-dimensional complex Hilbert space, computation is the action of the unitary group on that space, and the structure of the most important quantum algorithms is dictated by the representation theory of finite and continuous groups. This paper develops the mathematical scaffolding of the field from first principles and uses it to explain why quantum computers can outperform classical ones. We review complex inner-product spaces, self-adjoint and unitary operators, the spectral theorem, and the tensor-product construction that gives rise to entanglement and the exponential dimension of the state space. We then describe the qubit and its geometry, the group-theoretic classification of quantum gates (the special unitary groups, the Pauli and Clifford groups, and their Lie-algebraic generators), and the universality results that justify finite gate sets together with the Solovay–Kitaev theorem. With this apparatus we analyse the quantum Fourier transform, phase estimation, and the hidden subgroup problem, showing how Shor’s factoring algorithm, Grover’s search, and the quantum linear-systems algorithm arise as instances of a small number of algebraic templates. Finally we treat the stabilizer formalism of quantum error correction—where finite abelian groups over GF(2) play the central role—and the variational, near-term (NISQ) algorithms that dominate current practice. Throughout, the emphasis is on the algebraic invariants that make quantum speed-ups possible.
Quantum mechanics has proven its position as the primary theory for accurately describing microscopic domains. Numerous fields in physics utilize quantum mechanics to great effects, with one prominent application being quantum computing. Quantum computing extends the field of quantum mechanics to information theory, striving to perform computational tasks utilizing quantum phenomena with notably greater efficiency compared to classical alternatives. In this thesis, I will go through the basics required in the field of quantum computing. To understand quantum computing demands adapting a new type of matrix mechanical view. This involves considering Hilbert spaces, which are linear vector space having a well defined inner product. Hilbert spaces contain state vectors describing quantum states, as well as operators for altering and measuring these states. The dynamics of quantum systems are governed by three quantum postulates. These specify Hilbert spaces and state vectors as the fundamental components of quantum systems, Hermitian operators as providing the physical manifestation of these systems, and finally, the Schrödinger's equation to describe the time evolution of such systems. These notions are required in producing quantum computing. Quantum computing uses qubits as the computational basis, analogous to classical bits but with the added capability of quantum superposition. Qubits are represented as two-state vectors, and can be physically realized with any quantum-behaving binary-valued system, like the electron spins. Qubits can be combined into higher dimensional states with the use of tensor products, causing the system's Hilbert space to expand as 2^n with n being the number of qubits, allowing for exponential computational speedup. Computational logic can be constructed by acting on the qubits using unitary operators, known as quantum gates. The combinations of qubits and quantum gates can be visualized as quantum circuits, depicted using specialized circuit diagram notations. An essential part of quantum computing, and the phenomena enabling exponential computational speedup, is quantum entanglement. Entanglement arises in interacting qubits, intertwining them so that the individual states become correlated. Entanglement can be characterized by being unable to reduce a combined state into its pure constituents. The amount of entanglement in a system can be measured using von Neumann entropy, analogous to Shannon entropy in classical information theory. Entanglement serves various purposes in quantum computing and is a defining feature distinguishing it from the classical domain. In this thesis, the entanglement properties of a periodic four-qubit circuit with alternating quantum gates were simulated. The simulation was performed computationally, and measured entanglement entropy as a function of the amount of circuit periods. The results demonstrated different characteristics of entanglement depending on the parameters used for the quantum gates, with the entanglement either being periodic, non-occurring or chaotic in nature.