Differences

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

--- members:jroland [2020/04/15 17:16]
jroland [Publications]
+++ members:jroland [2022/05/20 09:16]
jroland [Publications]
@@ Line 6: / Line 6: @@
 | style="width:159px;" rowspan="4" | <box w=150px border left>{{members:jroland-quic.jpg?nolink&150}}</box>
 ! style="width:50px;"| Email:
-| style="width:541px;"| jroland (at) ulb.ac.be
+| style="width:541px;"| Jeremie.Roland (at) ulb.be
 |-
 ! Phone:
@@ Line 42: / Line 42: @@
 ==== Teaching ====
-  * Compléments de programmation et d'algorithmique (INFO-H-304)
+  * Since 2021 Analyse II (MATH-H-2000) - partim: part b
-  * Quantum information and computation (INFO-H-514) - partim: Quantum computation
+  * Since 2015 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
+  * Since 2013 Compléments de programmation et d'algorithmique (INFO-H-304)
-  * Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe
+  * Since 2012 Quantum information and computation (INFO-H-514) - partim: Quantum computation
-  * Signaux et Systèmes (MATH-H-3001) - partim: Exercices
+  * Since 2012 Examen spécial d'admission en Polytechnique - Géométrie
-  * Examen spécial d'admission en Polytechnique - Géométrie
+  * 2016-2021 Signaux et Systèmes (MATH-H-3001) - partim: Exercices
+  * 2015-2021 Analyse complexe et calcul numérique (MATH-H-302) - partim: Analyse complexe
 ==== Research interests ====
   * Quantum algorithms
@@ Line 79: / Line 82: @@
-<!-- This document was automatically generated with bibtex2html 1.96
+<!-- This document was automatically generated with bibtex2html 1.99
      (see http://www.lri.fr/~filliatr/bibtex2html/),
      with the following command:
-     bibtex2html --no-abstract --nobibsource --nodoc -e kor09 -e akr09-tr -e MR11 -e CLR19 publications.bib  -->
+     bibtex2html --no-abstract --nobibsource --nodoc -e kor09 -e akr09-tr -e MR11 publications.bib  -->
@@ Line 89: / Line 92: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="CLR20">1</a>]
+[<a name="HXA+22">1</a>]
 </td>
 <td class="bibtexitem">
-Shantanav Chakraborty, Kyle Luh, and Jérémie Roland.
+Simon Apers, Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland.
- How fast do quantum walks mix?
+ Self-testing of a single quantum system: Theory and experiment.
- <em>Physical Review Letters</em>, 124(5):050501, 2020.
+ <em>arXiv e-prints</em>, arXiv:2203.09003, 2022.
-[&nbsp;<a href="http://dx.doi.org/10.1103/physrevlett.124.050501">DOI</a>&nbsp;|
+[&nbsp;<a href="http://dx.doi.org/10.48550/ARXIV.2203.09003">DOI</a>&nbsp;|
-<a href="http://arxiv.org/abs/2001.06305">arXiv</a>&nbsp;]
+<a href="http://arxiv.org/abs/2203.09003">arXiv</a>&nbsp;]
 </td>
@@ Line 104: / Line 107: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ARV19">2</a>]
+[<a name="ACNL21">2</a>]
+</td>
+<td class="bibtexitem">
+Simon Apers, Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland.
+ Quadratic speedup for spatial search by continuous-time quantum walk.
+ <em>arXiv e-prints</em>, arXiv:2112.12746, 2021.
+[&nbsp;<a href="http://dx.doi.org/10.48550/ARXIV.2112.12746">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/2112.12746">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="ARV21">3</a>]
 </td>
 <td class="bibtexitem">
 Atul&nbsp;Singh Arora, J&eacute;r&eacute;mie Roland, and Chrysoula Vlachou.
- Explicit quantum weak coin flipping protocols with arbitrarily small
+ Analytic quantum weak coin flipping protocols with arbitrarily small
   bias.
- <em>arXiv e-prints</em>, arXiv:1911.13283, 2019.
+ In <em>Proceedings of the 2021 ACM-SIAM Symposium on Discrete
-[&nbsp;<a href="http://arxiv.org/abs/1911.13283">arXiv</a>&nbsp;]
+  Algorithms (SODA)</em>, pages 919--938, 2021.
+[&nbsp;<a href="http://dx.doi.org/10.1137/1.9781611976465.58">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1911.13283">arXiv</a>&nbsp;]
 </td>
@@ Line 119: / Line 139: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="CJR19">3</a>]
+[<a name="CNR20b">4</a>]
 </td>
 <td class="bibtexitem">
-Jean Cardinal, Gwena&euml;l Joret, and J&eacute;r&eacute;mie Roland.
+Shantanav Chakraborty, Leonardo Novo, and J&eacute;r&eacute;mie Roland.
- Information-theoretic lower bounds for quantum sorting.
+ Optimality of spatial search via continuous-time quantum walks.
- <em>arXiv e-prints</em>, arXiv:1902.06473, 2019.
+ <em>Phys. Rev. A</em>, 102:032214, 2020.
-[&nbsp;<a href="http://arxiv.org/abs/1902.06473">arXiv</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevA.102.032214">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/2004.12686">arXiv</a>&nbsp;]
 </td>
@@ Line 133: / Line 154: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ARW19">4</a>]
+[<a name="CNR20a">5</a>]
 </td>
 <td class="bibtexitem">
-Atul&nbsp;Singh Arora, J&eacute;r&eacute;mie Roland, and Stephan Weis.
+Shantanav Chakraborty, Leonardo Novo, and J&eacute;r&eacute;mie Roland.
- Quantum weak coin flipping.
+ Finding a marked node on any graph via continuous-time quantum walks.
- In <em>51st ACM Symposium on Theory of Computing (STOC'19)</em>, pages
+ <em>Phys. Rev. A</em>, 102:022227, 2020.
--216, 2019.
+[&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevA.102.022227">DOI</a>&nbsp;|
-[&nbsp;<a href="http://dx.doi.org/10.1145/3313276.3316306">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1807.05957">arXiv</a>&nbsp;]
-<a href="http://arxiv.org/abs/1811.02984">arXiv</a>&nbsp;]
 </td>
@@ Line 149: / Line 169: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BAKR18">5</a>]
+[<a name="CLR20a">6</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Kyle Luh, and J&eacute;r&eacute;mie Roland.
+ Analog quantum algorithms for the mixing of markov chains.
+ <em>Physical Review A</em>, 102:022423, 2020.
+[&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevA.102.022423">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1904.11895">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="BAKR20">7</a>]
 </td>
 <td class="bibtexitem">
 Kishor Bharti, Atul&nbsp;Singh Arora, Leong&nbsp;Chuan Kwek, and J&eacute;r&eacute;mie Roland.
- A simple proof of uniqueness of the KCBS inequality.
+ Uniqueness of all fundamental noncontextuality inequalities.
- <em>arXiv e-prints</em>, arXiv:1811.05294, 2018.
+ <em>Physical Review Research</em>, 2:033010, 2020.
-[&nbsp;<a href="http://arxiv.org/abs/1811.05294">arXiv</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevResearch.2.033010">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1811.05294">arXiv</a>&nbsp;]
 </td>
@@ Line 163: / Line 199: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="CNR18">6</a>]
+[<a name="CLR20b">8</a>]
 </td>
 <td class="bibtexitem">
-Shantanav Chakraborty, Leonardo Novo, and J&eacute;r&eacute;mie Roland.
+Shantanav Chakraborty, Kyle Luh, and Jérémie Roland.
- Finding a marked node on any graph by continuous time quantum walk.
+ How fast do quantum walks mix?
- <em>arXiv e-prints</em>, arXiv:1807.05957, 2018.
+ <em>Physical Review Letters</em>, 124(5):050501, 2020.
-[&nbsp;<a href="http://arxiv.org/abs/1807.05957">arXiv</a>&nbsp;]
+[&nbsp;<a href="http://dx.doi.org/10.1103/physrevlett.124.050501">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/2001.06305">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CJR19">9</a>]
+</td>
+<td class="bibtexitem">
+Jean Cardinal, Gwena&euml;l Joret, and J&eacute;r&eacute;mie Roland.
+ Information-theoretic lower bounds for quantum sorting.
+ <em>arXiv e-prints</em>, arXiv:1902.06473, 2019.
+[&nbsp;<a href="http://arxiv.org/abs/1902.06473">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="ARW19">10</a>]
+</td>
+<td class="bibtexitem">
+Atul&nbsp;Singh Arora, J&eacute;r&eacute;mie Roland, and Stephan Weis.
+ Quantum weak coin flipping.
+ In <em>51st ACM Symposium on Theory of Computing (STOC'19)</em>, pages
+--216, 2019.
+[&nbsp;<a href="http://dx.doi.org/10.1145/3313276.3316306">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1811.02984">arXiv</a>&nbsp;]
 </td>
@@ Line 177: / Line 244: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLN+18">7</a>]
+[<a name="LLN+18">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 193: / Line 260: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+16">8</a>]
+[<a name="FJKL+16">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 200: / Line 267: @@
  Relative discrepancy does not separate information and communication
   complexity.
- <em>ACM Transactions on Computation Theory</em>, 9(1):4:1-4:15, 2016.
+ <em>ACM Transactions on Computation Theory</em>, 9(1):4:1--4:15, 2016.
  Best of 2016 award.
 [&nbsp;<a href="http://dx.doi.org/10.1145/2967605">DOI</a>&nbsp;]
@@ Line 210: / Line 277: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLN+16">9</a>]
+[<a name="LLN+16">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 218: / Line 285: @@
  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.
+  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;]
@@ Line 228: / Line 295: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR15">10</a>]
+[<a name="BR15">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 235: / Line 302: @@
  In <em>10th Conference on the Theory of Quantum Computation,
   Communication and Cryptography (TQC'15)</em>, volume&nbsp;44 of <em>Leibniz
-  International Proceedings in Informatics (LIPIcs)</em>, pages 163-179, 2015.
+  International Proceedings in Informatics (LIPIcs)</em>, pages 163--179, 2015.
 [&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;]
@@ Line 245: / Line 312: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+15">11</a>]
+[<a name="KLL+15">15</a>]
 </td>
 <td class="bibtexitem">
@@ Line 252: / Line 319: @@
  Lower bounds on information complexity via zero-communication
   protocols and applications.
- <em>SIAM Journal on Computing</em>, 44(5):1550-1572, 2015.
+ <em>SIAM Journal on Computing</em>, 44(5):1550--1572, 2015.
 [&nbsp;<a href="http://dx.doi.org/10.1137/130928273">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/1204.1505">arXiv</a>&nbsp;]
@@ Line 262: / Line 329: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">12</a>]
+[<a name="FJKL+15">16</a>]
 </td>
 <td class="bibtexitem">
@@ Line 271: / Line 338: @@
  In <em>42nd International Colloquium on Automata, Languages and
   Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer
-  Science</em>, pages 506-516. Springer, 2015.
+  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;]
@@ Line 281: / Line 348: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">13</a>]
+[<a name="KMOR15">17</a>]
 </td>
 <td class="bibtexitem">
 Hari Krovi, Fr&eacute;d&eacute;ric Magniez, Maris Ozols, and J&eacute;r&eacute;mie Roland.
  Quantum walks can find a marked element on any graph.
- <em>Algorithmica</em>, 74(2):851-907, 2015.
+ <em>Algorithmica</em>, 74(2):851--907, 2015.
 [&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;]
@@ Line 296: / Line 363: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR15-IJQI">14</a>]
+[<a name="MR15-IJQI">18</a>]
 </td>
 <td class="bibtexitem">
@@ Line 313: / Line 380: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">15</a>]
+[<a name="ORR13">19</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;|
 <a href="http://arxiv.org/abs/1103.2774">arXiv</a>&nbsp;]
@@ Line 328: / Line 395: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">16</a>]
+[<a name="LR13">20</a>]
 </td>
 <td class="bibtexitem">
 Troy Lee and J&eacute;r&eacute;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;|
 <a href="http://arxiv.org/abs/1104.4468">arXiv</a>&nbsp;]
@@ Line 343: / Line 410: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">17</a>]
+[<a name="MR13">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 350: / Line 417: @@
   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 360: / Line 427: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">18</a>]
+[<a name="KLL+12">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 368: / Line 435: @@
   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 378: / Line 445: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">19</a>]
+[<a name="LLR12">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 385: / Line 452: @@
  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 395: / Line 462: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">20</a>]
+[<a name="LR11">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 401: / Line 468: @@
  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 411: / Line 478: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">21</a>]
+[<a name="ORR11">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 417: / Line 484: @@
  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 427: / Line 494: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">22</a>]
+[<a name="GRR11">26</a>]
 </td>
 <td class="bibtexitem">
@@ Line 434: / Line 501: @@
  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 444: / Line 511: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">23</a>]
+[<a name="AMRR11">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 451: / Line 518: @@
  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 461: / Line 528: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">24</a>]
+[<a name="dklr11">28</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 476: / Line 543: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">25</a>]
+[<a name="mnrs11-sicomp">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 482: / Line 549: @@
   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 492: / Line 559: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">26</a>]
+[<a name="kklr11">30</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 507: / Line 574: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">27</a>]
+[<a name="kor10">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 523: / Line 590: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">28</a>]
+[<a name="kmor10">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 530: / Line 597: @@
  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 540: / Line 607: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">29</a>]
+[<a name="akr10-pnas">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 546: / Line 613: @@
  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 556: / Line 623: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">30</a>]
+[<a name="kklr09">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 563: / Line 630: @@
  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 574: / Line 641: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">31</a>]
+[<a name="akr09-arxiv">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 589: / Line 656: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">32</a>]
+[<a name="dklr09">36</a>]
 </td>
 <td class="bibtexitem">
@@ Line 596: / Line 663: @@
  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 606: / Line 673: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">33</a>]
+[<a name="rs09">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 613: / Line 680: @@
  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 622: / Line 689: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">34</a>]
+[<a name="arc06">38</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 637: / Line 704: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">35</a>]
+[<a name="dlr06:qudits">39</a>]
 </td>
 <td class="bibtexitem">
@@ Line 653: / Line 720: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">36</a>]
+[<a name="mnrs06">40</a>]
 </td>
 <td class="bibtexitem">
@@ Line 660: / Line 727: @@
  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 670: / Line 737: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">37</a>]
+[<a name="ir06">41</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 685: / Line 752: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">38</a>]
+[<a name="ccmr05:pisa">42</a>]
 </td>
 <td class="bibtexitem">
@@ Line 692: / Line 759: @@
  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 705: / Line 772: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">39</a>]
+[<a name="dr05">43</a>]
 </td>
 <td class="bibtexitem">
@@ Line 719: / Line 786: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">40</a>]
+[<a name="dlr05">44</a>]
 </td>
 <td class="bibtexitem">
@@ Line 734: / Line 801: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">41</a>]
+[<a name="ccmr05:pra">45</a>]
 </td>
 <td class="bibtexitem">
@@ Line 751: / Line 818: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">42</a>]
+[<a name="rc05">46</a>]
 </td>
 <td class="bibtexitem">
@@ Line 767: / Line 834: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">43</a>]
+[<a name="roland04">47</a>]
 </td>
 <td class="bibtexitem">
@@ Line 781: / Line 848: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">44</a>]
+[<a name="rc03b">48</a>]
 </td>
 <td class="bibtexitem">
@@ Line 796: / Line 863: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">45</a>]
+[<a name="rc03a">49</a>]
 </td>
 <td class="bibtexitem">
@@ Line 811: / Line 878: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">46</a>]
+[<a name="mprg02">50</a>]
 </td>
 <td class="bibtexitem">
@@ Line 826: / Line 893: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">47</a>]
+[<a name="rc02">51</a>]
 </td>
 <td class="bibtexitem">
@@ Line 841: / Line 908: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">48</a>]
+[<a name="hrb02">52</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;]
@@ Line 852: / Line 919: @@
 </tr>
 </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.99.</em></p>
 <!-- Site Meter -->