Boosting quantum annealer performance via sample persistence
From MaRDI portal
Abstract: We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer (or any sampler) to fix the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are usually much easier for the quantum annealer to solve, due to their being smaller and consisting of disconnected components. This approach significantly increases the success rate and number of observations of the best known energy value in samples obtained from the quantum annealer, when compared with calling the quantum annealer without using it, even when using fewer annealing cycles. Use of the method results in a considerable improvement in success metrics even for problems with high-precision couplers and biases, which are more challenging for the quantum annealer to solve. The results are further enhanced by applying the method iteratively and combining it with classical pre-processing. We present results for both Chimera graph-structured problems and embedded problems from a real-world application.
Recommendations
- Quantum Annealing via Path-Integral Monte Carlo With Data Augmentation
- An improved quantum annealing algorithm
- Quantum annealing of hard problems
- Dissipative quantum annealing
- A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
- Building an iterative heuristic solver for a quantum annealer
- Quantum annealing and related optimization methods
- scientific article; zbMATH DE number 5824031
Cites work
- scientific article; zbMATH DE number 1369843 (Why is no real title available?)
- Building an iterative heuristic solver for a quantum annealer
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Performance of two different quantum annealing correction codes
- Quantum versus classical annealing of Ising spin glasses
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Systematic and deterministic graph minor embedding for Cartesian products of graphs
- Tabu Search—Part I
- Tabu Search—Part II
- Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
Cited in
(8)- Performance of two different quantum annealing correction codes
- Template-Based Minor Embedding for Adiabatic Quantum Optimization
- A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
- Large-scale vehicle routing problems: quantum annealing, tunings and results
- Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis
- Building an iterative heuristic solver for a quantum annealer
- Practical integer-to-binary mapping for quantum annealers
- On post-processing the results of quantum optimizers
This page was built for publication: Boosting quantum annealer performance via sample persistence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1674555)
