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/03/03 11:29] jroland [Short biography] |
members:jroland [2020/03/27 16:46] jroland [Short biography] |
||
---|---|---|---|
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;"| jroland (at) ulb.ac.be | ||
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 49: | Line 44: | ||
* Compléments de programmation et d'algorithmique (INFO-H-304) | * Compléments de programmation et d'algorithmique (INFO-H-304) | ||
* Quantum information and computation (INFO-H-514) - partim: Quantum computation | * 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 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 | * Examen spécial d'admission en Polytechnique - Géométrie | ||
==== Research interests ==== | ==== Research interests ==== | ||
Line 62: | Line 57: | ||
* 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 78: | Line 76: | ||
<html> | <html> | ||
- | <!-- This document was automatically generated with bibtex2html 1.97 | + | |
+ | |||
+ | <!-- This document was automatically generated with bibtex2html 1.96 | ||
(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 dklr10 -e mnrs10-sicomp -e kor09 -e akr09-tr -e MR11 publications.bib --> |
<table> | <table> | ||
+ | |||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="BR14">1</a>] | + | [<a name="ARV19">1</a>] |
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Atul Singh Arora, Jérémie Roland, and Chrysoula Vlachou. | ||
+ | Explicit quantum weak coin flipping protocols with arbitrarily small | ||
+ | bias. | ||
+ | <em>arXiv e-prints</em>, arXiv:1911.13283, 2019. | ||
+ | [ <a href="http://arxiv.org/abs/1911.13283">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CLR19">1</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Shantanav Chakraborty, Kyle Luh and Jérémie Roland. | ||
+ | On analog quantum algorithms for the mixing of markov chains. | ||
+ | <em>arXiv e-prints</em>, arXiv:1904.11895, 2019. | ||
+ | [ <a href="http://arxiv.org/abs/1904.11895">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CJR19">2</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">3</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="BAKR18">4</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Kishor Bharti, Atul Singh Arora, Leong Chuan Kwek, and Jérémie Roland. | ||
+ | A simple proof of uniqueness of the KCBS inequality. | ||
+ | <em>arXiv e-prints</em>, arXiv:1811.05294, 2018. | ||
+ | [ <a href="http://arxiv.org/abs/1811.05294">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="CNR18">5</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Shantanav Chakraborty, Leonardo Novo, and Jérémie Roland. | ||
+ | Finding a marked node on any graph by continuous time quantum walk. | ||
+ | <em>arXiv e-prints</em>, arXiv:1807.05957, 2018. | ||
+ | [ <a href="http://arxiv.org/abs/1807.05957">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="LLN+18">6</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">7</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">8</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. | ||
+ | In <em>11th Conference on the Theory of Quantum Computation, | ||
+ | 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> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="BR15">9</a>] | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 95: | Line 234: | ||
In <em>10th Conference on the Theory of Quantum Computation, | In <em>10th Conference on the Theory of Quantum Computation, | ||
Communication and Cryptography (TQC'15)</em>, volume 44 of <em>Leibniz | Communication and Cryptography (TQC'15)</em>, volume 44 of <em>Leibniz | ||
- | International Proceedings in Informatics (LIPIcs)</em>, pages 163--179, 2015. | + | International Proceedings in Informatics (LIPIcs)</em>, pages 163-179, 2015. |
[ <a href="http://dx.doi.org/10.4230/LIPIcs.TQC.2015.163">DOI</a> | | [ <a href="http://dx.doi.org/10.4230/LIPIcs.TQC.2015.163">DOI</a> | | ||
<a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | ||
Line 101: | Line 240: | ||
</td> | </td> | ||
</tr> | </tr> | ||
+ | |||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+14">2</a>] | + | [<a name="KLL+15">10</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 111: | Line 251: | ||
Lower bounds on information complexity via zero-communication | Lower bounds on information complexity via zero-communication | ||
protocols and applications. | 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. |
[ <a href="http://dx.doi.org/10.1137/130928273">DOI</a> | | [ <a href="http://dx.doi.org/10.1137/130928273">DOI</a> | | ||
<a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
Line 117: | Line 257: | ||
</td> | </td> | ||
</tr> | </tr> | ||
+ | |||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="FJKL+15">3</a>] | + | [<a name="FJKL+15">11</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 130: | Line 271: | ||
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://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> ] | + | [ <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 138: | Line 280: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR13-IJQI">4</a>] | + | [<a name="KMOR15">12</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, 2015. | + | [ <a href="http://dx.doi.org/10.1007/s00453-015-9979-8">DOI</a> | |
- | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | + | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] |
</td> | </td> | ||
Line 153: | Line 295: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KMOR15">5</a>] | + | [<a name="MR15-IJQI">13</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> | ||
</tr> | </tr> | ||
+ | |||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR13">6</a>] | + | [<a name="ORR13">14</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 173: | Line 318: | ||
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 181: | Line 327: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR13">7</a>] | + | [<a name="LR13">15</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 195: | Line 342: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR13">8</a>] | + | [<a name="MR13">16</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 212: | Line 359: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+12">9</a>] | + | [<a name="KLL+12">17</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 230: | Line 377: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLR12">10</a>] | + | [<a name="LLR12">18</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 247: | Line 394: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR11">11</a>] | + | [<a name="LR11">19</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 263: | Line 410: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR11">12</a>] | + | [<a name="ORR11">20</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 279: | Line 426: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="GRR11">13</a>] | + | [<a name="GRR11">21</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 296: | Line 443: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="AMRR11">14</a>] | + | [<a name="AMRR11">22</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 313: | Line 460: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr11">15</a>] | + | [<a name="dklr11">23</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 328: | Line 475: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs11-sicomp">16</a>] | + | [<a name="mnrs11-sicomp">24</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 344: | Line 491: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr11">17</a>] | + | [<a name="kklr11">25</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 359: | Line 506: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kor10">18</a>] | + | [<a name="kor10">26</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 365: | Line 512: | ||
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 374: | Line 522: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kmor10">19</a>] | + | [<a name="kmor10">27</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 391: | Line 539: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr10-pnas">20</a>] | + | [<a name="akr10-pnas">28</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 407: | Line 555: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr09">21</a>] | + | [<a name="kklr09">29</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 425: | Line 573: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr09-arxiv">22</a>] | + | [<a name="akr09-arxiv">30</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 440: | Line 588: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr09">23</a>] | + | [<a name="dklr09">31</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 457: | Line 605: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rs09">24</a>] | + | [<a name="rs09">32</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 473: | Line 621: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="arc06">25</a>] | + | [<a name="arc06">33</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 488: | Line 636: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr06:qudits">26</a>] | + | [<a name="dlr06:qudits">34</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 504: | Line 652: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs06">27</a>] | + | [<a name="mnrs06">35</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 521: | Line 669: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ir06">28</a>] | + | [<a name="ir06">36</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 536: | Line 684: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pisa">29</a>] | + | [<a name="ccmr05:pisa">37</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 556: | Line 704: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dr05">30</a>] | + | [<a name="dr05">38</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 570: | Line 718: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr05">31</a>] | + | [<a name="dlr05">39</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 585: | Line 733: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pra">32</a>] | + | [<a name="ccmr05:pra">40</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 602: | Line 750: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc05">33</a>] | + | [<a name="rc05">41</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 618: | Line 766: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="roland04">34</a>] | + | [<a name="roland04">42</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 632: | Line 780: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03b">35</a>] | + | [<a name="rc03b">43</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 647: | Line 795: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03a">36</a>] | + | [<a name="rc03a">44</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 662: | Line 810: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mprg02">37</a>] | + | [<a name="mprg02">45</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 677: | Line 825: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc02">38</a>] | + | [<a name="rc02">46</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 692: | Line 840: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="hrb02">39</a>] | + | [<a name="hrb02">47</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 702: | Line 850: | ||
</td> | </td> | ||
</tr> | </tr> | ||
- | </table> | + | </table><hr><p><em>This file was generated by |
+ | <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.96.</em></p> | ||
+ | |||
+ | |||
- | <hr><p><em>This file was generated by | ||
- | <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p> | ||