Related papers: Adiabatic Quantum Algorithms for the NP-Complete M…
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…
We introduce an approach for quantum computing in continuous time based on the Lewis-Riesenfeld dynamic invariants. This approach allows, under certain conditions, for the design of quantum algorithms running on a nonadiabatic regime. We…
We examine the use of adiabatic quantum algorithms to solve structured, or nested, search problems. We construct suitable time dependent Hamiltonians and derive the computation times for a general class of nested searches involving n…
We revisit the complex time method for the application to quantum dynamics as an exceptional point is encircled in the parameter space of the Hamiltonian. The basic idea of the complex time method is using complex contour integration to…
Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the…
We introduce an approach to scattering problems in theories with non-Hermitian Hamiltonian, usually known as PT-symmetric quantum theories, by means of the adiabatic switching of the interaction. The modifications of usual methods needed to…
We propose a novel non-Hermitian adiabatic quantum optimization algorithm. One of the new ideas is to use a non-Hermitian auxiliary "initial'' Hamiltonian that provides an effective level repulsion for the main Hamiltonian. This effect…
The strategy of shortcuts to adiabaticity enables us to realize adiabatic dynamics in finite time. In the counter-diabatic driving approach, an auxiliary Hamiltonian which is called the counter-diabatic Hamiltonian is appended to an…
We study the typical (median) value of the minimum gap in the quantum version of the Exact Cover problem using Quantum Monte Carlo simulations, in order to understand the complexity of the quantum adiabatic algorithm (QAA) for much larger…
In the context of adiabatic quantum computation (AQC), it has been argued that first-order quantum phase transitions (QPTs) due to localisation phenomena cause AQC to fail by exponentially decreasing the minimal spectral gap of the…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers…
Adiabatic Quantum Computing (AQC) is an attractive paradigm for solving hard integer polynomial optimization problems. Available hardware restricts the Hamiltonians to be of a structure that allows only pairwise interactions. This requires…
Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their…
Adiabatic vacua play a central role in quantum fields in cosmological spacetimes, where they serve as distinguished initial conditions and as reference states for the renormalization of observables. In this paper we introduce new methods…
Quantum computation is an attractive front for many problems that are intractable for computers today. One such problem is nonadiabatic quantum molecular dynamics, where quantized internal states coupling to parameterized modes result in a…
The critical quantum metrology, which exploits the quantum phase transition for high precision measurement, has gained increasing attention recently. The critical quantum metrology with the continuous quantum phase transition, however, is…
Quantum algorithms have been widely studied in the context of combinatorial optimization problems. While this endeavor can often analytically and practically achieve quadratic speedups, theoretical and numeric studies remain limited,…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…
Among variational quantum algorithms designed for NISQ devices, ADAPT-VQE stands out for its robustness against barren plateaus, particularly in estimating molecular ground states. On the other hand, counterdiabatic algorithms have shown…