Related papers: Partial Proof of a Conjecture with Implications for Spectral Majorization

Related papers

Autonomous disproofs of the sum-product conjecture over $\mathbb R$ with GPT-5.5 Pro [5.634825161148485]
We present a problem-agnostic, three-stage prompting pipeline built on GPT-5.5 Pro.<n>The agent autonomously generated correct proofs that the sum-product conjecture is false over $mathbb R$ in 7 of 8 independent trials.
arXiv Detail & Related papers (2026-07-09T23:28:37Z)
Combining moment matrices, symmetric extension, and Lovász theta: $Φ_{\ ext{E8}}$ is entangled [1.3999481573773072]
We show, via an entanglement witness, that the $14$-qubit state $_textE8$ is entangled.<n>Inspired by a method from quantum codes, we combine symmetric extension with moment matrices to prove that $_textE8$ is entangled.
arXiv Detail & Related papers (2026-05-13T17:54:51Z)
Statistical and computational challenges in ranking [53.03724383992195]
We consider the problem of ranking $n$ experts according to their abilities, based on the correctness of their answers to $d$ questions.<n>We investigate here the existence of statistically optimal and computationally efficient procedures for this problem.
arXiv Detail & Related papers (2025-12-24T11:18:06Z)
The tetrahedral Horn problem and asymptotics of U(n) 6j symbols [2.2633707287259868]
Horn's problem is concerned with characterizing the eigenvalues $(a,b,c,d,e,f)$ of Hermitian matrices $(A,B,C,D,E,F)$.<n>This paper aims to characterize the tetrashedra eigenvalues $(a,b,c,d,e,f)$ of Hermitian matrices $(A,B,C,D,E,F)$ forming the edges of a tetrahedron.
arXiv Detail & Related papers (2025-10-06T15:00:25Z)
Optimal level set estimation for non-parametric tournament and crowdsourcing problems [49.75262185577198]
Motivated by crowdsourcing, we consider a problem where we partially observe the correctness of the answers of $n$ experts on $d$ questions. In this paper, we assume that the matrix $M$ containing the probability that expert $i$ answers correctly to question $j$ is bi-isotonic up to a permutation of it rows and columns. We construct an efficient-time algorithm that turns out to be minimax optimal for this classification problem.
arXiv Detail & Related papers (2024-08-27T18:28:31Z)
Efficient Unitary T-designs from Random Sums [0.6640968473398456]
Unitary $T$-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. We provide a new construction of $T$-designs via random matrix theory using $tildeO(T2 n2)$ quantum gates.
arXiv Detail & Related papers (2024-02-14T17:32:30Z)
A generic quantum Wielandt's inequality [0.9975341265604578]
It is conjectured that $k$ should be of order $mathcalO(n2)$ in general. We provide a generic version of quantum Wielandt's inequality, which gives the optimal length with probability one. We shed new light on a long-standing open problem for Projected Entangled Pair State.
arXiv Detail & Related papers (2023-01-19T18:57:32Z)
Quantum and classical low-degree learning via a dimension-free Remez inequality [52.12931955662553]
We show a new way to relate functions on the hypergrid to their harmonic extensions over the polytorus. We show the supremum of a function $f$ over products of the cyclic group $exp(2pi i k/K)_k=1K$. We extend to new spaces a recent line of work citeEI22, CHP, VZ22 that gave similarly efficient methods for learning low-degrees on hypercubes and observables on qubits.
arXiv Detail & Related papers (2023-01-04T04:15:40Z)
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials [93.59919600451487]
"Statistical-computational gaps" occur in many statistical inference tasks. We consider a model for random order-3 decomposition where one component is slightly larger in norm than the rest. We show that tensor entries can accurately estimate the largest component when $ll n3/2$ but fail to do so when $rgg n3/2$.
arXiv Detail & Related papers (2022-11-10T00:40:37Z)
Near-optimal fitting of ellipsoids to random points [68.12685213894112]
A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
arXiv Detail & Related papers (2022-08-19T18:00:34Z)
Block-Circulant Complex Hadamard Matrices [0.0]
A new method of obtaining a sequence of isolated complex Hadamard matrices (CHM) for dimensions $Ngeqslant 7$ is presented. We discuss, several analytic examples resulting from a modification of the Sinkhorn algorithm.
arXiv Detail & Related papers (2022-04-25T15:33:26Z)
Permanent of random matrices from representation theory: moments, numerics, concentration, and comments on hardness of boson-sampling [0.0]
We study permanents of random i.i.d. complex Gaussian matrices and submatrices of random unitary matrices. Using a hybrid-theoretic and approach, we prove strong lower bounds for all moments of the permanent distribution. We show that our bounds are close to being tight and constitute accurate estimates for the moments.
arXiv Detail & Related papers (2021-04-13T18:00:06Z)
Algebraic and geometric structures inside the Birkhoff polytope [0.0]
Birkhoff polytope $mathcalB_d$ consists of all bistochastic matrices of order $d$. We prove that $mathcalL_d$ and $mathcalF_d$ are star-shaped with respect to the flat matrix.
arXiv Detail & Related papers (2021-01-27T09:51:24Z)
Linear-Sample Learning of Low-Rank Distributions [56.59844655107251]
We show that learning $ktimes k$, rank-$r$, matrices to normalized $L_1$ distance requires $Omega(frackrepsilon2)$ samples. We propose an algorithm that uses $cal O(frackrepsilon2log2fracepsilon)$ samples, a number linear in the high dimension, and nearly linear in the matrices, typically low, rank proofs.
arXiv Detail & Related papers (2020-09-30T19:10:32Z)
Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems [58.83118651518438]
We consider the general problem of learning about a matrix through vector-matrix-vector queries. These queries provide the value of $boldsymbolumathrmTboldsymbolMboldsymbolv$ over a fixed field. We provide new upper and lower bounds for a wide variety of problems, spanning linear algebra, statistics, and graphs.
arXiv Detail & Related papers (2020-06-24T19:33:49Z)
Supersymmetry of $\mathcal{PT}$- symmetric tridiagonal Hamiltonians [0.0]
We extend the study of supersymmetric tridiagonal Hamiltonians to the case of non-Hermitian Hamiltonians with real or complex eigenvalues. Besides its generality, the developed formalism in this work is a natural home for using the numerically powerful Gaussrature techniques.
arXiv Detail & Related papers (2020-06-16T22:18:25Z)
Robustly Learning any Clusterable Mixture of Gaussians [55.41573600814391]
We study the efficient learnability of high-dimensional Gaussian mixtures in the adversarial-robust setting. We provide an algorithm that learns the components of an $epsilon$-corrupted $k$-mixture within information theoretically near-optimal error proofs of $tildeO(epsilon)$. Our main technical contribution is a new robust identifiability proof clusters from a Gaussian mixture, which can be captured by the constant-degree Sum of Squares proof system.
arXiv Detail & Related papers (2020-05-13T16:44:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.