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

Bulletin of the American Physical Society

Generalized Pure Density Matrices and the Standard Model

Carl A. Brannen

Published Apr 14, 2015• 0 citations
OpenAlex

Related papers

General Density Matrix Theory

Karl Blum

Springer series on atomic, optical, and plasma physics•Oct 4, 2011•9 citations

A Relational Analysis of Quantum Symmetry

Carl A. Brannen

Carlo Rovelli's ``relational interpretation'' of quantum mechanics tells us that our understanding of quantum states is limited to their interactions with other quantum states. This implies that we have no understanding of the symmetry properties of a state vector except when considered in relation to at least one other state vector. The SU(3)xSU(2)xU(1) symmetry of the Standard Model is derived from their interactions and therefore cannot necessarily be applied to a single state vector. Steven Weinberg showed that mixed density matrices can have symmetries that are not available to state vectors. We explore the symmetry properties of finite symmetry groups for mixed density matrices. Just as mixed density matrices can define mixed states that require multiple state vectors, we find that the symmetries of mixed density matrices define ``mixed symmetries'' that are similar in structure to the symmetry of the Standard Model. We explore the point group symmetries and show one that gives the Standard Model symmetry. With this symmetry, we can generalize the Pauli spin matrices to a set that has irreducible representations matching the Standard Model plus a dark matter candidate.

•May 1, 2021•0 citations

General Density Matrix Theory

Karl Blum

Springer eBooks•Jan 1, 1996•2 citations

Quantum circuits with mixed states

Dorit Aharonov, Alexei Kitaev, Noam Nisan

We define the model of quantum circuits with density matrices, where non-unitary gates are allowed. Measurements in the middle of the computation, noise and decoherence are implemented in a natural way in this model, which is shown to be equivalent in computational power to standard quantum circuits. The main result in this paper is a solution for the subroutine problem: The general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations. We give a natural definition of using general subroutines, and analyze their computational power. We suggest convenient metrics for quantum computing with mixed states. For density matrices we analyze the so called ``trace metric'', and using this metric, we define and discuss the ``diamond metric'' on superoperators. These metrics enable a formal discussion of errors in the computation. Using a ``causality'' lemma for density matrices, we also prove a simple lower bound for probabilistic functions.

arXiv:quant-ph/9806029•ACM Symposium on Theory of Computing (STOC)•Jan 1, 1998•498 citations

Density matrix and quantum statistical mechanics

C. Di Castro, Roberto Raimondi

Cambridge University Press eBooks•Aug 27, 2015•0 citations

Algebraic Quantum Thermodynamics

Carl A. Brannen

Density matrices can be used to describe ensembles of particles in thermodynamic equilibrium. We assume that the density matrices are a more natural description of quantum objects than state vectors. This suggests that we generalize density matrices from the usual operators on a Hilbert space to be elements of an algebra. Using density matrix renormalization to change the temperature of the ensembles, we show how the choice of algebra determines the symmetry and particle content of these generalized density matrices. The symmetries are of the form SU(N)xSU(M)x...U(1). We propose that the Standard Model of elementary particles should include a dark matter SU(2) doublet.

•Mar 1, 2016•0 citations
Carlo Rovelli's ``relational interpretation'' of quantum mechanics tells us that our understanding of quantum states is limited to their interactions with other quantum states. This implies that we have no understanding of the symmetry properties of a state vector except when considered in relation to at least one other state vector. The SU(3)xSU(2)xU(1) symmetry of the Standard Model is derived from their interactions and therefore cannot necessarily be applied to a single state vector. Steven Weinberg showed that mixed density matrices can have symmetries that are not available to state vectors. We explore the symmetry properties of finite symmetry groups for mixed density matrices. Just as mixed density matrices can define mixed states that require multiple state vectors, we find that the symmetries of mixed density matrices define ``mixed symmetries'' that are similar in structure to the symmetry of the Standard Model. We explore the point group symmetries and show one that gives the Standard Model symmetry. With this symmetry, we can generalize the Pauli spin matrices to a set that has irreducible representations matching the Standard Model plus a dark matter candidate.
We define the model of quantum circuits with density matrices, where non-unitary gates are allowed. Measurements in the middle of the computation, noise and decoherence are implemented in a natural way in this model, which is shown to be equivalent in computational power to standard quantum circuits. The main result in this paper is a solution for the subroutine problem: The general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations. We give a natural definition of using general subroutines, and analyze their computational power. We suggest convenient metrics for quantum computing with mixed states. For density matrices we analyze the so called ``trace metric'', and using this metric, we define and discuss the ``diamond metric'' on superoperators. These metrics enable a formal discussion of errors in the computation. Using a ``causality'' lemma for density matrices, we also prove a simple lower bound for probabilistic functions.
Density matrices can be used to describe ensembles of particles in thermodynamic equilibrium. We assume that the density matrices are a more natural description of quantum objects than state vectors. This suggests that we generalize density matrices from the usual operators on a Hilbert space to be elements of an algebra. Using density matrix renormalization to change the temperature of the ensembles, we show how the choice of algebra determines the symmetry and particle content of these generalized density matrices. The symmetries are of the form SU(N)xSU(M)x...U(1). We propose that the Standard Model of elementary particles should include a dark matter SU(2) doublet.