Related papers: Adiabatic Quantum Counting by Geometric Phase Esti…
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both…
The adiabatic theorem is one of the most interesting and significant theorems in quantum mechanics. However, the adiabatic theorem can fail for general non-Hermitian quantum systems. In this paper, by utilizing the complex geometric phase,…
The second quantized approach to geometric phases is reviewed. The second quantization generally induces a hidden local (time-dependent) gauge symmetry. This gauge symmetry defines the parallel transport and holonomy, and thus it controls…
Digitized adiabatic quantum factorization is a hybrid algorithm that exploits the advantage of digitized quantum computers to implement efficient adiabatic algorithms for factorization through gate decompositions of analog evolutions. In…
We review the proposal of a quantum algorithm for Hilbert's tenth problem and provide further arguments towards the proof that: (i) the algorithm terminates after a finite time for any input of Diophantine equation; (ii) the final ground…
We analyze the performance of adiabatic quantum computation (AQC) under the effect of decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast…
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…
Many physically interesting models show a quantum phase transition when a single parameter is varied through a critical point, where the ground state and the first excited state become degenerate. When this parameter appears as a coupling…
Concepts from non-Hermitian quantum mechanics have proven useful in understanding and manipulating a variety of classical systems, such as those encountered in optics, classical mechanics, and metamaterial design. Recently, the…
Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised challenging questions about how to evaluate adiabatic quantum…
Adiabatic quantum computers are a promising platform for approximately solving challenging optimization problems. We present a quantum approach to solving the balanced $k$-means clustering training problem on the D-Wave 2000Q adiabatic…
Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition…
The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
We show how Berry phase can be used to construct an ultra-high precision quantum thermometer. An important advantage of our scheme is that there is no need for the thermometer to acquire thermal equilibrium with the sample. This reduces…
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing his challenge by using coherently controlled…
We outline an efficient quantum-adiabatic algorithm that solves Simon's problem, in which one has to determine the `period', or xor-mask, of a given black-box function. We show that the proposed algorithm is exponentially faster than its…
The two main approaches to quantum computing are gate-based computation and analog computation, which are polynomially equivalent in terms of complexity, and they are often seen as alternatives to each other. In this work, we present a…
The geometrical Berry phase is key to understanding the behaviour of quantum states under cyclic adiabatic evolution. When generalised to non-Hermitian systems with gain and loss, the Berry phase can become complex, and should modify not…
Treating a many-body Fermi system in terms of a single particle in a deforming mean field. We relate adiabatic geometric phase to susceptibility for the noncyclic case, and to its derivative for the cyclic case. Employing the semiclassical…