Hyperoptimized approximate contraction of tensor networks for rugged-energy-landscape spin glasses on periodic square and cubic lattices
- 23 December 2024
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 110 (6) , 065306
Abstract
Obtaining the low-energy configurations of spin glasses that have rugged energy landscapes is of direct relevance to combinatorial optimization and fundamental science. Search-based heuristics have difficulty with this task due to the existence of many local minima that are far from optimal. The work of M. M. Rams et al. [Phys. Rev. E 104, 025308 (2021)2470-004510.1103/PhysRevE.104.025308] demonstrates an alternative that can bypass this issue for spin glasses with planar or quasiplanar geometry: sampling the Boltzmann distribution via approximate contractions of tensor networks. The computational complexity of this approach is due only to the complexity of contracting the network and is therefore independent of landscape ruggedness. Here we initiate an investigation of how to take this approach beyond (quasi-)planar geometry by utilizing hyperoptimized approximate contraction of tensor networks [J. Gray and G. K.-L. Chan, Phys. Rev. X 14, 011009 (2024)2160-330810.1103/PhysRevX.14.011009]. We perform tests on the periodic square- and cubic-lattice, planted-solution Ising spin glasses generated with tile planting [F. Hamze et al., Phys. Rev. E 97, 043303 (2018)2470-004510.1103/PhysRevE.97.043303] for up to 2304 (square lattice) and 216 (cubic lattice) spins. For a fixed bond dimension, the time complexity is quadratic. With a bond dimension of only four, over the tested system sizes, the average relative energy error in the most rugged instance class remains ∼1% (square lattice) or ∼10% (cubic lattice) of optimal. In less rugged instances the solution is always optimal for the square lattice and either optimal or within ∼1% for the cubic lattice. These results suggest that further development of optimization methods based on tensor-network representations of spin glass partition functions may be fruitful, especially given that such methods are not limited to the Ising (i.e., binary) or two-body (i.e., quadratic) settings.Keywords
All Related Versions
Funding Information
- U.S. Department of Energy
- Office of Science
- National Quantum Information Science Research Centers
- Quantum Systems Accelerator
This publication has 44 references indexed in Scilit:
- The quantum transition of the two-dimensional Ising spin glassNature, 2024
- Exploring Quantum Annealing Architectures: A Spin Glass PerspectiveAdvanced Quantum Technologies, 2024
- Quantum critical dynamics in a 5,000-qubit programmable spin glassNature, 2023
- Searching for spin glass ground states through deep reinforcement learningNature Communications, 2023
- Scaling advantage of chaotic amplitude control for high-performance combinatorial optimizationCommunications Physics, 2021
- Brute-forcing spin-glass problems with CUDAComputer Physics Communications, 2021
- Quantum approximate optimization of non-planar graph problems on a planar superconducting processorNature Physics, 2021
- Power-efficient combinatorial optimization using intrinsic noise in memristor Hopfield neural networksNature Electronics, 2020
- A practical introduction to tensor networks: Matrix product states and projected entangled pair statesAnnals of Physics, 2014
- Rigorous Inequalities Between Length and Time Scales in Glassy SystemsJournal of Statistical Physics, 2006