Quantum annealing for industry applications: Introduction and review
Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to
solve combinatorial optimization problems. In recent years, advances in quantum …
solve combinatorial optimization problems. In recent years, advances in quantum …
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 …
Observation of topological phenomena in a programmable lattice of 1,800 qubits
Abstract The work of Berezinskii, Kosterlitz and Thouless in the 1970s, revealed exotic
phases of matter governed by the topological properties of low-dimensional materials such …
phases of matter governed by the topological properties of low-dimensional materials such …
Digitized counterdiabatic quantum optimization
We propose digitized-counterdiabatic quantum optimization (DCQO) to achieve polynomial
enhancement over adiabatic quantum optimization for the general Ising spin-glass model …
enhancement over adiabatic quantum optimization for the general Ising spin-glass model …
Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization
Classical optimization problems can be solved by adiabatically preparing the ground state of
a quantum Hamiltonian that encodes the problem. The performance of this approach is …
a quantum Hamiltonian that encodes the problem. The performance of this approach is …
Reverse annealing for the fully connected -spin model
Reverse annealing is a variant of quantum annealing that starts from a given classical
configuration of spins (qubits). In contrast to the conventional formulation, where one starts …
configuration of spins (qubits). In contrast to the conventional formulation, where one starts …
Counterdiabaticity and the quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) is a near-term hybrid algorithm
intended to solve combinatorial optimization problems, such as MaxCut. QAOA can be made …
intended to solve combinatorial optimization problems, such as MaxCut. QAOA can be made …
Analog errors in quantum annealing: doom and hope
Quantum annealing has the potential to provide a speedup over classical algorithms in
solving optimization problems. Just as for any other quantum device, suppressing …
solving optimization problems. Just as for any other quantum device, suppressing …