Related papers: Quantum computation in continuous time using dynam…
We develop a time-dependent real-space renormalization-group approach which can be applied to Hamiltonians with time-dependent random terms. To illustrate the renormalization-group analysis, we focus on the quantum Ising Hamiltonian with…
We derive the theory of open quantum system dynamics intervened by a series of nonselective measurements. We analyze the cases of time independent and time dependent Hamiltonian dynamics in between the measurements and find the approximate…
Nonadiabatic geometric quantum computation provides a means to perform fast and robust quantum gates. It has been implemented in various physical systems, such as trapped ions, nuclear magnetic resonance and superconducting circuits.…
We discuss dynamics of periodically-driven open quantum systems. The time evolution of the quantum state is described by the quantum master equation and the form of the dissipator is chosen so that the instantaneous stationary state is…
We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of the dynamic mode decomposition algorithm used in diverse fields such as fluid…
The "Lewis-Riesenfeld phases" which plays a crucial role in constructing shortcuts to adiabaticity may be a resource for the implementation of quantum phase gates. By combining "Lewis-Riesenfeld invariant" with "quantum Zeno dynamics", we…
A non-adiabatic nuclear wavepacket dynamics simulation of the H$_2$O$^+$ de-excitation process is performed based on electronic structure calculations using the variational quantum eigensolver. The adiabatic potential energy surfaces and…
Due to its geometric nature, holonomic quantum computation is fault-tolerant against certain types of control errors. Although proposed more than a decade ago, the experimental realization of holonomic quantum computation is still an open…
Recent years have witnessed an unprecedented increase in experiments and hybrid simulations involving quantum computers. In particular, quantum annealers. Although quantum supremacy has not been established thus far, there exist a plethora…
Adiabatic processes driven by non-Hermitian, time-dependent Hamiltonians may be sped up by generalizing inverse engineering techniques based on Berry's transitionless driving algorithm or on dynamical invariants. We work out the basic…
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…
We apply the inversely-engineered control method based on Lewis-Riesenfeld invariants to control mixed states of a two-level quantum system. We show that the inversely-engineered control passages of mixed states - and pure states as special…
High performance quantum information processing requires efficient control of undesired decohering effects, which are present in realistic quantum dynamics. To deal with this issue, a powerful strategy is to employ transitionless quantum…
Classical simulation of real-space quantum dynamics is challenging due to the exponential scaling of computational cost with system dimensions. Quantum computer offers the potential to simulate quantum dynamics with polynomial complexity;…
Nonadiabatic holonomic quantum computation has been proposed as a method to implement quantum logic gates with robustness comparable to that of adiabatic holonomic gates but with shorter execution times. In this paper, we establish an…
We introduce a simple framework for estimating lower bounds on the runtime of a broad class of adiabatic quantum algorithms. The central formula consists of calculating the variance of the final Hamiltonian with respect to the initial…
We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed universal quantum gates can be realized by using non-Abelian geometric phases. We show how a set of non-adiabatic holonomic one- and two-qubit…
Quantum computing is usually associated with discrete quantum states and physical quantities possessing discrete eigenvalue spectrum. However, quantum computing in general is any computation accomplished by the exploitation of quantum…
Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…