Abstract In quantum circuits, qubits and the quantum gates acting on them have traditionally been analysed using matrix algebra and Dirac notation. While powerful, these can be unintuitive for conceptual understanding and rapid problem solving. In this work, a new schematic representation method is developed that visualizes the effects of quantum gates on qubits without relying on complex mathematical operations. In the new notation, quantum bits (qubits) are represented using black (|0〉) and white (|1〉) circles. When a quantum gate is applied to a qubit, the circle representing the qubit is visually modified. For example, a Hadamard gate transforms a solid black or white circle into a half-black and half-white circle representing superposition. The work shows how this method simplifies the visualization of quantum algorithms, entanglement, and multi- qubit operations. The work proposes how this method can act as a visual aid to support the understanding of quantum algorithms, entanglement, and multi-qubit operations. Thus, the initial conceptual analysis of basic quantum circuits can be facilitated by simple schematic representations, reducing the immediate cognitive load of complex mathematical operations for beginners.
Abstract In quantum circuits, qubits and the quantum gates acting on them have traditionally been analysed using matrix algebra and Dirac notation. While powerful, these can be unintuitive for conceptual understanding and rapid problem solving. In this work, a new schematic representation method is developed that visualizes the effects of quantum gates on qubits without relying on complex mathematical operations. In the new notation, quantum bits (qubits) are represented using black (|0〉) and white (|1〉) circles. When a quantum gate is applied to a qubit, the circle representing the qubit is visually modified. For example, a Hadamard gate transforms a solid black or white circle into a half-black and half-white circle representing superposition. The work shows how this method simplifies the visualization of quantum algorithms, entanglement, and multi- qubit operations. The work proposes how this method can act as a visual aid to support the understanding of quantum algorithms, entanglement, and multi-qubit operations. Thus, the initial conceptual analysis of basic quantum circuits can be facilitated by simple schematic representations, reducing the immediate cognitive load of complex mathematical operations for beginners.
We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of quantum computations: elementary operations in single-qubit, two-qubit and three-qubit systems, immersions of gates on higher dimensional spaces, generation of single and multi-qubit states, procedures to synthesize unitary, controlled and diagonal matrices. To perform the analysis of quantum processes, we directly derive diagrams of states from physical implementations of quantum circuits associated to the processes. Complete diagrams are then rearranged into simplified diagrams, to visualize the overall effects of computations. Conversely, diagrams of states help to conceive new quantum algorithms, by schematically describing desired manipulations of quantum information with intuitive diagrams and then by guessing the equivalent complete diagrams, from which the corresponding quantum circuit is obtained effortlessly. Related examples and analysis of complex algorithms will be provided in future works, for whose comprehension this first tutorial offers the necessary introduction.
Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.
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.
In the field of quantum information science and technology, the representation and visualization of quantum states and related processes are essential for both research and education. In this context, a focus lies especially on ensembles of few qubits. There exist many powerful representations for single-qubit and multiqubit systems, such as the famous Bloch sphere and generalizations. Here, we utilize the dimensional circle notation as a representation of such ensembles, adapting the so-called circle notation of qubits and the idea of representing the n -particle system in an n -dimensional space. We show that the mathematical conditions for separability lead to symmetry conditions of the quantum state visualized, offering a new perspective on entanglement in few-qubit systems and therefore on various quantum algorithms. In this way, dimensional notations promise significant potential for conveying nontrivial quantum entanglement properties and processes in few-qubit systems to a broader audience, and could enhance understanding of these concepts as a bridge between intuitive quantum insight and formal mathematical descriptions. Published by the American Physical Society 2024
This paper explores a novel approach to quantum computation centered around self-referential quantum circuits. The core concept involves designing circuits that recursively incorporate themselves into their operational structure, effectively creating computational modules capable of self-replication. This is achieved through the strategic implementation of feedback loops and entanglement within the circuit architecture. The potential benefits of this paradigm include a reduction in circuit complexity and the possibility of constructing universal quantum computers from fundamentally simpler components. The theoretical framework presented herein outlines the key principles and mathematical underpinnings of this self-referential design, proposing a pathway toward more efficient and scalable quantum computation. The presented model uses the following notation: |ψ⟩ represents a quantum state, U(θ) represents a unitary operator with rotation angle θ, C represents a quantum circuit, and E represents the expectation value. Specifically, the expectation value of an observable A is denoted as E[A] = <ψ|A|ψ>, where |ψ> is the quantum state. The Hamiltonian of a quantum system is typically represented as H, and the time evolution of the state is governed by the Schrödinger equation: iℏ∂|ψ(t)⟩/∂t = H|ψ(t)⟩. Entanglement is represented by the Bell state |Φ⁺⟩ = (|00⟩ + |11⟩)/√2. Quantum gates, such as the Hadamard gate (H) and the CNOT gate (CN), are represented as unitary transformations. The circuit representation involves sequential application of gates, and the overall unitary transformation is the product of these gates. The circuit depth, denoted as d, represents the number of consecutive gate operations applied to a quantum state. The circuit complexity, denoted as C, is a measure of the number of gates required to implement a specific quantum algorithm. The circuit fidelity, denoted as F, quantifies the accuracy of a quantum circuit's output, ranging from 0 to 1. We define the quantum state preparation as |ψ⟩ = ∑i ci|i⟩, where ci are complex coefficients and |i⟩ are the computational basis states. The unitary transformation is defined as U|ψ⟩ = ∑i (Uici)|i⟩, where Ui are the matrix elements of the unitary operator U. The propagation of quantum states through a circuit is represented by the Schrödinger equation, and the final state is obtained by applying the unitary transformation to the initial state. The concept of quantum coherence, denoted as χ, represents the ability of a quantum system to maintain its superposition state. The fidelity of a quantum state is defined as the probability that a measurement will yield the expected outcome.
This paper investigates the core principles of quantum computation, providing an in-depth understanding of quantum phenomena and illustrating how these principles form the scientific foundation of the field. The pivotal physical concepts, such as properties of subatomic particles, including electrons and photons, as well as their mathematical description through linear algebra are examined. It focuses on the qubit, the quantum analogue of a classical bit, featuring properties like superposition, entanglement, and wave function collapse, which redefine the traditional concept of information processing. The mathematical structures that underlie quantum system modelling—vector spaces, tensor products, and Dirac notation—are also systematically explained. Essential components of quantum computation involve logic gates such as Pauli matrices and Hadamard gates, which demonstrate the novel application of qubits in unique ways. This sets up an important theme of the interdependence and potential for transformation of quantum states through the illustration of advanced ideas of quantum entanglement and teleportation. Quantum circuits serve as an outstanding example of how reversibility and superposition are exploited to solve complex problems at unprecedented levels of efficiency. The paper also highlights the Deutsch-Jozsa algorithm as a compelling example of quantum superiority over traditional computational approaches. Together, these findings emphasize the transformative potential of quantum computing for science and industry.