Related papers: Defects in Quantum Computers
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this…
Motivated by recent experiments in which specific thermal properties of complex many-body systems were successfully reproduced on a commercially available quantum annealer, we examine the extent to which quantum annealing hardware can…
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a…
The success of adiabatic quantum computation (AQC) depends crucially on the ability to maintain the quantum computer in the ground state of the evolution Hamiltonian. The computation process has to be sufficiently slow as restricted by the…
We propose an experimental method for evaluating the adiabatic condition during quantum annealing (QA), which will be essential for solving practical problems. The adiabatic condition consists of the transition matrix element and the energy…
Quantum simulators have the potential to shed light on the study of quantum many-body systems and materials, offering unique insights into various quantum phenomena. While adiabatic evolution has been conventionally employed for state…
The quantum speed limit specifies a universal bound of the fidelity between the initial state and the time-evolved state. We apply this method to find a bound of the fidelity between the adiabatic state and the time-evolved state. The bound…
In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator…
Quantum annealing is getting increasing attention in combinatorial optimization. The quantum processing unit by D-Wave is constructed to approximately solve Ising models on so-called Chimera graphs. Ising models are equivalent to quadratic…
The purpose of the D-Wave adiabatic quantum computer is to find a set of qubit values that minimize its objective function. For various reasons, the set of qubit values returned by the D-Wave has errors. This paper presents a method of…
Noisy intermediate-scale quantum (NISQ) devices are spearheading the second quantum revolution. Of these, quantum annealers are the only ones currently offering real world, commercial applications on as many as 5000 qubits. The size of…
Adiabatic quantum computation (AQC) is a promising counterpart of universal quantum computation, based on the key concept of quantum annealing (QA). QA is claimed to be at the basis of commercial quantum computers and benefits from the fact…
Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of…
The evaluation of the performance of adiabatic annealers is hindered by lack of efficient algorithms for simulating their behaviour. We exploit the analyticity of the standard model for the adiabatic quantum process to develop an efficient…
State of the art quantum computing architectures are founded on the decision to use scalable but faulty quantum hardware in conjunction with an efficient error correcting code capable of tolerating high error rates. The promised effect of…
Quantum annealing in a real device is necessarily susceptible to errors due to diabatic transitions and thermal noise. Nested quantum annealing correction is a method to suppress errors by using an all-to-all penalty coupling among a set of…
Quantum annealing provides a promising route for the development of quantum optimization devices, but the usefulness of such devices will be limited in part by the range of implementable problems as dictated by hardware constraints. To…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
(Withdrawn) This work describes an efficient user-side method of calibrating and correcting quantum annealing computers. For quantum annealing computers based on the Ising model, the method measures the residual bias of the h and J…
Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…