A categorical semantics of quantum protocols

@article{Abramsky2004ACS,  title={A categorical semantics of quantum protocols},  author={Samson Abramsky and Bob Coecke},  journal={Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.},  year={2004},  pages={415-425},  url={https://api.semanticscholar.org/CorpusID:1980118}}
  • S. AbramskyB. Coecke
  • Published inProceedings of the 19th…18 February 2004
  • Physics, Computer Science
  • Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 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.

899 Citations

Higher Semantics of Quantum Protocols

    J. Vicary
    Computer Science, Physics
    2012 27th Annual IEEE Symposium on Logic in…
  • 2012
A higher semantics for the description of quantum protocols is proposed, which deals with quantum and classical information in a unified way and uses the use of 2-category theory to formalize the resulting framework.

The Logic of Quantum Programs

A dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems is introduced and a sound proof system for this logic is presented.

Equivalence Checking of Quantum Protocols

This paper presents a new technique and a tool, with a high-level interface, for verification of quantum protocols using equivalence checking, and is able to go beyond stabilizer states and verify protocols efficiently on all input states.

A Logic for Quantum Circuits and Protocols ( Extended Abstract ) ?

A logic for reasoning about quantum circuits and protocols is proposed that incorporates the basic features of quantum theory Probability, unitary dynamics, tensor products and measurement and forms the foundation on which more elaborate formal systems for Reasoning about quantum protocols could be based.

Verifying Quantum Communication Protocols with Ground Bisimulation

This work designs and implements two on-the-fly algorithms for the strong and weak versions of ground bisimulation to check if two given processes in quantum CCS are equivalent, and develops a tool that can verify interesting quantum protocols such as the BB84 quantum key distribution scheme.

Picture-perfect Quantum Key Distribution

We provide a new way to bound the security of quantum key distribution using only two high-level, diagrammatic features of quantum processes: the compositional behavior of complementary measurements…

Quantum Programming Languages

This work focuses on the categorical semantics of QPLs in the classically controlled quantum computing model, and particularly those semantics related to the teleportation protocol.

Reasoning formally about quantum systems : an overview

Logics for specification and analysis of quantum information systems, in particular, recent work by P. Mateus and A. Sernada and EQPL are discussed here.
...

31 References

Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations

It is shown that single quantum bit operations, Bell-basis measurements and certain entangled quantum states such as Greenberger–Horne–Zeilinger (GHZ) states are sufficient to construct a universal quantum computer.

Logic of Quantum Mechanics

“When we go far in the direction of the very small, quantum theory says that our forms of thought fail, so that it is questionable whether we can properly think at all”. These words of Bridgman…

Towards a quantum programming language

This paper describes the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types, and has an interesting denotational semantics in terms of complete partial orders of superoperators.

Quantum Computation, Categorical Semantics and Linear Logic

A type theory and denotational semantics are developed and provided for a simple fragment of the quantum lambda calculus, a formal language for quantum computation based on linear logic.

Fault-tolerant Quantum Computation

This work here is on fault-tolerance of other quantum computing models like that of quantum cellular automata and adiabatic quantum computing both of which have been shown to be equivalent to circuit model of quantum computing.

On the Foundations of Quantum Physics

The interpretation of quantum theory has always been a source of difficulties, especially with regard to the theory of measurement. We do not intend to enter here into the details of the polemic…

Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.

An unknown quantum state \ensuremath{\Vert}\ensuremath{\varphi}〉 can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical Einstein-Podolsky-Rosen…

Topos Perspective on the Kochen-Specker Theorem: I. Quantum States as Generalized Valuations

AbstractAny attempt to construct a realistinterpretation of quantum theory founders on theKochen–Specker theorem, which asserts theimpossibility of assigning values to quantum quantitiesin a way that…

"Event-ready-detectors" Bell experiment via entanglement swapping.

This work gives the conditions for high fringe visibility and particle collection efficiency as required for a Bell test and subcoherence-time monitoring of the idlers provides a noninteractive quantum measurement entangling and preselecting the independent signals without touching them.

Related Papers

Showing 1 through 3 of 0 Related Papers