We study the specific role played by superposition and entangled states in a quantum computation, by elaborating an entangled spin model developed within the hidden measurement approach of quantum mechanics [1, 2, 3]. For the individual qubits we use a sphere model representation, which is a generalization of the Bloch sphere representation, such that also the collapse and noncollapse measurements are represented [4]. Using the Schmidt diagonal form [5], we show that an arbitrary tensor product state representing two entangled qubits can be described in a complete way by a specific internal constraint between the ray or density states of the two qubits, which describes the behavior of the state of one of the spins if measurements are executed on the other spin. Since any n-qubit unitary operation can be decomposed in two-qubit gates and unary operations [6], ‘understanding’ two qubit entanglement contributes to understanding the role of n-qubit entanglement in quantum computation. We illustrate our approach on Deutsch’s quantum algorithm for two qubits which determines in a single run whether a two-valued function on a domain containing two points is balanced or constant [7]. One of the advantages of the two qubit case besides its relative simplicity is that it allows for a nice geometrical representation of entanglement [8], resulting in a more intuitive grasp of what’s going on in a two-qubit quantum computation.
We study the specific role played by superposition and entangled states in a quantum computation, by elaborating an entangled spin model developed within the hidden measurement approach of quantum mechanics [1, 2, 3]. For the individual qubits we use a sphere model representation, which is a generalization of the Bloch sphere representation, such that also the collapse and noncollapse measurements are represented [4]. Using the Schmidt diagonal form [5], we show that an arbitrary tensor product state representing two entangled qubits can be described in a complete way by a specific internal constraint between the ray or density states of the two qubits, which describes the behavior of the state of one of the spins if measurements are executed on the other spin. Since any n-qubit unitary operation can be decomposed in two-qubit gates and unary operations [6], ‘understanding’ two qubit entanglement contributes to understanding the role of n-qubit entanglement in quantum computation. We illustrate our approach on Deutsch’s quantum algorithm for two qubits which determines in a single run whether a two-valued function on a domain containing two points is balanced or constant [7]. One of the advantages of the two qubit case besides its relative simplicity is that it allows for a nice geometrical representation of entanglement [8], resulting in a more intuitive grasp of what’s going on in a two-qubit quantum computation.
We present examples of macroscopic systems entailing a quantum mechanical structure. One of our examples has a structure which is isomorphic to the spin structure for a spin 1/2 and another system entails a structure isomorphic to the structure of two spin 1/2 in the entangled singlet state. We elaborate this system by showing that an arbitrary tensor product state representing two entangled qubits can be described in a complete way by a specific internal constraint between the ray or density states of the two qubits, which describes the behavior of the state of one of the spins if measurements are executed on the other spin. Since any n-qubit unitary operation can be decomposed into 2-qubit gates and unary operations, we argue that our representation of 2-qubit entanglement contributes to a better understanding of the role of n-qubit entanglement in quantum computation. We illustrate our approach on two 2-qubit algorithms proposed by Deutsch, respectively Arvind et al. One of the advantages of the 2-qubit case besides its relative simplicity is that it allows for a nice geometrical representation of entanglement, which contributes to a more intuitive grasp of what is going on in a 2-qubit quantum computation.
We present examples of macroscopic systems entailing a quantum mechanical structure. One of our examples has a structure which is isomorphic to the spin structure for a spin 1/2 and another system entails a structure isomorphic to the structure of two spin 1/2 in the entangled singlet state. We elaborate this system by showing that an arbitrary tensor product state representing two entangled qubits can be described in a complete way by a specific internal constraint between the ray or density states of the two qubits, which describes the behavior of the state of one of the spins if measurements are executed on the other spin. Since any n‐qubit unitary operation can be decomposed into 2‐qubit gates and unary operations, we argue that our representation of 2‐qubit entanglement contributes to a better understanding of the role of n‐qubit entanglement in quantum computation. We illustrate our approach on two 2‐qubit algorithms proposed by Deutsch, respectively Arvind et al.
Abstract The visualization of qubit states plays a fundamental role in understanding quantum information processing. This study explores the use of the Bloch sphere as a geometrical tool for representing and interpreting single-qubit and two-qubit states. Using the Qiskit framework, we simulate quantum circuits to demonstrate the action of quantum gates and the generation of entangled states, such as Bell states. The effects of various gate operations on qubit orientation are analyzed in the Bloch sphere representation. Furthermore, we examine the matrix formalism of quantum states and provide a statistical analysis of measurement outcomes. This work bridges the gap between theoretical quantum mechanics and experimental simulation, offering insights for both educational and research purposes in quantum computing.
Quantum computing represents a fundamentally new paradigm in information processing, in which information is encoded and manipulated using two-level quantum systems known as qubits, whose evolution is governed by the principles of quantum mechanics. This chapter presents a structured introduction to the theoretical foundations of quantum computation, beginning with the limitations of classical computation and the physical constraints that motivate the need for a quantum model of computation. We develop the mathematical framework required to describe quantum information, introducing qubits as state vectors in Hilbert space and examining the roles of superposition, measurement, and unitary evolution. Single-qubit operations are presented through the Pauli and Hadamard gates, along with their geometric interpretation on the Bloch sphere. Building on this formalism, the discussion is extended to multi-qubit systems using tensor products, and quantum entanglement is introduced as a non-classical correlation fundamental to quantum information processing. The chapter then explores quantum algorithms, focusing on Grover’s unstructured search algorithm, to demonstrate how superposition, interference, and entanglement can be harnessed to achieve computational advantages over classical approaches. Finally, the chapter discusses applications of quantum computation, including quantum simulation, cryptography, search and optimization problems, and near-term hybrid quantum algorithms such as the Variational Quantum Eigensolver (VQE)and the Quantum Approximate Optimization (QAO) Algorithm, highlighting their relevance in the noisy intermediate-scale quantum (NISQ) era.
An extended Bloch representation of quantum mechanics was recently derived to offer a possible (hidden-measurements) solution to the measurement problem. In this article we use this representation to investigate the geometry of superposition and entangled states, explaining interference effects and entanglement correlations in terms of the different orientations a state-vector can take within the generalized Bloch sphere. We also introduce a tensorial determination of the generators of SU(N), which we show to be particularly suitable for the description of multipartite systems, from the viewpoint of the sub-entities. We then use it to show that non-product states admit a general description where sub-entities can remain in well-defined states, even when entangled. This means that the completed version of quantum mechanics provided by the extended Bloch representation, where density operators are also considered to be representative of genuine states (providing a complete description), not only offers a plausible solution to the measurement problem but also to the lesser-known entanglement problem. This is because we no longer need to give up the general physical principle saying that a composite entity exists and therefore is in a well-defined state, if and only if its components also exist and therefore are also in well-defined states.
This presentation provides a comprehensive overview of the foundational principles of quantum computation. It begins by contrasting classical and quantum information, highlighting how quantum bits (qubits) leverage superposition, entanglement, and interference to process information in ways that surpass classical limits. The document explains the four postulates of quantum mechanics: state space (qubits as unit vectors in a Hilbert space), time evolution (via unitary operators), measurement (probabilistic collapse of the state), and composite systems (tensor products of subsystems). Key concepts such as the Bloch sphere representation, quantum gates (e.g., Hadamard, CNOT, Pauli gates), and quantum circuits are discussed, illustrating how quantum operations manipulate qubit states. The presentation also covers quantum evolution, the gate model for computation, and the universality of certain gate sets, emphasizing the potential for quantum parallelism and the transformative impact of quantum computing on fields like cryptography and optimization.