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. This study will explicitly shows the one-to-one correlation of Gell-Mann matrices with the Pauli basis resembled change of coordinates. This is particularly useful when dealing with quantum circuit problems.
We introduce graph state basis diagonalization to calculate the coherent information of a quantum code passing through a Pauli channel. The scheme is 5000 times faster than the best known one for some concatenated repetition codes, providing us a practical constructive way of approaching the quantum capacity of a Pauli channel. The calculation of the coherent information of non-additive quantum code can also be greatly simplified in graph state basis.
We report numerical results on the diagonalization of 1D transverse field Ising model. Numerical simulations using the Pauli product representation yield diagonalization from 3 spins to 22 spins in the transverse field Ising model with the number of global Jacobi unitary transformations and number of final terms in diagonalized spin z representation both grew polynomial with the number of spins. These results computed on a classical computer show promise in constructing a quantum circuit to simulate diagonalized generic many-particle Hamiltonians using polynomial number of gates.
Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal measurement-based quantum computing and its verification. In this paper, we construct a universal hypergraph state that only requires $X$ and $Z$-basis measurements for universal measurement-based quantum computing. We also show that universal measurement-based quantum computing on our hypergraph state can be verified in polynomial time using only $X$ and $Z$-bas…
Observable-Guided Generator Selection for Improving Trainability in Quantum Machine Learning with a $ \mathfrak{g} $-Purity Interpretation under Restricted Settings
The calculating of the coherent information is a fundamental step in obtaining the quantum capacity of a quantum channel. We introduce orthogonal and complete code basis to evaluate the coherent information per channel use when the input is the maximal mixture of stabilizer codewords. In the code basis, the output density matrix is diagonal, the joint output of the system and the auxiliary is block diagonal. The coherent information is worked out by counting the weights of error operators.
Several linear algebra routines for quantum computing use a basis of tensor products of identity and Pauli operators to describe linear operators, and obtaining the coordinates for any given linear operator from its matrix representation requires a basis transformation, which for an $\mathrm N\times\mathrm N$ matrix generally involves $\mathcal O(\mathrm N^4)$ arithmetic operations. Herein, we present an efficient algorithm that for our particular basis transformation only involves $\mathcal O(\mathrm N^2\log_2\mathrm N)$ operations. Because this algorithm requires fewer than $\mathcal O(\math…
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.
Phase-sensitive framed-ribbon representation of single-qubit Pauli measurements in linear cluster states
Indian Institute of Technology, Indore（印度印多尔理工学院）；Techno Main Salt Lake (Engg. Colg.), Techno India Group（Techno India集团Salt Lake技术主校区（工程学院））；Centre of Advanced Studies and Innovation Lab (CASILAB)（先进研究与创新实验室（CASILAB））
Estimating the expectation value of an operator corresponding to an observable is a fundamental task in quantum computation. It is often impossible to obtain such estimates directly, as the computer is restricted to measuring in a fixed computational basis. One common solution splits the operator into a weighted sum of Pauli operators and measures each separately, at the cost of many measurements. An improved version collects mutually commuting Pauli operators together before measuring all operators within a collection simultaneously. The effectiveness of doing this depends on two factors. Fir…
Twirling is a technique widely used for converting arbitrary noise channels into Pauli channels in error threshold estimations of quantum error correction codes. It is vitally useful both in real experiments and in classical quantum simulations. Minimising the size of the twirling gate set increases the efficiency of simulations and in experiments it might reduce both the number of runs required and the circuit depth (and hence the error burden). Conventional twirling uses the full set of Pauli gates as the set of twirling gates. This article provides a theoretical background for Pauli twirlin…
Decoherence of quantum systems is described by quantum channels. However, a complete understanding of such channels, especially in the multi-particle setting, is still an ongoing difficult task. We propose the family of quantum maps that preserve or completely erase the components of a multi-qubit system in the basis of Pauli strings, which we call Pauli component erasing maps. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace, from which we derive several properties and complete the characterization. Moreover, we show that…
SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates
University of Edinburgh（爱丁堡大学）；Arclight Quantum Computing Inc.（Arclight量子计算公司）；Institute of Computing Technology, Chinese Academy of Sciences（中国科学院计算技术研究所）
We derive a basis for the vector space of bounded operators acting on a $d$-dimensional system Hilbert space $C^d$. In the context of quantum computation the basis elements are identified as the generalised Pauli matrices - the error generators. As an application, we show how such matrices are used in the teleportation a single qudit.
Any polarization vector of a plane wave can be decomposed into a pair of mutually orthogonal base vectors, known as a polarization basis. Regarding this decomposition as a quasi-unitary transformation from a three-component vector to a corresponding two-component spinor, one is led to a representation formalism for the photon spin. The spin operator $\hat{\boldsymbol γ}$ defined on the space of unit spinors, referred to as the Jones space, has only component along the wave vector and is represented by one of the Pauli matrices in the commonly used polarization basis. It is deformed by the quas…
The design and optimization of realistic architectures for fault-tolerant quantum computation requires error models that are both reliable and amenable to large-scale classical simulation. Perhaps the simplest and most practical general-purpose method for constructing such an error model is to twirl a given completely positive channel over the Pauli basis, a procedure we refer to as the Pauli twirling approximation (PTA). In this work we test the accuracy of the PTA for a small stabilizer measurement circuit relevant to fault-tolerant quantum computation, in the presence of both intrinsic gate…
With continuing improvements on the quality of fabricated quantum devices, it becomes increasingly crucial to analyze noisy quantum process in greater details such as characterizing the non-Markovianity in a quantitative manner. In this work, we propose an experimental protocol, termed Spectral Transfer Tensor Maps (SpecTTM), to accurately predict the RHP non-Markovian measure of any Pauli channels without state-preparation and measurement (SPAM) errors. In fact, for Pauli channels, SpecTTM even allows the reconstruction of highly-precised noise power spectrum for qubits. At last, we also disc…
High-dimensional degrees of freedom of photons can encode more quantum information than their two-dimensional counterparts. While the increased information capacity has advantages in quantum applications (such as quantum communication), controlling and manipulating these systems has been challenging. Here we show a method to perform lossless arbitrary high-dimensional Pauli-X gates for single photon. The X-gate consists of a cyclic permutation of qudit basis vectors, and, together with the Z gate, forms the basis for performing arbitrary transformations. We propose an implementation of such ga…
Zero-point energy of a trapped ultracold Fermi gas at unitarity: squeezing the Heisenberg uncertainty principle and suppressing the Pauli principle to produce a superfluid state
We study locality preserving automorphisms of operator algebras on $D$-dimensional uniform lattices of prime $p$-dimensional qudits (QCA), specializing in those that are translation invariant (TI) and map every prime $p$-dimensional Pauli matrix to a tensor product of Pauli matrices (Clifford). We associate antihermitian forms of unit determinant over Laurent polynomial rings to TI Clifford QCA with lattice boundaries, and prove that the form determines the QCA up to Clifford circuits and shifts (trivial). It follows that every 2D TI Clifford QCA is trivial since the antihermitian form in this…
A class of representations of the $\mathbb{Z}_2\times\mathbb{Z}_2$-graded special linear Lie superalgebra $\mathfrak{sl}(m_1+1,m_2|n_1,n_2)$ and quantum statistics
The one-way model of Measurement-Based Quantum Computing and the gate-based circuit model give two different presentations of how quantum computation can be performed. There are known methods for converting any gate-based quantum circuit into a one-way computation, whereas the reverse is only efficient given some constraints on the structure of the measurement pattern. Causal flow and generalised flow have already been shown as sufficient, with efficient algorithms for identifying these properties and performing the circuit extraction. Pauli flow is a weaker set of conditions that extends gene…
Institute for Computer Science, University of Augsburg（奥格斯堡大学计算机科学研究所）；Quantum Motion Technologies Pty Ltd（量子运动科技有限公司）；School of Physics, The University of Melbourne（墨尔本大学物理学院）；Center for Advanced Analytics and Predictive Sciences, University of Augsburg（奥格斯堡大学先进分析与预测科学中心）
