Differences

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

--- members:jroland [2017/03/23 12:09]
jroland [Publications]
+++ members:jroland [2020/08/27 15:07]
jroland [Publications]
@@ Line 4: / Line 4: @@
 {| class="portrait"
 |-
-| style="width:159px;" rowspan="4" | <box w=150px border left>{{members:jroland:jroland.jpg?nolink&150}}</box>
+| 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
@@ Line 27: / Line 27: @@
   * -->
 </html>
 ==== Short biography ====
   * Born in Brussels in 1976.
@@ Line 55: / Line 57: @@
   * Quantum cryptographic primitives
 ==== Selected talks ====
+  * Finding a marked node on any graph by continuous time quantum walk. [[https://www.birs.ca/events/2019/5-day-workshops/19w5146|Quantum Walks and Information Tasks]] in Banff (Canada), April 24, 2019. [{{ :members:jroland:ctqw_search_any_graph-handout.pdf |PDF}} | [[https://www.birs.ca/events/2019/5-day-workshops/19w5146/videos/watch/201904241020-Roland.html|Video]]]
+  * Quantum weak coin flipping. [[https://uwaterloo.ca/institute-for-quantum-computing/|IQC Colloquium at UWaterloo]] (Canada), April 22, 2019. [{{ :members:jroland:iqc-colloquium-04-19-handout.pdf |PDF}} | [[https://youtu.be/2tfUBa0eHuU|Video]]]
+  * The quantum query complexity of sorting under partial information. [[https://sites.google.com/site/analysisqit2017/main-events/conference-on-quantum-information-theory|Conference on "Quantum Information Theory"]] at Institut Henri Poincaré (Paris, France), December 11-15,2017. [{{:members:jroland:ihp-quantum-sorting-12-17.pdf |PDF}} | [[https://youtu.be/MjKl80JO2wU|Video]]]
   * 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}}]
@@ Line 72: / Line 77: @@
+<!-- This document was automatically generated with bibtex2html 1.96
-<!-- This document was automatically generated with bibtex2html 1.98
      (see http://www.lri.fr/~filliatr/bibtex2html/),
      with the following command:
-     bibtex2html --no-abstract --nobibsource --nodoc -e dklr10 -e mnrs10-sicomp -e kor09 -e akr09-tr publications.bib  -->
+     bibtex2html --no-abstract --nobibsource --nodoc -e kor09 -e akr09-tr -e MR11 publications.bib  -->
@@ Line 83: / Line 87: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+16">1</a>]
+[<a name="CNR20a">1</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Leonardo Novo, and J&eacute;r&eacute;mie Roland.
+ Finding a marked node on any graph via continuous-time quantum walks.
+ <em>Phys. Rev. A</em>, 102:022227, 2020.
+[&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevA.102.022227">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1807.05957">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CLR20a">2</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">3</a>]
+</td>
+<td class="bibtexitem">
+Kishor Bharti, Atul&nbsp;Singh Arora, Leong&nbsp;Chuan Kwek, and J&eacute;r&eacute;mie Roland.
+ Uniqueness of all fundamental noncontextuality inequalities.
+ <em>Physical Review Research</em>, 2:033010, 2020.
+[&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>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CNR20b">4</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland.
+ On the optimality of spatial search by continuous-time quantum walk.
+ <em>arXiv e-prints</em>, arXiv:2004.12686, 2020.
+[&nbsp;<a href="http://arxiv.org/abs/2004.12686">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CLR20b">5</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Kyle Luh, and Jérémie Roland.
+ How fast do quantum walks mix?
+ <em>Physical Review Letters</em>, 124(5):050501, 2020.
+[&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="ARV19">6</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
+  bias.
+ <em>arXiv e-prints</em>, arXiv:1911.13283, 2019.
+[&nbsp;<a href="http://arxiv.org/abs/1911.13283">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CJR19">7</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">8</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>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="LLN+18">9</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.
+ <em>Quantum</em>, 2:72, 2018.
+[&nbsp;<a href="http://dx.doi.org/10.22331/q-2018-06-07-72">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1606.09514">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="FJKL+16">10</a>]
 </td>
 <td class="bibtexitem">
@@ Line 90: / Line 229: @@
  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 99: / Line 239: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLN+16">2</a>]
+[<a name="LLN+16">11</a>]
 </td>
 <td class="bibtexitem">
@@ Line 107: / Line 247: @@
  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 117: / Line 257: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BR14">3</a>]
+[<a name="BR15">12</a>]
 </td>
 <td class="bibtexitem">
@@ Line 124: / Line 264: @@
  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 134: / Line 274: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+14">4</a>]
+[<a name="KLL+15">13</a>]
 </td>
 <td class="bibtexitem">
@@ Line 141: / Line 281: @@
  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 151: / Line 291: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="FJKL+15">5</a>]
+[<a name="FJKL+15">14</a>]
 </td>
 <td class="bibtexitem">
@@ Line 160: / Line 300: @@
  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://eccc.hpi-web.de/report/2015/028/">http</a>&nbsp;]
+[&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 169: / Line 310: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR15-IJQI">6</a>]
+[<a name="KMOR15">15</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,
+[&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>
@@ Line 186: / Line 325: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KMOR15">7</a>]
+[<a name="MR15-IJQI">16</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>, 74(2):851--907, 2015.
+  query complexity.
-[&nbsp;<a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a>&nbsp;|
+ <em>International Journal of Quantum Information</em>, 13(4):1350059,
-<a href="http://arxiv.org/abs/1002.2419">arXiv</a>&nbsp;]
+.
+[&nbsp;<a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1209.2713">arXiv</a>&nbsp;]
 </td>
@@ Line 201: / Line 342: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR13">8</a>]
+[<a name="ORR13">17</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;]
+[&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;]
 </td>
@@ Line 215: / Line 357: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR13">9</a>]
+[<a name="LR13">18</a>]
 </td>
 <td class="bibtexitem">
-Troy Lee and Jérémie Roland.
+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;]
+[&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;]
 </td>
@@ Line 229: / Line 372: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="MR13">10</a>]
+[<a name="MR13">19</a>]
 </td>
 <td class="bibtexitem">
@@ Line 236: / Line 379: @@
   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 246: / Line 389: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="KLL+12">11</a>]
+[<a name="KLL+12">20</a>]
 </td>
 <td class="bibtexitem">
@@ Line 254: / Line 397: @@
   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 264: / Line 407: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LLR12">12</a>]
+[<a name="LLR12">21</a>]
 </td>
 <td class="bibtexitem">
@@ Line 271: / Line 414: @@
  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 281: / Line 424: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="LR11">13</a>]
+[<a name="LR11">22</a>]
 </td>
 <td class="bibtexitem">
@@ Line 287: / Line 430: @@
  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 297: / Line 440: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ORR11">14</a>]
+[<a name="ORR11">23</a>]
 </td>
 <td class="bibtexitem">
@@ Line 303: / Line 446: @@
  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 313: / Line 456: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="GRR11">15</a>]
+[<a name="GRR11">24</a>]
 </td>
 <td class="bibtexitem">
@@ Line 320: / Line 463: @@
  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 330: / Line 473: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="AMRR11">16</a>]
+[<a name="AMRR11">25</a>]
 </td>
 <td class="bibtexitem">
@@ Line 337: / Line 480: @@
  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 347: / Line 490: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr11">17</a>]
+[<a name="dklr11">26</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 362: / Line 505: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs11-sicomp">18</a>]
+[<a name="mnrs11-sicomp">27</a>]
 </td>
 <td class="bibtexitem">
@@ Line 368: / Line 511: @@
   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 378: / Line 521: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr11">19</a>]
+[<a name="kklr11">28</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 393: / Line 536: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kor10">20</a>]
+[<a name="kor10">29</a>]
 </td>
 <td class="bibtexitem">
@@ Line 399: / Line 542: @@
  Adiabatic condition and the quantum hitting time of Markov chains.
  <em>Physical Review A</em>, 82(2):022333, 2010.
+ Highlighted in the online APS Journal <em>Physics</em>.
 [&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevA.82.022333">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/1004.2721">arXiv</a>&nbsp;]
@@ Line 408: / Line 552: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kmor10">21</a>]
+[<a name="kmor10">30</a>]
 </td>
 <td class="bibtexitem">
@@ Line 415: / Line 559: @@
  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 425: / Line 569: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr10-pnas">22</a>]
+[<a name="akr10-pnas">31</a>]
 </td>
 <td class="bibtexitem">
@@ Line 431: / Line 575: @@
  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 441: / Line 585: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="kklr09">23</a>]
+[<a name="kklr09">32</a>]
 </td>
 <td class="bibtexitem">
@@ Line 448: / Line 592: @@
  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 459: / Line 603: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="akr09-arxiv">24</a>]
+[<a name="akr09-arxiv">33</a>]
 </td>
 <td class="bibtexitem">
@@ Line 474: / Line 618: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dklr09">25</a>]
+[<a name="dklr09">34</a>]
 </td>
 <td class="bibtexitem">
@@ Line 481: / Line 625: @@
  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 491: / Line 635: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rs09">26</a>]
+[<a name="rs09">35</a>]
 </td>
 <td class="bibtexitem">
@@ Line 498: / Line 642: @@
  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 507: / Line 651: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="arc06">27</a>]
+[<a name="arc06">36</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 522: / Line 666: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr06:qudits">28</a>]
+[<a name="dlr06:qudits">37</a>]
 </td>
 <td class="bibtexitem">
@@ Line 538: / Line 682: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mnrs06">29</a>]
+[<a name="mnrs06">38</a>]
 </td>
 <td class="bibtexitem">
@@ Line 545: / Line 689: @@
  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 555: / Line 699: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ir06">30</a>]
+[<a name="ir06">39</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 570: / Line 714: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pisa">31</a>]
+[<a name="ccmr05:pisa">40</a>]
 </td>
 <td class="bibtexitem">
@@ Line 577: / Line 721: @@
  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 590: / Line 734: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dr05">32</a>]
+[<a name="dr05">41</a>]
 </td>
 <td class="bibtexitem">
@@ Line 604: / Line 748: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="dlr05">33</a>]
+[<a name="dlr05">42</a>]
 </td>
 <td class="bibtexitem">
@@ Line 619: / Line 763: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ccmr05:pra">34</a>]
+[<a name="ccmr05:pra">43</a>]
 </td>
 <td class="bibtexitem">
@@ Line 636: / Line 780: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc05">35</a>]
+[<a name="rc05">44</a>]
 </td>
 <td class="bibtexitem">
@@ Line 652: / Line 796: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="roland04">36</a>]
+[<a name="roland04">45</a>]
 </td>
 <td class="bibtexitem">
@@ Line 666: / Line 810: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03b">37</a>]
+[<a name="rc03b">46</a>]
 </td>
 <td class="bibtexitem">
@@ Line 681: / Line 825: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc03a">38</a>]
+[<a name="rc03a">47</a>]
 </td>
 <td class="bibtexitem">
@@ Line 696: / Line 840: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="mprg02">39</a>]
+[<a name="mprg02">48</a>]
 </td>
 <td class="bibtexitem">
@@ Line 711: / Line 855: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="rc02">40</a>]
+[<a name="rc02">49</a>]
 </td>
 <td class="bibtexitem">
@@ Line 726: / Line 870: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="hrb02">41</a>]
+[<a name="hrb02">50</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 737: / Line 881: @@
 </tr>
 </table><hr><p><em>This file was generated by
-<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.98.</em></p>
+<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.96.</em></p>