Simulating quantum dynamics on a quantum computer
From MaRDI portal
Publication:3102253
Abstract: We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are significant because they are the first to have time-complexities that are comparable to the best known methods for simulating time-independent Hamiltonian evolution, given appropriate smoothness criteria on the Hamiltonian are satisfied. We provide a thorough cost analysis of these algorithms that considers discretizion errors in both the time and the representation of the Hamiltonian. In addition, we provide the first upper bounds for the error in Lie-Trotter-Suzuki approximations to unitary evolution operators, that use adaptively chosen time steps.
Recommendations
Cited in
(32)- Hamiltonian quantum simulation with bounded-strength controls
- Trotter product formulae for \(\ast\)-automorphisms of quantum lattice systems
- A generalized circuit for the Hamiltonian dynamics through the truncated series
- On the simulation of quantum Turing machines.
- Bounding the costs of quantum simulation of many-body physics in real space
- Quantum resources in Harrow-Hassidim-Lloyd algorithm
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- Quantum Simulation
- Quantum Simulation of Two Interacting Schrödinger Particles
- Quantum algorithms for multiscale partial differential equations
- Observation of a discrete time crystal on a digital quantum simulator
- Simulating symmetric time evolution with local operations
- Quantum computer simulator based on the circuit model of quantum computation
- ON THE COMPUTATIONAL POWER OF PHYSICAL INTERACTIONS: BOUNDS ON THE NUMBER OF TIME STEPS FOR SIMULATING ARBITRARY INTERACTION GRAPHS
- Quantum simulation dynamics and circuit synthesis of FMO complex on an NMR quantum computer
- Quantum algorithms for Hamiltonian simulation
- Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- A method for exact simulation of quantum dynamics
- Algorithms for perturbative analysis and simulation of quantum dynamics
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Quantum circuit design for accurate simulation of qudit channels
- Simulation of quantum many-body systems on Amazon cloud
- On the power of coherently controlled quantum adiabatic evolutions
- Exponentially more precise quantum simulation of fermions in second quantization
- Spinsim: a GPU optimized Python package for simulating spin-half and spin-one quantum systems
- \textit{TimeEvolver}: a program for time evolution with improved error bound
- Algorithm for quantum simulation
- Conserved charges in the quantum simulation of integrable spin chains
- Resonant transition-based quantum computation
- Divide and conquer approach to quantum Hamiltonian simulation
- Computer simulation of Einstein-Podolsky-Rosen-Bohm experiments
This page was built for publication: Simulating quantum dynamics on a quantum computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102253)
