相关论文: Speedup in Quantum Adiabatic Evolution Algorithm
We demonstrate provable (sub)exponential quantum speedups in both discrete and continuous optimization, achieved through simple and natural quantum optimization algorithms, namely the quantum adiabatic algorithm for discrete optimization…
We explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these examples each bit is treated symmetrically so the cost function…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
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…
Most investigations devoted to the conditions for adiabatic quantum computing are based on the first-order correction ${\bra{\Psi_{\rm ground}(t)}\dot H(t)\ket{\Psi_{\rm excited}(t)} /\Delta E^2(t)\ll1}$. However, it is demonstrated that…
The speed limit provides an upper bound for the dynamical evolution time of a quantum system. Here, we introduce the notion of quantum acceleration limit for unitary time evolution of quantum systems under time-dependent Hamiltonian. We…
Big Data is characterized by Volume, Velocity, Veracity and Complexity. The interaction between this huge data is complex with an associated free will having dynamic and non linear nature. We reduced big data based on its characteristics,…
Adiabaticity occurs when, during its evolution, a physical system remains in the instantaneous eigenstate of the hamiltonian. Unfortunately, existing results, such as the quantum adiabatic theorem based on a slow down evolution (H(epsilon…
In adiabatic quantum annealing, the speed with which an anneal can be run, while still achieving a high final ground state fidelity, is dictated by the size of the minimum gap that appears between the ground and first excited state in the…
Quantum control could be implemented by varying the system Hamiltonian. According to adiabatic theorem, a slowly changing Hamiltonian can approximately keep the system at the ground state during the evolution if the initial state is a…
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…
Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation…
One often needs to estimate how fast an evolving state of a quantum system can depart from some target state or target subspace of a Hilbert space. Such estimates are known as quantum speed limits. We derive a quantum speed limit for a…
We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $\delta$. Given a local…
The preparation of a given quantum state on a quantum computing register is a typically demanding operation, requiring a number of elementary gates that scales exponentially with the size of the problem. Using the adiabatic theorem for…
A computational model of adiabatic evolutionary quantum system (or AEQS, pronounced "eeh-ks") was introduced in [Yamakami,2022] as a sort of quantum annealing and its underlying input-driven Hamiltonians are generated…
Adiabatic processes are important for studying the dynamics of a time-dependent system. Conventionally, the adiabatic processes can only be achieved by varying the system slowly. We speed up both classical and quantum adiabatic processes by…
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…
The use of the adiabatic approximation in practical applications, as in adiabatic quantum computation, demands an assessment of the errors made in finite-time evolutions. Aiming at such scenarios, we derive bounds relating error and…
A universal scheme is introduced to speed up the dynamics of a driven open quantum system along a prescribed trajectory of interest. This framework generalizes counterdiabatic driving to open quantum processes. Shortcuts to adiabaticity…