Challenges of adiabatic quantum evaluation of NAND trees

DOI10.1007/S11128-015-1137-3zbMATH Open1333.81107OpenAlexW1830402087MaRDI QIDQ264902FDOQ264902

Authors Luís Tarrataca

Publication date 1 April 2016

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11128-015-1137-3

zbMATH Keywords

numerical analysisquantum adiabatic computationspectrum evaluationtree evaluation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• scientific article
• Discrete-query quantum algorithm for NAND trees
• scientific article; zbMATH DE number 1984609
• scientific article; zbMATH DE number 5953558
• The complexity of the quantum adiabatic algorithm

Cites work

• scientific article; zbMATH DE number 5899272 (Why is no real title available?)
• scientific article; zbMATH DE number 5953558 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• Adiabatic theorem without a gap condition
• Any AND-OR formula of size \(N\) can be evaluated in time \(N^{1/2+o(1)}\) on a quantum computer
• Discrete-query quantum algorithm for NAND trees
• Quantum Algorithms for Evaluating Min-Max Trees
• Strengths and Weaknesses of Quantum Computing

Cited in

(2)

• scientific article; zbMATH DE number 5899272 (Why is no real title available?)
• Discrete-query quantum algorithm for NAND trees

This page was built for publication: Challenges of adiabatic quantum evaluation of NAND trees

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