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 [2022/01/28 12:52] ncerf |
publications [2022/05/25 08:11] ncerf |
||
---|---|---|---|
Line 32: | Line 32: | ||
[[publications#2020|2020]] | [[publications#2020|2020]] | ||
[[publications#2021|2021]] | [[publications#2021|2021]] | ||
+ | [[publications#2022|2022]] | ||
[[publications#PhD Theses|PhD Theses]] | [[publications#PhD Theses|PhD Theses]] | ||
[[publications#Ms Theses|Ms Theses]] | [[publications#Ms Theses|Ms Theses]] | ||
+ | |||
+ | ==== 2022 ==== | ||
+ | |||
+ | //Boson bunching is not maximized by indistinguishable particles//,\\ | ||
+ | B. Seron, L. Novo, and N. J. Cerf\\ | ||
+ | [[https://arxiv.org/abs/2203.01306 |arXiv:2203.01306 [quant-ph]]] | ||
+ | |||
+ | //Multicopy observables for the detection of optically nonclassical states//,\\ | ||
+ | M. Arnhem, C. Griffet, and N. J. Cerf\\ | ||
+ | [[https://arxiv.org/abs/2205.12040 |arXiv:2205.12040 [quant-ph]]] | ||
==== 2021 ==== | ==== 2021 ==== | ||
Line 208: | Line 219: | ||
SIAM Journal on Computing, 44(5):1550--1572 (2015).\\ | SIAM Journal on Computing, 44(5):1550--1572 (2015).\\ | ||
[[http://dx.doi.org/10.1137/130928273|DOI]], [[http://arxiv.org/abs/1204.1505|arxiv:1204.1505 [quant-ph]]] | [[http://dx.doi.org/10.1137/130928273|DOI]], [[http://arxiv.org/abs/1204.1505|arxiv:1204.1505 [quant-ph]]] | ||
- | |||
//Relative Discrepancy does not separate Information and Communication Complexity//,\\ | //Relative Discrepancy does not separate Information and Communication Complexity//,\\ | ||
Line 282: | Line 292: | ||
//Information transmission in bosonic memory channels using Gaussian matrix-product states as near-optimal symbols//,\\ | //Information transmission in bosonic memory channels using Gaussian matrix-product states as near-optimal symbols//,\\ | ||
J. Schäfer, E. Karpov, and N. J. Cerf\\ | J. Schäfer, E. Karpov, and N. J. Cerf\\ | ||
- | AIP Conference Proceedings, 1633, 192 (2014)\\ | + | AIP Conference Proceedings, 1633, 192 (2014).\\ |
- | Proc. of the 11th International Conference on Quantum Communication, Measurement and Computation, Vienna, 2012, edited by H.-J. Schmiedmayer and P. Walther\\ | + | Proc. of the 11th International Conference on Quantum Communication (QCMC), Measurement and Computation, Vienna, 2012, edited by H.-J. Schmiedmayer and P. Walther.\\ |
[[ https://doi.org/10.1063/1.4903134| doi:10.1063/1.4903134]]\\ | [[ https://doi.org/10.1063/1.4903134| doi:10.1063/1.4903134]]\\ | ||
{{ :publications:2014-aip-1633-192.pdf |PDF file}} | {{ :publications:2014-aip-1633-192.pdf |PDF file}} | ||
Line 289: | Line 299: | ||
//The Holy Grail of quantum optical communication//,\\ | //The Holy Grail of quantum optical communication//,\\ | ||
R.Garcia-Patron, C. Navarrete-Benlloch, S. Lloyd, J. H. Shapiro, and N. J. Cerf\\ | R.Garcia-Patron, C. Navarrete-Benlloch, S. Lloyd, J. H. Shapiro, and N. J. Cerf\\ | ||
- | AIP Conference Proceedings, 1633, 109 (2014)\\ | + | AIP Conference Proceedings, 1633, 109 (2014).\\ |
- | Proc. of the 11th International Conference on Quantum Communication, Measurement and Computation, Vienna, 2012, edited by H.-J. Schmiedmayer and P. Walther\\ | + | Proc. of the 11th International Conference on Quantum Communication (QCMC), Measurement and Computation, Vienna, 2012, edited by H.-J. Schmiedmayer and P. Walther.\\ |
[[ https://doi.org/10.1063/1.4903108| doi:10.1063/1.4903108]]\\ | [[ https://doi.org/10.1063/1.4903108| doi:10.1063/1.4903108]]\\ | ||
{{ :publications:2014-aip-1633-109.pdf |PDF file}} | {{ :publications:2014-aip-1633-109.pdf |PDF file}} | ||
Line 300: | Line 310: | ||
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]] | ||
- | |||
- | //Gaussian classical capacity of Gaussian quantum channels//,\\ | ||
- | E. Karpov, J. Schäfer, R. Garcia-Patron, O. V. Pilyavets, and N. J. Cerf\\ | ||
- | Nanosystems: Physics, Chemistry, Mathematics 4, 496 (2013).\\ | ||
- | {{:publications:2013-NPCM-4-496.pdf|PDF file}} | ||
//A strong direct product theorem for quantum query complexity//,\\ | //A strong direct product theorem for quantum query complexity//,\\ | ||
Line 316: | Line 321: | ||
{{:publications:2013-PRL-111-030503.pdf|PDF file}}, {{publications:2013-PRL-111-030503-SuppMat.pdf|Suppl. Mat.}}, | {{:publications:2013-PRL-111-030503.pdf|PDF file}}, {{publications:2013-PRL-111-030503-SuppMat.pdf|Suppl. Mat.}}, | ||
[[http://arxiv.org/abs/1303.4939|arXiv:1303.4939 [quant-ph]]] | [[http://arxiv.org/abs/1303.4939|arXiv:1303.4939 [quant-ph]]] | ||
+ | |||
+ | //Gaussian classical capacity of Gaussian quantum channels//,\\ | ||
+ | E. Karpov, J. Schäfer, R. Garcia-Patron, O. V. Pilyavets, and N. J. Cerf\\ | ||
+ | Nanosystems: Physics, Chemistry, Mathematics 4, 496 (2013).\\ | ||
+ | {{:publications:2013-NPCM-4-496.pdf|PDF file}} | ||
//Explicit relation between all lower bound techniques for quantum query complexity//,\\ | //Explicit relation between all lower bound techniques for quantum query complexity//,\\ |