Re: Sex, Lies, And Quantum Computers
Don’t know much about quantum computation, but my ventures in graphical syntaxes for propositional calculus did turn up a logical operator whose evaluation process reminded me a little of the themes involved in the collapse of the wave function.
Here is the essential information —
Boolean formulas constructed from minimal negation operators can be given graph-theoretic representation as “decorated” or “painted” versions of rooted cactus graphs.
Here is a place where you can see some pictures and a description of the Fundamental Evaluation Rule for cactus expressions of propositional formulas.