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:02]
jroland
members:jroland [2013/06/21 17:55]
jroland
Line 8: Line 8:
 |- |-
 ! Phone: ​ ! Phone: ​
-| +32-2-650-28-20+| +32-2-650-28-75
 |- |-
 ! Fax: ! Fax:
Line 39: Line 39:
  
 === Selected talks === === Selected talks ===
-  * Quantum query complexity: Adversaries,​ polynomials and direct product theorems. [[http://​qa2012.iqc.uwaterloo.ca/​|Recent Progress in Quantum Algorithms]] ​in 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 50: Line 52:
 === Publications === === Publications ===
 <​html>​ <​html>​
 +
  
 <!-- This document was automatically generated with bibtex2html 1.96 <!-- This document was automatically generated with bibtex2html 1.96
Line 61: Line 64:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​KLL+12">​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 class="​bibtexitem">​ 
 +Lo&​iuml;​ck Magnin and J&​eacute;​r&​eacute;​mie Roland. 
 + ​Explicit relation between all lower bound techniques for quantum 
 +  query complexity. 
 + In <​em>​30th International Symposium on Theoretical Aspects of 
 +  Computer Science (STACS'​13)</​em>,​ number arXiv:​1209.2713,​ pages 434-445, 2013. 
 +[&​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>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​KLL+12">​3</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, J&​eacute;​r&​eacute;​mie Roland, ​and David +Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, J&​eacute;​r&​eacute;​mie Roland, 
-  Xiao.+  ​and David Xiao.
  Lower bounds on information complexity via zero-communication  Lower bounds on information complexity via zero-communication
   protocols and applications.   protocols and applications.
-In <​em>​53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'​12)</​em>,​ 2012. To appear+ In <​em>​53rd Annual IEEE Symposium on Foundations of Computer Science 
-[&​nbsp;<​a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​]+  ​(FOCS'​12)</​em>​, pages 500-509, 2012. 
 +[&nbsp;<a href="​http://​dx.doi.org/​10.1109/​FOCS.2012.68">​DOI</​a>&​nbsp;​|  
 +<a href="​http://​arxiv.org/​abs/​1204.1505">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 77: Line 113:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LLR12">​2</a>]+[<a name="​LLR12">​4</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Sophie Laplante, Virginie Lerays, and J&​eacute;​r&​eacute;​mie Roland. Sophie Laplante, Virginie Lerays, and J&​eacute;​r&​eacute;​mie Roland.
  ​Classical and quantum partition bound and detector inefficiency.  ​Classical and quantum partition bound and detector inefficiency.
-In <​em>​39th International Colloquium on Automata, Languages and  Programming (ICALP'​12)</​em>,​ volume 7391 of <​em>​Lecture Notes in Computer Science</​em>,​ pages 617-628, 2012. + In <​em>​39th International Colloquium on Automata, Languages and 
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-31594-7_52">​DOI</​a>&​nbsp;​|&nbsp;<a href="​http://​arxiv.org/​abs/​1203.4155">​arXiv</​a>&​nbsp;​]+  ​Programming (ICALP'​12)</​em>,​ volume 7391 of <​em>​Lecture Notes in Computer 
 +  ​Science</​em>,​ pages 617-628. Springer, 2012. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-31594-7_52">​DOI</​a>&​nbsp;​| ​ 
 +<a href="​http://​arxiv.org/​abs/​1203.4155">​arXiv</​a>&​nbsp;​]
  
 </td> </td>
Line 91: Line 130:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​LR11">​3</a>]+[<a name="​LR11">​5</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 97: Line 136:
  A strong direct product theorem for quantum query complexity.  A strong direct product theorem for quantum query complexity.
  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, 2012 +  pages 236-246. IEEE, 2012
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.1109/​CCC.2012.17">​DOI</​a>&​nbsp;​|&nbsp;<a href="​http://​arxiv.org/​abs/​1104.4468">​arXiv</​a>&​nbsp;​]+ To appear. 
 +[&​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;​]
  
 </td> </td>
Line 106: Line 147:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ORR11">​4</a>]+[<a name="​ORR11">​6</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 122: Line 163:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​GRR11">​5</a>]+[<a name="​GRR11">​7</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 139: Line 180:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​AMRR11">​6</a>]+[<a name="​AMRR11">​8</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 156: Line 197:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr11">​7</a>]+[<a name="​dklr11">​9</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 171: Line 212:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs11-sicomp">​8</a>]+[<a name="​mnrs11-sicomp">​10</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 187: Line 228:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr11">​9</a>]+[<a name="​kklr11">​11</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 202: Line 243:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kor10">​10</a>]+[<a name="​kor10">​12</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 217: Line 258:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kmor10">​11</a>]+[<a name="​kmor10">​13</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 234: Line 275:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr10-pnas">​12</a>]+[<a name="​akr10-pnas">​14</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 250: Line 291:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​kklr09">​13</a>]+[<a name="​kklr09">​15</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 268: Line 309:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​akr09-arxiv">​14</a>]+[<a name="​akr09-arxiv">​16</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 283: Line 324:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dklr09">​15</a>]+[<a name="​dklr09">​17</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 300: Line 341:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rs09">​16</a>]+[<a name="​rs09">​18</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 316: Line 357:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​arc06">​17</a>]+[<a name="​arc06">​19</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 331: Line 372:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr06:​qudits">​18</a>]+[<a name="​dlr06:​qudits">​20</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 347: Line 388:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mnrs06">​19</a>]+[<a name="​mnrs06">​21</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 364: Line 405:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ir06">​20</a>]+[<a name="​ir06">​22</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 379: Line 420:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pisa">​21</a>]+[<a name="​ccmr05:​pisa">​23</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 399: Line 440:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dr05">​22</a>]+[<a name="​dr05">​24</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 413: Line 454:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​dlr05">​23</a>]+[<a name="​dlr05">​25</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 428: Line 469:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​ccmr05:​pra">​24</a>]+[<a name="​ccmr05:​pra">​26</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 445: Line 486:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc05">​25</a>]+[<a name="​rc05">​27</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 461: Line 502:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​roland04">​26</a>]+[<a name="​roland04">​28</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 475: Line 516:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03b">​27</a>]+[<a name="​rc03b">​29</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 490: Line 531:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc03a">​28</a>]+[<a name="​rc03a">​30</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 505: Line 546:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​mprg02">​29</a>]+[<a name="​mprg02">​31</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 520: Line 561:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​rc02">​30</a>]+[<a name="​rc02">​32</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 535: Line 576:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​hrb02">​31</a>]+[<a name="​hrb02">​33</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 547: Line 588:
 </​table><​hr><​p><​em>​This file was generated by </​table><​hr><​p><​em>​This file was generated by
 <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>​
- 
  
  
Line 558: Line 598:
 </​noscript>​ </​noscript>​
 <!-- Copyright (c)2009 Site Meter --> <!-- Copyright (c)2009 Site Meter -->
- 
  
 </​html>​ </​html>​