Simulating a Sequential Pauli-Y–Hadamard–Pauli-Z Quantum Circuit

P. K. Majumdar

Published Aug 19, 2026• 0 citations

Abstract

This notebook demonstrates how NumPy can be used to construct the unified matrix operator for a single-qubit circuit in which the Pauli-Y, Hadamard and Pauli-Z gates are applied sequentially. It explains the relationship between chronological circuit order and right-to-left matrix multiplication, computes the composite operator as Z @ H @ Y, prints the resulting 2 × 2 complex matrix and verifies numerically that the composite transformation remains unitary.

DOI: 10.5281/zenodo.22011366

Related papers

Simulating Sequential Single-Qubit State Evolution with NumPy

P. K. Majumdar

This educational Jupyter notebook demonstrates how to simulate sequential quantum-gate operations using NumPy. Beginning with the computational-basis state |0>, it applies the Hadamard and Pauli-X operators in chronological circuit order while explaining the corresponding right-to-left order of matrix multiplication. The notebook uses NumPy's matrix-multiplication operator to compute intermediate and final state vectors, verifies the equivalence of composite-operator evaluation, and confirms that unitary evolution preserves state normalisation. It is intended as a transparent, reproducible introduction to matrix-based single-qubit simulation for students, educators and readers beginning their study of quantum computing.

Aug 14, 20260 citations

Diagonalise Hermitian operators and change quantum basis with NumPy

P. K. Majumdar

This program uses NumPy’s Hermitian eigensolver to diagonalise the Pauli-(X) operator, construct its unitary eigenvector matrix and verify the similarity transformation numerically. It also distinguishes NumPy’s automatically ordered eigenbasis from the conventional Hadamard basis, demonstrating that (H†XH=Z).

Aug 30, 20260 citations

Unitaria: Quantum Linear Algebra via Block Encodings

Matthias Deiml, Oliver Hüttenhofer, Ram Mosco +2 more

We introduce Unitaria, a Python library that brings the simplicity of classical linear algebra toolkits such as NumPy and SciPy to the implementation of quantum algorithms based on block encodings, a general-purpose abstraction in which a matrix is embedded as a sub-block of a larger unitary operator. Their implementation has so far required deep knowledge of low-level circuit construction, which Unitaria aims to eliminate. The library provides a composable, array-like interface through which users can define block encodings of matrices and vectors, combine them through standard operations such as addition, multiplication, tensor products, and the Quantum Singular Value Transformation, and extract the resulting quantum circuits automatically. A key feature is a matrix-arithmetic evaluation path in which every operation can be computed directly on encoded vectors and matrices without dependence on ancilla qubits or circuit simulation. This enables correctness verification and classical simulation that scale well beyond what state vector simulation permits and also allows resource estimation, including gate counts, qubit counts, and normalization constants, without executing any circuit. Together, these capabilities allow researchers to develop, verify, and analyze quantum linear algebra algorithms today, ahead of the availability of error-corrected hardware. Unitaria is open source and available at https://github.com/tequilahub/unitaria.

quant-pharXiv:2605.10768May 12, 20260 citations

Reconstructing the Hadamard Gate from Euler-Angle Parameters

P. K. Majumdar

This notebook implements the general single-qubit unitary matrix U(θ, φ, λ) and evaluates it for θ = π/2, φ = 0 and λ = π. It compares the generated array with the exact Hadamard matrix, uses matrix multiplication to verify their equivalence, and independently confirms that the resulting operator satisfies the unitarity condition U†U = I. The exercise demonstrates how familiar quantum gates can be recovered as particular cases of a general parameterised single-qubit transformation.

Aug 19, 20260 citations

Theory and Methodology of Information Security: Quantum Gates and Pauli Matrices

Mikhail Pavlov

Abstract In the field of quantum computing, the study of single-qubit quantum gates is fundamental to constructing quantum circuits and algorithms. Single-qubit gates, such as the X, Y, and Z gates, enable precise manipulation of qubit states, which can be visualized on the Bloch sphere. The use of matrix representations, including Pauli matrices, provides a rigorous mathematical framework for analyzing gate operations and their effects within quantum circuits. This work also explores the application of the Quantum Fourier Transform (QFT) and introduces the Hadamard test subroutine as a practical method for evaluating quantum states. The presented algorithms were successfully implemented on a 5-qubit IBM quantum computer, demonstrating both the theoretical foundations and practical significance of quantum gates and Pauli matrices in modern quantum computation and their potential role in secure information processing.

Mar 4, 20260 citations

A Quantum Model of Computation

Phillip Kaye, Raymond Laflamme, Michele Mosca

In Section 1.3, we introduced the circuit model of (classical) computation. We restricted attention to reversible circuits since they can simulate any non-reversible circuit with modest overhead. This model can be generalized to a model of quantum circuits. In the quantum circuit model, we have logical qubits carried along ‘wires’, and quantum gates that act on the qubits. A quantum gate acting on n qubits has the input qubits carried to it by n wires, and n other wires carry the output qubits away from the gate. A quantum circuit is often illustrated schematically by a circuit diagram as shown in Figure 4.1. The wires are shown as horizontal lines, and we imagine the qubits propagating along the wires from left to right in time. The gates are shown as rectangular blocks. For convenience, we will restrict attention to unitary quantum gates (which are also reversible). Recall from Section 3.5.3 that non-unitary (non-reversible) quantum operations can be simulated by unitary (reversible) quantum gates if we allow the possibility of adding an ancilla and of discarding some output qubits. A circuit diagram describing a superoperator being implemented using a unitary operator is illustrated in Figure 4.2. In the example of Figure 4.1, the 4-qubit state |ψi⟩= |0⟩⊗ |0⟩⊗ |0⟩⊗ |0⟩ enters the circuit at the left (recall we often write this state as |ψi⟩ = |0⟩|0⟩|0⟩|0⟩ or |ψi⟩ = |0000⟩.) These qubits are processed by the gates U1, U2, U3, and U4. At the output of the circuit we have the collective (possibly entangled) 4-qubit state |ψf⟩. A measurement is then made of the resulting state. The measurement will often be a simple qubit-by-qubit measurement in the computational basis, but in some cases may be a more general measurement of the joint state. A measurement of a single qubit in the computational basis is denoted on a circuit diagram by a small triangle, as shown in Figure 4.1 (there are other symbols used in the literature, but we adopt this one). The triangle symbol will be modified for cases in which there is a need to indicate different types of measurements.R50

Oxford University Press eBooksNov 16, 20060 citations