Quantum annealing for neural network optimization problems: a new approach via tensor network simulations

DOI10.21468/scipostphys.14.5.117MaRDI QIDQ6593896

Giuseppe E. Santoro, Guglielmo Lami, M. Collura, Pietro Torta

Publication date: 27 August 2024

Published in: SciPost Physics (Search for Journal in Brave)

Mathematics Subject Classification ID

Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Communication, information (94Axx) Time-dependent statistical mechanics (dynamic and nonequilibrium) (82Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The density-matrix renormalization group in the age of matrix product states
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• The existence of persistent states in the brain
• Entropy landscape of solutions in the binary perceptron problem
• Quantum Computation and Quantum Information
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Many-body transverse interactions in the quantum annealing of thep-spin ferromagnet
• Efficiency of quantum vs. classical annealing in nonconvex learning problems
• Tensor Network Contractions
• Neural networks and physical systems with emergent collective computational abilities.
• Optimization using quantum mechanics: quantum annealing through adiabatic evolution

This page was built for publication: Quantum annealing for neural network optimization problems: a new approach via tensor network simulations