Showing quant-phShow all
2 papers · 1 filter
quant-ph2024
Iterative quantum optimization of spin glass problems with rapidly oscillating transverse fields
Brandon Barton, Jacob Sagal, Sean Feeney +5
In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimizati…
quant-ph2023
On the approximability of random-hypergraph MAX-3-XORSAT problems with quantum algorithms
Eliot Kapit, Brandon A. Barton, Sean Feeney +5
A canonical feature of the constraint satisfaction problems in NP is approximation hardness, where in the worst case, finding sufficient-quality approximate solutions is exponentia…