Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches
To date, a conclusive detection of quantum speedup remains elusive. Recently, a team by
Google Inc.[VS Denchev, Phys. Rev. X 6, 031015 (2016) 10.1103/PhysRevX. 6.031015] …
Google Inc.[VS Denchev, Phys. Rev. X 6, 031015 (2016) 10.1103/PhysRevX. 6.031015] …
Perspectives of quantum annealing: Methods and implementations
Quantum annealing is a computing paradigm that has the ambitious goal of efficiently
solving large-scale combinatorial optimization problems of practical importance. However …
solving large-scale combinatorial optimization problems of practical importance. However …
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
Computational quantum technologies are entering a new phase in which noisy intermediate-
scale quantum computers are available, but are still too small to benefit from active error …
scale quantum computers are available, but are still too small to benefit from active error …
Coherent SAT solvers: a tutorial
The coherent Ising machine (CIM) is designed to solve the NP-hard Ising problem quickly
and energy efficiently. Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are …
and energy efficiently. Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are …
What is the computational value of finite-range tunneling?
Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic
exploiting tunneling. Here, we demonstrate how finite-range tunneling can provide …
exploiting tunneling. Here, we demonstrate how finite-range tunneling can provide …
Defining and detecting quantum speedup
The development of small-scale quantum devices raises the question of how to fairly assess
and detect quantum speedup. Here, we show how to define and measure quantum speedup …
and detect quantum speedup. Here, we show how to define and measure quantum speedup …
Quantum optimization of fully connected spin glasses
Many NP-hard problems can be seen as the task of finding a ground state of a disordered
highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it …
highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it …
Computational multiqubit tunnelling in programmable quantum annealers
Quantum tunnelling is a phenomenon in which a quantum state traverses energy barriers
higher than the energy of the state itself. Quantum tunnelling has been hypothesized as an …
higher than the energy of the state itself. Quantum tunnelling has been hypothesized as an …
Error-corrected quantum annealing with hundreds of qubits
Quantum information processing offers dramatic speedups, yet is susceptible to
decoherence, whereby quantum superpositions decay into mutually exclusive classical …
decoherence, whereby quantum superpositions decay into mutually exclusive classical …
Adiabatic quantum simulation of quantum chemistry
We show how to apply the quantum adiabatic algorithm directly to the quantum computation
of molecular properties. We describe a procedure to map electronic structure Hamiltonians …
of molecular properties. We describe a procedure to map electronic structure Hamiltonians …