iweb visitor

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
members:jroland [2012/09/14 10:04]
jroland
members:jroland [2013/06/21 17:59]
jroland
Line 1: Line 1:
 +~~NOTOC~~
 ====== Jérémie Roland ====== ====== Jérémie Roland ======
  
Line 8: Line 9:
 |- |-
 ! Phone: ​ ! Phone: ​
-| +32-2-650-28-20+| +32-2-650-28-75
 |- |-
 ! Fax: ! Fax:
Line 17: Line 18:
 |} |}
  
-=== Short biography ===+==== Short biography ​====
   * Born in Brussels in 1976.   * Born in Brussels in 1976.
   * In 1994, he began to study engineering at the [[http://​www.ulb.ac.be/​|University of Brussels]] (ULB).   * In 1994, he began to study engineering at the [[http://​www.ulb.ac.be/​|University of Brussels]] (ULB).
Line 30: Line 31:
   * From May 2008 to August 2011, he was a Research Staff Member at [[http://​www.nec-labs.com/​|NEC Laboratories America]]. ​   * From May 2008 to August 2011, he was a Research Staff Member at [[http://​www.nec-labs.com/​|NEC Laboratories America]]. ​
  
-=== Research interests ===+==== Research interests ​====
   * Quantum algorithms   * Quantum algorithms
   * Quantum walks   * Quantum walks
Line 38: Line 39:
   * Quantum query complexity   * Quantum query complexity
  
-=== Selected talks === +==== Selected talks ==== 
-  * Quantum query complexity: Adversaries,​ polynomials and direct product theorems. [[http://​qa2012.iqc.uwaterloo.ca/​|Recent Progress in Quantum Algorithms]] at IQC (Waterloo, Canada), April 11-13, 2012. [{{:​members:​jroland:​talk-qa-2012-printout.pdf|PDF}} | [[http://​www.youtube.com/​watch?​v=N9BuArGFqjU|Video]]]+  * Quantum query complexity: Adversaries,​ polynomials and direct product theorems. [[http://​www.maths.bris.ac.uk/​~maowg/​q-alg-2013/​q-alg-2013.html|The 3rd Heilbronn Quantum Algorithms Day]] in Bristol (UK), April 25, 2013. [{{:​members:​jroland:​bristol-algorithm-day-2013-handout.pdf|PDF}}] 
 +  * Quantum algorithms based on quantum walks. [[http://​www-fourier.ujf-grenoble.fr/​~joye/​quawag/​QuaWaG/​|Quantum Walks in Grenoble]] (France), November 13-14, 2012. [{{:​members:​jroland:​quawag-grenoble-presentation-handout.pdf|PDF}}] 
 +  * Quantum query complexity: Adversaries,​ polynomials and direct product theorems. [[http://​qa2012.iqc.uwaterloo.ca/​|Recent Progress in Quantum Algorithms]] at IQC (Waterloo, Canada), April 11-13, 2012. [{{:​members:​jroland:​talk-iqc-pi-workshop-2012-printout.pdf|PDF}} | [[http://​www.youtube.com/​watch?​v=N9BuArGFqjU|Video]]]
   * Quantum rejection sampling. [[http://​quantum.nasa.gov/​|First NASA Quantum Future Technologies Conference]] at NASA Ames Research Center (USA), January 17-21, 2012. [{{:​members:​jroland:​talk-qft-2012-printout.pdf|PDF}} | [[http://​connect.arc.nasa.gov/​p59zv0ohngj/​|Video]]]   * Quantum rejection sampling. [[http://​quantum.nasa.gov/​|First NASA Quantum Future Technologies Conference]] at NASA Ames Research Center (USA), January 17-21, 2012. [{{:​members:​jroland:​talk-qft-2012-printout.pdf|PDF}} | [[http://​connect.arc.nasa.gov/​p59zv0ohngj/​|Video]]]
   * Quantum rejection sampling. [[http://​www.iro.umontreal.ca/​~qip2012/​|15th Workshop on Quantum Information Processing]] (QIP'​12) in Montréal (Canada), December 12-16, 2011. [{{:​members:​jroland:​talk-qip12-printout.pdf|PDF}} | [[http://​www.iro.umontreal.ca/​~qip2012/​videos/​Talks/​Thursday/​QIP2012-Thursday-roland.mov|Video]]]   * Quantum rejection sampling. [[http://​www.iro.umontreal.ca/​~qip2012/​|15th Workshop on Quantum Information Processing]] (QIP'​12) in Montréal (Canada), December 12-16, 2011. [{{:​members:​jroland:​talk-qip12-printout.pdf|PDF}} | [[http://​www.iro.umontreal.ca/​~qip2012/​videos/​Talks/​Thursday/​QIP2012-Thursday-roland.mov|Video]]]
Line 48: Line 51:
   * Search via quantum walk. [[http://​www2.research.att.com/​~dsj/​stoc07.html|39th ACM Symposium on Theory of Computing]] (STOC'​07) in San Diego (USA), June 11-13, 2007. [{{:​members:​jroland:​stoc-presentation.pdf|PDF}}]   * Search via quantum walk. [[http://​www2.research.att.com/​~dsj/​stoc07.html|39th ACM Symposium on Theory of Computing]] (STOC'​07) in San Diego (USA), June 11-13, 2007. [{{:​members:​jroland:​stoc-presentation.pdf|PDF}}]
  
-=== Publications ===+==== Publications ​====
 <​html>​ <​html>​
  
Line 62: Line 65:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="MR12">​1</​a>​]+[<a name="LR13">1</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Troy Lee and Jérémie Roland. 
 + A strong direct product theorem for quantum query complexity. 
 + <​em>​Computational Complexity</​em>,​ 22(2):​429-462,​ 2013. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​s00037-013-0066-8">​DOI</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​MR13">​2</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 68: Line 85:
  ​Explicit relation between all lower bound techniques for quantum  ​Explicit relation between all lower bound techniques for quantum
   query complexity.   query complexity.
- Technical Report ​arXiv:​1209.2713, ​arXiv2012+ In <​em>​30th International Symposium on Theoretical Aspects of 
-[&​nbsp;<​a href="​http://​arxiv.org/abs/1209.2713">arXiv</​a>&​nbsp;​|  +  Computer Science (STACS'​13)</​em>,​ number ​arXiv:​1209.2713, ​pages 434-4452013
-<a href="​http://​arxiv.org/​abs/​1209.2713">​http</​a>&​nbsp;​]+[&​nbsp;<​a href="​http://​dx.doi.org/10.4230/LIPIcs.STACS.2013.434">DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1209.2713">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 78: Line 96:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KLL+12">​2</a>]+[<a name="​KLL+12">​3</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 86: Line 104:
   protocols and applications.   protocols and applications.
  In <​em>​53rd Annual IEEE Symposium on Foundations of Computer Science  In <​em>​53rd Annual IEEE Symposium on Foundations of Computer Science
-  (FOCS'​12)</​em>,​ 2012+  (FOCS'​12)</​em>​, pages 500-509, 2012. 
- To appear+[&nbsp;<a href="​http://​dx.doi.org/​10.1109/​FOCS.2012.68">​DOI</​a>&​nbsp;​|  
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​]+<a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 96: Line 114:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLR12">​3</a>]+[<a name="​LLR12">​4</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 113: Line 131:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LR11">​4</a>]+[<a name="​LR11">​5</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 120: Line 138:
  In <​em>​27th IEEE Conference on Computational Complexity (CCC'​12)</​em>,​  In <​em>​27th IEEE Conference on Computational Complexity (CCC'​12)</​em>,​
   pages 236-246. IEEE, 2012.   pages 236-246. IEEE, 2012.
- To appear. 
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1109/​CCC.2012.17">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1109/​CCC.2012.17">​DOI</​a>&​nbsp;​| ​
 <a href="​http://​arxiv.org/​abs/​1104.4468">​arXiv</​a>&​nbsp;​] <a href="​http://​arxiv.org/​abs/​1104.4468">​arXiv</​a>&​nbsp;​]
Line 130: Line 147:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ORR11">​5</a>]+[<a name="​ORR11">​6</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 146: Line 163:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​GRR11">​6</a>]+[<a name="​GRR11">​7</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 163: Line 180:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​AMRR11">​7</a>]+[<a name="​AMRR11">​8</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 180: Line 197:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr11">​8</a>]+[<a name="​dklr11">​9</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 195: Line 212:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs11-sicomp">​9</a>]+[<a name="​mnrs11-sicomp">​10</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 211: Line 228:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr11">​10</a>]+[<a name="​kklr11">​11</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 226: Line 243:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kor10">​11</a>]+[<a name="​kor10">​12</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 241: Line 258:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kmor10">​12</a>]+[<a name="​kmor10">​13</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 258: Line 275:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr10-pnas">​13</a>]+[<a name="​akr10-pnas">​14</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 274: Line 291:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr09">​14</a>]+[<a name="​kklr09">​15</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 292: Line 309:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr09-arxiv">​15</a>]+[<a name="​akr09-arxiv">​16</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 307: Line 324:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr09">​16</a>]+[<a name="​dklr09">​17</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 324: Line 341:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rs09">​17</a>]+[<a name="​rs09">​18</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 340: Line 357:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​arc06">​18</a>]+[<a name="​arc06">​19</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 355: Line 372:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr06:​qudits">​19</a>]+[<a name="​dlr06:​qudits">​20</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 371: Line 388:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs06">​20</a>]+[<a name="​mnrs06">​21</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 388: Line 405:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ir06">​21</a>]+[<a name="​ir06">​22</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 403: Line 420:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pisa">​22</a>]+[<a name="​ccmr05:​pisa">​23</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 423: Line 440:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dr05">​23</a>]+[<a name="​dr05">​24</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 437: Line 454:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr05">​24</a>]+[<a name="​dlr05">​25</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 452: Line 469:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pra">​25</a>]+[<a name="​ccmr05:​pra">​26</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 469: Line 486:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc05">​26</a>]+[<a name="​rc05">​27</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 485: Line 502:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​roland04">​27</a>]+[<a name="​roland04">​28</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 499: Line 516:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03b">​28</a>]+[<a name="​rc03b">​29</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 514: Line 531:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03a">​29</a>]+[<a name="​rc03a">​30</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 529: Line 546:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mprg02">​30</a>]+[<a name="​mprg02">​31</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 544: Line 561:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc02">​31</a>]+[<a name="​rc02">​32</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 559: Line 576:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​hrb02">​32</a>]+[<a name="​hrb02">​33</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 572: Line 589:
 <a href="​http://​www.lri.fr/​~filliatr/​bibtex2html/">​bibtex2html</​a>​ 1.96.</​em></​p>​ <a href="​http://​www.lri.fr/​~filliatr/​bibtex2html/">​bibtex2html</​a>​ 1.96.</​em></​p>​
  
 +
 +<!-- Site Meter -->
 +<script type="​text/​javascript"​ src="​http://​s12.sitemeter.com/​js/​counter.js?​site=s12jereroland">​
 +</​script>​
 +<​noscript>​
 +<a href="​http://​s12.sitemeter.com/​stats.asp?​site=s12jereroland"​ target="​_top">​
 +<img src="​http://​s12.sitemeter.com/​meter.asp?​site=s12jereroland"​ alt="​Site Meter" border="​0"/></​a>​
 +</​noscript>​
 +<!-- Copyright (c)2009 Site Meter -->
  
 </​html>​ </​html>​