We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. The strength of this strategy is benchmarked against state-of-the-art techniques, showing a remarkable acceleration. As a side product, we provide an optimized method for one key calculus in quantum simulations: the Pauli basis decomposition of Hamiltonians.
We present a code in Python3 which takes a square real symmetric matrix, of arbitrary size, and decomposes it as a tensor product of Pauli spin matrices. The application to the decomposition of a Hamiltonian of relevance to nuclear physics for implementation on quantum computer is given.
Using dyadic representations elaborated from vectors of Jones, and calculating relations of anti-commutation of these tensorial forms, we obtain in shape explicit the Pauli spin matrices.
The Pauli matrices are a set of three 2x2 complex Hermitian, unitary matrices. In this article, we investigate the relationships between certain roots of the Pauli matrices and how gates implementing those roots are used in quantum circuits. Techniques for simplifying such circuits are given. In particular, we show how those techniques can be used to find a circuit of Clifford+T gates starting from a circuit composed of gates from the well studied NCV library.
The construction of unitary operator bases in a finite-dimensional Hilbert space is reviewed through a nonstandard approach combinining angular momentum theory and representation theory of SU(2). A single formula for the bases is obtained from a polar decomposition of SU(2) and analysed in terms of cyclic groups, quadratic Fourier transforms, Hadamard matrices and generalized Gauss sums. Weyl pairs, generalized Pauli operators and their application to the unitary group and the Pauli group naturally arise in this approach.
The definition due to Accardi of a pair of complementary observables is adapted to the context of the Lie algebra $ su(2) $. We show that the pair of Pauli matrices $ A,B $ associated to the unit directions $ α$ and $ β$ in $ \mathbb{R}^{3} $ are Accardi complementary if and only if $ α$ and $ β$ are orthogonal if and only if $ A $ and $ B $ are orthogonal. In particular, any pair of the standard triple of Pauli matrices is complementary.
Study of the normalizer of the MAD-group corresponding to a finegrading offers the most important tool for describing symmetries in the system of non-linear equations connected with contraction of a Lie algebra. One fine grading that is always present in any Lie algebra $sl(n,\mathbb{C})$ is the Pauli grading. The MAD-group corresponding to it is generated by generalized Pauli matrices. For such MAD-group, we already know its normalizer; its quotient group is isomorphic to the Lie group $Sl(2,\mathbb{Z}_n)\times v\mathbb{Z}_2$. In this paper, we deal with a more complicated situation, namely t…
An efficient Pauli decomposition algorithm for structured matrices
Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（量子信息与计算联合中心，美国国家标准与技术研究院/马里兰大学）；Joint Quantum Institute, NIST/University of Maryland（量子研究所联合机构，美国国家标准与技术研究院/马里兰大学）；Department of Physics, University of Maryland（马里兰大学物理系）；Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland（马里兰大学计算机科学与高等计算机科学研究所）
Quantum computation started to become significant field of studies as it hold great promising towards the upgrade of our current computational power. Studying the evolution of quantum states serves as a good fundamental in understanding quantum information which lead to quantum computation. This was assisted with the respective mathematical tools such as Lie group and Lie algebra. In this study, the Lie algebra of $\mathfrak{su}(8)$ is represented in tensor product between three Pauli matrices. This is done by constructing the generalized Gell-Mann matrices and compared to the Pauli basis. Thi…
A set of generators of generalized Pauli matrices play a crucial role in quantum computation based on n level systems of an atom. In this paper we show how to construct them by making use of Rabi oscillations. We also construct the generalized Walsh-Hadamard matrix in the case of three level systems and present some related problems.
In this paper we will provide a new operatorial counterpart of the path-integral formalism of classical mechanics developed in recent years. We call it new because the Jacobi fields and forms will be realized via finite dimensional matrices. As a byproduct of this we will prove that all the operations of the Cartan calculus, such as the exterior derivative, the interior contraction with a vector field, the Lie derivative and so on, can be realized by means of suitable tensor products of Pauli and identity matrices.
A quantum lattice algorithm (QLA) is developed for the solution of Maxwell equations in scalar dielectric media using the Riemann-Silberstein representation. For x-dependent and y-dependent inhomogeneities, the corresponding QLA requries 8 qubits/spatial lattice site. This is because the corresponding Pauli spin matrices have off-diagonal components which permit the collisional entanglement of two qubits. However, z-dependent inhomogeneities require a QLA with 16 qubits/lattice site since the Pauli spin matrix $σ_z$ is diagonal. QLA simulations are performed for the time evolution of an initia…
The Clifford+$T$ quantum computing gate library for single qubit gates can create all unitary matrices that are generated by the group $\langle H, T\rangle$. The matrix $T$ can be considered the fourth root of Pauli $Z$, since $T^4 = Z$ or also the eighth root of the identity $I$. The Hadamard matrix $H$ can be used to translate between the Pauli matrices, since $(HTH)^4$ gives Pauli $X$. We are generalizing both these roots of the Pauli matrices (or roots of the identity) and translation matrices to investigate the groups they generate: the so-called Pauli root groups. In this work we introdu…
We introduce a new generalization of the Pauli channels using the mutually unbiased measurement operators. The resulting channels are bistochastic but their eigenvectors are not unitary. We analyze the channel properties, such as complete positivity, entanglement breaking, and multiplicativity of maximal output purity. We illustrate our results with the maps constructed from the Gell-Mann matrices and the Heisenberg-Weyl observables.
In the Bloch sphere picture, one finds the coefficients for expanding a single-qubit density operator in terms of the identity and Pauli matrices. A generalization to $n$ qubits via tensor products represents a density operator by a real vector of length $4^n$, conceptually similar to a statevector. Here, we study this approach for the purpose of quantum circuit simulation, including noise processes. The tensor structure leads to computationally efficient algorithms for applying circuit gates and performing few-qubit quantum operations. In view of variational circuit optimization, we study ``b…
The Pauli operators (tensor products of Pauli matrices) provide a complete basis of operators on the Hilbert space of N qubits. We prove that the set of 4^N-1 Pauli operators may be partitioned into 2^N+1 distinct subsets, each consisting of 2^N-1 internally commuting observables. Furthermore, each such partitioning defines a unique choice of 2^N+1 mutually unbiased basis sets in the N-qubit Hilbert space. Examples for 2 and 3 qubit systems are discussed with emphasis on the nature and amount of entanglement that occurs within these basis sets.
From a geometric point of view, Pauli's exclusion principle defines a hypersimplex. This convex polytope describes the compatibility of $1$-fermion and $N$-fermion density matrices, therefore it coincides with the convex hull of the pure $N$-representable $1$-fermion density matrices. Consequently, the description of ground state physics through $1$-fermion density matrices may not necessitate the intricate pure state generalized Pauli constraints. In this article, we study the generalization of the $1$-body $N$-representability problem to ensemble states with fixed spectrum $\mathbf{w}$, in o…
It is a well-known result due to E. Størmer that every positive qubit map is decomposable into a sum of a completely positive map and a completely copositive map. Here, we generalize this result to tensor squares of qubit maps. Specifically, we show that any positive tensor product of a qubit map with itself is decomposable. This solves a recent conjecture by S. Fillipov and K. Magadov. We contrast this result with examples of non-decomposable positive maps arising as the tensor product of two distinct qubit maps or as the tensor square of a decomposable map from a qubit to a ququart. To show …
Quantum algorithms for the exponentiation of Toeplitz matrices and applications in partial differential equations
University of the Basque Country, UPV/EHU（巴斯克大学）；EHU Quantum Center, University of the Basque Country UPV/EHU（巴斯克大学EHU量子中心）；IBM Quantum, IBM Research Europe（IBM欧洲研究院量子部门）；Quantum Mads；Basque Center for Applied Mathematics (BCAM)（巴斯克应用数学中心）；IKERBASQUE, Basque Foundation for Science（伊克尔巴斯基克科学基金会）
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique for the manipulation of arbitrary non-unitary matrices on a quantum computer. We describe how to 'sketch' these quantities via the kernel polynomial method which is a standard strategy in numerical condensed matter physics. These algorithms use amplitude estimation to obtain a quadratic speedup in the accuracy over previous results, can capture any observabl…
The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length $N = 2^m$ over $\mathbb{Z}_4$. We show that exponentiating these $\mathbb{Z}_4$-valued codewords by $\imath \triangleq \sqrt{-1}$ produces stabilizer states, that are quantum states obtained using only Clifford unitaries. These states are also the common eigenvectors of commuting Hermitian matrices forming maximal commutative subgroups (MCS) of the Pauli group. We use this quantum description to simplify the derivation of the classical weight distribution of Kerdock codes. Next, we organi…
