Related papers: $\texttt{Symdyn}$: an automated algebraic solution…
Using the Wei-Norman theory we obtain a time-dependent complex Riccati equation (TDCRE) as the solution of the time evolution operator (TEO) of quantum systems described by time-dependent (TD) Hamiltonians that are linear combinations of…
We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body…
We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system described by an N dimensional Hilbert space with a Hamiltonian of the form $E |w >< w|$ where…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
Hamiltonian simulation is a central task in quantum computing, with wide-ranging applications in quantum chemistry, condensed matter physics, and combinatorial optimization. A fundamental challenge lies in approximating the unitary…
Lie systems in Quantum Mechanics are studied from a geometric point of view. In particular, we develop methods to obtain time evolution operators of time-dependent Schrodinger equations of Lie type and we show how these methods explain…
A non-Hermitian operator $H$ defined in a Hilbert space with inner product $\langle\cdot|\cdot\rangle$ may serve as the Hamiltonian for a unitary quantum system, if it is $\eta$-pseudo-Hermitian for a metric operator (positive-definite…
We introduce a hybrid classical-quantum algorithm for simulating a Hamiltonian of the form $H= \sum_{i=1}^K H_i = \sum_{i=1}^K H_{i_1} \otimes H_{i_2} \otimes \cdots \otimes H_{i_M}$. Given that the entries of all $\{ H_{i_1}, H_{i_2} ,…
In recent works we have used quantum tools in the analysis of the time evolution of several macroscopic systems. The main ingredient in our approach is the self-adjoint Hamiltonian $H$ of the system $\Sc$. This Hamiltonian quite often, and…
The quantum measurement axiom dictates that physical observables and in particular the Hamiltonian must be diagonalizable and have a real spectrum. For a time-independent Hamiltonian (with a discrete spectrum) these conditions ensure the…
We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the input model where the entries of the Hamiltonian are stored in a data structure in a quantum random…
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in…
Certain aspects of some unitary quantum systems are well-described by evolution via a non-Hermitian effective Hamiltonian, as in the Wigner-Weisskopf theory for spontaneous decay. Conversely, any non-Hermitian Hamiltonian evolution can be…
We consider an open quantum system which contains unstable states. The time evolution of the system can be described by an effective non-hermitian Hamiltonian H_{eff}, in accord with the Wigner--Weisskopf approximation, and an additional…
Open classical and quantum systems have attracted great interest in the past two decades. These include systems described by non-Hermitian Hamiltonians with parity-time $(\mathcal{PT})$ symmetry that are best understood as systems with…
We study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. By using a graph-coloring algorithm to minimize the number of commuting clusters of terms in the qubitized Hamiltonian,…
In this paper we propose a systematic method to solve the inverse dynamical problem for a quantum system governed by the von Neumann equation: to find a class of Hamiltonians reproducing a prescribed time evolution of a pure or mixed state…
The rapid development of reliable Quantum Processing Units (QPU) opens up novel computational opportunities for machine learning. Here, we introduce a procedure for measuring the similarity between graph-structured data, based on the…
We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm…
Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant…