Explicit convergence rates for noncommutative SOS hierarchies on the Pauli algebra are bounded using smallest roots of Krawtchouk polynomials.
Scal- able Ground-State Certification of Quantum Spin Systems via Structured Noncommutative Polyno- mial Optimization
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.
A family of SDP-derived certified upper bounds converges to the bulk spectral gap, proving it semi-decidable for quantum lattice systems.
Moment relaxations with time-dependent differential constraints yield upper bounds on fidelities and lower bounds on optimal times for quantum control tasks including qubit gates and excitation transfer.
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.
-
The bulk spectral gap is semi-decidable: a convergent family of certified upper bounds
A family of SDP-derived certified upper bounds converges to the bulk spectral gap, proving it semi-decidable for quantum lattice systems.
-
Reachability and optimal-time certificates for quantum control
Moment relaxations with time-dependent differential constraints yield upper bounds on fidelities and lower bounds on optimal times for quantum control tasks including qubit gates and excitation transfer.