A universal adiabatic quantum query algorithm

DOI10.4230/LIPICS.TQC.2015.163MaRDI QIDQ5278028zbMATH OpenFDO

Authors Mathieu Brandeho, Jérémie Roland

Publication date 12 July 2017

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

zbMATH Keywords

adiabatic quantum computationadversary methodquantum algorithmsquery complexity

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Efficient discrete-time simulations of continuous-time quantum query algorithms
• Quantum adversary (upper) bound
• Quantum adversary (upper) bound
• Reflections for quantum query algorithms
• scientific article

Cited in

(3)

• Realizable Hamiltonians for universal adiabatic quantum computers
• Efficient discrete-time simulations of continuous-time quantum query algorithms
• Mathematical Foundations of Computer Science 2004

This page was built for publication: A universal adiabatic quantum query algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5278028)