On the efficiency of Hamiltonian-based quantum computation for low-rank matrices

DOI10.1063/1.3690045zbMath1274.81056arXiv1004.4911OpenAlexW3102711566WikidataQ58004536 ScholiaQ58004536MaRDI QIDQ2861773

Zhenwei Cao, Alexander Elgart

Publication date: 11 November 2013

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

adiabatic quantum computingGrover speedup

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Other types of codes (94B60) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Adapting the traveling salesman problem to an adiabatic quantum computer, A note on the switching adiabatic theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adiabatic theorem without a gap condition
• Linear adiabatic theory. Exponential estimates
• Anderson localization makes adiabatic quantum optimization fail
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS
• Bounds for the adiabatic approximation with applications to quantum computation
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Precise exponential estimates in adiabatic theory
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Strengths and Weaknesses of Quantum Computing
• A STRONG OPERATOR TOPOLOGY ADIABATIC THEOREM
• Adiabatic charge transport and the Kubo formula for Landau-type Hamiltonians
• An elementary proof of a theorem of Johnson and Lindenstrauss