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

Foundations of Physics

Doubly stochastic matrices in quantum mechanics

James D. Louck

Published Aug 1, 1997• 24 citations
Publisher
DOI
10.1007/bf02551435

Related papers

Doubly Stochastic Matrices in Angular Momentum Theory

WORLD SCIENTIFIC eBooks•May 1, 2011•0 citations

Stochastic quantum dynamics

Jerzy Stryla

I propose to treat quantum evolution as a stochastic process consisting from a sequence of doubly stochastic matrices, which naturally arise in a generalized quantum evolution. Then it is proved that the law of non-decreasing entropy is fulfilled and that the law characterizes doubly stochastic matrices. An application of the model to support the generalized second law of black hole thermodynamics appears.

•Jan 1, 2002•0 citations

Stochastic model of quantum mechanics

Victor Yu. Podlipchuk

Theoretical and Mathematical Physics•Feb 1, 1990•3 citations

A quantum compiler design method by using linear combinations of permutations

Ammar Daskin

A matrix can be converted into a doubly stochastic matrix by using two diagonal matrices. And a doubly stochastic matrix can be written as a sum of permutation matrices. In this paper, we describe a method to write a given generic matrix in terms of quantum gates based on the block encoding. In particular, we first show how to convert a matrix into doubly stochastic matrices and by using Birkhoff's algorithm, we express that matrix in terms of a linear combination of permutations which can be mapped to quantum circuits. We then discuss a few optimization techniques that can be applied in a possibly future quantum compiler software based on the method described here.

arXiv:2404.18226•Apr 28, 2024•0 citations

Stochastic methods in quantum mechanics

Alladi Ramakrishnan, Nagarajan Ranganathan

Journal of Mathematical Analysis and Applications•Oct 1, 1961•6 citations

A mapping from the unitary to doubly stochastic matrices and symbols on a finite set

Alexander Karabegov, Piotr Kielanowski, Anatol Odzijewicz +2 more

We prove that the mapping from the unitary to doubly stochastic matrices that maps a unitary matrix (ukl) to the doubly stochastic matrix (|ukl|2) is a submersion at a generic unitary matrix. The proof uses the framework of operator symbols on a finite set.

arXiv:0806.2357•AIP conference proceedings•Jan 1, 2008•7 citations
A matrix can be converted into a doubly stochastic matrix by using two diagonal matrices. And a doubly stochastic matrix can be written as a sum of permutation matrices. In this paper, we describe a method to write a given generic matrix in terms of quantum gates based on the block encoding. In particular, we first show how to convert a matrix into doubly stochastic matrices and by using Birkhoff's algorithm, we express that matrix in terms of a linear combination of permutations which can be mapped to quantum circuits. We then discuss a few optimization techniques that can be applied in a possibly future quantum compiler software based on the method described here.