NEC

NEC Laboratories America

MyPhoto

Jérémie Roland

NEC Laboratories America, Inc.
4 Independence Way, Suite 200
Princeton, NJ 08540

phone: (+1) 609 951 2781
fax: (+1) 609 951 2483
email

Short biography

I received a B.S. in Physics Engineering in 1999, from the "Université Libre de Bruxelles" (ULB) in Belgium and the "Ecole Centrale de Lille" in France. I then obtained a M.S in Theoretical Physics from ULB in 2000, and continued as a PhD student under the supervision of Nicolas Cerf in the group QuIC at ULB, where I developed research interests for quantum information, and more particularly quantum computation. I defended a PhD dissertation on Adiabatic Quantum Computation in 2004. Later, I held subsequent postdoctoral positions at LRI (France), UC Berkeley and ULB, where I continued research in the field of quantum computation. More precisely, I worked on subjects such as quantum walk-based algorithms, quantum non-locality and communication complexity. In 2008, I joined the quantum IT group at NEC Laboratories America as a Research Staff Member.

Research interests

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

    Publications

    [1] Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland. Non-local box complexity and secure function evaluation. In Foundations of Software Technology and Theoretical Computer Science, Leibniz International Proceedings in Informatics, 2009. eprint arXiv:0903.2179. [ bib | http | Abstract ]
    [2] Julien Degorre, Marc Kaplan, Sophie Laplante, and Jeremie Roland. The communication complexity of non-signaling distributions. In 34st International Symposium on Mathematical Foundations of Computer Science, volume 5734 of Lecture Notes in Computer Science, pages 270-281. Springer, 2009. [ bib | DOI | http | Abstract ]
    [3] 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. [ bib | DOI | Abstract ]
    [4] 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. e-print quant-ph/0609234. [ bib | http | Abstract ]
    [5] 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. e-print quant-ph/0608064. [ bib | DOI | http | Abstract ]
    [6] 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, pages 575-584, 2007. e-print quant-ph/0608026. [ bib | http | Abstract ]
    [7] Sofyan Iblisdir and Jérémie Roland. Optimal finite measurements and Gauss quadratures. Physics Letters A, 358(5-6):368-372, 2006. e-print quant-ph/0410237. [ bib | DOI | http | Abstract ]
    [8] 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). e-print quant-ph/0508197. [ bib | DOI | .html | Abstract ]
    [9] 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. [ bib | .pdf | Abstract ]
    [10] Julien Degorre, Sophie Laplante, and Jérémie Roland. Simulating quantum correlations as a distributed sampling problem. Physical Review A, 72:062314, 2005. e-print quant-ph/0507120. [ bib | http | Abstract ]
    [11] 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. e-print quant-ph/0412089. [ bib | http | Abstract ]
    [12] Jérémie Roland and Nicolas J. Cerf. Noise resistance of adiabatic quantum computation using random matrix theory. Physical Review A, 71:032330, 2005. e-print quant-ph/0409127. [ bib | http | Abstract ]
    [13] Jérémie Roland. Adiabatic Quantum Computation. PhD thesis, Université Libre de Bruxelles, 2004. [ bib | .pdf | Abstract ]
    [14] Jérémie Roland and Nicolas J. Cerf. Adiabatic quantum search algorithm for structured problems. Physical Review A, 68:062312, 2003. e-print quant-ph/0304039. [ bib | http | Abstract ]
    [15] Jérémie Roland and Nicolas J. Cerf. Quantum-circuit model of Hamiltonian search algorithms. Physical Review A, 68:062311, 2003. e-print quant-ph/0302138. [ bib | http | Abstract ]
    [16] Serge Massar, Stefano Pironio, Jérémie Roland, and Bernard Gisin. Bell inequalities resistant to detector inefficiency. Physical Review A, 66:052112, 2002. e-print quant-ph/0205130. [ bib | http | Abstract ]
    [17] Jérémie Roland and Nicolas J. Cerf. Quantum search by local adiabatic evolution. Physical Review A, 65:042308, 2002. e-print quant-ph/0107015. [ bib | http | Abstract ]
    [18] 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. [ bib | http | Abstract ]

    NEC Laboratories America Home

    ©2006 NEC Laboratories America, Inc. All rights reserved.