Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

MSCS
2006

favoriteEmaildiscussreport

69views more MSCS 2006»

A categorical quantum logic

13 years 4 months ago

A categorical quantum logic

Download www.mathstat.dal.ca

We define a sequent calculus corresponding to the logic of strongly compact closed categories with biproducts. Based on this calculus, we define a proof-net syntax with ly normalising cut-elimination. This syntax encodes abstract qualitative and quantitative information about the behaviour of quantum processes.

Samson Abramsky, Ross Duncan

Real-time Traffic

Abstract Qualitative | MSCS 2006 | Proof-net Syntax | Sequent Calculus |

claim paper

Related Content

» A Functional Quantum Programming Language

» Quantum Logic in Dagger Kernel Categories

» Extending Graphical Representations for Compact Closed Categories with Applications to Sym...

» Analysis and synthesis of quantum circuits by using quantum decision diagrams

» A Survey of Quantum Programming Languages History Methods and Tools

» Quantum logic synthesis by symbolic reachability analysis

» Reasoning about Entanglement and Separability in Quantum HigherOrder Functions

» Highspeed processor for quantumcomputing emulation and its applications

» Reasoning About Imperative Quantum Programs

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	MSCS
Authors	Samson Abramsky, Ross Duncan

Comments (0)