Related papers: Fast Classical Simulation of Hamiltonian Dynamics …
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…
We report the quantum computing of reacting flows by simulating the Hamiltonian dynamics. The scalar transport equation for reacting flows is transformed into a Hamiltonian system, mapping the dissipative and non-Hermitian problem in…
Simulating Clifford and near-Clifford circuits using the extended stabilizer formalism has become increasingly popular, particularly in quantum error correction. Compared to the state-vector approach, the extended stabilizer formalism can…
Hamiltonian simulation is a fundamental algorithm in quantum computing that has attracted considerable interest owing to its potential to efficiently solve the governing equations of large-scale classical systems. Exponential speedup…
In this paper a formalism for studying the dynamics of quantum systems coupled to classical spin environments is reviewed. The theory is based on generalized antisymmetric brackets and naturally predicts open-path off-diagonal geometric…
Classical simulation of quantum systems plays an important role in the study of many-body phenomena and in the benchmarking and verification of quantum technologies. Exact simulation is often limited to small systems because the dimension…
The goal of digital quantum simulation is to approximate the dynamics of a given target Hamiltonian via a sequence of quantum gates, a procedure known as Trotterization. The quality of this approximation can be controlled by the so called…
Classical simulators play a major role in the development and benchmark of quantum algorithms and practically any software framework for quantum computation provides the option of running the algorithms on simulators. However, the…
Quantum computing has the potential to revolutionize multiple fields by solving complex problems that can not be solved in reasonable time with current classical computers. Nevertheless, the development of quantum computers is still in its…
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Namely, the algorithm takes as input a finite number of queries to a black-box seed Hamiltonian dynamics to simulate a desired Hamiltonian. Our…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…
We aim to explore a more efficient way to simulate few-body dynamics on quantum computers. Instead of mapping the second quantization of the system Hamiltonian to qubit Pauli gates representation via the Jordan-Wigner transform, we propose…
The simple algorithm for the simulation and visualization of non relativistic quantum dynamics is proposed that is based on a collective behavior of classical particles. Any quantum particle is represented as the swarm of its classical…
The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress…
We present a quantum algorithm for simulating rovibrational Hamiltonians on fault-tolerant quantum computers. The method integrates exact curvilinear kinetic energy operators and general-form potential energy surfaces expressed in a hybrid…
The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity, and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for…
Quantum circuits are considered more powerful than classical circuits and require exponential resources to simulate classically. Clifford circuits are a special class of quantum circuits that can be simulated in polynomial time but still…
We present a novel method to simulate the Lindblad equation, drawing on the relationship between Lindblad dynamics, stochastic differential equations, and Hamiltonian simulations. We derive a sequence of unitary dynamics in an enlarged…
Parity-time ($PT$)-symmetric Hamiltonians exhibit non-unitary dynamical evolution while maintaining real spectra, and offer unique approaches to quantum sensing and entanglement generation. Here we present a method for simulating the…
We introduce a new classical simulation algorithm based on non-signaling polytopes of multipartite Bell scenarios, capable of simulating universal measurement-based quantum computation with single-qubit Pauli measurements. In our model, the…