Coend Optics for Quantum Combs

  title={Coend Optics for Quantum Combs},
  author={James Hefford and Cole Comfort},
We compare two possible ways of defining a category of 1-combs, the first intensionally as coend optics and the second extensionally as a quotient by the operational behaviour of 1-combs on lower-order maps. We show that there is a full and bijective on objects functor quotienting the intensional definition to the extensional one and give some sufficient conditions for this functor to be an isomorphism of categories. We also show how the constructions for 1-combs can be extended to produce… 
1 Citations
Quantum Supermaps are Characterized by Locality
We prove that the sequential and parallel composition rules for quantum channels are all that need to be referenced to axiomatise quantum supermaps from first principles. To do so we provide a simple


Theoretical framework for quantum networks
We present a framework to treat quantum networks and all possible transformations thereof, including as special cases all possible manipulations of quantum states, measurements, and channels, such
Interacting Quantum Observables: Categorical Algebra and Diagrammatics
The ZX-calculus is introduced, an intuitive and universal graphical calculus for multi-qubit systems, which greatly simplifies derivations in the area of quantum computation and information and axiomatize phase shifts within this framework.
ZX-calculus for the working quantum computer scientist
This review discusses Clifford computation and graphically prove the Gottesman-Knill theorem, a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and the recent completeness theorems that show that, in principle, all reasoning about quantum computation can be done using Zx-diagrams.
Quantum picturalism
Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the ‘no-cloning theorem’ is easy, and its
Transforming quantum operations: Quantum supermaps
We introduce the concept of quantum supermap, describing the most general transformation that maps an input quantum operation into an output quantum operation. Since quantum operations include as
Semicausal operations are semilocalizable
We prove a conjecture by DiVincenzo, which in the terminology of Preskill et al. states that semicausal operations are semilocalizable. That is, we show that any operation on the combined system of
Quantum computations without definite causal structure
It is shown that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order, and that the quantum version of this transformation-the quantum switch- produces an output circuit where the order of the connections is controlled by a quantum bit, which becomes entangled with the circuit structure.
A categorical semantics of quantum protocols
  • S. AbramskyB. Coecke
  • Computer Science
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
This paper focuses on quantum information protocols, which exploit quantum-mechanical effects in an essential way and form the basis for novel and potentially very important applications to secure and fault-tolerant communication and computation.
Information processing in generalized probabilistic theories
A framework in which a variety of probabilistic theories can be defined, including classical and quantum theories, and many others, is introduced, and a tensor product rule for combining separate systems can be derived.
Quantum circuit architecture.
Unexplored quantum processing tasks, such as cloning and storing or retrieving of gates, can be optimized, along with setups for tomography and discrimination or estimation of quantum circuits.