REVIEW 4 cited by
Polynomial unconstrained binary optimisation inspired by optical simulation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We propose an algorithm inspired by optical coherent Ising machines to solve the problem of polynomial unconstrained binary optimization (PUBO). We benchmark the proposed algorithm against existing PUBO algorithms on the extended Sherrington-Kirkpatrick model and random third-degree polynomial pseudo-Boolean functions, and observe its superior performance. We also address instances of practically relevant computational problems such as protein folding and electronic structure calculations with problem sizes not accessible to existing quantum annealing devices. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approximating the electronic structure problem by a PUBO problem, which, in turn, puts into question the applicability of the unconstrained binary optimization formulation, such as that of quantum annealers and coherent Ising machines, in this context.
Forward citations
Cited by 4 Pith papers
-
Applying Grover-mixer quantum alternating operator ansatz algorithm to higher-order unconstrained binary optimization problems
Using a Grover mixer instead of a transverse-field mixer makes QAOA's ground-state success probability keep improving with depth on high-order binary optimization instances, and a Gaussian/EVT parameter heuristic come...
-
How to Incorporate Higher-order Interactions in Analog Ising Machines
On 3-SAT benchmarks, analog Ising machines with sign-based spin interactions outperform amplitude-rescaling methods in time-to-solution and success rate.
-
Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree-Fock Method
Hartree-Fock energy minimization is reformulated as a sequence of QUBO/MaxCut problems, with approximation guarantees at each step and demonstrations on OH- and N2.
-
Evaluating the Performance of Direct Higher-Order Formulations in Combinatorial Optimization Problems
Direct PUBO solving beat order-reduced QUBO solving on LABS and distance-balanced VRP benchmarks on the same annealing platform in fixed 60-second runs.
Discussion (0). Continue with ORCID to comment.