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 [2016/03/16 10:43] jroland [2015] |
publications [2016/04/27 15:55] ncerf |
||
|---|---|---|---|
| Line 25: | Line 25: | ||
| [[publications#2014|2014]] | [[publications#2014|2014]] | ||
| [[publications#2014|2015]] | [[publications#2014|2015]] | ||
| + | [[publications#2014|2016]] | ||
| [[publications#PhD Theses|PhD Theses]] | [[publications#PhD Theses|PhD Theses]] | ||
| [[publications#Ms Theses|Ms Theses]] | [[publications#Ms Theses|Ms Theses]] | ||
| - | ==== 2015 ==== | + | ==== 2016 ==== |
| - | //Explicit relation between all lower bound techniques for quantum query complexity//,\\ | + | //Efficient iterative entanglement distillation without quantum memory//,\\ |
| - | L. Magnin and J. Roland\\ | + | D. Abdelkhalek, M. Syllwasschy, N. J. Cerf, J. Fiurasek, and R. Schnabel\\ |
| - | International Journal of Quantum Information, 13(4): 1350059 (2015).\\ | + | Nature Communications (to appear, 2016). |
| - | [[http://dx.doi.org/10.1142/S0219749913500597|DOI]], | + | |
| - | [[http://arxiv.org/abs/1209.2713|arxiv:1209.2713 [quant-ph]]] | + | |
| //Majorization preservation of Gaussian bosonic channels//,\\ | //Majorization preservation of Gaussian bosonic channels//,\\ | ||
| Line 42: | Line 41: | ||
| //Detection of non-Gaussian entangled states with an improved continuous-variable separability criterion//,\\ | //Detection of non-Gaussian entangled states with an improved continuous-variable separability criterion//,\\ | ||
| A. Hertz, E. Karpov, A. Mandilara, and N. J. Cerf\\ | A. Hertz, E. Karpov, A. Mandilara, and N. J. Cerf\\ | ||
| - | to appear in Phys. Rev. A\\ | + | Phys. Rev. A 93 (2016) 032330.\\ |
| + | {{:publications:2016-pra-93-032330.pdf|PDF file}}, | ||
| [[http://arxiv.org/abs/1511.06621|arXiv:1511.06621 [quant-ph]]] | [[http://arxiv.org/abs/1511.06621|arXiv:1511.06621 [quant-ph]]] | ||
| - | //Efficient iterative entanglement distillation without quantum memory//,\\ | + | ==== 2015 ==== |
| - | D. Abdelkhalek, M. Syllwasschy, N. J. Cerf, J. Fiurasek, and R. Schnabel\\ | + | |
| - | submitted (August 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: | //Entropy generation in Gaussian quantum transformations: | ||
| Line 110: | Line 132: | ||
| ==== 2013 ==== | ==== 2013 ==== | ||
| - | |||
| - | //Explicit relation between all lower bound techniques for quantum query complexity//,\\ | ||
| - | L. Magnin and J. Roland\\ | ||
| - | International Journal of Quantum Information, Online ready (2013).\\ | ||
| - | [[http://dx.doi.org/10.1142/S0219749913500597|DOI]] | ||
| //Quantum Rejection sampling//,\\ | //Quantum Rejection sampling//,\\ | ||
| Line 217: | Line 234: | ||
| O. V. Pilyavets, C. Lupo, and S. Mancini\\ | O. V. Pilyavets, C. Lupo, and S. Mancini\\ | ||
| IEEE Trans. Inf. Theory 58 (2012) 6126.\\ | 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]]] | [[http://arxiv.org/abs/0907.1532|arXiv:0907.1532 [quant-ph]]] | ||