REVIEW 4 cited by
Solving Inequality-Constrained Binary Optimization Problems on Quantum Annealer
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 a new method for solving binary optimization problems under inequality constraints using a quantum annealer. To deal with inequality constraints, we often use slack variables, as in previous approaches. When we use slack variables, we usually conduct a binary expansion, which requires numerous physical qubits. Therefore, the problem of the current quantum annealer is limited to a small scale. In this study, we employ the alternating direction method of multipliers. This approach allows us to deal with various types using constraints in the current quantum annealer without slack variables. To test the performance of our algorithm, we use quadratic knapsack problems (QKPs). We compared the accuracy obtained by our method with a simulated annealer and the optimization and sampling mode of a D-Wave machine. As a result of our experiments, we found that the sampling mode shows the best accuracy. We also found that the computational time of our method is faster than that of the exact solver when we tackle various QKPs defined on dense graphs.
Forward citations
Cited by 4 Pith papers
-
Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform
A Walsh-Fourier least-squares projection of constraint penalties onto hardware-supported quadratic terms gives chain-free QUBO encodings that, on tested MDKP benchmarks, often beat full-pairwise projections and unbala...
-
Mixed-Binary Quadratic Programming via QUBO Sampling without Continuous-Variable Binarization
For separable mixed-binary quadratic programs, the continuous variables are integrated out analytically at fixed Lagrange multipliers, yielding a QUBO sampling formulation that avoids binarization and outperforms pena...
-
CVaR-Assisted Custom Penalty Function for Constrained Optimization
A slack-free step-penalty combined with CVaR tail sampling improves VQE optimality gaps on multi-dimensional knapsack benchmarks versus slack-based QUBO.
-
Demonstration of a Compatibility-Based Childcare Support Service using Quantum Annealing
A QUBO matching framework for a childcare support service shows quantum annealing finding more accurate and diverse solutions than simulated annealing on large synthetic instances, while a top-2 approximation cuts var...
Discussion (0). Sign in to comment.