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

Journal of Physics A Mathematical and General

Parametrisation of unitary matrices

P. Diţă

Published Nov 1, 1982• 27 citations
Publisher

Abstract

An algorithm for parametrisation of arbitrary n*n unitary matrices is presented. It is given with a minimum number of real parameters out of which a part take values in the positive unit cube, the others being arbitrary phases. The case n=4 is worked out in detail.
DOI
10.1088/0305-4470/15/11/023

Related papers

Comment on "A Recursive Parametrisation of Unitary Matrices"

Kazuyuki Fujii

In this note we make a comment on the paper by Jarlskog (math-ph/0504049) in which she gave a parametrisation to unitary matrices. Namely, we show that her recursive method is essentially obtained by the canonical coordinate of the second kind in the Lie group theory, and propose a problem on constructing unitary gates in quantum computation by making use of the parametrisation.

arXiv:math-ph/0505047•May 19, 2005•6 citations

On constructing Hermitian unitary matrices with prescribed moduli 1

Alicja Smoktunowicz, Wojciech Tadej

The problem of reconstructing the phases of a unitary matrix with prescribed moduli is of a broad interest to people working in many applications, e.g in the circuit theory, phase shift analysis, multichannel scattering, computer science (e.g in the theory of error correcting codes, design theory). We propose efficient algorithms for computing Hermitian unitary matrices for given symmetric bistochastic matrices A(n × n) for n = 3 and n = 4. We mention also some results for matrices of arbitrary size n.

Journal of Generalized Lie Theory and Applications•Jan 1, 2008•2 citations

On the parametrisation of unitary matrices by the moduli of their elements

P. Diţă

Communications in Mathematical Physics•Jan 1, 1994•13 citations

Recursive parametrization and invariant phases of unitary matrices

Ch. Zacharatou Jarlskog

We present further properties of a previously proposed recursive scheme for parametrization of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study the invariant phases of unitary matrices. The case of four-by-four unitary matrices is investigated in detail. We also address the question of how to construct symmetric unitary matrices (i.e., unitary matrices U that satisfy the condition Uij=Uji) using the recursive approach.

arXiv:math-ph/0510034•Journal of Mathematical Physics•Jan 1, 2006•23 citations

A composite parameterization of unitary groups, density matrices and subspaces

Christoph Spengler, Marcus Huber, Beatrix C. Hiesmayr

Unitary transformations and density matrices are central objects in quantum physics and various tasks require to introduce them in a parameterized form. In this paper we present a parameterization of the unitary group of arbitrary dimension d which is constructed in a composite way. We show explicitly how any element of can be composed of matrix exponential functions of generalized anti-symmetric σ-matrices and one-dimensional projectors. The specific form makes it considerably easy to identify and discard redundant parameters in several cases. In this way, redundancy-free density matrices of arbitrary rank k can be formulated. Our construction can also be used to derive an orthonormal basis of any k -dimensional subspaces of with the minimal number of parameters. As an example it is shown that this feature leads to a significant reduction of parameters in the case of investigating distillability of quantum states via lower bounds of an entanglement measure (the m -concurrence).

arXiv:1004.5252•Journal of Physics A Mathematical and Theoretical•Aug 17, 2010•53 citations

The Five Postulates of Quantum Mechanics on the Record: Theorems, Premises, and What Is Owed

Jonathan Washburn

Quantum mechanics is taught from five postulates: a state is a vector in a complex space; left alone it turns by a unitary step that an energy operator generates; a measurement returns an outcome with a probability equal to a squared length; the state afterwards is the part that matches the outcome; and two systems together live in the product of their spaces. The textbook does not say where the five come from. We read each of them as a statement about one object, the recognition ledger, a record of events that is written in postings and never erased, and we say for each how much of it is then a theorem. The guiding sentence is short: histories that leave no record add, and what is on the record is counted. The record's clock makes a complex unit. The tick of the eight-position register has no complete set of real stationary states, and on the states that four ticks reverse, two ticks square to minus one. For a law on a finite-dimensional space whose factors all lie above zero, the unitary step is fixed up to its unit: a linear rule for the step that uses only the law between two records, keeps every length, regroups and is continuous is exp(−icH) with H = −log T, where T is the law itself. The square follows, for reads of a register's positions, from two principal properties and three mild ones: a read that weighs each position by its own value and adds over positions, is silent on an empty position and is never less for a larger value, and whose total is blind to a common turn of the register, is the sum of squares. For reads along other splittings of a space the square is a hypothesis. Two acts can be read together exactly when they commute, and reading one first moves the other's weights by an amount we give in closed form, never more than one half. Where a crossing takes held states off the held part, a contact divides a held state into a part left exactly as it was and a part with one crossing applied, with squared lengths cos²θ and sin²θ; where it keeps them held, the contact reads one sign of the register and nothing else. Two blocks of one cube compose by the product, their acts commute, and their correlations have three ceilings, 2, 2√2 and 4, for acts that only read, acts that write, and tables that merely do not signal; the cube reaches 2√2 exactly. Each theorem is proved on the page from premises we name, and we say postulate by postulate what that gives. The second follows from four statements about a linear step. The third follows for reads of positions, given that a read is taken position by position, which is owed. For the first, the clock makes a complex unit with no premise, the one such unit that is a whole number of ticks; that states are complex rests on a premise about the clock that is close to the conclusion, that a held register is among the states the unit acts on is a working statement, and from the second postulate on the spaces are taken complex, as in the textbook. Of the fourth the algebra is proved; the weights and the state afterwards are the textbook's, and that one outcome occurs is owed. The fifth is proved for two blocks of one cube and owed for two laboratories, where published network experiments exclude a real product whose sources share nothing. Several of the theorems are known results of the textbook's own mathematics, and the ledger enters through what their objects are identified with. What is owed is named in four statements, and we say how exact each is. The paper closes with twelve paradoxes of quantum mechanics, from the double slit to Wigner's friend, each in three lines: the puzzle, what the record says, and what is owed. Eleven of the twelve wait on the same owed statement, and every number they return is the textbook's own.

