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

arXiv:1611.00182 · Reviews in Mathematical Physics

Parametrizations of degenerate density matrices

E. Brüning, S. Nagamachi

Published Jul 26, 2017• 0 citations
arXivHTMLPDF

Abstract

It turns out that a parametrization of degenerate density matrices requires a parametrization of [Formula: see text], [Formula: see text] where [Formula: see text] denotes the set of all unitary [Formula: see text]-matrices with complex entries. Unfortunately, the parametrization of this quotient space is quite involved. Our solution does not rely on Lie algebra methods directly, but succeeds through the construction of suitable sections for natural projections, by using techniques from the theory of homogeneous spaces. We mention the relation to the Lie algebra background and conclude with two concrete examples.

DOI
10.1142/s0129055x1750026x

Related papers

CONTRACTIONS OF LIE ALGEBRA REPRESENTATIONS

U. Cattaneo, Walter Felipe Wreszinski

A theory of contractions of Lie algebra representations on complex Hilbert spaces is proposed, based on Trotter's theory of approximating sequences of Banach spaces. Its main distinguishing feature is a careful definition of the carrier space of the limit Lie algebra representation. A set of quite general conditions on the contracting representations, satisfied in all known examples, is proven to be sufficient for the existence of such a representation. In order to show how natural the suggested framework is, the general theory is applied to the contraction of [Formula: see text] into the Lie algebra [Formula: see text] of the 3-dimensional Heisenberg group and to the related study of the limit N→∞ of a quantum system of N identical two-level particles.

Reviews in Mathematical Physics•Nov 1, 1999•9 citations

Parametrization of degenerate density matrices

Tae-Hun Lee

This paper presents a parametrization of a degenerate density matrix. The problem needs to be approached first with a diagonalized form (the spectral representation) to deal with degeneracy. Such a form is useful for this parametrization in that the conditions to be a density matrix from a Hermitian matrix are applied only to a diagonal eigenvalue matrix, not a unitary matrix. Those conditions can be satisfied by parametrizing eigenvalues with squared spherical coordinates in dimension of the matrix. Degeneracy in eigenvalues brings symmetries between a eigenvalue matrix and a unitary matrix, which are realized in a form of a commuting unitary matrix, called a commutant. The associated redundant parameters in a unitary matrix have to be eliminated. It is realized in this paper that degrees of degeneracies can be defined as the total number of possible pairs of the same eigenvalues and one degree of degeneracy corresponds to one phase and one two dimensional rotation in a unitary matrix or a commutant. In this way all the degeneracies are identified and assigned to one phase-one rotation block. Therefore, a unitary matrix or a commutant is a product of these blocks and a general diagonal phase matrix. In physics a unitary matrix is often parametrized by rotation and phase matrices, called an angular representation here. There are many possible different phase configurations. It is often not a trivial matter whether a given parametrized unitary matrix is general. A simple diagram will be introduced to illustrate how to transform one phase configuration to another.

arXiv:1309.1238•Sep 5, 2013•0 citations

Extremal Positive Maps on M3(ℂ) and Idempotent Matrices

Marek Miller, Robert Olkiewicz

A new method of analysing positive bistochastic maps on the algebra of complex matrices [Formula: see text] has been proposed. By identifying the set of such maps with a convex set of linear operators on [Formula: see text], one can employ techniques from the theory of compact semigroups to obtain results concerning asymptotic properties of positive maps. It turns out that the idempotent elements play a crucial role in classifying the convex set into subsets, in which representations of extremal positive maps are to be found. It has been shown that all positive bistochastic maps, extremal in the set of all positive maps of [Formula: see text], that are not Jordan isomorphisms of [Formula: see text] are represented by matrices that fall into two possible categories, determined by the simplest idempotent matrices: one by the zero matrix, and the other by a one-dimensional orthogonal projection. Some norm conditions for matrices representing possible extremal maps have been specified and examples of maps from both categories have been brought up, based on the results published previously.

arXiv:1510.04920•Open Systems & Information Dynamics•Mar 1, 2016•5 citations

Parametrizations of unitary matrices and related coset spaces

Alan Macfarlane

Explicit forms of U3 and U4 matrices as functions of a single adjoint vector are displayed. Parametrizations of the coset spaces U(N+r)/(UN×Ur) are discussed, most explicitly for r=1 and 2, and related, for N=3 and 4, to the results for U3 and U4 matrices.

Journal of Mathematical Physics•Oct 1, 1980•3 citations

Parametrizing Density Matrices for Composite Quantum Systems

Erwin Brüning, Dariusz Chruściński, Francesco Petruccione

