Boosting quantum annealer performance via sample persistence
From MaRDI portal
Publication:1674555
DOI10.1007/s11128-017-1615-xzbMath1373.81143arXiv1606.07797OpenAlexW3101049507MaRDI QIDQ1674555
Publication date: 25 October 2017
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.07797
quantum annealingvariable reductionadiabatic quantum computationbinary optimizationsample persistency
Related Items (2)
Template-Based Minor Embedding for Adiabatic Quantum Optimization ⋮ A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
Uses Software
Cites Work
- Unnamed Item
- Performance of two different quantum annealing correction codes
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
- Systematic and deterministic graph minor embedding for Cartesian products of graphs
- Building an iterative heuristic solver for a quantum annealer
- Quantum versus classical annealing of Ising spin glasses
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Tabu Search—Part I
- Tabu Search—Part II
This page was built for publication: Boosting quantum annealer performance via sample persistence
