Scaling a Unitary Matrix

DOI10.1142/S1230161214500139zbMath1306.65198arXiv1401.7883OpenAlexW3106084612MaRDI QIDQ2938191

Alexis De Vos, Stijn De Baerdemacker

Publication date: 14 January 2015

Published in: Open Systems & Information Dynamics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.7883

zbMATH Keywords

algorithmunitary matrixscaled matrix

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12) Orthogonal matrices (15B10)

Related Items

The Birkhoff theorem for unitary matrices of arbitrary dimensions ⋮ Conjectured \textit{DXZ} decompositions of a unitary matrix ⋮ The Birkhoff theorem for unitary matrices of prime dimension ⋮ On biunimodular vectors for unitary matrices ⋮ Constructive quantum scaling of unitary matrices ⋮ Sinkhorn normal form for unitary matrices ⋮ A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits ⋮ Reversible computation in integrated photonics

Cites Work

• An NP-hardness result for nonlinear systems
• Birkhoff's polytope and unistochastic matrices, \(N=3\) and \(N=4\)
• The Group of Dyadic Unitary Matrices
• Quantum computing and hidden variables
• A Concise Guide to Complex Hadamard Matrices
• A recursive parametrization of unitary matrices
• Recursive parametrization and invariant phases of unitary matrices
• Random bistochastic matrices
• Composed ensembles of random unitary matrices
• The NEGATOR as a Basic Building Block for Quantum Circuits
• A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
• ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS
• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

This page was built for publication: Scaling a Unitary Matrix