Black-box Hamiltonian simulation and unitary implementation
From MaRDI portal
Publication:3166193
zbMATH Open1268.81045arXiv0910.4157MaRDI QIDQ3166193FDOQ3166193
Authors: Dominic W. Berry, Andrew M. Childs 
Publication date: 21 October 2012
Full work available at URL: https://arxiv.org/abs/0910.4157
Recommendations
- Hamiltonian simulation with nearly optimal dependence on spectral norm
- Efficient quantum algorithms for simulating sparse Hamiltonians
- scientific article; zbMATH DE number 6131346
- Simulating Sparse Hamiltonians with Star Decompositions
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Computational methods for problems pertaining to quantum theory (81-08)
Cited In (27)
- Quantum algorithm for total least squares data fitting
- A hybrid algorithm to solve linear systems of equations with limited qubit resources
- A survey on HHL algorithm: from theory to application in quantum machine learning
- Quantum algorithm design: techniques and applications
- Double sparse quantum state preparation
- Bounding the costs of quantum simulation of many-body physics in real space
- Fast black-box quantum state preparation based on linear combination of unitaries
- Quantum algorithms for multiscale partial differential equations
- Quantum algorithm for classical multidimensional scaling
- Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Title not available (Why is that?)
- Solving Large‐Scale Linear Systems of Equations by a Quantum Hybrid Algorithm
- An introduction to quantum computing for statisticians and data scientists
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Efficient quantum circuits for Szegedy quantum walks
- An efficient quantum algorithm for spectral estimation
- A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation
- An improved method for quantum matrix multiplication
- Efficient and scalable quantum walk algorithms via the quantum Fourier transform
- Approximating fractional time quantum evolution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Divide and conquer approach to quantum Hamiltonian simulation
This page was built for publication: Black-box Hamiltonian simulation and unitary implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166193)
