Modernizing Quantum Annealing using Local Searches

@article{Chancellor2016ModernizingQA,
  title={Modernizing Quantum Annealing using Local Searches},
  author={N. Chancellor},
  journal={arXiv: Quantum Physics},
  year={2016}
}
I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm. Such protocols will have numerous advantages over simple quantum annealing. By using such searches the effect of problem mis-specification can be reduced, as only energy differences between the searched states will be relevant. The quantum annealing algorithm is an analogue of simulated… Expand

Figures from this paper

An Overview of Approaches to Modernize Quantum Annealing Using Local Searches
TLDR
This work explores strategies to use an annealer in a way which takes advantage of modern classical optimization algorithms, and additionally should be less sensitive to problem mis-specification then the traditional quantum annealing algorithm. Expand
Modernizing Quantum Annealing II: Genetic algorithms with the Inference Primitive Formalism
Quantum annealing allows for quantum fluctuations to be used used to assist in finding the solution to some of the worlds most challenging computational problems. Recently, this field has attractedExpand
Analog errors in quantum annealing: doom and hope
TLDR
It is shown that J-chaos causes a catastrophic failure of quantum annealing, in that the scaling of the time-to-solution metric becomes worse than that of a deterministic (exhaustive) classical solver, and this doomsday scenario can be mitigated using a simple error suppression and correction scheme known as QAC. Expand
An experimental test of search range in quantum annealing
We construct an Ising Hamiltonian with an engineered energy landscape such that it has a local energy minimum which is near to the true global minimum solution, and further away from a false minimum.Expand
Search range in experimental quantum annealing
We construct an Ising Hamiltonian with an engineered energy landscape such that it has a local energy minimum which is near to the true global minimum solution, and further away from a false minimum.Expand
Readiness of Quantum Optimization Machines for Industrial Applications
TLDR
Although the results show that transverse-field quantum annealing is outperformed by state-of-the-art classical optimization algorithms, these benchmark instances are hard and small in the size of the input, therefore representing the first industrial application ideally suited for testing near-term Quantum annealers and other quantum algorithmic strategies for optimization problems. Expand
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing
TLDR
A hybrid paradigm for quantum annealers is proposed with the goal of mitigating a different limitation of such devices: the need to embed problem instances within the (often highly restricted) connectivity graph of the annealer. Expand
Domain wall encoding of integer variables for quantum annealing and QAOA
In this paper I propose a new method of encoding integer variables into Ising model qubits for quantum optimization. The new method is based on the physics of domain walls in one dimensional IsingExpand
Efficient Population Transfer via Non-Ergodic Extended States in Quantum Spin Glass
We analyze a new computational role of coherent multi-qubit quantum tunneling that gives rise to bands of non-ergodic extended (NEE) quantum states each formed by a superposition of a large number ofExpand
Domain wall encoding of discrete variables for quantum annealing and QAOA.
In this paper I propose a new method of encoding discrete variables into Ising model qubits for quantum optimization. The new method is based on the physics of domain walls in one dimensional IsingExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 82 REFERENCES
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. Expand
What is the Computational Value of Finite Range Tunneling
TLDR
It is demonstrated how finite range tunneling can provide considerable computational advantage over classical processors for a crafted problem designed to have tall and narrow energy barriers separating local minima, the D-Wave 2X quantum annealer achieves significant runtime advantages relative to Simulated Annealing. Expand
Thermally assisted quantum annealing of a 16-qubit problem.
TLDR
It is experimentally demonstrated that, even with annealing times eight orders of magnitude longer than the predicted single-qubit decoherence time, the probabilities of performing a successful computation are similar to those expected for a fully coherent system. Expand
Quantum annealing with manufactured spins
TLDR
This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems. Expand
Adiabatic quantum optimization with the wrong Hamiltonian
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians.Expand
Defining and detecting quantum speedup
TLDR
Here, it is shown how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup, and the subtle nature of the quantum speed up question is illustrated. Expand
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
TLDR
For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems. Expand
Computational multiqubit tunnelling in programmable quantum annealers
TLDR
It is shown that 8-qubit tunnelling plays a computational role in a currently available programmable quantum annealer, and a nonperturbative theory of open quantum dynamics under realistic noise characteristics is developed that accurately predicts the rate of many-body dissipative quantum Tunnelling subject to the polaron effect. Expand
Computational Role of Multiqubit Tunneling in a Quantum Annealer
Quantum tunneling, a phenomenon in which a quantum state traverses energy barriers above the energy of the state itself, has been hypothesized as an advantageous physical resource for optimization.Expand
Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model
Quantum annealing was recently found experimentally in a disordered spin- magnet to be more effective than its classical, thermal counterpart. We use the random two-dimensional Ising model as a testExpand
...
1
2
3
4
5
...