Learn More
We give a quantum algorithm for evaluating a class of boolean formulas (such as NAND trees and 3-majority trees) on a restricted set of inputs. Due to the structure of the allowed inputs, our algorithm can evaluate a depth <i>n</i> tree using <i>O</i>(<i>n</i><sup>2+log&#969;</sup>) queries, where &#969; is independent of <i>n</i> and depends only on the(More)
We present a new system of automation for separation logic in the interactive theorem prover Isabelle. The system is based on the recently developed auto2 prover, and follows a natural, saturation-based approach to reasoning about imperative programs. In addition to standard examples on linked lists and binary search trees, we apply the automation to(More)
  • 1