Conventional quantum computing entails a geometry based on the description of an n-qubit state using 2^{n} infinite precision complex numbers denoting a vector in a Hilbert space. Such numbers are in general uncomputable using any real-world resources, and, if we have the idea of physical law as some kind of computational algorithm of the universe, we would be compelled to alter our descriptions of physics to be consistent with computable numbers. Our purpose here is to examine the geometric implications of using finite fields Fp and finite complexified fields Fp^2 (based on primes p congruent to 3 mod{4}) as the basis for computations in a theory of discrete quantum computing, which would therefore become a computable theory. Because the states of a discrete n-qubit system are in principle enumerable, we are able to determine the proportions of entangled and unentangled states. In particular, we extend the Hopf fibration that defines the irreducible state space of conventional continuous n-qubit theories (which is the complex projective space CP{2^{n}-1}) to an analogous discrete geometry in which the Hopf circle for any n is found to be a discrete set of p+1 points. The tally of unit-length n-qubit states is given, and reduced via the generalized Hopf fibration to DCP{2^{n}-1}, the discrete analog of the complex projective space, which has p^{2^{n}-1} (p-1)\prod_{k=1}^{n-1} (p^{2^{k}}+1) irreducible states. Using a measure of entanglement, the purity, we explore the entanglement features of discrete quantum states and find that the n-qubit states based on the complexified field Fp^2 have p^{n} (p-1)^{n} unentangled states (the product of the tally for a single qubit) with purity 1, and they have p^{n+1}(p-1)(p+1)^{n-1} maximally entangled states with purity zero.
Conventional quantum computing entails a geometry based on the description of an n-qubit state using 2^{n} infinite precision complex numbers denoting a vector in a Hilbert space. Such numbers are in general uncomputable using any real-world resources, and, if we have the idea of physical law as some kind of computational algorithm of the universe, we would be compelled to alter our descriptions of physics to be consistent with computable numbers. Our purpose here is to examine the geometric implications of using finite fields Fp and finite complexified fields Fp^2 (based on primes p congruent to 3 mod{4}) as the basis for computations in a theory of discrete quantum computing, which would therefore become a computable theory. Because the states of a discrete n-qubit system are in principle enumerable, we are able to determine the proportions of entangled and unentangled states. In particular, we extend the Hopf fibration that defines the irreducible state space of conventional continuous n-qubit theories (which is the complex projective space CP{2^{n}-1}) to an analogous discrete geometry in which the Hopf circle for any n is found to be a discrete set of p+1 points. The tally of unit-length n-qubit states is given, and reduced via the generalized Hopf fibration to DCP{2^{n}-1}, the discrete analog of the complex projective space, which has p^{2^{n}-1} (p-1)\prod_{k=1}^{n-1} (p^{2^{k}}+1) irreducible states. Using a measure of entanglement, the purity, we explore the entanglement features of discrete quantum states and find that the n-qubit states based on the complexified field Fp^2 have p^{n} (p-1)^{n} unentangled states (the product of the tally for a single qubit) with purity 1, and they have p^{n+1}(p-1)(p+1)^{n-1} maximally entangled states with purity zero.
Complex Hopf fibration and quaternionic Hopf fibration provide distinct ways of describing the state space for two-qubit quantum states. In this research, we have studied the geometry of quantum states for a two-level quantum system, along with the correspondence between complex Hopf bundle and quaternionic Hopf bundle. In the first part of our study, we investigate the behaviour of local coordinates for both Hopf bundles under different degree of entanglement such as entangled states and non-entangled states. Fubini-Study metric for complex projective space is also obtained. Its form suggests that for the intermediate entangled states, complex projective space CP3 can be described as a set of flat three-tori parametrized by a three-sphere. The local inhomogeneous coordinate of CP3 (base space of complex Hopf fibration) is found to carry the description of both subsystems A and B, whereas in the case of maximally entangled state, basis elements of local coordinates CP3 is not linearly independent of each other. Next, we construct a base space map between CP3 and S4, which is denoted as η map. After the mapping, we obtained phases in the base space manifold, different sections and coordinate charts are related by transition functions. We found that there is an inherent symmetry of coordinate transformation corresponds to different sections of CP3, which is expressed in terms of transition functions having the U(1) group structure. Also under η map, phases and transition function in S4 is doubled over that of CP3, indicating subtle symmetric changes after the mapping. The base space coordinates of quaternionic Hopf bundle are consist of two parts, whereby the first part is invariant to the coordinate transformation in CP3 but sensitive to the coordinate transformation in S4.
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal with entanglement. The paper by R. Mosseri and P. Ribeiro presents a detailed description of the two- and three-qubit geometry in Hilbert space, dealing with the geometry of fibrations and discrete geometry. The paper by J.-G.Luque et al. is more algebraic and considers invariants of pure k-qubit states and their application to entanglement measurement.
We develop a comparative synthesis of quantum-information geometry beyond complex numbers, with emphasis on what different algebraic frameworks contribute to information-processing structure rather than on their formal novelty alone. The organizing idea is a layer-by-layer test of the standard complex Hilbert-space formalism: each non-complex or deformed framework modifies the scalar field, phase group, projective state space, Born-probability semantics, composition rule, measurement geometry, symmetry algebra or representation category. The central thesis is that such frameworks are physically meaningful when they identify which assumptions make complex quantum mechanics operationally stable: positive probabilities, associative multipartite composition, reversible dynamics, experimentally testable phases, locality constraints, informationally complete measurements, error bases and clear operational semantics. Real quantum theory probes the necessity of complex phases and local tomography; quaternionic quantum mechanics probes non-Abelian phase while retaining associativity and admitting complex embeddings; octonionic proposals probe the boundary where exceptional geometry survives but generic circuit composition is obstructed by non-associativity; Jordan algebras test ordered probabilistic state spaces; Clifford algebras and Bott periodicity provide the spinorial and topological grammar connecting gates, Hopf maps and periodic dimensions; and quantum-group or q-deformed constructions probe coproducts, braiding and representation categories rather than scalar amplitudes. We distinguish three roles that are often conflated: genuine hypercomplex kinematics, Hopf-fibration coordinates for ordinary complex multipartite entanglement, and deformed algebraic or categorical structures. The resulting map separates established equivalence and experimental-constraint results from useful representation tools and speculative programs, while identifying concrete open problems for non-complex quantum information.
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.
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.