Related papers: Hierarchical Fusion Method for Scalable Quantum Ei…
Stimulated Raman Adiabatic Passage, a very efficient technique for manipulating a quantum system based on the adiabatic theorem, is analyzed in the case where the manipulated physical system is interacting with a spin bath. Exploitation of…
We introduce a method called resolution refinement that allows one to bootstrap eigenstate preparation on a quantum computer. We first prepare an eigenstate of a low-resolution Hamiltonian using any method of choice. The eigenstate is then…
We study a single two-level system coupled resonantly to an oscillator mode or a large spin. By adiabatically turning on a linear driving term on the oscillator or the spin, the eigenstates of the system change character and its ground…
Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialised state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible.…
Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines…
A shortcut to an adiabatic scheme is proposed for preparing a massive object in a macroscopic spatial superposition state. In this scheme we propose to employ counterdiabatic driving to maintain the system in the ground state of its…
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…
We introduce a high-fidelity technique for coherent control of three-state quantum systems, which combines two popular control tools --- stimulated Raman adiabatic passage (STIRAP) and composite pulses. By using composite sequences of pairs…
Reliable preparation of many-body ground states is an essential task in quantum computing, with applications spanning areas from chemistry and materials modeling to quantum optimization and benchmarking. A variety of approaches have been…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for…
We develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large…
Efficient initialization and manipulation of quantum states is important for numerous applications and it usually requires the ability to perform high fidelity and robust swapping of the populations of quantum states. Stimulated Raman…
The Quantum Approximate Optimization Algorithm (QAOA) exhibits significant potential for tackling combinatorial optimization problems. Despite its promise for near-term quantum devices, a major challenge in applying QAOA lies in the cost of…
STImulated Raman Adiabatic Passage (STIRAP) is a powerful technique for robust state transfer capabilities in quantum systems. This method, however encounters challenges for its implementation as a gate in qubit-subspace due to its…
Adiabatic Quantum Computing relies on the quantum adiabatic theorem, which states that a quantum system evolves along its ground state with time if the governing Hamiltonian varies infinitely slowly. However, practical limitations force…
The implementation of static artificial magnetic fields in ultracold atomic systems has become a powerful tool, e.g. for simulating quantum-Hall physics with charge-neutral atoms. Taking an interacting bosonic flux ladder as a minimal…
Quantum control optimization algorithms are routinely used to generate optimal quantum gates or efficient quantum state transfers. However, there are two main challenges in designing efficient optimization algorithms, namely overcoming the…
The simulation of stochastic reaction-diffusion systems using fine-grained representations can become computationally prohibitive when particle numbers become large. If particle numbers are sufficiently high then it may be possible to…
Consider a path of non-degenerate eigenstates of unitary operators or Hamiltonians with minimum eigenvalue gap G. The eigenpath traversal problem is to transform one or more copies of the initial to the final eigenstate. Solutions to this…