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/27 14:58] ncerf |
publications [2022/07/19 18:46] 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, Phys. Rev. A, in press (2022).\\ | ||
| + | [[https://arxiv.org/abs/2205.12040 |arXiv:2205.12040 [quant-ph]]] | ||
| ==== 2021 ==== | ==== 2021 ==== | ||
| Line 203: | Line 214: | ||
| In 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC'15), volume 44 of Leibniz International Proceedings in Informatics (LIPIcs): 163--179 (2015).\\ | In 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC'15), volume 44 of Leibniz International Proceedings in Informatics (LIPIcs): 163--179 (2015).\\ | ||
| [[http://dx.doi.org/10.4230/LIPIcs.TQC.2015.163|DOI]], [[http://arxiv.org/abs/1409.3558|arxiv:1409.3558 [quant-ph]]] | [[http://dx.doi.org/10.4230/LIPIcs.TQC.2015.163|DOI]], [[http://arxiv.org/abs/1409.3558|arxiv:1409.3558 [quant-ph]]] | ||
| - | |||
| //Lower bounds on information complexity via zero-communication protocols and applications//,\\ | //Lower bounds on information complexity via zero-communication protocols and applications//,\\ | ||
| Line 209: | 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 250: | Line 259: | ||
| ==== 2014 ==== | ==== 2014 ==== | ||
| - | //21st Central European Workshop on Quantum Optics: Book of Abstracts//.\\ | ||
| - | N. J. Cerf and E. Karpov (eds.), 23-27 June 2014, (Université Libre de Bruxelles, Brussels, 2014) 258 p. \\ | ||
| - | ISBN: 978-2-9601515-0-3\\ | ||
| - | [[http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/192020|http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/192020]] | ||
| - | |||
| //Ultimate classical communication rates of quantum optical channels//,\\ | //Ultimate classical communication rates of quantum optical channels//,\\ | ||
| Line 281: | Line 285: | ||
| [[http://arxiv.org/abs/0910.3473|arXiv:0910.3473 [quant-ph]]] | [[http://arxiv.org/abs/0910.3473|arXiv:0910.3473 [quant-ph]]] | ||
| - | ==== 2013 ==== | + | //21st Central European Workshop on Quantum Optics: Book of Abstracts//.\\ |
| - | + | N. J. Cerf and E. Karpov (eds.), 23-27 June 2014, (Université Libre de Bruxelles, Brussels, 2014) 258 p. \\ | |
| - | //Quantum Rejection sampling//,\\ | + | ISBN: 978-2-9601515-0-3\\ |
| - | M. Ozols, M. Roetteler, and J. Roland\\ | + | [[http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/192020|http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/192020]] |
| - | ACM Transactions on Computation Theory, 5(3):11:1-11:33 (2013).\\ | + | |
| - | [[http://dx.doi.org/10.1145/2493252.2493256|DOI]] | + | |
| //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 ConferenceProceedings, 1633, 192 (2014)\\ | + | AIP Conference Proceedings, 1633, 192 (2014).\\ |
| + | 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}} | ||
| - | //Gaussian classical capacity of Gaussian quantum channels//,\\ | + | //The Holy Grail of quantum optical communication//,\\ |
| - | E. Karpov, J. Schäfer, R. Garcia-Patron, O. V. Pilyavets, and N. J. Cerf\\ | + | R.Garcia-Patron, C. Navarrete-Benlloch, S. Lloyd, J. H. Shapiro, and N. J. Cerf\\ |
| - | Nanosystems: Physics, Chemistry, Mathematics 4, 496 (2013).\\ | + | AIP Conference Proceedings, 1633, 109 (2014).\\ |
| - | {{:publications:2013-NPCM-4-496.pdf|PDF file}} | + | 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]]\\ | ||
| + | {{ :publications:2014-aip-1633-109.pdf |PDF file}} | ||
| + | |||
| + | ==== 2013 ==== | ||
| + | |||
| + | //Quantum Rejection sampling//,\\ | ||
| + | M. Ozols, M. Roetteler, and J. Roland\\ | ||
| + | ACM Transactions on Computation Theory, 5(3):11:1-11:33 (2013).\\ | ||
| + | [[http://dx.doi.org/10.1145/2493252.2493256|DOI]] | ||
| //A strong direct product theorem for quantum query complexity//,\\ | //A strong direct product theorem for quantum query complexity//,\\ | ||
| Line 309: | 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//,\\ | ||