Differences

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

--- members:jroland [2015/11/04 10:06]
jroland [Publications]
+++ members:jroland [2017/03/23 12:09]
jroland [Publications]
@@ Line 18: / Line 18: @@
 |}
-==== News ====
+<html>
-  * From May 20 to 22, 2015, Stefano Pironio and I organize the 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015) in Brussels. More information [[http://tqc2015.ulb.ac.be|here]].
+<!--
+* From May 20 to 22, 2015, Stefano Pironio and I organize the 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015) in Brussels. More information [[http://tqc2015.ulb.ac.be|here]].
   * On May 31, 2015, I will run the 20km of Brussels for [[http://www.medecinsdumonde.be/|Doctors of the World]]. Help me support their action by [[http://www.medecinsdumonde.be/events/20-km-de-bruxelles/j-r-mie_roland|sponsoring my race]].
   * How to separate information and communication complexity? My joint paper with (too many coauthors to list!), which was accepted at [[http://www.kurims.kyoto-u.ac.jp/icalp2015/|ICALP 2015]], takes a fresh look at this problem: [ [[http://eccc.hpi-web.de/report/2015/028/|http]] ]
   * Any query problem can be solved optimally with bounded error by an adiabatic quantum algorithm, as shown in the article I coauthored with my PhD student Mathieu Brandeho, which was accepted at [[http://tqc2015.ulb.ac.be|TQC 2015]]. Congratulations to Mathieu for his first accepted article! [ [[http://arxiv.org/abs/1409.3558|arXiv]] ]
   * Quantum walks can find a marked element on any graph! The original result was obtained in 2010 with my coauthors Hari Krovi, Frédéric Magniez and Maris Ozols, but the full journal article is finally available in Algorithmica: [ [[http://dx.doi.org/10.1007/s00453-015-9979-8|DOI]] | [[http://arxiv.org/abs/1002.2419|arXiv]] ]
+  * -->
+</html>
 ==== Short biography ====
   * Born in Brussels in 1976.
@@ Line 32: / Line 35: @@
   * 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 [[http://www.lri.fr/algo/|Laboratoire de Recherche en Informatique]] in Orsay, France.
-  * From January to December 2007, he was a Postdoctoral Researcher of the [[http://www.berkeley.edu/|University of California, Berkeley]].
+  * From January to December 2007, he was a Postdoctoral Researcher of the [[http://www.berkeley.edu/|University of California, Berkeley]], USA.
   * From January to May 2008, he was a Postdoctoral Researcher of the Belgian [[http://www.frs-fnrs.be/|FNRS]], based at the University of Brussels.
-  * 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]] 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: Computing and Complexity Theory
+  * Information, Coding, Computing and Complexity Theory (INFO-H-422) - partim: Complexity Theory
   * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe
-  * Analyse complexe (MATH-H-201) - partim: Exercices
+  * Signaux et Systèmes (MATH-H-3001) - partim: Exercices
   * Examen spécial d'admission en Polytechnique - Géométrie
 ==== Research interests ====
@@ Line 52: / Line 55: @@
   * Quantum cryptographic primitives
 ==== Selected talks ====
+  * A universal adiabatic quantum query algorithm. [[http://www.lorentzcenter.nl/lc/web/2015/724/info.php3?wsid=724&venue=Snellius|Quantum Random Walks and Quantum Algorithms]], Lorentz Center, Leiden (Netherlands), December 11, 2015. [{{:members:jroland:qwalks-leiden-2015-handout.pdf|PDF}}]
   * Quantum algorithms based on quantum walks. [[https://uwaterloo.ca/institute-for-quantum-computing/|IQC Colloquium at UWaterloo]] (Canada), July 28, 2014. [{{:members:jroland:IQC-colloquium-08-2014-handout.pdf|PDF}}]
   * 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}}]
@@ Line 67: / Line 71: @@
 <html>
-<!-- This document was automatically generated with bibtex2html 1.97
+<!-- This document was automatically generated with bibtex2html 1.98
      (see http://www.lri.fr/~filliatr/bibtex2html/),
      with the following command:
@@ Line 77: / Line 83: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">1</a>]
+[<a name="FJKL+16">1</a>]
 </td>
 <td class="bibtexitem">
 Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu
   Lauri&egrave;re, and J&eacute;r&eacute;mie Roland.
- Relative Discrepancy does not separate Information and Communication
+ Relative discrepancy does not separate information and communication
-  Complexity.
+  complexity.
- In <em>42nd International Colloquium on Automata, Languages and
+ <em>ACM Transactions on Computation Theory</em>, 9(1):4:1--4:15, 2016.
-  Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer
+[&nbsp;<a href="http://dx.doi.org/10.1145/2967605">DOI</a>&nbsp;]
-  Science</em>, pages 506-516. Springer, 2015.
-[&nbsp;<a href="http://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</a>&nbsp;| <a href="http://eccc.hpi-web.de/report/2015/028/">http</a>&nbsp;]
 </td>
@@ Line 95: / Line 99: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR14">2</a>]
+[<a name="LLN+16">2</a>]
+</td>
+<td class="bibtexitem">
+Sophie Laplante, Mathieu Lauri&egrave;re, Alexandre Nolin, J&eacute;r&eacute;mie Roland,
+  and Gabriel Senno.
+ Robust Bell inequalities from communication complexity.
+ In <em>11th Conference on the Theory of Quantum Computation,
+  Communication and Cryptography (TQC 2016)</em>, volume&nbsp;61 of <em>Leibniz
+  International Proceedings in Informatics (LIPIcs)</em>, pages 5:1--5:24, 2016.
+[&nbsp;<a href="http://arxiv.org/abs/1606.09514">arXiv</a>&nbsp;|
+<a href="http://drops.dagstuhl.de/opus/volltexte/2016/6686">http</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="BR14">3</a>]
 </td>
 <td class="bibtexitem">
@@ Line 101: / Line 123: @@
  A universal adiabatic quantum query algorithm.
  In <em>10th Conference on the Theory of Quantum Computation,
-  Communication and Cryptography (TQC'15)</em>, 2015.
+  Communication and Cryptography (TQC'15)</em>, volume&nbsp;44 of <em>Leibniz
- To appear.
+  International Proceedings in Informatics (LIPIcs)</em>, pages 163--179, 2015.
-[&nbsp;<a href="http://arxiv.org/abs/1409.3558">arXiv</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.4230/LIPIcs.TQC.2015.163">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1409.3558">arXiv</a>&nbsp;]
 </td>
 </tr>
 <tr valign="top">
@@ Line 127: / Line 151: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">3</a>]
+[<a name="FJKL+15">5</a>]
 </td>
 <td class="bibtexitem">
-Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, J&eacute;r&eacute;mie Roland,
+Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu
-  and David Xiao.
+  Lauri&egrave;re, and J&eacute;r&eacute;mie Roland.
- Lower bounds on information complexity via zero-communication
+ Relative Discrepancy does not separate Information and Communication
-  protocols and applications.
+  Complexity.
- <em>SIAM Journal on Computing</em>, 2015.
+ In <em>42nd International Colloquium on Automata, Languages and
- To appear.
+  Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer
-[&nbsp;<a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
+  Science</em>, pages 506--516. Springer, 2015.
+[&nbsp;<a href="http://eccc.hpi-web.de/report/2015/028/">http</a>&nbsp;]
 </td>
@@ Line 144: / Line 169: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">4</a>]
+[<a name="MR15-IJQI">6</a>]
 </td>
 <td class="bibtexitem">
-Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
+Lo&iuml;ck Magnin and J&eacute;r&eacute;mie Roland.
- Quantum walks can find a marked element on any graph.
+ Explicit relation between all lower bound techniques for quantum
- <em>Algorithmica</em>, 2015.
+  query complexity.
- Published online.
+ <em>International Journal of Quantum Information</em>, 13(4):1350059,
-[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
+.
-<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
+ Online ready.
+[&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;]
 </td>
 </tr>
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13-IJQI">5</a>]
+[<a name="KMOR15">7</a>]
 </td>
 <td class="bibtexitem">
-Lo&iuml;ck Magnin and J&eacute;r&eacute;mie Roland.
+Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
- Explicit relation between all lower bound techniques for quantum
+ Quantum walks can find a marked element on any graph.
-  query complexity.
+ <em>Algorithmica</em>, 74(2):851--907, 2015.
- <em>International Journal of Quantum Information</em>, 13(4): 1350059, 2015.
+[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
-[&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;]
+<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
 </td>
@@ Line 177: / Line 201: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">6</a>]
+[<a name="ORR13">8</a>]
 </td>
 <td class="bibtexitem">
 Maris Ozols, Martin Roetteler, and J&eacute;r&eacute;mie Roland.
  Quantum rejection sampling.
- <em>ACM Transactions on Computation Theory</em>, 5(3):11:1-11:33, 2013.
+ <em>ACM Transactions on Computation Theory</em>, 5(3):11:1--11:33, 2013.
 [&nbsp;<a href="http://dx.doi.org/10.1145/2493252.2493256">DOI</a>&nbsp;]
@@ Line 191: / Line 215: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">7</a>]
+[<a name="LR13">9</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.
+ <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;]
@@ Line 205: / Line 229: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">8</a>]
+[<a name="MR13">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 212: / Line 236: @@
   query complexity.
  In <em>30th International Symposium on Theoretical Aspects of
-  Computer Science (STACS'13)</em>, pages 434-445, 2013.
+  Computer Science (STACS'13)</em>, 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;]
@@ Line 222: / Line 246: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">9</a>]
+[<a name="KLL+12">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 230: / Line 254: @@
   protocols and applications.
  In <em>53rd Annual IEEE Symposium on Foundations of Computer Science
-  (FOCS'12)</em>, pages 500-509, 2012.
+  (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;]
@@ Line 240: / Line 264: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">10</a>]
+[<a name="LLR12">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 247: / Line 271: @@
  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. Springer, 2012.
+  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;]
@@ Line 257: / Line 281: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">11</a>]
+[<a name="LR11">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 263: / Line 287: @@
  A strong direct product theorem for quantum query complexity.
  In <em>27th IEEE Conference on Computational Complexity (CCC'12)</em>,
-  pages 236-246. IEEE, 2012.
+  pages 236--246. IEEE, 2012.
 [&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;]
@@ Line 273: / Line 297: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">12</a>]
+[<a name="ORR11">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 279: / Line 303: @@
  Quantum rejection sampling.
  In <em>3rd Conference on Innovations in Theoretical Computer Science
-  (ITCS'12)</em>, pages 290-308. ACM Press, 2012.
+  (ITCS'12)</em>, pages 290--308. ACM Press, 2012.
 [&nbsp;<a href="http://dx.doi.org/10.1145/2090236.2090261">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/1103.2774">arXiv</a>&nbsp;]
@@ Line 289: / Line 313: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">13</a>]
+[<a name="GRR11">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 296: / Line 320: @@
  In <em>17th International Computing &amp; Combinatorics Conference
   (COCOON'11)</em>, volume 6842 of <em>Lecture Notes in Computer Science</em>, pages
--167. Springer, 2011.
+--167. Springer, 2011.
 [&nbsp;<a href="http://dx.doi.org/10.1007/978-3-642-22685-4_14">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/1103.3017">arXiv</a>&nbsp;]
@@ Line 306: / Line 330: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">14</a>]
+[<a name="AMRR11">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 313: / Line 337: @@
  Symmetry-assisted adversaries for quantum state generation.
  In <em>26th IEEE Conference on Computational Complexity (CCC'11)</em>,
-  pages 167-177, 2011.
+  pages 167--177, 2011.
 [&nbsp;<a href="http://dx.doi.org/10.1109/CCC.2011.24">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/1012.2112">arXiv</a>&nbsp;]
@@ Line 323: / Line 347: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">15</a>]
+[<a name="dklr11">17</a>]
 </td>
 <td class="bibtexitem">
 Julien Degorre, Marc Kaplan, Sophie Laplante, and J&eacute;r&eacute;mie Roland.
  The communication complexity of non-signaling distributions.
- <em>Quantum Information &amp; Computation</em>, 11(7&amp;8):649-676, 2011.
+ <em>Quantum Information &amp; Computation</em>, 11(7&amp;8):649--676, 2011.
 [&nbsp;<a href="http://arxiv.org/abs/0804.4859">arXiv</a>&nbsp;|
 <a href="http://www.rintonpress.com/journals/qiconline.html#v11n78">http</a>&nbsp;]
@@ Line 338: / Line 362: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">16</a>]
+[<a name="mnrs11-sicomp">18</a>]
 </td>
 <td class="bibtexitem">
@@ Line 344: / Line 368: @@
   Santha.
  Search via quantum walk.
- <em>SIAM Journal on Computing</em>, 40(1):142-164, 2011.
+ <em>SIAM Journal on Computing</em>, 40(1):142--164, 2011.
 [&nbsp;<a href="http://dx.doi.org/10.1137/090745854">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a>&nbsp;]
@@ Line 354: / Line 378: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">17</a>]
+[<a name="kklr11">19</a>]
 </td>
 <td class="bibtexitem">
 Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and J&eacute;r&eacute;mie Roland.
  Non-local box complexity and secure function evaluation.
- <em>Quantum Information &amp; Computation</em>, 11(1&amp;2):40-69, 2011.
+ <em>Quantum Information &amp; Computation</em>, 11(1&amp;2):40--69, 2011.
 [&nbsp;<a href="http://arxiv.org/abs/0903.2179">arXiv</a>&nbsp;|
 <a href="http://www.rintonpress.com/journals/qiconline.html#v11n12">http</a>&nbsp;]
@@ Line 369: / Line 393: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">18</a>]
+[<a name="kor10">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 384: / Line 408: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">19</a>]
+[<a name="kmor10">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 391: / Line 415: @@
  In <em>37th International Colloquium on Automata, Languages and
   Programming (ICALP'10)</em>, volume 6198 of <em>Lecture Notes in Computer
-  Science</em>, pages 540-551. Springer, 2010.
+  Science</em>, pages 540--551. Springer, 2010.
 [&nbsp;<a href="http://dx.doi.org/10.1007/978-3-642-14165-2_46">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
@@ Line 401: / Line 425: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">20</a>]
+[<a name="akr10-pnas">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 407: / Line 431: @@
  Anderson localization makes adiabatic quantum optimization fail.
  <em><em>Proceedings of the National Academy of Sciences of the
-  United States of America</em></em>, 107(28):12446-12450, 2010.
+  United States of America</em></em>, 107(28):12446--12450, 2010.
 [&nbsp;<a href="http://dx.doi.org/10.1073/pnas.1002116107">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/0912.0746">arXiv</a>&nbsp;]
@@ Line 417: / Line 441: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">21</a>]
+[<a name="kklr09">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 424: / Line 448: @@
  In <em>IARCS Annual Conference on Foundations of Software Technology
   and Theoretical Computer Science (FSTTCS'09)</em>, volume&nbsp;4 of <em>Leibniz
-  International Proceedings in Informatics (LIPICs)</em>, pages 239-250. Schloss
+  International Proceedings in Informatics (LIPICs)</em>, pages 239--250. Schloss
   Dagstuhl, 2009.
 [&nbsp;<a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2009.2322">DOI</a>&nbsp;|
@@ Line 435: / Line 459: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">22</a>]
+[<a name="akr09-arxiv">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 450: / Line 474: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">23</a>]
+[<a name="dklr09">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 457: / Line 481: @@
  In <em>34th International Symposium on Mathematical Foundations of
   Computer Science (MFCS'09)</em>, volume 5734 of <em>Lecture Notes in Computer
-  Science</em>, pages 270-281. Springer, 2009.
+  Science</em>, pages 270--281. Springer, 2009.
 [&nbsp;<a href="http://dx.doi.org/10.1007/978-3-642-03816-7_24">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/0804.4859">arXiv</a>&nbsp;]
@@ Line 467: / Line 491: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">24</a>]
+[<a name="rs09">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 474: / Line 498: @@
  In <em>36th International Colloquium on Automata, Languages and
   Programming (ICALP'09)</em>, volume 5555 of <em>Lecture Notes in Computer
-  Science</em>, pages 738-749. Springer, 2009.
+  Science</em>, pages 738--749. Springer, 2009.
 [&nbsp;<a href="http://dx.doi.org/10.1007/978-3-642-02927-1_61">DOI</a>&nbsp;]
@@ Line 483: / Line 507: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">25</a>]
+[<a name="arc06">27</a>]
 </td>
 <td class="bibtexitem">
 Olga&nbsp;Lopez Acevedo, J&eacute;r&eacute;mie Roland, and Nicolas&nbsp;J. Cerf.
  Exploring scalar quantum walks on Cayley graphs.
- <em>Quantum Information &amp; Computation</em>, 8(1&amp;2):68-81, 2008.
+ <em>Quantum Information &amp; Computation</em>, 8(1&amp;2):68--81, 2008.
 [&nbsp;<a href="http://arxiv.org/abs/quant-ph/0609234">arXiv</a>&nbsp;|
 <a href="http://www.rintonpress.com/journals/qiconline.html#v8n12">http</a>&nbsp;]
@@ Line 498: / Line 522: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">26</a>]
+[<a name="dlr06:qudits">28</a>]
 </td>
 <td class="bibtexitem">
@@ Line 514: / Line 538: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">27</a>]
+[<a name="mnrs06">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 521: / Line 545: @@
  Search via quantum walk.
  In <em>39th ACM Symposium on Theory of Computing (STOC'07)</em>, pages
--584, 2007.
+--584, 2007.
 [&nbsp;<a href="http://dx.doi.org/10.1145/1250790.1250874">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a>&nbsp;]
@@ Line 531: / Line 555: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">28</a>]
+[<a name="ir06">30</a>]
 </td>
 <td class="bibtexitem">
 Sofyan Iblisdir and J&eacute;r&eacute;mie Roland.
  Optimal finite measurements and Gauss quadratures.
- <em>Physics Letters A</em>, 358(5-6):368-372, 2006.
+ <em>Physics Letters A</em>, 358(5-6):368--372, 2006.
 [&nbsp;<a href="http://dx.doi.org/doi:10.1016/j.physleta.2006.05.045">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/quant-ph/0410237">arXiv</a>&nbsp;]
@@ Line 546: / Line 570: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">29</a>]
+[<a name="ccmr05:pisa">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 553: / Line 577: @@
  Information transmission via entangled quantum states in Gaussian
   channels with memory.
- <em>International Journal of Quantum Information</em>, 4(3):439-452,
+ <em>International Journal of Quantum Information</em>, 4(3):439--452,
 .
  Proceedings of the International Workshop &ldquo;Quantum Entanglement in
-  Physical and Information Sciences&rdquo; (December 14-18, 2004, Pisa, Italy).
+  Physical and Information Sciences&rdquo; (December 14--18, 2004, Pisa, Italy).
 [&nbsp;<a href="http://dx.doi.org/doi:10.1142/S021974990600189X">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/quant-ph/0508197">arXiv</a>&nbsp;]
@@ Line 566: / Line 590: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">30</a>]
+[<a name="dr05">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 580: / Line 604: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">31</a>]
+[<a name="dlr05">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 595: / Line 619: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">32</a>]
+[<a name="ccmr05:pra">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 612: / Line 636: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">33</a>]
+[<a name="rc05">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 628: / Line 652: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">34</a>]
+[<a name="roland04">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 642: / Line 666: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">35</a>]
+[<a name="rc03b">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 657: / Line 681: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">36</a>]
+[<a name="rc03a">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 672: / Line 696: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">37</a>]
+[<a name="mprg02">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 687: / Line 711: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">38</a>]
+[<a name="rc02">40</a>]
 </td>
 <td class="bibtexitem">
@@ Line 702: / Line 726: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">39</a>]
+[<a name="hrb02">41</a>]
 </td>
 <td class="bibtexitem">
 Michel Hesse, J&eacute;r&eacute;mie Roland, and Daniel Baye.
  Solving the resonating-group equation on a Lagrange mesh.
- <em>Nuclear Physics&nbsp;A</em>, 709:184-200, 2002.
+ <em>Nuclear Physics&nbsp;A</em>, 709:184--200, 2002.
 [&nbsp;<a href="http://dx.doi.org/10.1016/S0375-9474(02)01040-0">DOI</a>&nbsp;]
 </td>
 </tr>
-</table>
+</table><hr><p><em>This file was generated by
+<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.98.</em></p>
-<hr><p><em>This file was generated by
-<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p>