相关论文: Noise amplification at spin-glass bottlenecks of q…
Quantum phenomena have the potential to speed up the solution of hard optimization problems. For example quantum annealing, based on the quantum tunneling effect, has recently been shown to scale exponentially better with system size as…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
Recent developments in quantum annealing techniques have been indicating potential advantage of quantum annealing for solving NP-hard optimization problems. In this article we briefly indicate and discuss the beneficial features of quantum…
Quantum annealing offers a promising strategy for solving complex optimization problems by encoding the solution into the ground state of a problem Hamiltonian. While most implementations rely on spin-$1/2$ systems, we explore the…
Quantum computing has the potential for disruptive change in many sectors of industry, especially in materials science and optimization. In this paper, we describe how the Turbine Balancing Problem can be solved with quantum computing,…
Quantum annealing is analogous to simulated annealing with a tunneling mechanism substituting for thermal activation. Its performance has been tested in numerical simulation with mixed conclusions. There is a class of optimization problems…
Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and…
Quantum tunneling is a phenomenon in which a quantum state traverses energy barriers above the energy of the state itself. Tunneling has been hypothesized as an advantageous physical resource for optimization. Here we present the first…
Although quantum annealing is usually considered as a method for locating the ground states of difficult spin-glass and optimization problems, its use in approximate optimization -- finding low- but not zero-energy states in a reasonably…
There has been considerable progress in the design and construction of quantum annealing devices. However, a conclusive detection of quantum speedup over traditional silicon-based machines remains elusive, despite multiple careful studies.…
Noise can be considered the natural enemy of quantum information. An often implied benefit of high-dimensional entanglement is its increased resilience to noise. However, manifesting this potential in an experimentally meaningful fashion is…
We analyze the complexity of classically simulating continuous-time dynamics of locally interacting quantum spin systems with a constant rate of entanglement breaking noise. We prove that a polynomial time classical algorithm can be used to…
In this paper, we explore the potential for quantum annealing to solve realistic routing problems. We focus on two NP-Hard problems, including the Traveling Salesman Problem with Time Windows and the Capacitated Vehicle Routing Problem with…
Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic exploiting tunneling. Here, we demonstrate how finite range tunneling can provide considerable computational advantage. For a crafted problem designed to…
Whether noisy quantum devices without error correction can provide quantum advantage over classical computers is a critical issue of current quantum computation. In this work, the random quantum circuits, which are used as the paradigm…
Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after…
We find that reinforcement exponentially reduces computation time of the quantum search problem from $\sqrt{D}$ to $\ln D$ in a $D$-dimensional system. Therefor, a reinforced quantum search is expected to exhibit an exponentially larger…
Quantum annealing is an innovative idea and method for avoiding the increase of the calculation cost of the combinatorial optimization problem. Since the combinatorial optimization problems are ubiquitous, quantum annealing machine with…
To date, a conclusive detection of quantum speedup remains elusive. Recently, a team by Google Inc.~[V.~S.~Denchev {\em et al}., Phys.~Rev.~X {\bf 6}, 031015 (2016)] proposed a weak-strong cluster model tailored to have tall and narrow…
The greatest challenge in achieving the high level of control needed for future technologies based on coherent quantum systems is the decoherence induced by the environment. Here, we present an analytical approach that yields explicit…