Simulating quantum dynamics on a quantum computer
From MaRDI portal
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)- On the simulation of quantum Turing machines.
- Resonant transition-based quantum computation
- A generalized circuit for the Hamiltonian dynamics through the truncated series
- Trotter product formulae for \(\ast\)-automorphisms of quantum lattice systems
- 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
- Computer simulation of Einstein-Podolsky-Rosen-Bohm experiments
- Quantum Simulation of Two Interacting Schrödinger Particles
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- A method for exact simulation of quantum dynamics
- On the power of coherently controlled quantum adiabatic evolutions
- Algorithm for quantum simulation
- Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity
- Quantum computer simulator based on the circuit model of quantum computation
- Bounding the costs of quantum simulation of many-body physics in real space
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Simulating symmetric time evolution with local operations
- Quantum circuit design for accurate simulation of qudit channels
- Hamiltonian quantum simulation with bounded-strength controls
- Quantum simulation dynamics and circuit synthesis of FMO complex on an NMR quantum computer
- Quantum Simulation
- Quantum algorithms for Hamiltonian simulation
- ON THE COMPUTATIONAL POWER OF PHYSICAL INTERACTIONS: BOUNDS ON THE NUMBER OF TIME STEPS FOR SIMULATING ARBITRARY INTERACTION GRAPHS
- Exponentially more precise quantum simulation of fermions in second quantization
- Conserved charges in the quantum simulation of integrable spin chains
- Simulation of quantum many-body systems on Amazon cloud
- Algorithms for perturbative analysis and simulation of quantum dynamics
- Divide and conquer approach to quantum Hamiltonian simulation
- Quantum resources in Harrow-Hassidim-Lloyd algorithm
- Quantum algorithms for multiscale partial differential equations
- Observation of a discrete time crystal on a digital quantum simulator
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)
