Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
members:jroland [2016/07/02 16:30] jroland [Publications] |
members:jroland [2022/06/24 15:56] jroland [Publications] |
||
---|---|---|---|
Line 4: | Line 4: | ||
{| class="portrait" | {| 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:50px;"| Email: | ||
- | | style="width:541px;"| jroland (at) ulb.ac.be | + | | style="width:541px;"| Jeremie.Roland (at) ulb.be |
|- | |- | ||
! Phone: | ! Phone: | ||
Line 17: | Line 17: | ||
| QuIC - Ecole Polytechnique de Bruxelles \\ Université Libre de Bruxelles \\ 50 av. F. D. Roosevelt - CP 165/59 \\ B-1050 Bruxelles \\ Belgique | | QuIC - Ecole Polytechnique de Bruxelles \\ Université Libre de Bruxelles \\ 50 av. F. D. Roosevelt - CP 165/59 \\ B-1050 Bruxelles \\ Belgique | ||
|} | |} | ||
- | |||
- | ==== Grant offers ==== | ||
- | As part of a new project on quantum communication complexity and quantum cryptographic primitives (such as weak coin flipping), I am looking for one postdoctoral researcher (2-year grant) and one PhD student (1-year grant, with possibility of extension). | ||
- | |||
- | Interested applicants can send an email with their resume to jroland (at) ulb.ac.be and are encouraged to have at least 2 letters of recommendation sent to the same address. | ||
- | |||
- | Consideration of candidates will be effective immediately and will continue until the positions are filled. | ||
<html> | <html> | ||
Line 34: | Line 27: | ||
* --> | * --> | ||
</html> | </html> | ||
+ | |||
+ | |||
==== Short biography ==== | ==== Short biography ==== | ||
* Born in Brussels in 1976. | * Born in Brussels in 1976. | ||
Line 47: | Line 42: | ||
==== Teaching ==== | ==== 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: Computing and 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 |
- | * Analyse complexe (MATH-H-201) - 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 ==== | ==== Research interests ==== | ||
* Quantum algorithms | * Quantum algorithms | ||
Line 62: | Line 60: | ||
* Quantum cryptographic primitives | * Quantum cryptographic primitives | ||
==== Selected talks ==== | ==== 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}}] | * 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 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 79: | Line 80: | ||
- | <!-- This document was automatically generated with bibtex2html 1.98 | + | |
+ | |||
+ | <!-- This document was automatically generated with bibtex2html 1.99 | ||
(see http://www.lri.fr/~filliatr/bibtex2html/), | (see http://www.lri.fr/~filliatr/bibtex2html/), | ||
with the following command: | 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 89: | Line 92: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLN+16">1</a>] | + | [<a name="HXA+22">1</a>] |
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Xiao-Min Hu, Yi Xie, Atul Singh Arora, Ming-Zhong Ai, Kishor Bharti, Jie Zhang, | ||
+ | Wei Wu, Ping-Xing Chen, Jin-Ming Cui, Bi-Heng Liu, Yun-Feng Huang, Chuan-Feng | ||
+ | Li, Guang-Can Guo, Jérémie Roland, Adán Cabello, and Leong-Chuan Kwek. | ||
+ | Self-testing of a single quantum system: Theory and experiment. | ||
+ | <em>arXiv e-prints</em>, arXiv:2203.09003, 2022. | ||
+ | [ <a href="http://dx.doi.org/10.48550/ARXIV.2203.09003">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/2203.09003">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<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. | ||
+ | [ <a href="http://dx.doi.org/10.48550/ARXIV.2112.12746">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/2112.12746">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="ARV21">3</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Atul Singh Arora, Jérémie Roland, and Chrysoula Vlachou. | ||
+ | Analytic quantum weak coin flipping protocols with arbitrarily small | ||
+ | bias. | ||
+ | In <em>Proceedings of the 2021 ACM-SIAM Symposium on Discrete | ||
+ | Algorithms (SODA)</em>, pages 919--938, 2021. | ||
+ | [ <a href="http://dx.doi.org/10.1137/1.9781611976465.58">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1911.13283">arXiv</a> ] | ||
+ | |||
+ | </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. | ||
+ | Optimality of spatial search via continuous-time quantum walks. | ||
+ | <em>Phys. Rev. A</em>, 102:032214, 2020. | ||
+ | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.032214">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/2004.12686">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CNR20a">5</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. | ||
+ | Finding a marked node on any graph via continuous-time quantum walks. | ||
+ | <em>Phys. Rev. A</em>, 102:022227, 2020. | ||
+ | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.022227">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1807.05957">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CLR20a">6</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Shantanav Chakraborty, Kyle Luh, and Jérémie Roland. | ||
+ | Analog quantum algorithms for the mixing of markov chains. | ||
+ | <em>Physical Review A</em>, 102:022423, 2020. | ||
+ | [ <a href="http://dx.doi.org/10.1103/PhysRevA.102.022423">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1904.11895">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="BAKR20">7</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Kishor Bharti, Atul Singh Arora, Leong Chuan Kwek, and Jérémie Roland. | ||
+ | Uniqueness of all fundamental noncontextuality inequalities. | ||
+ | <em>Physical Review Research</em>, 2:033010, 2020. | ||
+ | [ <a href="http://dx.doi.org/10.1103/PhysRevResearch.2.033010">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1811.05294">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CLR20b">8</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. | ||
+ | [ <a href="http://dx.doi.org/10.1103/physrevlett.124.050501">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/2001.06305">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CJR19">9</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Jean Cardinal, Gwenaël Joret, and Jérémie Roland. | ||
+ | Information-theoretic lower bounds for quantum sorting. | ||
+ | <em>arXiv e-prints</em>, arXiv:1902.06473, 2019. | ||
+ | [ <a href="http://arxiv.org/abs/1902.06473">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="ARW19">10</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Atul Singh Arora, Jérémie Roland, and Stephan Weis. | ||
+ | Quantum weak coin flipping. | ||
+ | In <em>51st ACM Symposium on Theory of Computing (STOC'19)</em>, pages | ||
+ | 205--216, 2019. | ||
+ | [ <a href="http://dx.doi.org/10.1145/3313276.3316306">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1811.02984">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="LLN+18">11</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie | ||
+ | Roland, and Gabriel Senno. | ||
+ | Robust Bell inequalities from communication complexity. | ||
+ | <em>Quantum</em>, 2:72, 2018. | ||
+ | [ <a href="http://dx.doi.org/10.22331/q-2018-06-07-72">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1606.09514">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="FJKL+16">12</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu | ||
+ | Laurière, and Jérémie Roland. | ||
+ | Relative discrepancy does not separate information and communication | ||
+ | complexity. | ||
+ | <em>ACM Transactions on Computation Theory</em>, 9(1):4:1--4:15, 2016. | ||
+ | Best of 2016 award. | ||
+ | [ <a href="http://dx.doi.org/10.1145/2967605">DOI</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="LLN+16">13</a>] | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 95: | Line 285: | ||
and Gabriel Senno. | and Gabriel Senno. | ||
Robust Bell inequalities from communication complexity. | Robust Bell inequalities from communication complexity. | ||
- | 2016. | + | In <em>11th Conference on the Theory of Quantum Computation, |
- | [ <a href="http://arxiv.org/abs/1606.09514">arXiv</a> ] | + | Communication and Cryptography (TQC 2016)</em>, volume 61 of <em>Leibniz |
+ | International Proceedings in Informatics (LIPIcs)</em>, pages 5:1--5:24, 2016. | ||
+ | [ <a href="http://arxiv.org/abs/1606.09514">arXiv</a> | | ||
+ | <a href="http://drops.dagstuhl.de/opus/volltexte/2016/6686">http</a> ] | ||
</td> | </td> | ||
Line 104: | Line 297: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="BR14">2</a>] | + | [<a name="BR15">14</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 121: | Line 314: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+14">3</a>] | + | [<a name="KLL+15">15</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 138: | Line 331: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="FJKL+15">4</a>] | + | [<a name="FJKL+15">16</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 148: | Line 341: | ||
Programming (ICALP'15)</em>, volume 9134 of <em>Lecture Notes in Computer | 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. | ||
- | [ <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | + | [ <a href="http://dx.doi.org/10.1007/978-3-662-47672-7_41">DOI</a> | |
+ | <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | ||
</td> | </td> | ||
Line 156: | Line 350: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR15-IJQI">5</a>] | + | [<a name="KMOR15">17</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Loïck Magnin and Jérémie Roland. | + | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jéré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, | + | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | |
- | 2015. | + | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] |
- | Online ready. | + | |
- | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | + | |
</td> | </td> | ||
Line 173: | Line 365: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KMOR15">6</a>] | + | [<a name="MR15-IJQI">18</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Hari Krovi, Frédéric Magniez, Maris Ozols, and Jérémie Roland. | + | Loïck Magnin and Jéré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. |
- | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | | + | <em>International Journal of Quantum Information</em>, 13(4):1350059, |
- | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | + | 2015. |
+ | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] | ||
</td> | </td> | ||
Line 188: | Line 382: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR13">7</a>] | + | [<a name="ORR13">19</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 194: | Line 388: | ||
Quantum rejection sampling. | 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. | ||
- | [ <a href="http://dx.doi.org/10.1145/2493252.2493256">DOI</a> ] | + | [ <a href="http://dx.doi.org/10.1145/2493252.2493256">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1103.2774">arXiv</a> ] | ||
</td> | </td> | ||
Line 202: | Line 397: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR13">8</a>] | + | [<a name="LR13">20</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Troy Lee and Jérémie Roland. | + | Troy Lee and Jérémie Roland. |
A strong direct product theorem for quantum query complexity. | 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. | ||
- | [ <a href="http://dx.doi.org/10.1007/s00037-013-0066-8">DOI</a> ] | + | [ <a href="http://dx.doi.org/10.1007/s00037-013-0066-8">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1104.4468">arXiv</a> ] | ||
</td> | </td> | ||
Line 216: | Line 412: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR13">9</a>] | + | [<a name="MR13">21</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 233: | Line 429: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+12">10</a>] | + | [<a name="KLL+12">22</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 251: | Line 447: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLR12">11</a>] | + | [<a name="LLR12">23</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 268: | Line 464: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR11">12</a>] | + | [<a name="LR11">24</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 284: | Line 480: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR11">13</a>] | + | [<a name="ORR11">25</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 300: | Line 496: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="GRR11">14</a>] | + | [<a name="GRR11">26</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 317: | Line 513: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="AMRR11">15</a>] | + | [<a name="AMRR11">27</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 334: | Line 530: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr11">16</a>] | + | [<a name="dklr11">28</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 349: | Line 545: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs11-sicomp">17</a>] | + | [<a name="mnrs11-sicomp">29</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 365: | Line 561: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr11">18</a>] | + | [<a name="kklr11">30</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 380: | Line 576: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kor10">19</a>] | + | [<a name="kor10">31</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 386: | Line 582: | ||
Adiabatic condition and the quantum hitting time of Markov chains. | Adiabatic condition and the quantum hitting time of Markov chains. | ||
<em>Physical Review A</em>, 82(2):022333, 2010. | <em>Physical Review A</em>, 82(2):022333, 2010. | ||
+ | Highlighted in the online APS Journal <em>Physics</em>. | ||
[ <a href="http://dx.doi.org/10.1103/PhysRevA.82.022333">DOI</a> | | [ <a href="http://dx.doi.org/10.1103/PhysRevA.82.022333">DOI</a> | | ||
<a href="http://arxiv.org/abs/1004.2721">arXiv</a> ] | <a href="http://arxiv.org/abs/1004.2721">arXiv</a> ] | ||
Line 395: | Line 592: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kmor10">20</a>] | + | [<a name="kmor10">32</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 412: | Line 609: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr10-pnas">21</a>] | + | [<a name="akr10-pnas">33</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 428: | Line 625: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr09">22</a>] | + | [<a name="kklr09">34</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 446: | Line 643: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr09-arxiv">23</a>] | + | [<a name="akr09-arxiv">35</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 461: | Line 658: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr09">24</a>] | + | [<a name="dklr09">36</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 478: | Line 675: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rs09">25</a>] | + | [<a name="rs09">37</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 494: | Line 691: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="arc06">26</a>] | + | [<a name="arc06">38</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 509: | Line 706: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr06:qudits">27</a>] | + | [<a name="dlr06:qudits">39</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 525: | Line 722: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs06">28</a>] | + | [<a name="mnrs06">40</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 542: | Line 739: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ir06">29</a>] | + | [<a name="ir06">41</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 557: | Line 754: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pisa">30</a>] | + | [<a name="ccmr05:pisa">42</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 577: | Line 774: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dr05">31</a>] | + | [<a name="dr05">43</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 591: | Line 788: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr05">32</a>] | + | [<a name="dlr05">44</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 606: | Line 803: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pra">33</a>] | + | [<a name="ccmr05:pra">45</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 623: | Line 820: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc05">34</a>] | + | [<a name="rc05">46</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 639: | Line 836: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="roland04">35</a>] | + | [<a name="roland04">47</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 653: | Line 850: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03b">36</a>] | + | [<a name="rc03b">48</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 668: | Line 865: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03a">37</a>] | + | [<a name="rc03a">49</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 683: | Line 880: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mprg02">38</a>] | + | [<a name="mprg02">50</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 698: | Line 895: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc02">39</a>] | + | [<a name="rc02">51</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 713: | Line 910: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="hrb02">40</a>] | + | [<a name="hrb02">52</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 724: | Line 921: | ||
</tr> | </tr> | ||
</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.98.</em></p> | + | <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.99.</em></p> |
- | + | ||
<!-- Site Meter --> | <!-- Site Meter --> |