Black-box Hamiltonian simulation and unitary implementation

zbMATHMaRDI QIDQ3166193FDO

Authors Dominic W. Berry, Andrew M. Childs

Publication date 21 October 2012

Full work available at URL https://arxiv.org/abs/0910.4157

zbMATH Keywords

quantum computationquantum walkquantum query complexityHamiltonian simulation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Computational methods for problems pertaining to quantum theory (81-08)

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

Cited in

(26)

• An introduction to quantum computing for statisticians and data scientists
• Approximating fractional time quantum evolution
• The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
• Quantum algorithm design: techniques and applications
• Efficient quantum circuits for continuous-time quantum walks on composite graphs
• Efficient quantum circuits for Szegedy quantum walks
• Solving Large‐Scale Linear Systems of Equations by a Quantum Hybrid Algorithm
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• scientific article; zbMATH DE number 5320183 (Why is no real title available?)
• scientific article; zbMATH DE number 5320194 (Why is no real title available?)
• An efficient quantum algorithm for spectral estimation
• Divide and conquer approach to quantum Hamiltonian simulation
• Quantum algorithm for total least squares data fitting
• 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
• scientific article; zbMATH DE number 6131346 (Why is no real title available?)
• Double sparse quantum state preparation
• Bounding the costs of quantum simulation of many-body physics in real space
• 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
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• A survey on HHL algorithm: from theory to application in quantum machine learning
• A hybrid algorithm to solve linear systems of equations with limited qubit resources
• Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians

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)