Abstract
We survey the recent sequence of algorithms for evaluating Boolean formulas consisting of NAND gates.
Quantum algorithms for formula evaluation
Related papers
Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).
- A nearly optimal discrete query quantum algorithm for evaluating NAND formulas (2007)77% match
- How to Compile Some NAND Formula Evaluators (2007)75% match
- Super-Polynomial Quantum Speed-ups for Boolean Evaluation Trees with Hidden Structure (2011)72% match
- Discrete-query Quantum Algorithm For NAND Trees (2007)72% match
- Every NAND formula of size N can be evaluated in time N^1/2+o(1) on a quantum computer (2011)72% match
- Java Application that Outputs Quantum Circuit for Some NAND Formula Evaluators (2008)70% match
- Faster quantum algorithm for evaluating game trees (2009)69% match
- Molecular Realization of a Quantum NAND Tree (2018)68% match