Related papers: Staying adiabatic with unknown energy gap
We discuss the energetic cost of superadiabatic models of quantum computation. Specifically, we investigate the energy-time complementarity in general transitionless controlled evolutions and in shortcuts to the adiabatic quantum search…
The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle of quantum annealing, which implies that a carefully controlled energy solution is optimal and…
The challenge in building high-fidelity quantum gates lies in overcoming control errors and decoherence effects caused by the coupling between the quantum system and the external environment. Nonadiabatic holonomic quantum computation uses…
We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…
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…
It is generally believed that a generic system can be reversibly transformed from one state into another by sufficiently slow change of parameters. A standard argument favoring this assertion is based on a possibility to expand the energy…
We investigate the non-adiabatic implementation of an adiabatic quantum teleportation protocol, finding that perfect fidelity can be achieved through resonance. We clarify the physical mechanisms of teleportation, for three qubits, by…
In adiabatic quantum computing finding the dependence of the gap of the Hamiltonian as a function of the parameter varied during the adiabatic sweep is crucial in order to optimize the speed of the computation. Inspired by this challenge,…
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…
We establish the connection between the standard ADM 3+1 treatment of matter with its characteristic equivalent, in the context of spherical symmetry. The flux-conservative rendition of the fluid equations are obtained. Considering…
We explore the role of entanglement in adiabatic quantum optimization by performing approximate simulations of the real-time evolution of a quantum system while limiting the amount of entanglement. To classically simulate the time evolution…
We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in [E. Farhi, et al., arXiv:quant-ph/0208135]. The algorithm is applied to a random binary optimization problem (a version…
We present a quantum algorithm for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. Our algorithm digitally simulates the adiabatic evolution between two self-adjoint…
A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, we implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the…
Suppressing undesired nonunitary effects is a major challenge in quantum computation and quantum control. In this work, by considering the adiabatic dynamics in presence of a surrounding environment, we theoretically and experimentally…
We propose a $\tau$-leaping simulation algorithm for stochastic systems subject to fast environmental changes. Similar to conventional $\tau$-leaping the algorithm proceeds in discrete time steps, but as a principal addition it captures…
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian…
We study superadiabatic quantum control of a three-level quantum system whose energy spectrum exhibits multiple avoided crossings. In particular, we investigate the possibility of treating the full control task in terms of independent…
A population transfer based on adiabatic evolutions in a three-state system undergoing an avoided crossing is considered. The efficiency of the process is analyzed in connection with the relevant parameters, bringing to light an important…
The efficiency of a quantum heat engine is maximum when the unitary strokes are adiabatic. On the other hand, this may not be always possible due to small energy gaps in the system, especially at the critical point where the gap vanishes.…