Explicit convergence rates for noncommutative SOS hierarchies on the Pauli algebra are bounded using smallest roots of Krawtchouk polynomials.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
quant-ph 4years
2026 4verdicts
UNVERDICTED 4representative citing papers
Hybrid Rydberg atom plus SDP algorithm achieves 0.651-approximation for quantum Max Cut, improving on the prior 0.614 SDP-only bound and remaining effective at 89% ground-state fidelity.
Any n-qubit QC Hamiltonian sparsifies to Õ(n/ε²) terms preserving all state energies within 1±ε using invariant subspace decomposition and the Alon-Kozma operator inequality.
Proves max eigenvalue of level-k Kikuchi graph Laplacian is at most m+k for any graph with m edges, confirming conjectures and giving 0.614 approx ratio for Quantum Max Cut.
citing papers explorer
-
Convergence rates of Sum-of-Hermitian-Squares Hierarchies for the Pauli algebra
Explicit convergence rates for noncommutative SOS hierarchies on the Pauli algebra are bounded using smallest roots of Krawtchouk polynomials.
-
A 0.651-approximation to quantum Max Cut via Rydberg atoms
Hybrid Rydberg atom plus SDP algorithm achieves 0.651-approximation for quantum Max Cut, improving on the prior 0.614 SDP-only bound and remaining effective at 89% ground-state fidelity.
-
Quantum Cut Sparsifiers
Any n-qubit QC Hamiltonian sparsifies to Õ(n/ε²) terms preserving all state energies within 1±ε using invariant subspace decomposition and the Alon-Kozma operator inequality.
-
Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
Proves max eigenvalue of level-k Kikuchi graph Laplacian is at most m+k for any graph with m edges, confirming conjectures and giving 0.614 approx ratio for Quantum Max Cut.