|
|
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
Publications
| [1] | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. Finding is as easy as detecting for quantum walks. 2010. eprint arXiv:1002.2419. [ http | Abstract ] |
| [2] | Boris Altshuler, Hari Krovi, and Jérémie Roland. Anderson localization casts clouds over adiabatic quantum optimization. 2009. eprint arXiv:0912.0746. [ http | Abstract ] |
| [3] | 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. eprint arXiv:0903.2179. [ DOI | http | Abstract ] |
| [4] | 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. e-print arXiv:0908.2782. [ http | Abstract ] |
| [5] | Julien Degorre, Marc Kaplan, Sophie Laplante, and Jérémie Roland. The communication complexity of non-signaling distributions. In 34st International Symposium on Mathematical Foundations of Computer Science (MFCS'09), volume 5734 of Lecture Notes in Computer Science, pages 270-281. Springer, 2009. e-print arXiv:0804.4859. [ DOI | http | Abstract ] |
| [6] | 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 | Abstract ] |
| [7] | 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. [ http | Abstract ] |
| [8] | 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. [ DOI | http | Abstract ] |
| [9] | 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. e-print quant-ph/0608026. [ DOI | http | Abstract ] |
| [10] | 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. [ DOI | http | Abstract ] |
| [11] | 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. [ DOI | http | Abstract ] |
| [12] | 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 | Abstract ] |
| [13] | 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. [ DOI | http | Abstract ] |
| [14] | 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. [ DOI | http | Abstract ] |
| [15] | 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. [ DOI | http | Abstract ] |
| [16] | Jérémie Roland. Adiabatic Quantum Computation. PhD thesis, Université Libre de Bruxelles, 2004. [ .pdf | Abstract ] |
| [17] | 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. [ DOI | http | Abstract ] |
| [18] | 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. [ DOI | http | Abstract ] |
| [19] | 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. [ DOI | http | Abstract ] |
| [20] | 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. [ DOI | http | Abstract ] |
| [21] | 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 | Abstract ] |
©2006 NEC Laboratories America, Inc. All rights reserved.
