Related papers: Exponentially more precise quantum simulation of f…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
The simulation of quantum many-body systems, relevant for quantum chemistry and condensed matter physics, is one of the most promising applications of near-term quantum computers before fault-tolerance. However, since the vast majority of…
Hamiltonian simulation represents an important module in a large class of quantum algorithms and simulations such as quantum machine learning, quantum linear algebra methods, and modeling for physics, material science and chemistry. One of…
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…
Tomography has reached its practical limits in characterization of new quantum devices, and there is a need for a new means of characterizing and validating new technological advances in this field. We propose a different verification…
Digital quantum simulation is a promising application for quantum computers. Their free programmability provides the potential to simulate the unitary evolution of any many-body Hamiltonian with bounded spectrum by discretizing the time…
Simulating molecular systems on quantum computers requires efficient mappings from Fermionic operators to qubit operators. Traditional mappings such as Jordan-Wigner or Bravyi-Kitaev often produce high-weight Pauli terms, increasing circuit…
The potential of employing higher orders of the Trotter-Suzuki decomposition of the evolution operator for more effective simulations of quantum systems on a noisy quantum computer is explored. By examining the transverse-field Ising model…
We present a scalable quantum simulation framework for real-time dynamics of the multi-flavor Gross-Neveu model in 1+1 dimensions. Using superconducting quantum processors at utility scale, we develop a hardware-efficient Trotterization…
To efficiently implement many-qubit gates for use in quantum simulations on quantum computers we develop and present methods reexpressing exp[-i (H_1 + H_2 + ...) \Delta t] as a product of factors exp[-i H_1 \Delta t], exp[-i H_2 \Delta t],…
The Fermi-Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum…
We propose the regularized compressed double factorization (RC-DF) method to classically compute compressed representations of molecular Hamiltonians that enable efficient simulation with noisy intermediate scale (NISQ) and error corrected…
The Harrow-Hassidim-Lloyd (HHL) algorithm is a quantum algorithm for solving systems of linear equations that, in principle, offers an exponential improvement in scaling with the system size compared to classical approaches. In this work,…
Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…
Quantum signal processing provides an optimal procedure for simulating Hamiltonian evolution on a quantum computer using calls to a block encoding of the Hamiltonian. In many situations it is possible to control between forward and reverse…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding…
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy…
Quantum simulation is a promising way toward practical quantum advantage, but noise in current quantum hardware poses a significant obstacle. We prove that not only the physical error but also the algorithmic error in a single Trotter step…
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…