Related papers: Reverse engineering of a Hamiltonian by designing …
We develop new constructions of 2D classical and quantum superintegrable Hamiltonians allowing separation of variables in Cartesian coordinates. In classical mechanics we start from two functions on a one-dimensional phase space, a natural…
Quantum computation offers potential exponential speedups for simulating certain physical systems, but its application to nonlinear dynamics is inherently constrained by the requirement of unitary evolution. We propose the quantum Koopman…
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…
We propose a dynamical system of tumor cells proliferation based on operatorial methods. The approach we propose is quantum-like: we use ladder and number operators to describe healthy and tumor cells birth and death, and the evolution is…
Quantum simulation presents itself as one of the biggest advantages of developing quantum computers. Simulating a quantum system classically is almost impossible beyond a certain system size whereas a controllable quantum system inherently…
The construction of quantum circuits to simulate Hamiltonian evolution is central to many quantum algorithms. State-of-the-art circuits are based on oracles whose implementation is often omitted, and the complexity of the algorithm is…
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} ,…
Gradient descent is a fundamental algorithm in both theory and practice for continuous optimization. Identifying its quantum counterpart would be appealing to both theoretical and practical quantum applications. A conventional approach to…
Non-autonomous dynamical systems appear in a very wide range of interesting applications, both in classical and quantum dynamics, where in the latter case it corresponds to having a time-dependent Hamiltonian. However, the quantum…
Time-dependent Hamiltonian simulation (TDHS) is a critical task in quantum computing. Existing algorithms are generally biased with a small algorithmic error $\varepsilon$, and the gate complexity scales as $O(\text{poly}(1/\varepsilon))$…
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…
Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize…
A universal family of Hamiltonians can be used to simulate any local Hamiltonian by encoding its full spectrum as the low-energy subspace of a Hamiltonian from the family. Many spin-lattice model Hamiltonians -- such as Heisenberg or XY…
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…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…
In a recent work [D. K. Burgarth et al., Nat. Commun. 5, 5173 (2014)] it was shown that a series of frequent measurements can project the dynamics of a quantum system onto a subspace in which the dynamics can be more complex. In this…
We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained…
In this paper, we present a proof-of-concept quantum algorithm for simulating time-dependent Hamiltonian evolution by reducing the problem to simulating a time-independent Hamiltonian in a larger space using a discrete clock Hamiltonian…
Electronic structure simulation is an anticipated application for quantum computers. Due to high-dimensional quantum entanglement in strongly correlated systems, the quantum resources required to perform such simulations are far beyond the…
Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing…