Related papers: From Symmetric Toeplitz Hamiltonians to Quantum Ci…
The concept of parity-time (PT) symmetry originates from the framework of quantum mechanics, where if the Hamiltonian operator satisfies the commutation relation with the parity and time operators, it shows all real eigen-energy spectrum.…
Based on a simple observation that a classical second order differential equation may be decomposed into a set of two first order equations, we introduce a Hamiltonian framework to quantize the damped systems. In particular, we analyze the…
In this article, we formulate the study of the unitary time evolution of systems consisting of an infinite number of uncoupled time-dependent harmonic oscillators in mathematically rigorous terms. We base this analysis on the theory of a…
I will provide a pedagogical introduction to non-Hermitian quantum systems that are PT-symmetric, that is they are left invariant under a simultaneous parity transformation (P) and time-reversal (T). I will explain how generalised versions…
We explore how to build quantum circuits that compute the lowest energy state corresponding to a given Hamiltonian within a Symmetry subspace by explicitly encoding it into the circuit. We create an explicit unitary and a variationally…
Two-level boson systems displaying a quantum phase transition from a spherical (symmetric) to a deformed (broken) phase are studied. A formalism to diagonalize Hamiltonians with $O(2L+1)$ symmetry for large number of bosons is worked out.…
Partial differential equations (PDEs) are central to computational electromagnetics (CEM) and photonic design, but classical solvers face high costs for large or complex structures. Quantum Hamiltonian simulation provides a framework to…
We provide new constructions of unitary $t$-designs for general $t$ on one qudit and $N$ qubits, and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design after a threshold time, as a basic…
We use complexity theory to rigorously investigate the difficulty of classically simulating evolution under many-body localized (MBL) Hamiltonians. Using the defining feature that MBL systems have a complete set of quasilocal integrals of…
We present an efficient quantum algorithm for simulating the evolution of a sparse Hamiltonian H for a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a…
The practical use of non-Hermitian (i.e., typically, PT-symmetric) phenomenological quantum Hamiltonians is discussed as requiring an explicit reconstruction of the {\em ad hoc} Hilbert-space metrics which would render the time-evolution…
Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems is an important objective in its own right. In many cases,…
Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work, we present a polynomially scaling hybrid…
We develop a hybrid semiclassical method to study the time evolution of one dimensional quantum systems in and out of equilibrium. Our method handles internal degrees of freedom completely quantum mechanically by a modified time evolving…
We show that the discrete-time evolution of an open quantum system generated by a single quantum channel $T$ can be embedded in the discrete-time evolution of an enlarged closed quantum system, i.e. we construct a unitary dilation of the…
We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps…
For solving the Poisson equation it is usually possible to discretize it into solving the corresponding linear system $Ax=b$.Variational quantum algorithms (VQAs) for the discreted Poisson equation have been studied before. We give a VQA…
We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circuit-model based quantum computer. Our approach is based on approximating the truncated Dyson series of the evolution operator, extending the…
We show how to visualize the process of diagonalizing the Hamiltonian matrix to find the energy eigenvalues and eigenvectors of a generic one-dimensional quantum system. Starting in the familiar sine-wave basis of an embedding infinite…
Principal component analysis is an important dimension reduction technique in machine learning. In [S. Lloyd, M. Mohseni and P. Rebentrost, Nature Physics 10, 631-633, (2014)], a quantum algorithm to implement principal component analysis…