SearcharxivSearch

arXiv subjects

David J. Reutter

Publications and source records attributed to David J. Reutter.

4 recordsLinked to original sources

Shaded tangles for the design and verification of quantum circuits

We give a scheme for interpreting shaded tangles as quantum circuits, with the property that if two shaded tangles are ambient isotopic, their corresponding computational effects are identical. We analyze 11 known quantum procedures in this way -- including entanglement manipulation, error correction and teleportation -- and in each case present a fully-topological formal verification, yielding generalized procedures in some cases. We also use our methods to identify 2 new procedures, for topological state transfer and quantum error correction. Our formalism yields in some cases significant new insight into how the procedures work, including a description of quantum entanglement arising from topological entanglement of strands, and a description of quantum error correction where errors are `trapped by bubbles' and removed from the shaded tangle.

quant-ph

A classical groupoid model for quantum networks

We give a mathematical analysis of a new type of classical computer network architecture, intended as a model of a new technology that has recently been proposed in industry. Our approach is based on groubits, generalizations of classical bits based on groupoids. This network architecture allows the direct execution of a number of protocols that are usually associated with quantum networks, including teleportation, dense coding and secure key distribution.

quant-ph

Biunitary constructions in quantum information

We present an infinite number of construction schemes involving unitary error bases, Hadamard matrices, quantum Latin squares and controlled families, many of which have not previously been described. Our results rely on biunitary connections, algebraic objects which play a central role in the theory of planar algebras. They have an attractive graphical calculus which allows simple correctness proofs for the constructions we present. We apply these techniques to construct a unitary error basis that cannot be built using any previously known method.

quant-ph