Unistochastic Embedding

• Unistochastic embedding is a framework where bistochastic matrices are expressed as the squared moduli of unitary or orthogonal matrices, linking unitary symmetries with quantum and classical channels.
• It employs techniques like Stinespring dilation and Cartan decomposition to construct explicit embeddings for quantum channels, including those with Markovian dynamics and Pauli semigroups.
• This concept has practical applications in quantum channel theory, frame theory, and matrix polytope geometry, utilizing structures like robust Hadamard matrices and equiangular tight frames.

A unistochastic embedding refers to the realization or parametrization of certain linear maps—typically quantum channels or bistochastic matrices—as arising from the modulus-squared of a unitary (or orthogonal) matrix, often via a dilation involving coupling to an environment in a canonical (maximally mixed) state. This concept serves as a bridge between unitary symmetries, quantum dynamics, and the geometry of classical or quantum channels. It is central to understanding the structure of quantum Markovian dynamics, the geometry of the Birkhoff polytope, and constructions in frame theory.

1. Definition and General Framework

A bistochastic (or doubly stochastic) matrix $B\in \mathbb{R}^{n\times n}$—a non-negative matrix with every row and column summing to 1—is called unistochastic if there exists a unitary $U\in U(n)$ such that $B_{ij}=|U_{ij}|^2$ for all $i,j$. If $U$ is additionally real orthogonal, $B$ is termed orthostochastic (Rajchel-Mieldzioć et al., 2018). For quantum channels, a linear map $\Phi$ is unistochastic if it admits a Stinespring dilation of the form

$$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$

where $U$ is a unitary on $S\otimes E$ and $U\in U(n)$0 is the maximally mixed environment state. This construction guarantees complete positivity and trace preservation by design (Musz et al., 2012, Puchała et al., 2019).

In higher dimensions, the concept generalizes to $U\in U(n)$1-unistochastic and $U\in U(n)$2-orthostochastic matrices: $U\in U(n)$3 is $U\in U(n)$4-unistochastic if it arises from an isometry of degree $U\in U(n)$5, i.e., assigning to each entry a non-negative squared norm of a vector in $U\in U(n)$6 subject to orthonormality constraints (Gutkin, 2013).

2. Unistochastic Embedding for Pauli Semigroups

In the context of quantum channels for a single qubit, any unital channel unitarily equivalent to a Pauli-diagonal form

$U\in U(n)$7

can be analyzed geometrically as a point inside a tetrahedron in $U\in U(n)$8 space (Puchała et al., 2019). The Pauli semigroup consists of those channels admitting a Lindblad-type semigroup structure $U\in U(n)$9, corresponding to divisible Markovian dynamics.

For any such channel, if the eigenvalues $B_{ij}=|U_{ij}|^2$0 of the superoperator's unital block satisfy $B_{ij}=|U_{ij}|^2$1 and $B_{ij}=|U_{ij}|^2$2 (for all distinct $B_{ij}=|U_{ij}|^2$3), then the channel is Markovian and admits a unistochastic embedding:

• One constructs parameters $B_{ij}=|U_{ij}|^2$4 and assembles the "Cartan" unitary

$B_{ij}=|U_{ij}|^2$5

• The quantum channel is then given by partial tracing over an environment qubit in the maximally mixed state:

$B_{ij}=|U_{ij}|^2$6

This construction is necessary and sufficient for the class of Markovian qubit Pauli channels, yielding a complete unistochastic embedding for the semigroup structure (Musz et al., 2012, Puchała et al., 2019).

3. Geometry and Structure of Unistochastic Sets

For $B_{ij}=|U_{ij}|^2$7 or $B_{ij}=|U_{ij}|^2$8, all bistochastic matrices are unistochastic, i.e., $B_{ij}=|U_{ij}|^2$9 for $i,j$0 (Gutkin, 2013). For $i,j$1, unistochastic matrices form a strict subset of the Birkhoff polytope $i,j$2. The geometry is highly nontrivial: for qubit channels, the unistochastic subset is a non-convex, star-shaped domain within the CP (completely positive) tetrahedron, characterized by curved boundaries corresponding to "parabolic–hyperboloid" inequalities among the channel parameters (Musz et al., 2012).

In the Birkhoff polytope of all bistochastic matrices, certain rays joining the center matrix $i,j$3 (all entries $i,j$4) to permutation matrices $i,j$5 are always unistochastic in even dimensions admitting robust (skew) Hadamard matrices. For any such $i,j$6, the entire segment $i,j$7 is unistochastic, with an explicit unitary $i,j$8 constructed from the associated robust Hadamard matrix $i,j$9 (Rajchel-Mieldzioć et al., 2018).

Object	Set Membership	Reference
$U$0 bistochastic $U$1	$U$2	(Gutkin, 2013)
Ray $U$3 with robust $U$4	Unistochastic for all $U$5	(Rajchel-Mieldzioć et al., 2018)
Pauli semigroup channel	Unistochastic iff semigroup (Markov)	(Puchała et al., 2019)

