Quantum Optimization Heuristics with an Application to Knapsack Problems

@article{Dam2021QuantumOH,
  title={Quantum Optimization Heuristics with an Application to Knapsack Problems},
  author={Wim van Dam and Karim M. El Defrawy and Nicholas Genise and Natalie Parham},
  journal={2021 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  year={2021},
  pages={160-170}
}
This paper introduces two techniques that make the standard Quantum Approximate Optimization Algorithm (QAOA) more suitable for constrained optimization problems. The first technique describes how to use the outcome of a prior greedy classical algorithm to define an initial quantum state and mixing operation to adjust the quantum optimization algorithm to explore the possible answers around this initial greedy solution. The second technique is used to nudge the quantum exploration to avoid the… 
View on IEEE
arxiv.org
5 Citations
Background Citations
1
Methods Citations
1

5 Citations

Quantum Computing Techniques for Multi-Knapsack Problems

,

OpenQAOA -- An SDK for QAOA

OpenQAOA is designed to simplify and enhance research on QAOA, providing a robust and consistent framework for experimentation with, and deployment of, the algorithm and its variations.

Classically-Boosted Quantum Optimization Algorithm

The Classically-Boosted Quantum Optimization Algorithm (CBQOA) is proposed that can solve a wide range of combinatorial optimization problems, including all unconstrained problems and many important constrained problems such as Max Bisection, Maximum Independent Set, Minimum Vertex Cover, Portfolio Optimization, Traveling Salesperson and so on.

Authenticity, Integrity, and Replay Protection in Quantum Data Communications and Networking

This work proposes a solution to protect the authenticity, integrity, and replay of quantum data communications and describes how classical keying material can be mapped to quantum operators, which enables classical key management techniques for secure quantum data Communications.

Markov chain Monte Carlo enhanced variational quantum algorithms

This work devise a Metropolis–Hastings method that is suitable for variational quantum devices and use it, in conjunction with quantum optimization, to construct quantum ensembles that converge to Gibbs states, allowing the former to provably converge to global minima and thus assure solution quality.

References

SHOWING 1-10 OF 12 REFERENCES

Warm-starting quantum optimization

Results indicate that warm-starting the Quantum Approximate Optimization Algorithm (QAOA) is particularly beneficial at low depth, and it is straightforward to apply the same ideas to other randomized-rounding schemes and optimization problems.

Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation

We propose GM-QAOA, a variation of the Quantum Alternating Operator Ansatz (QAOA) that uses Grover-like selective phase shift mixing operators. GM-QAOA works on any NP optimization problem for which…

XY mixers: Analytical and numerical results for the quantum alternating operator ansatz

This paper explores strategies for enforcing hard constraints by using $XY$ Hamiltonians as mixing operators (mixers) and demonstrates that, for an integer variable admitting $\ensuremath{\kappa}$ discrete values represented through one-hot encoding, certain classes of the mixer Hamiltonian can be implemented without Trotter error in depth.

Bivariate Exponential Distributions

Abstract A bivariate distribution is not determined by the knowledge of the margins. Two bivariate distributions with exponential margins are analyzed and another is briefly mentioned. In the first…

The performance of some correlation coefficients for a general bivariate distribution

Association between two variables has in the past been measured or tested by several coefficients, among them (i) Product moment correlation coefficient. (ii) Spearman's rank correlation coefficient.…

Finding Exponential Product Formulas of Higher Orders

This article is based on a talk presented at a conference “Quantum Annealing and Other Optimization Methods” held at Kolkata, India on March 2–5, 2005. It will be published in the proceedings…

From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter.

Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems

  • F. Glover
  • Computer Science
    Eur. J. Oper. Res.
  • 2013

A Quantum Approximate Optimization Algorithm

A quantum algorithm that produces approximate solutions for combinatorial optimization problems that depends on a positive integer p and the quality of the approximation improves as p is increased, and is studied as applied to MaxCut on regular graphs.

Optimal Allocation of Filters against DDoS Attacks

The results demonstrate that efficient filter allocation significantly improves the tradeoff between the number of filters used and the amount of legitimate traffic preserved.