A nearly optimal discrete query quantum algorithm for evaluating NAND formulas
classification
🪐 quant-ph
keywords
algorithmdiscreteevaluatingformulasnandquantumquerybinary
read the original abstract
We present an O(\sqrt{N}) discrete query quantum algorithm for evaluating balanced binary NAND formulas and an O(N^{{1/2}+O(\frac{1}{\sqrt{\log N}})}) discrete query quantum algorithm for evaluating arbitrary binary NAND formulas.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.