This paper introduces QWIRE (``choir''), a language for defining quantum circuits and an interface for manipulating them inside of an arbitrary classical host language. QWIRE is minimal---it containsâ€¦ (More)

Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools ofâ€¦ (More)

We introduce a Hoare-style logic for probabilistic programs, called VPHL, that has been formally verified in the Coq proof assistant. VPHL features propositional, rather than additive, assertions andâ€¦ (More)

We prove that every connected terminal game with 3 terminals has a proper Nash equilibrium in pure positional strategies. Acknowledgements: The second author is thankful for the support of the 2009â€¦ (More)

We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties ofâ€¦ (More)

We introduce a Hoare-style logic for probabilistic programs, called VPHL, that has been formally verified in the Coq proof assistant. VPHL features propositional, rather than additive, assertions andâ€¦ (More)

In an era of massive data gathering, analysts are facing an increasingly difficult decision regarding the amount of data features to consider for the purpose of target detection and classification.â€¦ (More)

In 2003, the first two authors proved that a chess-likes game has a Nash equilibrium (NE) in pure stationary strategies if (A) the number n of players is at most 2, or (B) the number p of terminalsâ€¦ (More)

Common quantum algorithms make heavy use of ancillae, scratch qubits that initialized at some state and later returned to that state and discarded. Existing quantum circuit languages allowâ€¦ (More)