Related papers: Hardware-Efficient Hamiltonian Simulation via Trot…
The discretization approximation method commonly used to simulate the dynamics of quantum system coupled to the environment in continuum often suffers from the periodically partial recovery of initial state because of the effect of finite…
Compiling arbitrary-connectivity NISQ circuits onto monolithic single-zone neutral-atom devices is constrained by a finite interaction range and a minimum separation between simultaneously addressable sites. Under the minimum-separation…
We consider Hamiltonian simulation using the first order Lie-Trotter product formula under the assumption that the initial state has a high overlap with an energy eigenstate, or a collection of eigenstates in a narrow energy band. This…
Simulating quantum dynamics is one of the central applications of quantum computing. For Hamiltonians written as a sum of many terms, deterministic Trotter--Suzuki product formulas can require applying a large number of term-wise evolutions…
We develop randomized quantum algorithms to simulate quantum collision models, also known as repeated interaction schemes, which provide a rich framework to model various open-system dynamics. The underlying technique involves composing…
We present the quantum simulation of the frustrated quantum spin-$\frac{1}{2}$ antiferromagnetic Heisenberg spin chain with competing nearest-neighbor $(J_1)$ and next-nearest-neighbor $(J_2)$ exchange interactions in the real…
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))$…
The accelerated progress in manufacturing noisy intermediate-scale quantum (NISQ) computing hardware has opened the possibility of exploring its application in transforming approaches to solving computationally challenging problems. The…
Many-body entangled quantum spin systems exhibit emergent phenomena such as topological quantum spin liquids with distinct excitation spectra accessed in inelastic neutron scattering (INS) experiments. Here we simulate the dynamics of a…
Quantum computers have rapidly improved in scale and fidelity, yet access to large systems remains limited for most researchers. This makes accurate and scalable noisy quantum simulation essential. While density matrix simulation provides…
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers and holds immense promise for advancing the fields of physical and computer sciences, with applications spanning…
Quantum error mitigation (QEM) is vital for noisy intermediate-scale quantum (NISQ) devices. While most conventional QEM schemes assume discrete gate-based circuits with noise appearing either before or after each gate, the assumptions are…
In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotter's formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic…
Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing by replacing sequences of one- and two-qubit gates with a unitary transformation generated…
Building on the established methods for superconducting circuit quantization, we present a new theoretical framework for approximate numerical simulation of Josephson quantum circuits. Simulations based on this framework provide access to a…
Trotter approximation in conjunction with Quantum Phase Estimation can be used to extract eigen-energies of a many-body Hamiltonian on a quantum computer. There were several ways proposed to assess the quality of this approximation based on…
Trotter decomposition provides a simple approach to simulating open quantum systems by decomposing the Lindbladian into a sum of individual terms. While it is established that Trotter errors in Hamiltonian simulation depend on nested…
Quantum compilers sit between an algorithm's theoretical promise and what executes on physical hardware. Existing benchmarks report aggregate post-transpilation metrics but cannot attribute where fidelity is lost within the compilation…
Simulating the dynamics of many-body quantum systems is believed to be one of the first fields that quantum computers can show a quantum advantage over classical computers. Noisy intermediate-scale quantum (NISQ) algorithms aim at…
Quantum compilation is the problem of translating an input quantum circuit into the most efficient equivalent of itself, taking into account the characteristics of the device that will execute the computation. Compilation strategies are…