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 [2012/09/14 10:02] jroland |
members:jroland [2015/02/27 15:42] jroland [Publications] |
||
---|---|---|---|
Line 1: | Line 1: | ||
+ | ~~NOTOC~~ | ||
====== Jérémie Roland ====== | ====== Jérémie Roland ====== | ||
Line 7: | Line 8: | ||
| style="width:541px;"| jroland (at) ulb.ac.be | | style="width:541px;"| jroland (at) ulb.ac.be | ||
|- | |- | ||
- | ! Phone: | + | ! Phone: |
- | | +32-2-650-28-20 | + | | +32-2-650-28-75 |
|- | |- | ||
! Fax: | ! Fax: | ||
Line 17: | Line 18: | ||
|} | |} | ||
- | === Short biography === | + | ==== Short biography ==== |
* Born in Brussels in 1976. | * Born in Brussels in 1976. | ||
* In 1994, he began to study engineering at the [[http://www.ulb.ac.be/|University of Brussels]] (ULB). | * In 1994, he began to study engineering at the [[http://www.ulb.ac.be/|University of Brussels]] (ULB). | ||
Line 30: | Line 31: | ||
* From May 2008 to August 2011, he was a Research Staff Member at [[http://www.nec-labs.com/|NEC Laboratories America]]. | * From May 2008 to August 2011, he was a Research Staff Member at [[http://www.nec-labs.com/|NEC Laboratories America]]. | ||
- | === Research interests === | + | ==== Teaching ==== |
+ | * Compléments de programmation et d'algorithmique (INFO-H-304) | ||
+ | * Quantum information and computation (INFO-H-514) | ||
+ | |||
+ | ==== Research interests ==== | ||
* Quantum algorithms | * Quantum algorithms | ||
* Quantum walks | * Quantum walks | ||
Line 38: | Line 43: | ||
* Quantum query complexity | * Quantum query complexity | ||
- | === Selected talks === | + | ==== Selected talks ==== |
- | * Quantum query complexity: Adversaries, polynomials and direct product theorems. [[http://qa2012.iqc.uwaterloo.ca/|Recent Progress in Quantum Algorithms]] in Waterloo (Canada), April 11-13, 2012. [{{:members:jroland:talk-qa-2012-printout.pdf|PDF}} | [[http://www.youtube.com/watch?v=N9BuArGFqjU|Video]]] | + | * Quantum algorithms based on quantum walks. [[https://uwaterloo.ca/institute-for-quantum-computing/|IQC Colloquium at UWaterloo]] (Canada), July 28, 2014. [{{:members:jroland:IQC-colloquium-08-2014-handout.pdf|PDF}}] |
+ | * Quantum query complexity: Adversaries, polynomials and direct product theorems. [[http://www.maths.bris.ac.uk/~maowg/q-alg-2013/q-alg-2013.html|The 3rd Heilbronn Quantum Algorithms Day]] in Bristol (UK), April 25, 2013. [{{:members:jroland:bristol-algorithm-day-2013-handout.pdf|PDF}}] | ||
+ | * Quantum algorithms based on quantum walks. [[http://www-fourier.ujf-grenoble.fr/~joye/quawag/QuaWaG/|Quantum Walks in Grenoble]] (France), November 13-14, 2012. [{{:members:jroland:quawag-grenoble-presentation-handout.pdf|PDF}}] | ||
+ | * Quantum query complexity: Adversaries, polynomials and direct product theorems. [[http://qa2012.iqc.uwaterloo.ca/|Recent Progress in Quantum Algorithms]] at IQC (Waterloo, Canada), April 11-13, 2012. [{{:members:jroland:talk-iqc-pi-workshop-2012-printout.pdf|PDF}} | [[http://www.youtube.com/watch?v=N9BuArGFqjU|Video]]] | ||
* Quantum rejection sampling. [[http://quantum.nasa.gov/|First NASA Quantum Future Technologies Conference]] at NASA Ames Research Center (USA), January 17-21, 2012. [{{:members:jroland:talk-qft-2012-printout.pdf|PDF}} | [[http://connect.arc.nasa.gov/p59zv0ohngj/|Video]]] | * Quantum rejection sampling. [[http://quantum.nasa.gov/|First NASA Quantum Future Technologies Conference]] at NASA Ames Research Center (USA), January 17-21, 2012. [{{:members:jroland:talk-qft-2012-printout.pdf|PDF}} | [[http://connect.arc.nasa.gov/p59zv0ohngj/|Video]]] | ||
* Quantum rejection sampling. [[http://www.iro.umontreal.ca/~qip2012/|15th Workshop on Quantum Information Processing]] (QIP'12) in Montréal (Canada), December 12-16, 2011. [{{:members:jroland:talk-qip12-printout.pdf|PDF}} | [[http://www.iro.umontreal.ca/~qip2012/videos/Talks/Thursday/QIP2012-Thursday-roland.mov|Video]]] | * Quantum rejection sampling. [[http://www.iro.umontreal.ca/~qip2012/|15th Workshop on Quantum Information Processing]] (QIP'12) in Montréal (Canada), December 12-16, 2011. [{{:members:jroland:talk-qip12-printout.pdf|PDF}} | [[http://www.iro.umontreal.ca/~qip2012/videos/Talks/Thursday/QIP2012-Thursday-roland.mov|Video]]] | ||
Line 48: | Line 56: | ||
* Search via quantum walk. [[http://www2.research.att.com/~dsj/stoc07.html|39th ACM Symposium on Theory of Computing]] (STOC'07) in San Diego (USA), June 11-13, 2007. [{{:members:jroland:stoc-presentation.pdf|PDF}}] | * Search via quantum walk. [[http://www2.research.att.com/~dsj/stoc07.html|39th ACM Symposium on Theory of Computing]] (STOC'07) in San Diego (USA), June 11-13, 2007. [{{:members:jroland:stoc-presentation.pdf|PDF}}] | ||
- | === Publications === | + | ==== Publications ==== |
<html> | <html> | ||
- | <!-- This document was automatically generated with bibtex2html 1.96 | + | <!-- This document was automatically generated with bibtex2html 1.97 |
(see http://www.lri.fr/~filliatr/bibtex2html/), | (see http://www.lri.fr/~filliatr/bibtex2html/), | ||
with the following command: | with the following command: | ||
Line 61: | Line 69: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KLL+12">1</a>] | + | [<a name="FJKL+15">1</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, and David | + | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Mathieu Laurière, Sophie |
- | Xiao. | + | Laplante, and Jérémie Roland. |
+ | Relative Discrepancy does not separate Information and Communication | ||
+ | Complexity. | ||
+ | <em>Electronic Colloquium on Computational Complexity</em>, 28, 2015. | ||
+ | [ <a href="http://eccc.hpi-web.de/report/2015/028/">http</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="BR14">2</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Mathieu Brandeho and Jérémie Roland. | ||
+ | A universal adiabatic quantum query algorithm. | ||
+ | <em>arXiv preprint arXiv:1409.3558</em>, 2014. | ||
+ | [ <a href="http://arxiv.org/abs/1409.3558">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="KLL+14">3</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, | ||
+ | and David Xiao. | ||
Lower bounds on information complexity via zero-communication | Lower bounds on information complexity via zero-communication | ||
protocols and applications. | protocols and applications. | ||
- | In <em>53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12)</em>, 2012. To appear. | + | <em>SIAM Journal on Computing</em>, 2014. |
+ | To appear. | ||
[ <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | [ <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
Line 77: | Line 116: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLR12">2</a>] | + | [<a name="MR13-IJQI">4</a>] |
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Loïck Magnin and Jérémie Roland. | ||
+ | Explicit relation between all lower bound techniques for quantum | ||
+ | query complexity. | ||
+ | <em>International Journal of Quantum Information</em>, 2013. | ||
+ | Online ready. | ||
+ | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="ORR13">5</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Maris Ozols, Martin Roetteler, and Jérémie Roland. | ||
+ | Quantum rejection sampling. | ||
+ | <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> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="LR13">6</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Troy Lee and Jérémie Roland. | ||
+ | A strong direct product theorem for quantum query complexity. | ||
+ | <em>Computational Complexity</em>, 22(2):429-462, 2013. | ||
+ | [ <a href="http://dx.doi.org/10.1007/s00037-013-0066-8">DOI</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="MR13">7</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Loïck Magnin and Jérémie Roland. | ||
+ | Explicit relation between all lower bound techniques for quantum | ||
+ | query complexity. | ||
+ | In <em>30th International Symposium on Theoretical Aspects of | ||
+ | Computer Science (STACS'13)</em>, pages 434-445, 2013. | ||
+ | [ <a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2013.434">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="KLL+12">8</a>] | ||
+ | </td> | ||
+ | <td class="bibtexitem"> | ||
+ | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, | ||
+ | and David Xiao. | ||
+ | Lower bounds on information complexity via zero-communication | ||
+ | protocols and applications. | ||
+ | In <em>53rd Annual IEEE Symposium on Foundations of Computer Science | ||
+ | (FOCS'12)</em>, pages 500-509, 2012. | ||
+ | [ <a href="http://dx.doi.org/10.1109/FOCS.2012.68">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
+ | |||
+ | </td> | ||
+ | </tr> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<a name="LLR12">9</a>] | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Sophie Laplante, Virginie Lerays, and Jérémie Roland. | Sophie Laplante, Virginie Lerays, and Jérémie Roland. | ||
Classical and quantum partition bound and detector inefficiency. | Classical and quantum partition bound and detector inefficiency. | ||
- | 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, 2012. | + | In <em>39th International Colloquium on Automata, Languages and |
- | [ <a href="http://dx.doi.org/10.1007/978-3-642-31594-7_52">DOI</a> | <a href="http://arxiv.org/abs/1203.4155">arXiv</a> ] | + | Programming (ICALP'12)</em>, volume 7391 of <em>Lecture Notes in Computer |
+ | Science</em>, pages 617-628. Springer, 2012. | ||
+ | [ <a href="http://dx.doi.org/10.1007/978-3-642-31594-7_52">DOI</a> | | ||
+ | <a href="http://arxiv.org/abs/1203.4155">arXiv</a> ] | ||
</td> | </td> | ||
Line 91: | Line 212: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR11">3</a>] | + | [<a name="LR11">10</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 97: | Line 218: | ||
A strong direct product theorem for quantum query complexity. | A strong direct product theorem for quantum query complexity. | ||
In <em>27th IEEE Conference on Computational Complexity (CCC'12)</em>, | In <em>27th IEEE Conference on Computational Complexity (CCC'12)</em>, | ||
- | pages 236-246, 2012 | + | pages 236-246. IEEE, 2012. |
- | [ <a href="http://dx.doi.org/10.1109/CCC.2012.17">DOI</a> | <a href="http://arxiv.org/abs/1104.4468">arXiv</a> ] | + | [ <a href="http://dx.doi.org/10.1109/CCC.2012.17">DOI</a> | |
+ | <a href="http://arxiv.org/abs/1104.4468">arXiv</a> ] | ||
</td> | </td> | ||
Line 106: | Line 228: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR11">4</a>] | + | [<a name="ORR11">11</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 122: | Line 244: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="GRR11">5</a>] | + | [<a name="GRR11">12</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 139: | Line 261: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="AMRR11">6</a>] | + | [<a name="AMRR11">13</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 156: | Line 278: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr11">7</a>] | + | [<a name="dklr11">14</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 171: | Line 293: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs11-sicomp">8</a>] | + | [<a name="mnrs11-sicomp">15</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 187: | Line 309: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr11">9</a>] | + | [<a name="kklr11">16</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 202: | Line 324: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kor10">10</a>] | + | [<a name="kor10">17</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Hari Krovi, Maris Ozols, and Jérémie Roland. | Hari Krovi, Maris Ozols, and Jérémie Roland. | ||
Adiabatic condition and the quantum hitting time of Markov chains. | Adiabatic condition and the quantum hitting time of Markov chains. | ||
- | <em><em>Physical Review A</em></em>, 82(2):022333, 2010. | + | <em>Physical Review A</em>, 82(2):022333, 2010. |
[ <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 217: | Line 339: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kmor10">11</a>] | + | [<a name="kmor10">18</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 234: | Line 356: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr10-pnas">12</a>] | + | [<a name="akr10-pnas">19</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 250: | Line 372: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr09">13</a>] | + | [<a name="kklr09">20</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 268: | Line 390: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="akr09-arxiv">14</a>] | + | [<a name="akr09-arxiv">21</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 283: | Line 405: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr09">15</a>] | + | [<a name="dklr09">22</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 300: | Line 422: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rs09">16</a>] | + | [<a name="rs09">23</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 316: | Line 438: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="arc06">17</a>] | + | [<a name="arc06">24</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 331: | Line 453: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr06:qudits">18</a>] | + | [<a name="dlr06:qudits">25</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 347: | Line 469: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs06">19</a>] | + | [<a name="mnrs06">26</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 364: | Line 486: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ir06">20</a>] | + | [<a name="ir06">27</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 379: | Line 501: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pisa">21</a>] | + | [<a name="ccmr05:pisa">28</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 399: | Line 521: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dr05">22</a>] | + | [<a name="dr05">29</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 405: | Line 527: | ||
An intuitive approach for the simulation of quantum correlations. | An intuitive approach for the simulation of quantum correlations. | ||
In <em>26th Symposium on Information Theory in the Benelux</em>, 2005. | In <em>26th Symposium on Information Theory in the Benelux</em>, 2005. | ||
- | [ <a href="/~jroland/publications/2005-Proc-IT05.pdf">.pdf</a> ] | + | [ <a href="/_media/members/jroland/publications/2005-proc-it05.pdf">.pdf</a> ] |
</td> | </td> | ||
Line 413: | Line 535: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr05">23</a>] | + | [<a name="dlr05">30</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 428: | Line 550: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ccmr05:pra">24</a>] | + | [<a name="ccmr05:pra">31</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 445: | Line 567: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc05">25</a>] | + | [<a name="rc05">32</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 461: | Line 583: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="roland04">26</a>] | + | [<a name="roland04">33</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 467: | Line 589: | ||
<em>Adiabatic Quantum Computation</em>. | <em>Adiabatic Quantum Computation</em>. | ||
PhD thesis, Université Libre de Bruxelles, 2004. | PhD thesis, Université Libre de Bruxelles, 2004. | ||
- | [ <a href="/~jroland/publications/2004-Thesis-Adiabatic\_Quantum\_Computation.pdf">.pdf</a> ] | + | [ <a href="/_media/members/jroland/2004-thesis.pdf">.pdf</a> ] |
</td> | </td> | ||
Line 475: | Line 597: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03b">27</a>] | + | [<a name="rc03b">34</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 490: | Line 612: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03a">28</a>] | + | [<a name="rc03a">35</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 505: | Line 627: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mprg02">29</a>] | + | [<a name="mprg02">36</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 520: | Line 642: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc02">30</a>] | + | [<a name="rc02">37</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 535: | Line 657: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="hrb02">31</a>] | + | [<a name="hrb02">38</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 546: | Line 668: | ||
</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.96.</em></p> | + | <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p> |
Line 558: | Line 679: | ||
</noscript> | </noscript> | ||
<!-- Copyright (c)2009 Site Meter --> | <!-- Copyright (c)2009 Site Meter --> | ||
- | |||
</html> | </html> |