iweb visitor

Jérémie Roland

jroland.jpg

Email: jroland (at) ulb.ac.be
Phone: +32-2-650-28-75
Fax: +32-2-650-29-41
Address: QuIC - Ecole Polytechnique de Bruxelles
Université Libre de Bruxelles
50 av. F. D. Roosevelt - CP 165/59
B-1050 Bruxelles
Belgique

Short biography

  • Born in Brussels in 1976.
  • In 1994, he began to study engineering at the University of Brussels (ULB).
  • From 1996 to 1998, he studied at the Ecole Centrale de Lille (France) as part of the TIME double-graduating exchange program.
  • In 1999, he graduated as Engineer in Physics at the University of Brussels and simultaneously as Engineer at the Ecole Centrale de Lille.
  • In 2000, he got a degree of Advanced Studies (DEA) in Theoretical Physics at the ULB.
  • From 2000 to 2004, he did a PhD thesis at QuIC, where he also worked as a teaching assistant for courses of information theory and quantum physics.
  • From 2004 to 2006, he held a postdoctoral position at the Laboratoire de Recherche en Informatique in Orsay, France.
  • From January to December 2007, he was a Postdoctoral Researcher of the University of California, Berkeley, USA.
  • From January to May 2008, he was a Postdoctoral Researcher of the Belgian FNRS, based at the University of Brussels.
  • From May 2008 to August 2011, he was a Research Staff Member at NEC Laboratories America in Princeton, USA.

Teaching

  • Compléments de programmation et d'algorithmique (INFO-H-304)
  • Quantum information and computation (INFO-H-514) - partim: Quantum computation
  • Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Complexity Theory
  • Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe
  • Signaux et Systèmes (MATH-H-3001) - partim: Exercices
  • Examen spécial d'admission en Polytechnique - Géométrie

Research interests

  • Quantum algorithms
  • Quantum walks
  • Adiabatic quantum computation
  • Quantum query complexity
  • Quantum non-locality
  • Quantum communication complexity
  • Quantum cryptographic primitives

Selected talks

Publications