4. Explicit Constructions and Embedding Techniques

Pauli Channels: The explicit recipe for constructing the dilating unitary proceeds via Cartan decomposition, as detailed above. The unistochastic realization is determined entirely by the spectrum of the channel, allowing reconstruction of the underlying unitary (Musz et al., 2012, Puchała et al., 2019).

Birkhoff Polytope Rays: When a robust Hadamard matrix $U$6 of order $U$7 exists, the interpolation $U$8 for parameters $U$9 and $B$0 defined by $B$1 yields a unitary such that $B$2 realizes $B$3. Orthogonality/unitarity follows from the extremality of 2$B$42 minors of $B$5, and the construction is uniform across all even $B$6 with known robust Hadamard matrices (Rajchel-Mieldzioć et al., 2018).

d-Unistochastic Matrices: For general $B$7 and $B$8, the vector model characterizes $B$9-unistochastic matrices as norms of $\Phi$0 isometries $\Phi$1 of degree $\Phi$2, with each column orthonormal and squared norm $\Phi$3. Surjectivity of the squared-norm map $\Phi$4 is guaranteed for $\Phi$5; for small $\Phi$6, lower $\Phi$7 suffices, with $\Phi$8 (Gutkin, 2013).

Equiangular Tight Frames (ETFs): A complex ETF($\Phi$9) exists if and only if the corresponding bistochastic matrix $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$0 with $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$1, $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$2 for $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$3 is unistochastic. An explicit Hermitian unitary $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$4 is constructed from the ETF Gram matrix and spectrum, enabling one to retrieve the frame vectors via Cholesky or SVD decomposition (Goyeneche et al., 2016).

5. Applications and Connections

Quantum Channel Theory: Unistochastic embedding provides algorithmic protocols for constructing environmental dilations with maximally mixed ancillary states, crucial for quantum information tasks involving Markovian evolution and channel tomography (Puchała et al., 2019, Musz et al., 2012).

Matrix Polytope Geometry: Classifying which points and rays in $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$5 are unistochastic links deeply to the theory of Hadamard matrices and combinatorial designs. The existence and structure of robust Hadamard matrices dictate the reach of explicit unistochastic embeddings along central rays (Rajchel-Mieldzioć et al., 2018). Theoretical results also give dimensional bounds for general $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$6-unistochastic and $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$7-orthostochastic sets (Gutkin, 2013).

Frame Theory and Quantum Measurement: Unistochastic embeddings underpin the construction of equiangular tight frames, widely used in signal processing, quantum state tomography, and for constructing symmetric POVMs in quantum information. The ETF–unistochastic matrix correspondence enables the systematic construction and deformation of tight frames parameterized by equivalence classes of unitary matrices (Goyeneche et al., 2016).

6. Open Questions and Outlook

The detailed characterization of unistochastic matrices beyond $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$8 remains incomplete. For rays not passing through the center of $$\Phi(\rho) = \mathrm{Tr}_E\big[U(\rho \otimes I_E/N)U^\dagger\big],$$9, unistochasticity may fail due to chain inequalities, and a general algorithmic certificate for unistochasticity in arbitrary bistochastic matrices is lacking for $U$0 (Rajchel-Mieldzioć et al., 2018). In higher dimensions, the necessary and sufficient spectral (or structural) conditions on quantum channels for unistochastic embedding as dynamical semigroups are unknown (Puchała et al., 2019).

For $U$1-unistochastic matrices, determining the minimal $U$2 for full coverage of $U$3 is open; plausible implications are that $U$4 for large $U$5, but this is unproven (Gutkin, 2013). The geometric and volumetric properties of the unistochastic set, especially under various symmetry constraints, are the subject of ongoing research. The ETF construction via unistochastic embedding prompts further exploration of parametrized families, entanglement properties, and extremal tightness bounds in both real and complex settings (Goyeneche et al., 2016).

7. Numerical and Algorithmic Methods

Computing a unitary $U$6 realizing a given bistochastic $U$7 as $U$8 is inherently nonconvex. For certain classes (e.g., rays from the center with robust Hadamard matrices, or ETF-derived bistochastic matrices), explicit formulas are available (Rajchel-Mieldzioć et al., 2018, Goyeneche et al., 2016). More generally, iterative algorithms alternate enforcing modulus constraints and orthogonality (using, e.g., Gram–Schmidt or QR factorization), with convergence only when $U$9 is genuinely unistochastic (Goyeneche et al., 2016).

The presence or absence of convergence yields a practical check on unistochasticity, and parameter deformations via ER-pairs (equivalent-to-real pairs of columns/rows) enable exploration of continuous families of unistochastic embeddings, particularly for applications to frame theory and symmetric POVMs (Goyeneche et al., 2016).

The development of efficient certification and construction algorithms for general unistochastic embeddings, including analysis of the failure modes connected to matrix polytope geometry, continues to be of central algorithmic and theoretical interest.