Related papers: Benchmarking a heuristic Floquet adiabatic algorit…
We apply a quantum adiabatic evolution algorithm to a combinatorial optimization problem where the cost function depends entirely on the of the number of unit bits in a n-bit string (Hamming weight). The solution of the optimization problem…
Advances in quantum algorithms suggest a tentative scaling advantage on certain combinatorial optimization problems. Recent work, however, has also reinforced the idea that barren plateaus render variational algorithms ineffective on large…
We introduce the notion of adiabatic state-flip of a Floquet Hamiltonian associated with a non-Hermitian system that it is subjected to two driving schemes with clear separation of time scales. The fast (Floquet) modulation scheme is…
A new and intuitive perturbative approach to time-dependent quantum mechanics problems is presented, which is useful in situations where the evolution of the Hamiltonian is slow. The state of a system which starts in an instantaneous…
Solving the electronic structure problem via unitary evolution of the electronic Hamiltonian is one of the promising applications of digital quantum computers. One of the practical strategies to implement the unitary evolution is via…
Periodically driven systems have emerged as a useful technique to engineer the properties of quantum systems, and are in the process of being developed into a standard toolbox for quantum simulation. An outstanding challenge that leaves…
Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. [Suba\c{s}i et al., Phys. Rev. Lett.…
Most research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians, whose ground states can be expressed with only real, nonnegative amplitudes. This raises the question of whether classical Monte Carlo algorithms…
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required…
Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps $N$ and approximates the evolution of each step by a…
An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the…
Controllable adiabatic evolution of a multi-qubit system can be used for adiabatic quantum computation (AQC). This evolution ends at a configuration where the Hamiltonian of the system encodes the solution of the problem to be solved. As a…
A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply…
Understanding NP-complete problems is a central topic in computer science. This is why adiabatic quantum optimization has attracted so much attention, as it provided a new approach to tackle NP-complete problems using a quantum computer.…
We reveal universal dynamical scaling behavior across adiabatic quantum phase transitions (QPTs) in networks ranging from traditional spatial systems (Ising model) to fully connected ones (Dicke and Lipkin-Meshkov-Glick models). Our…
The evolution of a driven quantum system is said to be adiabatic whenever the state of the system stays close to an instantaneous eigenstate of its time-dependent Hamiltonian. The celebrated quantum adiabatic theorem ensures that such pure…
We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that…
We propose a novel adiabatic time evolution (ATE) method for obtaining the ground state of a quantum many-electron system on a quantum circuit based on first quantization. As a striking feature of the ATE method, it consists of only unitary…