[1] Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, and Jérémie Roland. Relative discrepancy does not separate information and communication complexity. ACM Transactions on Computation Theory, 9(1):4:1--4:15, 2016. [ DOI ]
[2] Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, and Gabriel Senno. Robust Bell inequalities from communication complexity. In 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016), volume 61 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1--5:24, 2016. [ arXiv | http ]
[3] Mathieu Brandeho and Jérémie Roland. A universal adiabatic quantum query algorithm. In 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC'15), volume 44 of Leibniz International Proceedings in Informatics (LIPIcs), pages 163--179, 2015. [ DOI | arXiv ]
[4] Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, and David Xiao. Lower bounds on information complexity via zero-communication protocols and applications. SIAM Journal on Computing, 44(5):1550--1572, 2015. [ DOI | arXiv ]
[5] Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, and Jérémie Roland. Relative Discrepancy does not separate Information and Communication Complexity. In 42nd International Colloquium on Automata, Languages and Programming (ICALP'15), volume 9134 of Lecture Notes in Computer Science, pages 506--516. Springer, 2015. [ http ]
[6] Loïck Magnin and Jérémie Roland. Explicit relation between all lower bound techniques for quantum query complexity. International Journal of Quantum Information, 13(4):1350059, 2015. Online ready. [ DOI ]
[7] Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. Quantum walks can find a marked element on any graph. Algorithmica, 74(2):851--907, 2015. [ DOI | arXiv ]
[8] Maris Ozols, Martin Roetteler, and Jérémie Roland. Quantum rejection sampling. ACM Transactions on Computation Theory, 5(3):11:1--11:33, 2013. [ DOI ]
[9] Troy Lee and Jérémie Roland. A strong direct product theorem for quantum query complexity. Computational Complexity, 22(2):429--462, 2013. [ DOI ]
[10] Loïck Magnin and Jérémie Roland. Explicit relation between all lower bound techniques for quantum query complexity. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS'13), pages 434--445, 2013. [ DOI | arXiv ]
[11] Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, and David Xiao. Lower bounds on information complexity via zero-communication protocols and applications. In 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12), pages 500--509, 2012. [ DOI | arXiv ]
[12] Sophie Laplante, Virginie Lerays, and Jérémie Roland. Classical and quantum partition bound and detector inefficiency. In 39th International Colloquium on Automata, Languages and Programming (ICALP'12), volume 7391 of Lecture Notes in Computer Science, pages 617--628. Springer, 2012. [ DOI | arXiv ]
[13] Troy Lee and Jérémie Roland. A strong direct product theorem for quantum query complexity. In 27th IEEE Conference on Computational Complexity (CCC'12), pages 236--246. IEEE, 2012. [ DOI | arXiv ]
[14] Maris Ozols, Martin Roetteler, and Jérémie Roland. Quantum rejection sampling. In 3rd Conference on Innovations in Theoretical Computer Science (ITCS'12), pages 290--308. ACM Press, 2012. [ DOI | arXiv ]
[15] Dmitry Gavinsky, Martin Roetteler, and Jérémie Roland. Quantum algorithm for the Boolean hidden shift problem. In 17th International Computing & Combinatorics Conference (COCOON'11), volume 6842 of Lecture Notes in Computer Science, pages 158--167. Springer, 2011. [ DOI | arXiv ]
[16] Andris Ambainis, Loïck Magnin, Martin Roetteler, and Jérémie Roland. Symmetry-assisted adversaries for quantum state generation. In 26th IEEE Conference on Computational Complexity (CCC'11), pages 167--177, 2011. [ DOI | arXiv ]
[17] Julien Degorre, Marc Kaplan, Sophie Laplante, and Jérémie Roland. The communication complexity of non-signaling distributions. Quantum Information & Computation, 11(7&8):649--676, 2011. [ arXiv | http ]
[18] Frédéric Magniez, Ashwin Nayak, Jérémie Roland, and Miklos Santha. Search via quantum walk. SIAM Journal on Computing, 40(1):142--164, 2011. [ DOI | arXiv ]
[19] Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland. Non-local box complexity and secure function evaluation. Quantum Information & Computation, 11(1&2):40--69, 2011. [ arXiv | http ]
[20] Hari Krovi, Maris Ozols, and Jérémie Roland. Adiabatic condition and the quantum hitting time of Markov chains. Physical Review A, 82(2):022333, 2010. [ DOI | arXiv ]
[21] Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. Finding is as easy as detecting for quantum walks. In 37th International Colloquium on Automata, Languages and Programming (ICALP'10), volume 6198 of Lecture Notes in Computer Science, pages 540--551. Springer, 2010. [ DOI | arXiv ]
[22] Boris Altshuler, Hari Krovi, and Jérémie Roland. Anderson localization makes adiabatic quantum optimization fail. Proceedings of the National Academy of Sciences of the United States of America, 107(28):12446--12450, 2010. [ DOI | arXiv ]
[23] Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland. Non-local box complexity and secure function evaluation. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'09), volume 4 of Leibniz International Proceedings in Informatics (LIPICs), pages 239--250. Schloss Dagstuhl, 2009. [ DOI | arXiv ]
[24] Boris Altshuler, Hari Krovi, and Jérémie Roland. Adiabatic quantum optimization fails for random instances of NP-complete problems. Technical Report 2009-L128, NEC Laboratories America, 2009. [ arXiv ]
[25] Julien Degorre, Marc Kaplan, Sophie Laplante, and Jérémie Roland. The communication complexity of non-signaling distributions. In 34th International Symposium on Mathematical Foundations of Computer Science (MFCS'09), volume 5734 of Lecture Notes in Computer Science, pages 270--281. Springer, 2009. [ DOI | arXiv ]
[26] Jérémie Roland and Mario Szegedy. Amortized communication complexity of distributions. In 36th International Colloquium on Automata, Languages and Programming (ICALP'09), volume 5555 of Lecture Notes in Computer Science, pages 738--749. Springer, 2009. [ DOI ]
[27] Olga Lopez Acevedo, Jérémie Roland, and Nicolas J. Cerf. Exploring scalar quantum walks on Cayley graphs. Quantum Information & Computation, 8(1&2):68--81, 2008. [ arXiv | http ]
[28] Julien Degorre, Sophie Laplante, and Jérémie Roland. Classical simulation of traceless binary observables on any bipartite quantum state. Physical Review A, 75:012309, 2007. [ DOI | arXiv ]
[29] Frédéric Magniez, Ashwin Nayak, Jérémie Roland, and Miklos Santha. Search via quantum walk. In 39th ACM Symposium on Theory of Computing (STOC'07), pages 575--584, 2007. [ DOI | arXiv ]
[30] Sofyan Iblisdir and Jérémie Roland. Optimal finite measurements and Gauss quadratures. Physics Letters A, 358(5-6):368--372, 2006. [ DOI | arXiv ]
[31] Nicolas J. Cerf, Julien Clavareau, Jérémie Roland, and Chiara Macchiavello. Information transmission via entangled quantum states in Gaussian channels with memory. International Journal of Quantum Information, 4(3):439--452, 2006. Proceedings of the International Workshop “Quantum Entanglement in Physical and Information Sciences” (December 14--18, 2004, Pisa, Italy). [ DOI | arXiv ]
[32] Julien Degorre and Jérémie Roland. An intuitive approach for the simulation of quantum correlations. In 26th Symposium on Information Theory in the Benelux, 2005. [ .pdf ]
[33] Julien Degorre, Sophie Laplante, and Jérémie Roland. Simulating quantum correlations as a distributed sampling problem. Physical Review A, 72:062314, 2005. [ DOI | arXiv ]
[34] Nicolas J. Cerf, Julien Clavareau, Chiara Macchiavello, and Jérémie Roland. Quantum entanglement enhances the capacity of bosonic channels with memory. Physical Review A, 72:042330, 2005. [ DOI | arXiv ]
[35] Jérémie Roland and Nicolas J. Cerf. Noise resistance of adiabatic quantum computation using random matrix theory. Physical Review A, 71:032330, 2005. [ DOI | arXiv ]
[36] Jérémie Roland. Adiabatic Quantum Computation. PhD thesis, Université Libre de Bruxelles, 2004. [ .pdf ]
[37] Jérémie Roland and Nicolas J. Cerf. Adiabatic quantum search algorithm for structured problems. Physical Review A, 68:062312, 2003. [ DOI | arXiv ]
[38] Jérémie Roland and Nicolas J. Cerf. Quantum-circuit model of Hamiltonian search algorithms. Physical Review A, 68:062311, 2003. [ DOI | arXiv ]
[39] Serge Massar, Stefano Pironio, Jérémie Roland, and Bernard Gisin. Bell inequalities resistant to detector inefficiency. Physical Review A, 66:052112, 2002. [ DOI | arXiv ]
[40] Jérémie Roland and Nicolas J. Cerf. Quantum search by local adiabatic evolution. Physical Review A, 65:042308, 2002. [ DOI | arXiv ]
[41] Michel Hesse, Jérémie Roland, and Daniel Baye. Solving the resonating-group equation on a Lagrange mesh. Nuclear Physics A, 709:184--200, 2002. [ DOI ]

This file was generated by bibtex2html 1.98.