Challenges of adiabatic quantum evaluation of NAND trees
From MaRDI portal
Publication:264902
Recommendations
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)
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)