Related papers: Time evolution and adiabatic approximation in $PT$…
A fundamental axiom of quantum mechanics requires the Hamiltonians to be Hermitian which guarantees real eigen-energies and probability conservation. However, a class of non-Hermitian Hamiltonians with Parity-Time ($\mathcal{PT}$) symmetry…
The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in $1/T$, based on the lowest non-zero derivative of the…
Adiabatic evolution is an emergent design principle for time modulated metamaterials, often inspired by insights from topological quantum computing such as braiding operations. However, the pursuit of classical adiabatic metamaterials is…
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…
This work concerns a study of the quantum mechanical extension of the work of Horwitz et al. [1] on the stability of classical Hamiltonian systems by geometrical methods. Simulations are carried out for several important examples, these…
We consider the evolution of a quantum state of a Hamiltonian which is parametrically perturbed via a term proportional to the adiabatic parameter \lambda (t). Starting with the Pechukas-Yukawa mapping of the energy eigenvalues evolution on…
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…
Quantum systems with adiabatic classical parameters are widely studied, e.g., in the modern holonomic quantum computation. We here provide complete geometric quantization of a Hamiltonian system with time-dependent parameters, without the…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
A new class of time-energy uncertainty relations is directly derived from the Schr\"odinger equations for time-dependent Hamiltonians. Only the initial states and the Hamiltonians, but neither the instantaneous eigenstates nor the full…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
Extended quantum mechanics using non-Hermitian, pseudo-Hermitian Hamiltonians is briefly reviewed. Supersymmetric regularizations, solvable simulations and large-N expansion techniques are recollected as suitable means for the study of…
The time development of equal-time correlation functions in quantum mechanics and quantum field theory is described by an exact evolution equation for generating functionals. This permits a comparison between classical and quantum evolution…
We present a model of discrete quantum evolution based on quantum correlations between the evolving system and a reference quantum clock system. A quantum circuit for the model is provided, which in the case of a constant Hamiltonian is…
This paper proposes to broaden the canonical formulation of quantum mechanics. Ordinarily, one imposes the condition $H^\dagger=H$ on the Hamiltonian, where $\dagger$ represents the mathematical operation of complex conjugation and matrix…
Quantization of arbitrary free scalar fields in spatially homogeneous and isotropic space-times is considered. The quantum representation allowing a unitary evolution for the fields is taken as a requirement for the theory. Studying the…
The simulation of adiabatic evolution has deep connections with Adiabatic Quantum Computation, the Quantum Approximate Optimization Algorithm and adiabatic state preparation. Here we address the error analysis problem in quantum simulation…
Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms for the approximation of Hamiltonian dynamics using…
We investigate the evolution of an electron undergoing coherent tunneling via adiabatic passage (CTAP) using the solution of the one-dimensional Schroedinger equation in both space and time for a triple well potential. We find the…
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…