Efficient quantum simulation algorithms in the path integral formulation
From MaRDI portal
Cites work
- Adiabatic quantum state generation and statistical zero knowledge
- Bounds for the adiabatic approximation with applications to quantum computation
- BQP and the polynomial hierarchy
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Exponential improvement in precision for simulating sparse Hamiltonians
- Hamiltonian simulation with nearly optimal dependence on all parameters
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3737613 (Why is no real title available?)
- scientific article; zbMATH DE number 1273989 (Why is no real title available?)
- scientific article; zbMATH DE number 1131801 (Why is no real title available?)
- scientific article; zbMATH DE number 3008793 (Why is no real title available?)
- scientific article; zbMATH DE number 6131346 (Why is no real title available?)
- Improved error bounds for the adiabatic approximation
- Oscillatory integrals and the method of stationary phase in infinitely many dimensions, with applications to the classical limit of quantum mechanics. I
- Quantum lower bounds by polynomials
- Simulating physics with computers
- The functional integral constructed directly from the Hamiltonian
- Universal Quantum Simulators
This page was built for publication: Efficient quantum simulation algorithms in the path integral formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295677)