A parametrization of density operators for bipartite quantum systems is proposed. It is based on the particular parametrization of the unitary group found recently by Jarlskog. It is expected that this parametrization will find interesting applications in the study of quantum properties of multipartite systems.

arXiv:0810.2528•Open Systems & Information Dynamics•Dec 1, 2008•5 citations

Quantum Time-Space Tradeoffs for Matrix Problems

Paul W. Beame, Niels Kornerup, Michael Whitmeyer

Abstract. We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices [Formula: see text], including the discrete Fourier transform matrix, we prove that quantum circuits with at most [Formula: see text] input queries and [Formula: see text] qubits of memory require [Formula: see text] to compute matrix-vector product [Formula: see text] for [Formula: see text]. We similarly prove that matrix multiplication for [Formula: see text] binary matrices requires [Formula: see text]. Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for [Formula: see text] Boolean matrix multiplication to [Formula: see text] from [Formula: see text]. Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

arXiv:2401.05321•SIAM Journal on Computing•May 20, 2026•5 citations
It turns out that a parametrization of degenerate density matrices requires a parametrization of [Formula: see text], [Formula: see text] where [Formula: see text] denotes the set of all unitary [Formula: see text]-matrices with complex entries. Unfortunately, the parametrization of this quotient space is quite involved. Our solution does not rely on Lie algebra methods directly, but succeeds through the construction of suitable sections for natural projections, by using techniques from the theory of homogeneous spaces. We mention the relation to the Lie algebra background and conclude with two concrete examples.
A theory of contractions of Lie algebra representations on complex Hilbert spaces is proposed, based on Trotter's theory of approximating sequences of Banach spaces. Its main distinguishing feature is a careful definition of the carrier space of the limit Lie algebra representation. A set of quite general conditions on the contracting representations, satisfied in all known examples, is proven to be sufficient for the existence of such a representation. In order to show how natural the suggested framework is, the general theory is applied to the contraction of [Formula: see text] into the Lie algebra [Formula: see text] of the 3-dimensional Heisenberg group and to the related study of the limit N→∞ of a quantum system of N identical two-level particles.
This paper presents a parametrization of a degenerate density matrix. The problem needs to be approached first with a diagonalized form (the spectral representation) to deal with degeneracy. Such a form is useful for this parametrization in that the conditions to be a density matrix from a Hermitian matrix are applied only to a diagonal eigenvalue matrix, not a unitary matrix. Those conditions can be satisfied by parametrizing eigenvalues with squared spherical coordinates in dimension of the matrix. Degeneracy in eigenvalues brings symmetries between a eigenvalue matrix and a unitary matrix, which are realized in a form of a commuting unitary matrix, called a commutant. The associated redundant parameters in a unitary matrix have to be eliminated. It is realized in this paper that degrees of degeneracies can be defined as the total number of possible pairs of the same eigenvalues and one degree of degeneracy corresponds to one phase and one two dimensional rotation in a unitary matrix or a commutant. In this way all the degeneracies are identified and assigned to one phase-one rotation block. Therefore, a unitary matrix or a commutant is a product of these blocks and a general diagonal phase matrix. In physics a unitary matrix is often parametrized by rotation and phase matrices, called an angular representation here. There are many possible different phase configurations. It is often not a trivial matter whether a given parametrized unitary matrix is general. A simple diagram will be introduced to illustrate how to transform one phase configuration to another.
A new method of analysing positive bistochastic maps on the algebra of complex matrices [Formula: see text] has been proposed. By identifying the set of such maps with a convex set of linear operators on [Formula: see text], one can employ techniques from the theory of compact semigroups to obtain results concerning asymptotic properties of positive maps. It turns out that the idempotent elements play a crucial role in classifying the convex set into subsets, in which representations of extremal positive maps are to be found. It has been shown that all positive bistochastic maps, extremal in the set of all positive maps of [Formula: see text], that are not Jordan isomorphisms of [Formula: see text] are represented by matrices that fall into two possible categories, determined by the simplest idempotent matrices: one by the zero matrix, and the other by a one-dimensional orthogonal projection. Some norm conditions for matrices representing possible extremal maps have been specified and examples of maps from both categories have been brought up, based on the results published previously.
Abstract. We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices [Formula: see text], including the discrete Fourier transform matrix, we prove that quantum circuits with at most [Formula: see text] input queries and [Formula: see text] qubits of memory require [Formula: see text] to compute matrix-vector product [Formula: see text] for [Formula: see text]. We similarly prove that matrix multiplication for [Formula: see text] binary matrices requires [Formula: see text]. Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for [Formula: see text] Boolean matrix multiplication to [Formula: see text] from [Formula: see text]. Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.