Ising Machines for Diophantine Problems in Physics

DOI10.1002/prop.202200114arXiv2206.09956WikidataQ114234898 ScholiaQ114234898MaRDI QIDQ6091893

Unnamed Author, Steven A. Abel

Publication date: 21 November 2023

Published in: Fortschritte der Physik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.09956

zbMATH Keywords

simulated annealingquantum annealinganomaly cancellationDiophantine equations in physics

Mathematics Subject Classification ID

Quantum theory (81-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm
• Pseudo-Boolean optimization
• Computational complexity of the landscape. I.
• Data science applications to string theory
• Finding numerical solutions of Diophantine equations using ant colony optimization
• Resource efficient gadgets for compiling adiabatic quantum optimization problems
• Colloquium: Quantum annealing and analog quantum computation
• Anomaly-free sets of fermions
• Computational complexities of diophantine equations with parameters
• A Greedy Heuristic for the Set-Covering Problem
• Heterotic String Model Building with Monad Bundles and Reinforcement Learning

This page was built for publication: Ising Machines for Diophantine Problems in Physics