Efficient quantum circuit simulation using a multi-qubit Bloch vector representation of density matrices

Abstract

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 ``backpropagation'' through a quantum circuit and gradient computation based on this representation, and generalize our analysis to the Lindblad equation for modeling the (non-unitary) time evolution of a density operator.

arXiv comment10 pages

References in corpus (10)

• Quantum Circuit Learning
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Evaluating analytic gradients on quantum hardware
• The Bloch Vector for N-Level Systems
• Bloch vectors for qudits
• Hybrid Quantum-Classical Approach to Quantum Optimal Control
• Quantum Steering Ellipsoids
• Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
• Entangled Bloch Spheres: Bloch Matrix and Two Qubit State Space
• Finding purifications with minimal entanglement

Cited by in corpus (2)

• Quantum Process Tomography of Unitary Maps from Time-Delayed Measurements
• Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings