Challenges of adiabatic quantum evaluation of NAND trees

DOI10.1007/S11128-015-1137-3zbMath1333.81107OpenAlexW1830402087MaRDI QIDQ264902

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 computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Adiabatic theorem without a gap condition
• Discrete-query quantum algorithm for NAND trees
• Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Strengths and Weaknesses of Quantum Computing
• Quantum Algorithms for Evaluating Min-Max Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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