Related papers: Time evolution and adiabatic approximation in $PT$…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
If a Hamiltonian is PT symmetric, there are two possibilities: Either the eigenvalues are entirely real, in which case the Hamiltonian is said to be in an unbroken-PT-symmetric phase, or else the eigenvalues are partly real and partly…
A general quantum adiabatic theorem with and without the time-dependent orthogonalization is proven, which can be applied to understand the origin of activation energies in chemical reactions. Further proofs are also developed for the…
In this paper, we present a U(1)-invariant expansion theory of the adiabatic process. As its application, we propose and discuss new sufficient adiabatic approximation conditions. In the new conditions, we find a new invariant quantity…
In this paper, we discuss the compatibility between the rotating-wave and the adiabatic approximations for controlled quantum systems. Although the paper focuses on applications to two-level quantum systems, the main results apply in higher…
We treat space and time as bona fide quantum degrees of freedom on an equal footing in Hilbert space. Motivated by considerations in quantum gravity, we focus on a paradigm dealing with linear, first-order Hamiltonian and momentum…
The paper addresses the quantization of minisuperspace cosmological models by studying a possible solution to the problem of time and time asymmetries in quantum cosmology. Since General Relativity does not have a privileged time variable…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes…
PT-symmetric Hamiltonians and transfer matrices arise naturally in statistical mechanics. These classical and quantum models often require the use of complex or negative weights and thus fall outside of the conventional equilibrium…
We introduce a self-consistent framework for the analysis of both Abelian and non-Abelian geometric phases associated with open quantum systems, undergoing cyclic adiabatic evolution. We derive a general expression for geometric phases,…
It has been argued that it is incompatible to maintain unitary time-evolution for time-dependent non-Hermitian Hamiltonians when the metric operator is explicitly time-dependent. We demonstrate here that the time-dependent Dyson equation…
This paper investigates a new formalism to describe real time evolution of quantum systems at finite temperature. A time correlation function among subsystems will be derived which allows for a probabilistic interpretation. Our derivation…
We develop from first principles Markovian master equations suited for studying the time evolution of a system evolving adiabatically while coupled weakly to a thermal bath. We derive two sets of equations in the adiabatic limit, one using…
The adiabatic approximation in open systems is formulated through the effective Hamiltonian approach. By introducing an ancilla, we embed the open system dynamics into a non-Hermitian quantum dynamics of a composite system, the adiabatic…
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the…
We systematically study the parity- and time-reversal (PT) symmetric non-Hermitian version of a quantum network proposed in the paper of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)]. The nature of this model shows that it is a…
We analyze the complexity of the quantum optimization algorithm based on adiabatic evolution for the set partition problem. We introduce a cost function defined on a logarithmic scale of the partition residues so that the total number of…
We derive a nearly optimal upper bound on the running time in the adiabatic theorem for a switching family of Hamiltonians. We assume the switching Hamiltonian is in the Gevrey class $G^\alpha$ as a function of time, and we show that the…
Parks introduced a formulation of time dependent weak values in 2008, which is the formalism we use in this paper. In this paper we extend notions from time dependent weak values to show that Hamiltonians associated with weak value…