Efficient quantum algorithms for simulating sparse Hamiltonians
From MaRDI portal
Publication:883042
DOI10.1007/s00220-006-0150-xzbMath1115.81011arXivquant-ph/0508139OpenAlexW3101636216WikidataQ56593897 ScholiaQ56593897MaRDI QIDQ883042
Graeme Ahokas, Dominic W. Berry, Barry C. Sanders, Richard Cleve
Publication date: 31 May 2007
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0508139
Related Items (72)
Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems ⋮ Quantum algorithm for total least squares data fitting ⋮ MMSE detection method in uplink massive MIMO systems based on quantum computing ⋮ Efficient quantum circuits for Szegedy quantum walks ⋮ Bosonic Random Walk Neural Networks for Graph Learning ⋮ Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores ⋮ A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation ⋮ Obtaining a linear combination of the principal components of a matrix on quantum computers ⋮ Toward prethreshold gate-based quantum simulation of chemical dynamics: using potential energy surfaces to simulate few-channel molecular collisions ⋮ Solving Lyapunov equation by quantum algorithm ⋮ Quantum spectral methods for differential equations ⋮ Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target ⋮ Quantum algorithm for linear differential equations with exponentially improved dependence on precision ⋮ Quantum fast Poisson solver: the algorithm and complete and modular circuit design ⋮ An investigation on support vector clustering for big data in quantum paradigm ⋮ Solving systems of linear algebraic equations via unitary transformations on quantum processor of IBM quantum experience ⋮ Quantum algorithm for estimating largest eigenvalues ⋮ Simulation of three-spin evolution under \(XX\) Hamiltonian on quantum processor of IBM-quantum experience ⋮ Efficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation ⋮ Module for arbitrary controlled rotation in gate-based quantum algorithms ⋮ Quantum simulation of quantum mechanical system with spatial noncommutativity ⋮ An efficient quantum algorithm for spectral estimation ⋮ A quantum Richardson-lucy image restoration algorithm based on controlled rotation operation and Hamiltonian evolution ⋮ Universal computation with quantum fields ⋮ On the relationship between continuous- and discrete-time quantum walk ⋮ Nonlinear stochastic operators and associated inhomogeneous entangled quantum Markov chains ⋮ Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions ⋮ Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial ⋮ Quantum radial basis function method for scattered data interpolation ⋮ On a \(\psi\)-mixing property for entangled Markov chains ⋮ Succinct description and efficient simulation of non-Markovian open quantum systems ⋮ Quantum spin dynamics with pairwise-tunable, long-range interactions ⋮ An improved method for quantum matrix multiplication ⋮ On the efficiency of quantum algorithms for Hamiltonian simulation ⋮ Average-case speedup for product formulas ⋮ Operations with elements of transferred density matrix via unitary transformations on extended receiver ⋮ Efficient quantum circuits for continuous-time quantum walks on composite graphs ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Optimization of quantum Hamiltonian evolution: From two projection operators to local Hamiltonians ⋮ Quantum algorithms for similarity measurement based on Euclidean distance ⋮ Unnamed Item ⋮ A survey on HHL algorithm: from theory to application in quantum machine learning ⋮ A Quantum Implementation Model for Artificial Neural Networks ⋮ Quantum-circuit design for efficient simulations of many-body quantum dynamics ⋮ A universal quantum circuit scheme for finding complex eigenvalues ⋮ Quantum algorithm and circuit design solving the Poisson equation ⋮ Quantum algorithm design: techniques and applications ⋮ Quantum circuit design for accurate simulation of qudit channels ⋮ Programmable quantum simulation by dynamic Hamiltonian engineering ⋮ Multiple network alignment on quantum computers ⋮ An improved quantum principal component analysis algorithm based on the quantum singular threshold method ⋮ Computing scalar products via a two-terminal quantum transmission line ⋮ QUANTUM SIMULATION OF SIMPLE MANY-BODY DYNAMICS ⋮ A quantum eigensolver for symmetric tridiagonal matrices ⋮ Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians ⋮ Product formulas for exponentials of commutators ⋮ Fast quantum algorithms for least squares regression and statistic leverage scores ⋮ A generalized circuit for the Hamiltonian dynamics through the truncated series ⋮ An all-pair quantum SVM approach for big data multiclass classification ⋮ ON THE GAP OF HAMILTONIANS FOR THE ADIABATIC SIMULATION OF QUANTUM CIRCUITS ⋮ Unnamed Item ⋮ Bounding the costs of quantum simulation of many-body physics in real space ⋮ Translationally invariant universal quantum Hamiltonians in 1D ⋮ Optimized Lie-Trotter-Suzuki decompositions for two and three non-commuting terms ⋮ Simple digital quantum algorithm for symmetric first-order linear hyperbolic systems ⋮ Exponentially more precise quantum simulation of fermions in second quantization ⋮ Quantum mean centering for block-encoding-based quantum algorithm ⋮ Trotter product formulae for \(\ast\)-automorphisms of quantum lattice systems ⋮ Approximating ground and excited state energies on a quantum computer ⋮ A hybrid algorithm to solve linear systems of equations with limited qubit resources ⋮ Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians ⋮ Quantum computation and quantum information
Cites Work
- Unnamed Item
- Unnamed Item
- An example of the difference between quantum and classical random walks
- Universal Quantum Simulators
- Adiabatic quantum state generation and statistical zero knowledge
- Exponential algorithmic speedup by a quantum walk
- Deterministic coin tossing with applications to optimal parallel list ranking
- General theory of fractal path integrals with applications to many-body theories and statistical physics
- Locality in Distributed Graph Algorithms
- Quantum lower bounds by polynomials
- The Complexity of the Local Hamiltonian Problem
This page was built for publication: Efficient quantum algorithms for simulating sparse Hamiltonians
