Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Density Matrices and Their Traces in Quantum Computing: Matrix Representations of Pure and Mixed Quantum States

Chinnaraji Annamalai

Published Sep 19, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.14331.48165

Related papers

A Density Matrix Approach Towards Quantum Computing

Vandana Arora, Jagneet Kaur Anand

In this article, the authors start with a discussion of various quantum states and their associated density matrices. The evaluation of the density matrices for pure, mixed, and entangled states is done elaborately. The concept of the trace of the density matrices is then explored and its relation with the purity of any state is discussed. The mathematical process of diagonalization of a matrix is studied for pure, mixed, and entangled states.

IOSR Journal of Applied Physics•Jun 1, 2025•1 citation

DENSITY MATRICES IN QUANTUM MECHANICS

WORLD SCIENTIFIC eBooks•Jul 1, 1995•1 citation

Estimation of trace distance between two arbitrary quantum states

Sanchita Ghosh, Anumita Mukhopadhyay, Anindita Bera +2 more

When it comes to discriminating between two quantum states, trace distance is one of the well-known metrics used in quantum computation and quantum information theory. While there are several quantum algorithms for calculating the trace distance between two quantum states, computing it for any two general density matrices remains computationally demanding. In this paper, we propose a quantum algorithm based on the exponentiation of the density matrix and the improved quantum phase estimation (IQPE) to determine the trace distance for both pure and mixed states, with a time complexity of $O(N^2/\varepsilon^6)$ where $N$ is the number of qubits of the given states and $\varepsilon$ is the simulation or estimation precision error. We demonstrate its ability to predict the quantity with proof-of-principle simulations and also quantum hardware computations on the IBM quantum computers, confirming its promise for near-term quantum devices.

quant-pharXiv:2604.05628•Apr 8, 2026•0 citations

Density Matrix Representations

John D. Patterson

The relations between the ordinary density matrix, the density matrix in the coordinate representation, the Löwdin density matrices, the Dirac density matrix, and other density matrices are traced. The roles of pure and mixed cases, equilibrium and nonequilibrium situations, and single- and many-body representations are considered.

American Journal of Physics•Dec 1, 1962•6 citations

Description of States in Quantum Mechanics by Density Matrix and Operator Techniques

U. Fano

Reviews of Modern Physics•Jan 1, 1957•1,974 citations

The Quantum Density Matrix and Its Many Uses

Apoorva Patel

arXiv:2303.08738•Journal of the Indian Institute of Science•Apr 1, 2023•4 citations
When it comes to discriminating between two quantum states, trace distance is one of the well-known metrics used in quantum computation and quantum information theory. While there are several quantum algorithms for calculating the trace distance between two quantum states, computing it for any two general density matrices remains computationally demanding. In this paper, we propose a quantum algorithm based on the exponentiation of the density matrix and the improved quantum phase estimation (IQPE) to determine the trace distance for both pure and mixed states, with a time complexity of O(N2/ε6)O(N^2/\varepsilon^6)O(N2/ε6) where NNN is the number of qubits of the given states and ε\varepsilonε is the simulation or estimation precision error. We demonstrate its ability to predict the quantity with proof-of-principle simulations and also quantum hardware computations on the IBM quantum computers, confirming its promise for near-term quantum devices.