Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky
暂无分享,去创建一个
[1] D. Aharonov,et al. The quantum FFT can be classically simulated , 2006, quant-ph/0611156.
[2] P. Selinger,et al. Quantum lambda calculus , 2010 .
[3] S. Lack,et al. Introduction to extensive and distributive categories , 1993 .
[4] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[5] Benoît Valiron,et al. A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) , 2008, FoSSaCS.
[6] Eugenio Moggi,et al. Notions of Computation and Monads , 1991, Inf. Comput..
[7] A. Joyal,et al. The geometry of tensor calculus, I , 1991 .
[8] J. Robin B. Cockett,et al. Introduction to distributive categories , 1993, Mathematical Structures in Computer Science.
[9] Benoît Valiron,et al. A Lambda Calculus for Quantum Computation with Classical Control , 2005, TLCA.
[10] Peter Selinger,et al. Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract) , 2007, QPL.
[11] Peter Selinger,et al. Towards a quantum programming language , 2004, Mathematical Structures in Computer Science.
[12] Saunders MacLane,et al. Duality for groups , 1950 .
[13] Robert Spalek,et al. Quantum Fan-out is Powerful , 2005, Theory Comput..
[14] R. Blute,et al. Natural deduction and coherence for weakly distributive categories , 1996 .
[15] Samson Abramsky,et al. A categorical semantics of quantum protocols , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..
[16] Paul-André Melliès. Categorical models of linear logic revisited , 2002 .
[17] S. Braunstein,et al. Impossibility of deleting an unknown quantum state. , 1999, Nature.
[18] Michael A. Nielsen,et al. Quantum Computation and Quantum Information Theory , 2000 .
[19] Eugenio Moggi,et al. Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[20] Benoît Valiron,et al. On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract) , 2008, QPL.
[21] Peter Hines. Quantum circuit oracles for Abstract Machine computations , 2010, Theor. Comput. Sci..
[22] R. A. G. Seely,et al. Linear Logic, -Autonomous Categories and Cofree Coalgebras , 1989 .
[23] W. Wootters,et al. A single quantum cannot be cloned , 1982, Nature.
[24] Samson Abramsky,et al. Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories , 2005, CALCO.
[25] Peter W. Shor,et al. Algorithms for Quantum Computation: Discrete Log and Factoring (Extended Abstract) , 1994, FOCS 1994.
[26] Miguel L. Laplaza. Coherence for categories with associativity, commutativity and distributivity , 1972 .
[27] Michael Barr,et al. Algebraically compact functors , 1992 .
[28] Octavio Malherbe,et al. Categorical models of computation: partially traced categories and presheaf models of quantum computation , 2013, 1301.5087.
[29] Dusko Pavlovic,et al. Quantum measurements without sums , 2007 .
[30] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[31] M. Laplaza,et al. Coherence for distributivity , 1972 .