Quantum algorithms for Hamiltonian simulation
From MaRDI portal
Publication:5448348
Recommendations
Cited in
(22)- A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
- Quantum algorithm for Feynman loop integrals
- Using quantum computers for quantum simulation
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Algorithm for quantum simulation
- Duality quantum computer and the efficient quantum simulations
- On the efficiency of quantum algorithms for Hamiltonian simulation
- Divide and conquer approach to quantum Hamiltonian simulation
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- Efficient Algorithms for Universal Quantum Simulation
- Quantum computing implemented via optimal control: theory and application to spin and pseudo-spin systems
- Quantum simulation of classically chaotic systems
- scientific article; zbMATH DE number 6131346 (Why is no real title available?)
- Simulation of a quantum algorithm for phase estimation
- Randomized algorithms for Hamiltonian simulation
- Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity
- Exponentially more precise quantum simulation of fermions in second quantization
- Necessary conditions for efficient simulation of Hamiltonians using local unitary operations
- Toward the first quantum simulation with quantum speedup
- scientific article; zbMATH DE number 2132448 (Why is no real title available?)
- Simulating quantum dynamics on a quantum computer
- Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians
This page was built for publication: Quantum algorithms for Hamiltonian simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448348)
