23 problems
An almost Hadamard matrix in the complex sense is the notion introduced in the cited work, while a complex Hadamard matrix is a unitary matrix whose entries have equal modulus afte…
Diagonalizing sequence conjecture. For every , the sequences satisfy
Let denote a Haar-random unitary matrix, and let be a positive integer. Hunter-Jones's conjecture. The permanent moment satisfies … The source attributes thi…
Egan–Ó Catháin conjecture. Is it true that
Let be a rescaled unitary matrix. A strict almost Hadamard matrix, an isolated complex Hadamard matrix, and a complex Hadamard matrix with minimal AHM/CHM defect…
Let be the unitary group on a -dimensional Hilbert space, and call a unitary matrix chaotic when it has the property studied in the paper, namely maximal PVM-dyn…
Diagonal-unitary scaling conjecture. There exist diagonal unitary matrices such that is doubly quasistochastic.
Let denote the set of bipartite unitary operators whose associated quantum channels preserve tensor product algebras. The choice of the pattern matri…
Let be an positive semidefinite matrix. Marcus–Minc max-per-unitary conjecture. The maximum of … over all unitary matrices is attained when all diag…
Let be an arbitrary unitary matrix such that each line sum equals : … Let be the permutation matrices of dimension . De Vos–De Baerdemaecker conjec…
Let be a unitary matrix. A unitary diagonal matrix is a diagonal matrix whose diagonal entries have modulus , and a unitary doubly stochastic matrix is a unitary matrix whos…
Unitary near-invariance conjecture. An analogous near-invariance result should hold for arbitrary unitary matrices under this relaxed condition, with the exceptional matrices broad…
Let be generic, and consider its normal forms , where and are unitary diagonal matrices with and has all row and c…
Let be an unitary matrix. A matrix is doubly stochastic when all entries in each row and column sum to one, and a matrix is unitary diagonal when it is both diagona…
Convergence conjecture. The numerical algorithm converges to a unit line-sum matrix, that is, to a member of .
Numerical solvability conjecture. For every and every member of , the asymptotic scaling procedure provides a numerical solution.
Two-factor decomposition conjecture. Even the stronger bound should hold.
Global-minimum conjecture. The global minimum of the landscape is attained at a matrix with , and hence at a desired unit line-sum matrix.
Unitary matrix scaling conjecture. A similar procedure should allow, starting from any unitary matrix, finding a scaled matrix that is unitary and has all line sums equal to .
Near-Haar spectral-distribution conjecture. The spectral distributions of should be close to the corresponding Haar-unitary spectral distributions when is distributed s…
Let be a unitary matrix with a fixed Kronecker product structure, meaning that the sequence of sizes of its Kronecker factors is fixed up to order. In either of the two cases c…
Edge convergence conjecture. The largest and smallest eigenvalues converge to the edge of the limiting support.
Let and be fixed, let be fixed vectors, and let vary over unitary matrices. Write for the associated variety and let…