Related papers: Enhancing quantum utility: simulating large-scale …
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 consider simulating quantum systems on digital quantum computers. We show that the performance of quantum simulation can be improved by simultaneously exploiting commutativity of the target Hamiltonian, sparsity of interactions, and…
A higher-order Suzuki-Trotter decomposition or Trotterization can be exploited to mitigate the Trotter error in digital quantum simulation. This work revisits the second-order symmetric Trotterization in terms of the Trotter error, where…
When simulating the time evolution of quantum many-body systems on a digital quantum computer, one faces the challenges of quantum noise and of the Trotter error due to time discretization. The Trotter error in integrable spin chains can be…
Heisenberg exchange coupling between neighboring electron spins in semiconductor quantum dots provides a powerful tool for quantum information processing and simulation. Although so far unrealized, extended Heisenberg spin chains can enable…
We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our…
Quantum-mechanical correlations of interacting fermions result in the emergence of exotic phases. Magnetic phases naturally arise in the Mott-insulator regime of the Fermi-Hubbard model, where charges are localized and the spin degree of…
Trotterization is the most common and convenient approximation method for Hamiltonian simulations on digital quantum computers, but estimating its error accurately is computationally difficult for large quantum systems. Here, we develop a…
Moderate-size quantum computers are now publicly accessible over the cloud, opening the exciting possibility of performing dynamical simulations of quantum systems. However, while rapidly improving, these devices have short coherence times,…
As physical implementations of quantum architectures emerge, it is increasingly important to consider the cost of algorithms for practical connectivities between qubits. We show that by using an arrangement of gates that we term the…
We propose a scheme to simulate one-dimensional XXZ-type Heisenberg spin models with competing interactions between nearest-neighbors (NNs) and next-NNs in photon-coupled micro-cavities. Our scheme, for the first time, exploits the rich…
Large quantum simulators, with sufficiently many qubits to be impossible to simulate classically, become hard to experimentally validate. We propose two tests of a quantum simulator with Heisenberg interaction in a linear chain of spins. In…
Trotterization is a standard approach for simulating quantum time evolution on quantum computers, where the Hamiltonian is split into local terms and each term is applied in sequence. The order of these terms affects the fidelity of the…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
We study a variation of the Trotter-Suzuki decomposition, in which a Hamiltonian exponential is approximated by an ordered product of two-qubit operator exponentials such that the Trotter step size is enhanced for a small number of terms.…
Simulation of quantum systems is expected to be one of the most important applications of quantum computing, with much of the theoretical work so far having focused on fermionic and spin-$\frac{1}{2}$ systems. Here, we instead consider…
Quantum simulation is one of the most promising scientific applications of quantum computers. Due to decoherence and noise in current devices, it is however challenging to perform digital quantum simulation in a regime that is intractable…
Simulating quantum dynamics beyond the reach of classical computers is one of the main envisioned applications of quantum computers. The most promising quantum algorithms to this end in the near-term are the simplest, which use the Trotter…
Simulating the dynamic evolutions of physical and molecular systems in a quantum computer is of fundamental interest in many applications. Its implementation requires efficient quantum simulation algorithms. The Lie-Trotter-Suzuki…
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…