Related papers: Adiabatic Quantum Simulators
Quantum adiabatic processes -that keep constant the populations in the instantaneous eigenbasis of a time-dependent Hamiltonian- are very useful to prepare and manipulate states, but take typically a long time. This is often problematic…
We show that the quasi-adiabatic evolution of a system governed by the Dicke Hamiltonian can be described in terms of a self-induced quantum many-body metrological protocol. This effect relies on the sensitivity of the ground state to a…
Quantum computers are expected to help us to achieve accurate simulation of the dynamics of many-body quantum systems. However, the limitations of current NISQ devices prevents us from realising this goal today. Recently an algorithm for…
Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by…
A quantum simulator is a well controlled quantum system that can simulate the behavior of another quantum system which may require exponentially large classical computing resources to understand otherwise. In the 1980s, Feynman proposed the…
Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…
We review a scheme for the systematic design of quantum control protocols based on shortcuts to adiabaticity in few-level quantum systems. The adiabatic dynamics is accelerated by introducing high-frequency modulations in the control…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. The algorithm implements a Trotterized adiabatic evolution from a purely tight-binding Hamiltonian to one including kinetic,…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
Due to its geometric nature, holonomic quantum computation is fault-tolerant against certain types of control errors. Although proposed more than a decade ago, the experimental realization of holonomic quantum computation is still an open…
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…
The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in $1/T$, based on the lowest non-zero derivative of the…
We introduce a shortcut to the adiabatic gate teleportation model of quantum computation. More specifically, we determine fast local counterdiabatic Hamiltonians able to implement teleportation as a universal computational primitive. In…
In this article it will be introduced a new theorem, can be considered a generalization of Hellmann-Feynman theorem[1]. The latter used in conjunction with the quantization of the free energy[2] of a quantum system allows to derive…
We present a quantum algorithm for implementing $\phi^4$ lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the…
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links…
A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to…
Unitary quantum gates constitute the building blocks of Quantum Computing in the circuit paradigm. In this work, we engineer a locally driven two-qubit Hamiltonian whose instantaneous ground-state dynamics generates the controlled-NOT…
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…