Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
publications [2021/10/22 19:28] ncerf |
publications [2022/01/27 14:56] ncerf |
||
---|---|---|---|
Line 287: | Line 287: | ||
ACM Transactions on Computation Theory, 5(3):11:1-11:33 (2013).\\ | ACM Transactions on Computation Theory, 5(3):11:1-11:33 (2013).\\ | ||
[[http://dx.doi.org/10.1145/2493252.2493256|DOI]] | [[http://dx.doi.org/10.1145/2493252.2493256|DOI]] | ||
+ | |||
+ | //Information transmission in bosonic memory channels using Gaussian matrix-product states as near-optimal symbols//,\\ | ||
+ | J. Schäfer, E. Karpov, and N. J. Cerf\\ | ||
+ | AIP ConferenceProceedings, 1633, 192 (2014)\\ | ||
+ | {{ :publications:2014-aip-1633-192.pdf |PDF file}},[[ https://doi.org/10.1063/1.4903134| doi:10.1063/1.4903134]]. | ||
//Gaussian classical capacity of Gaussian quantum channels//,\\ | //Gaussian classical capacity of Gaussian quantum channels//,\\ | ||
Line 1400: | Line 1405: | ||
=== PhD Theses === | === PhD Theses === | ||
+ | |||
+ | //Majorization theoretical approach to quantum uncertainty: From Wigner entropy to Gaussian bosonic channels//, \\ | ||
+ | Z. Van Herstraeten, Université Libre de Bruxelles (2021)\\ | ||
+ | {{ :publications:2021_phd_thesis_zacharie_van_herstraeten.pdf |PDF file}} | ||
//New bounds for information complexity and quantum query complexity via convex optimization tools//, \\ | //New bounds for information complexity and quantum query complexity via convex optimization tools//, \\ |