•Nov 14, 2026•0 citations
The problem of reconstructing the phases of a unitary matrix with prescribed moduli is of a broad interest to people working in many applications, e.g in the circuit theory, phase shift analysis, multichannel scattering, computer science (e.g in the theory of error correcting codes, design theory). We propose efficient algorithms for computing Hermitian unitary matrices for given symmetric bistochastic matrices A(n × n) for n = 3 and n = 4. We mention also some results for matrices of arbitrary size n.
We present further properties of a previously proposed recursive scheme for parametrization of n-by-n unitary matrices. We show that the factors in the recursive formula may be introduced in any desired order. The method is used to study the invariant phases of unitary matrices. The case of four-by-four unitary matrices is investigated in detail. We also address the question of how to construct symmetric unitary matrices (i.e., unitary matrices U that satisfy the condition Uij=Uji) using the recursive approach.
Unitary transformations and density matrices are central objects in quantum physics and various tasks require to introduce them in a parameterized form. In this paper we present a parameterization of the unitary group of arbitrary dimension d which is constructed in a composite way. We show explicitly how any element of can be composed of matrix exponential functions of generalized anti-symmetric σ-matrices and one-dimensional projectors. The specific form makes it considerably easy to identify and discard redundant parameters in several cases. In this way, redundancy-free density matrices of arbitrary rank k can be formulated. Our construction can also be used to derive an orthonormal basis of any k -dimensional subspaces of with the minimal number of parameters. As an example it is shown that this feature leads to a significant reduction of parameters in the case of investigating distillability of quantum states via lower bounds of an entanglement measure (the m -concurrence).
Quantum mechanics is taught from five postulates: a state is a vector in a complex space; left alone it turns by a unitary step that an energy operator generates; a measurement returns an outcome with a probability equal to a squared length; the state afterwards is the part that matches the outcome; and two systems together live in the product of their spaces. The textbook does not say where the five come from. We read each of them as a statement about one object, the recognition ledger, a record of events that is written in postings and never erased, and we say for each how much of it is then a theorem. The guiding sentence is short: histories that leave no record add, and what is on the record is counted. The record's clock makes a complex unit. The tick of the eight-position register has no complete set of real stationary states, and on the states that four ticks reverse, two ticks square to minus one. For a law on a finite-dimensional space whose factors all lie above zero, the unitary step is fixed up to its unit: a linear rule for the step that uses only the law between two records, keeps every length, regroups and is continuous is exp(−icH) with H = −log T, where T is the law itself. The square follows, for reads of a register's positions, from two principal properties and three mild ones: a read that weighs each position by its own value and adds over positions, is silent on an empty position and is never less for a larger value, and whose total is blind to a common turn of the register, is the sum of squares. For reads along other splittings of a space the square is a hypothesis. Two acts can be read together exactly when they commute, and reading one first moves the other's weights by an amount we give in closed form, never more than one half. Where a crossing takes held states off the held part, a contact divides a held state into a part left exactly as it was and a part with one crossing applied, with squared lengths cos²θ and sin²θ; where it keeps them held, the contact reads one sign of the register and nothing else. Two blocks of one cube compose by the product, their acts commute, and their correlations have three ceilings, 2, 2√2 and 4, for acts that only read, acts that write, and tables that merely do not signal; the cube reaches 2√2 exactly. Each theorem is proved on the page from premises we name, and we say postulate by postulate what that gives. The second follows from four statements about a linear step. The third follows for reads of positions, given that a read is taken position by position, which is owed. For the first, the clock makes a complex unit with no premise, the one such unit that is a whole number of ticks; that states are complex rests on a premise about the clock that is close to the conclusion, that a held register is among the states the unit acts on is a working statement, and from the second postulate on the spaces are taken complex, as in the textbook. Of the fourth the algebra is proved; the weights and the state afterwards are the textbook's, and that one outcome occurs is owed. The fifth is proved for two blocks of one cube and owed for two laboratories, where published network experiments exclude a real product whose sources share nothing. Several of the theorems are known results of the textbook's own mathematics, and the ledger enters through what their objects are identified with. What is owed is named in four statements, and we say how exact each is. The paper closes with twelve paradoxes of quantum mechanics, from the double slit to Wigner's friend, each in three lines: the puzzle, what the record says, and what is owed. Eleven of the twelve wait on the same owed statement, and every number they return is the textbook's own.