Differences

This shows you the differences between two versions of the page.

--- publications [2016/03/16 10:44]
jroland [2013]
+++ publications [2017/09/13 14:28]
ncerf
@@ Line 3: / Line 3: @@
 ====== Publications ======
-The QuIC Centre currently holds two patents and authors more than 150 scientific publications in the field of quantum information theory and quantum computing, among which two in the journal //Nature//, one in //Nature Physics//, two in //Nature Photonics//, and one in //Nature Communications//.
+The QuIC Centre currently holds two patents and authors more than 150 scientific publications in the field of quantum information and quantum computing, among which two in the journal //Nature//, one in //Nature Physics//, two in //Nature Photonics//, and two in //Nature Communications//.
 [[publications#1996|1996]]
@@ Line 24: / Line 24: @@
 [[publications#2013|2013]]
 [[publications#2014|2014]]
-[[publications#2014|2015]]
+[[publications#2015|2015]]
+[[publications#2016|2016]]
+[[publications#2017|2017]]
 [[publications#PhD Theses|PhD Theses]]
 [[publications#Ms Theses|Ms Theses]]
-==== 2015 ====
+==== 2017 ====
-//Explicit relation between all lower bound techniques for quantum query complexity//,\\
+//Entropy-power uncertainty relations: towards a tight inequality for all Gaussian pure states//,\\
-L. Magnin and J. Roland\\
+A. Hertz, M. G. Jabbour, and N. J. Cerf, J. Phys. A 50 (2017) 385301;
-International Journal of Quantum Information, 13(4): 1350059 (2015).\\
+[[https://doi.org/10.1088/1751-8121/aa852f|doi:10.1088/1751-8121/aa852f]]\\
-[[http://dx.doi.org/10.1142/S0219749913500597|DOI]],
+{{ :publications:2017-jpa-50-385301.pdf |PDF file}},
-[[http://arxiv.org/abs/1209.2713|arxiv:1209.2713 [quant-ph]]]
+[[http://arxiv.org/abs/1702.07286|arXiv:1702.07286 [quant-ph]]]
+//Boson sampling with Gaussian measurements//,\\
+L. Chakhmakhchyan and N. J. Cerf\\
+[[http://arxiv.org/abs/1705.05299|arXiv:1705.05299 [quant-ph]]]
+//Semi-device-independent framework based on natural physical assumptions//,\\
+T. Van Himbeeck, E. Woodhead, N. J. Cerf, R. García-Patrón, and S. Pironio\\
+[[http://arxiv.org/abs/1612.06828|arXiv:1612.06828 [quant-ph]]]
+//Quantum-inspired algorithm for estimating the permanent of positive semidefinite matrices//,\\
+L. Chakhmakhchyan, N. J. Cerf, and R. García-Patrón, Phys. Rev. A 96 (2017) 022329;
+[[https://link.aps.org/doi/10.1103/PhysRevA.96.022329|DOI: 10.1103/PhysRevA.96.022329]]\\
+[[http://arxiv.org/abs/arXiv:1609.02416|arXiv:1609.02416 [quant-ph]]]
+==== 2016 ====
+//Classical capacity of phase-sensitive Gaussian quantum channels//,\\
+J. Schäfer, E. Karpov, O. V. Pilyavets, and N. J. Cerf\\
+[[http://arxiv.org/abs/1609.04119|arXiv:1609.04119 [quant-ph]]]
+//Efficient entanglement distillation without quantum memory//,\\
+D. Abdelkhalek, M. Syllwasschy, N. J. Cerf, J. Fiurasek, and R. Schnabel\\
+Nature Communications 7 (2016) 11720; [[http://www.nature.com/ncomms/2016/160531/ncomms11720/abs/ncomms11720.html|doi:10.1038/ncomms11720]]\\
+{{:publications:2016-ncomms-7-11720.pdf|PDF file}},
+[[http://arxiv.org/abs/1612.08410|arXiv:1612.08410 [quant-ph]]]
+//Higher order nonclassicality from nonlinear coherent states for models with quadratic spectrum//,\\
+A. Hertz, S. Dey, V. Hussin, and H. Eleuch\\
+Symmetry 8 (2016) 36; [[http://dx.doi.org/10.3390/sym8050036|doi:10.3390/sym8050036]]\\
+{{:publications:2016-symmetry-08-36.pdf|PDF file}}
+//Causal and causally separable processes//,\\
+O. Oreshkov and C. Giarmatzi\\
+New J. Phys. 18 (2016) 093020; [[http://iopscience.iop.org/article/10.1088/1367-2630/18/9/093020/meta|doi:10.1088/1367-2630/18/9/093020]]\\
+{{:publications:2016-njp-18-093020.pdf|PDF file}},
+[[http://arxiv.org/abs/1506.05449|arXiv:1506.05449 [quant-ph]]]
 //Majorization preservation of Gaussian bosonic channels//,\\
 M. G. Jabbour, R. García-Patrón, and N. J. Cerf\\
+New J. Phys. 18 (2016) 073047; [[http://iopscience.iop.org/article/10.1088/1367-2630/18/7/073047/meta|doi:	10.1088/1367-2630/18/7/073047]]\\
+{{:publications:2016_njp_18_073047.pdf|PDF file}},
 [[http://arxiv.org/abs/1512.08225|arXiv:1512.08225 [quant-ph]]]
 //Detection of non-Gaussian entangled states with an improved continuous-variable separability criterion//,\\
 A. Hertz, E. Karpov, A. Mandilara, and N. J. Cerf\\
-to appear in Phys. Rev. A\\
+Phys. Rev. A 93 (2016) 032330; [[http://dx.doi.org/10.1103/PhysRevA.93.032330|doi:10.1103/PhysRevA.93.032330]]\\
+{{:publications:2016-pra-93-032330.pdf|PDF file}},
 [[http://arxiv.org/abs/1511.06621|arXiv:1511.06621 [quant-ph]]]
-//Efficient iterative entanglement distillation without quantum memory//,\\
+//Operational quantum theory without predefined time//,\\
-D. Abdelkhalek, M. Syllwasschy, N. J. Cerf, J. Fiurasek, and R. Schnabel\\
+O. Oreshkov and N. J. Cerf\\
-submitted (August 2015).
+New J. Phys. 18 (2016) 073037; [[http://iopscience.iop.org/article/10.1088/1367-2630/18/7/073037/meta|doi:10.1088/1367-2630/18/7/073037]]\\
+{{:publications:2016_njp_18_073037.pdf|PDF file}},
+[[http://arxiv.org/abs/1406.3829|arXiv:1406.3829 [quant-ph]]]
+==== 2015 ====
+//A universal adiabatic quantum query algorithm//,\\
+M. Brandeho and J. Roland\\
+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]]]
+//Lower bounds on information complexity via zero-communication protocols and applications//,\\
+I. Kerenidis, S. Laplante, V. Lerays, J. Roland, and D. Xiao\\
+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]]]
+//Relative Discrepancy does not separate Information and Communication Complexity//,\\
+L. Fontes, R. Jain, I. Kerenidis, S. Laplante, M. Laurière, and J. Roland\\
+In 42nd International Colloquium on Automata, Languages and Programming (ICALP'15), volume 9134 of Lecture Notes in Computer Science : 506-516 (2015).\\
+[[http://dx.doi.org/10.1007/978-3-662-47672-7_41|DOI]],
+[[http://eccc.hpi-web.de/report/2015/028/|ECCC-TR15-028]]
+//Explicit relation between all lower bound techniques for quantum query complexity//,\\
+L. Magnin and J. Roland\\
+International Journal of Quantum Information, 13(4): 1350059 (2015).\\
+[[http://dx.doi.org/10.1142/S0219749913500597|DOI]],
+[[http://arxiv.org/abs/1209.2713|arxiv:1209.2713 [quant-ph]]]
 //Entropy generation in Gaussian quantum transformations:
 applying the replica method to continuous-variable quantum information theory//,\\
 C. N. Gagatsos, A. I. Karanikas, G. Kordas, and N. J. Cerf\\
-npj Quantum Information 2 (2015) 15008; [published online 16 February 2016 | nature.com]\\
+npj Quantum Information 2 (2015) 15008; [published online, February 2016 | nature.com]\\
+[[http://www.nature.com/articles/npjqi20158|doi:10.1038/npjqi.2015.8]]\\
 {{:publications:2015-npjqi-2-15008.pdf|PDF file}}, [[http://arxiv.org/abs/1408.5062|arXiv:1408.5062 [quant-ph]]]
@@ Line 80: / Line 152: @@
 [[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]]
-//Operational quantum theory without predefined time//,\\
-O. Oreshkov and N. J. Cerf\\
-[[http://arxiv.org/abs/1406.3829|arXiv:1406.3829 [quant-ph]]]
 //Ultimate classical communication rates of quantum optical channels//,\\
@@ Line 164: / Line 233: @@
 C. N. Gagatsos, A. I. Karanikas, and G. Kordas\\
 Open Syst. Inf. Dyn. 20 (2013) 1350008.\\ [[http://arxiv.org/abs/1207.0303|arXiv:1207.0303 [quant-ph]]]
 ==== 2012 ====
@@ Line 212: / Line 282: @@
 O. V. Pilyavets, C. Lupo, and S. Mancini\\
 IEEE Trans. Inf. Theory 58 (2012) 6126.\\
+{{:publications:2012-ieee-58-6126.pdf|PDF file}},
 [[http://arxiv.org/abs/0907.1532|arXiv:0907.1532 [quant-ph]]]
@@ Line 244: / Line 315: @@
 Rev. Mod. Phys. 84 (2012) 621.\\
 {{:publications:2012-RMP-84-621.pdf|PDF file}}, [[http://arxiv.org/abs/1110.3234|arXiv:1110.3234 [quant ph]]]
+{|
+|-
+|[[publications#Publications|{{wiki:up.png}}]]
+|-
+|
+|}
 ==== 2011 ====
@@ Line 266: / Line 345: @@
 Proceedings of the 26th Annual IEEE Conference on Computational Complexity (2011).\\
 {{publications:2011-CCC.pdf|PDF file}}
+{|
+|-
+|[[publications#Publications|{{wiki:up.png}}]]
+|-
+|
+|}
 ==== 2010 ====