Related papers: Diagonal Catalysts in Quantum Adiabatic Optimizati…
Quantum control techniques are employed to perform adiabatic quantum computing in the presence of noise. First, we analyze the adiabatic entanglement protocol (AEP) for two qubits. In this case, we found that this protocol is very robust…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…
Adiabatic passage employs a slowly varying time-dependent Hamiltonian to control the evolution of a quantum system along the Hamiltonian eigenstates. For processes of finite duration, the exact time evolving state may deviate from the…
We show, for quantum annealing, that a certain type of inhomogeneous driving of the transverse field erases first-order quantum phase transitions in the p-body interacting mean-field-type model with and without longitudinal random field.…
We introduce two methods for speeding up adiabatic quantum computations by increasing the energy between the ground and first excited states. Our methods are even more general. They can be used to shift a Hamiltonian's density of states…
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…
Perturbed Hamming weight problems serve as examples of optimization instances for which the adiabatic algorithm provably out performs classical simulated annealing. In this work we study the efficiency of the adiabatic algorithm for solving…
We provide several examples and an intuitive diagrammatic representation demonstrating the use of two-qubit unitary transformations for mapping coupled spin Hamiltonians to simpler ones and vice versa. The corresponding dualities may be…
Quantum annealing is guaranteed to find the ground state of optimization problems in the adiabatic limit. Recent work [Phys. Rev. X 6, 031010 (2016)] has found that for some barrier tunneling problems, quantum annealing can be run much…
The techniques of shortcuts to adiabaticity have been proposed to accelerate the "slow" adiabatic processes in various quantum systems with the applications in quantum information processing. In this paper, we study the counter-diabatic…
Suppression of diabatic transitions in quantum adiabatic evolution stands as a significant challenge for ground state preparations. Counterdiabatic driving has been proposed to compensate for diabatic losses and achieve shortcut to…
Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm, which it can approximate with sufficient depth. However, it is unclear to what extent the lessons from the adiabatic regime apply to QAOA as…
In this report, we propose a novel quantum diagonalization algorithm based on the optimization of variational quantum circuits. Diagonalizing a quantum state is a fundamental yet computationally challenging task in quantum information…
Adiabatic optimal control schemes are essential for advancing the practical implementation of quantum technologies. However, the vast array of possible adiabatic protocols, combined with their dependence on the particular quantum system and…
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…
A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a symmetric superposition of all possible assignments of $N$…
Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the quantum approximate optimization algorithm (QAOA). These algorithms are…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…
An elementary excitation in an aggregate of coupled particles generates a collective excited state. We show that the dynamics of these excitations can be controlled by applying a transient external potential which modifies the phase of the…