Quantum glassiness from efficient learning

DOI10.1007/S00220-025-05536-7MaRDI QIDQ6866627zbMATH OpenFDO

Authors Eric R. Anschuetz

Publication date 28 January 2026

Published in Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00220-025-05536-7

zbMATH Keywords

efficient learningoverlap gap propertyspin glasses

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68) Open systems, reduced dynamics, master equations, decoherence (81S22) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)

Cites work

• A geometric approach to quantum circuit lower bounds
• Algorithmic obstructions in the random number partitioning problem
• Algorithms and barriers in the symmetric binary perceptron model
• An invariant of topologically ordered states under local unitary transformations
• Complexity classification of local Hamiltonian problems
• Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations
• Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
• Limits of local algorithms over sparse random graphs
• Matrix concentration inequalities and free probability
• On multivariate Gaussian tails
• Optimizing strongly interacting fermionic Hamiltonians
• Performance of sequential local algorithms for the random NAE-K-SAT problem
• Quantum computation and quantum information. 10th anniversary edition
• The maximum degree of a random graph
• The Quantum Wasserstein Distance of Order 1

This page was built for publication: Quantum glassiness from efficient learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866627)