Bennett and Stinespring, Together at Last
暂无分享,去创建一个
[1] Claudio Hermida,et al. Monoidal indeterminates and categories of possible worlds , 2012, Theor. Comput. Sci..
[2] Robert Glück,et al. Join inverse categories and reversible recursion , 2017, J. Log. Algebraic Methods Program..
[3] Brett Gordon Giles. An investigation of some theoretical aspects of reversible computing , 2014 .
[4] Charles H. Bennett,et al. Logical reversibility of computation , 1973 .
[5] Robert Glück,et al. A categorical foundation for structured reversible flowchart languages: Soundness and adequacy , 2018, Log. Methods Comput. Sci..
[6] J. Cockett,et al. Restriction categories III: colimits, partial limits, and extensivity , 2006, math/0610500.
[7] Bas Westerbaan,et al. Paschke Dilations , 2016, QPL.
[8] Robert Glück,et al. Reversible Flowchart Languages and the Structured Reversible Program Theorem , 2008, ICALP.
[9] Robert Glück,et al. Fundamentals of reversible flowchart languages , 2016, Theor. Comput. Sci..
[10] Sam Staton,et al. Quantum channels as a categorical completion , 2019, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[11] Robert Wille,et al. Trading off circuit lines and gate costs in the synthesis of reversible logic , 2014, Integr..
[12] Cole Comfort. The ZX& calculus: A complete graphical calculus for classical circuits using spiders , 2020, ArXiv.
[13] Rolf Landauer,et al. Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..
[14] Sam Staton,et al. Universal Properties in Quantum Theory , 2019, QPL.