Practical integer-to-binary mapping for quantum annealers

@article{Karimi2019PracticalIM,
  title={Practical integer-to-binary mapping for quantum annealers},
  author={Sahar Karimi and Pooya Ronagh},
  journal={Quantum Information Processing},
  year={2019},
  volume={18},
  pages={1-24}
}
  • S. Karimi, Pooya Ronagh
  • Published 6 June 2017
  • Physics, Computer Science, Mathematics
  • Quantum Information Processing
Recent advancements in quantum annealing hardware and numerous studies in this area suggest that quantum annealers have the potential to be effective in solving unconstrained binary quadratic programming problems. Naturally, one may desire to expand the application domain of these machines to problems with general discrete variables. In this paper, we explore the possibility of employing quantum annealers to solve unconstrained quadratic programming problems over a bounded integer domain. We… 
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
TLDR
The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated and unary encoding shows the best performance for large-sized problems.
Error mitigation for variational quantum algorithms through mid-circuit measurements
Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of
Quantum Annealing for Industry Applications: Introduction and Review
Quantum annealing is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the
Calculating Nash equilibrium and Nash bargaining solution on quantum annealers
  • Faisal Shah Khan
  • Computer Science, Physics
    ArXiv
  • 2021
TLDR
It is shown that adding penalty terms to the quadratic function formulation of Nash equilibrium, and reducing the higher powers of the polynomial expression for the Nash bargaining problem, together with addition of penalty terms, gives QUBO formulation of these problems for execution on quantum annealers.
Least-squares solutions to polynomial systems of equations with quantum annealing
TLDR
The proposed methodology maps the squared-error function for a polynomial equation onto the Ising–Hamiltonian model, ensuring that the approximate solutions to real-world problems can be computed on a quantum annealer even when the exact solutions do not exist.

References

SHOWING 1-10 OF 27 REFERENCES
A subgradient approach for constrained binary programming via quantum adiabatic evolution
TLDR
A subgradient method for finding an optimal primaldual pair for the Lagrangian dual of a polynomially constrained binary polynomial programming problem and it is seen that this method applied to the QSS problem can be viewed as an instance-dependent penalty-term approach that avoids large penalty coefficients.
A subgradient approach for constrained binary optimization via quantum adiabatic evolution
TLDR
A subgradient method for finding an optimal primal–dual pair for the Lagrangian dual of a constrained binary polynomial programming problem is considered and it is seen that this method applied to the QSS problem can be viewed as an instance-dependent penalty-term approach that avoids large penalty coefficients.
Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
TLDR
This work proposes to complement head-to-head scaling studies that compare quantum annealing machines to state-of-the-art classical codes with an approach that compares the performance of different algorithms and/or computing architectures on different classes of computationally hard tunable spin-glass instances.
A case study in programming a quantum annealer for hard operational planning problems
TLDR
This is one of the first studies of a quantum annealer’s performance on parametrized families of hard problems from a practical domain, exploring two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and applying them to two parametrizated families of plans.
CORRIGENDUM: Optimization using quantum mechanics: quantum annealing through adiabatic evolution
We review here some recent work in the field of quantum annealing, alias adiabatic quantum computation. The idea of quantum annealing is to perform optimization by a quantum adiabatic evolution which
Adiabatic quantum computation
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing,
Experimental quantum annealing: case study involving the graph isomorphism problem
TLDR
An experimental case study of quantum annealing and some of the factors involved in real-world solvers, using a 504-qubit D-Wave Two machine and the graph isomorphism problem and the enhanced solver demonstrated clear advantages over the baseline approach.
Quantum versus classical annealing of Ising spin glasses
TLDR
The question of when quantum speedup may be expected is revisited and it is shown that the results depend on how the problem is described and how the optimization routine is implemented, which implies that care must be taken when using QMC simulations to assess the potential for quantum speed up.
Consistency tests of classical and quantum models for a quantum annealer
Recently the question of whether the D-Wave processors exhibit large-scale quantum behavior or can be described by a classical model has attracted significant interest. In this work we address this
Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities
Recent tests performed on the D-Wave Two quantum annealer have revealed no clear evidence of speedup over conventional silicon-based technologies. Here we present results from classical
...
1
2
3
...