A nearly optimal discrete query quantum algorithm for evaluating NAND formulas
Abstract
We present an O(N) discrete query quantum algorithm for evaluating balanced binary NAND formulas and an O(N1/2+O(1 N)) discrete query quantum algorithm for evaluating arbitrary binary NAND formulas.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.