Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity

MaRDI QIDQ3522365zbMATH OpenFDO

Authors Pawel Wocjan, Dominik Janzing, Thomas Beth

Publication date 3 September 2008

Full work available at URL https://arxiv.org/abs/quant-ph/0106077

zbMATH Keywords

simulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Recommendations

• ON THE COMPUTATIONAL POWER OF PHYSICAL INTERACTIONS: BOUNDS ON THE NUMBER OF TIME STEPS FOR SIMULATING ARBITRARY INTERACTION GRAPHS
• Simulating quantum dynamics on a quantum computer
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Quantum algorithms for Hamiltonian simulation
• Simulating Sparse Hamiltonians with Star Decompositions

Cited in

(5)

• Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
• Quantum computation by measurement and quantum memory
• Simulation and reversal of n -qubit Hamiltonians using Hadamard matrices
• Hamiltonian quantum simulation with bounded-strength controls
• ON THE COMPUTATIONAL POWER OF PHYSICAL INTERACTIONS: BOUNDS ON THE NUMBER OF TIME STEPS FOR SIMULATING ARBITRARY INTERACTION GRAPHS

This page was built for publication: Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522365)