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/02/10 09:31] jroland [Publications] |
members:jroland [2016/09/20 17:00] jroland [Publications] |
||
---|---|---|---|
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 on 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 42: | Line 35: | ||
* From 2000 to 2004, he did a PhD thesis at QuIC, where he also worked as a teaching assistant for courses of information theory and quantum physics. | * From 2000 to 2004, he did a PhD thesis at QuIC, where he also worked as a teaching assistant for courses of information theory and quantum physics. | ||
* From 2004 to 2006, he held a postdoctoral position at the [[http://www.lri.fr/algo/|Laboratoire de Recherche en Informatique]] in Orsay, France. | * From 2004 to 2006, he held a postdoctoral position at the [[http://www.lri.fr/algo/|Laboratoire de Recherche en Informatique]] in Orsay, France. | ||
- | * From January to December 2007, he was a Postdoctoral Researcher of the [[http://www.berkeley.edu/|University of California, Berkeley]]. | + | * From January to December 2007, he was a Postdoctoral Researcher of the [[http://www.berkeley.edu/|University of California, Berkeley]], USA. |
* From January to May 2008, he was a Postdoctoral Researcher of the Belgian [[http://www.frs-fnrs.be/|FNRS]], based at the University of Brussels. | * From January to May 2008, he was a Postdoctoral Researcher of the Belgian [[http://www.frs-fnrs.be/|FNRS]], based at the University of Brussels. | ||
- | * 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]] in Princeton, USA. |
==== Teaching ==== | ==== Teaching ==== | ||
Line 78: | Line 71: | ||
<html> | <html> | ||
- | <!-- This document was automatically generated with bibtex2html 1.97 | + | |
+ | <!-- This document was automatically generated with bibtex2html 1.98 | ||
(see http://www.lri.fr/~filliatr/bibtex2html/), | (see http://www.lri.fr/~filliatr/bibtex2html/), | ||
with the following command: | with the following command: | ||
Line 88: | Line 82: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="BR14">1</a>] | + | [<a name="LLN+16">1</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="BR14">2</a>] | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 101: | Line 114: | ||
</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+14">3</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 117: | Line 131: | ||
</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">4</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 129: | Line 144: | ||
In <em>42nd International Colloquium on Automata, Languages and | In <em>42nd International Colloquium on Automata, Languages and | ||
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://eccc.hpi-web.de/report/2015/028/">http</a> ] |
</td> | </td> | ||
Line 138: | Line 153: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR13-IJQI">4</a>] | + | [<a name="MR15-IJQI">5</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 144: | Line 159: | ||
Explicit relation between all lower bound techniques for quantum | Explicit relation between all lower bound techniques for quantum | ||
query complexity. | query complexity. | ||
- | <em>International Journal of Quantum Information</em>, 13(4): 1350059, 2015. | + | <em>International Journal of Quantum Information</em>, 13(4):1350059, |
+ | 2015. | ||
+ | Online ready. | ||
[ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | [ <a href="http://dx.doi.org/10.1142/S0219749913500597">DOI</a> ] | ||
Line 153: | Line 170: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="KMOR15">5</a>] | + | [<a name="KMOR15">6</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 164: | Line 181: | ||
</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">7</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Maris Ozols, Martin Roetteler, and Jérémie Roland. | Maris Ozols, Martin Roetteler, and Jérémie Roland. | ||
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> ] | ||
Line 181: | Line 199: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR13">7</a>] | + | [<a name="LR13">8</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> ] | ||
Line 195: | Line 213: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="MR13">8</a>] | + | [<a name="MR13">9</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 202: | Line 220: | ||
query complexity. | query complexity. | ||
In <em>30th International Symposium on Theoretical Aspects of | 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. |
[ <a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2013.434">DOI</a> | | [ <a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2013.434">DOI</a> | | ||
<a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] | <a href="http://arxiv.org/abs/1209.2713">arXiv</a> ] | ||
Line 212: | Line 230: | ||
<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">10</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 220: | Line 238: | ||
protocols and applications. | protocols and applications. | ||
In <em>53rd Annual IEEE Symposium on Foundations of Computer Science | 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. |
[ <a href="http://dx.doi.org/10.1109/FOCS.2012.68">DOI</a> | | [ <a href="http://dx.doi.org/10.1109/FOCS.2012.68">DOI</a> | | ||
<a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | <a href="http://arxiv.org/abs/1204.1505">arXiv</a> ] | ||
Line 230: | Line 248: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LLR12">10</a>] | + | [<a name="LLR12">11</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 237: | Line 255: | ||
In <em>39th International Colloquium on Automata, Languages and | In <em>39th International Colloquium on Automata, Languages and | ||
Programming (ICALP'12)</em>, volume 7391 of <em>Lecture Notes in Computer | 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. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-31594-7_52">DOI</a> | | [ <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> ] | <a href="http://arxiv.org/abs/1203.4155">arXiv</a> ] | ||
Line 247: | Line 265: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="LR11">11</a>] | + | [<a name="LR11">12</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 253: | Line 271: | ||
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. IEEE, 2012. | + | pages 236--246. IEEE, 2012. |
[ <a href="http://dx.doi.org/10.1109/CCC.2012.17">DOI</a> | | [ <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://arxiv.org/abs/1104.4468">arXiv</a> ] | ||
Line 263: | Line 281: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ORR11">12</a>] | + | [<a name="ORR11">13</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 269: | Line 287: | ||
Quantum rejection sampling. | Quantum rejection sampling. | ||
In <em>3rd Conference on Innovations in Theoretical Computer Science | 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. |
[ <a href="http://dx.doi.org/10.1145/2090236.2090261">DOI</a> | | [ <a href="http://dx.doi.org/10.1145/2090236.2090261">DOI</a> | | ||
<a href="http://arxiv.org/abs/1103.2774">arXiv</a> ] | <a href="http://arxiv.org/abs/1103.2774">arXiv</a> ] | ||
Line 279: | Line 297: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="GRR11">13</a>] | + | [<a name="GRR11">14</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 286: | Line 304: | ||
In <em>17th International Computing & Combinatorics Conference | In <em>17th International Computing & Combinatorics Conference | ||
(COCOON'11)</em>, volume 6842 of <em>Lecture Notes in Computer Science</em>, pages | (COCOON'11)</em>, volume 6842 of <em>Lecture Notes in Computer Science</em>, pages | ||
- | 158-167. Springer, 2011. | + | 158--167. Springer, 2011. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-22685-4_14">DOI</a> | | [ <a href="http://dx.doi.org/10.1007/978-3-642-22685-4_14">DOI</a> | | ||
<a href="http://arxiv.org/abs/1103.3017">arXiv</a> ] | <a href="http://arxiv.org/abs/1103.3017">arXiv</a> ] | ||
Line 296: | Line 314: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="AMRR11">14</a>] | + | [<a name="AMRR11">15</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 303: | Line 321: | ||
Symmetry-assisted adversaries for quantum state generation. | Symmetry-assisted adversaries for quantum state generation. | ||
In <em>26th IEEE Conference on Computational Complexity (CCC'11)</em>, | In <em>26th IEEE Conference on Computational Complexity (CCC'11)</em>, | ||
- | pages 167-177, 2011. | + | pages 167--177, 2011. |
[ <a href="http://dx.doi.org/10.1109/CCC.2011.24">DOI</a> | | [ <a href="http://dx.doi.org/10.1109/CCC.2011.24">DOI</a> | | ||
<a href="http://arxiv.org/abs/1012.2112">arXiv</a> ] | <a href="http://arxiv.org/abs/1012.2112">arXiv</a> ] | ||
Line 313: | Line 331: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr11">15</a>] | + | [<a name="dklr11">16</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Julien Degorre, Marc Kaplan, Sophie Laplante, and Jérémie Roland. | Julien Degorre, Marc Kaplan, Sophie Laplante, and Jérémie Roland. | ||
The communication complexity of non-signaling distributions. | The communication complexity of non-signaling distributions. | ||
- | <em>Quantum Information & Computation</em>, 11(7&8):649-676, 2011. | + | <em>Quantum Information & Computation</em>, 11(7&8):649--676, 2011. |
[ <a href="http://arxiv.org/abs/0804.4859">arXiv</a> | | [ <a href="http://arxiv.org/abs/0804.4859">arXiv</a> | | ||
<a href="http://www.rintonpress.com/journals/qiconline.html#v11n78">http</a> ] | <a href="http://www.rintonpress.com/journals/qiconline.html#v11n78">http</a> ] | ||
Line 328: | Line 346: | ||
<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">17</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 334: | Line 352: | ||
Santha. | Santha. | ||
Search via quantum walk. | 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. |
[ <a href="http://dx.doi.org/10.1137/090745854">DOI</a> | | [ <a href="http://dx.doi.org/10.1137/090745854">DOI</a> | | ||
<a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a> ] | <a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a> ] | ||
Line 344: | Line 362: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr11">17</a>] | + | [<a name="kklr11">18</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland. | Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland. | ||
Non-local box complexity and secure function evaluation. | Non-local box complexity and secure function evaluation. | ||
- | <em>Quantum Information & Computation</em>, 11(1&2):40-69, 2011. | + | <em>Quantum Information & Computation</em>, 11(1&2):40--69, 2011. |
[ <a href="http://arxiv.org/abs/0903.2179">arXiv</a> | | [ <a href="http://arxiv.org/abs/0903.2179">arXiv</a> | | ||
<a href="http://www.rintonpress.com/journals/qiconline.html#v11n12">http</a> ] | <a href="http://www.rintonpress.com/journals/qiconline.html#v11n12">http</a> ] | ||
Line 359: | Line 377: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kor10">18</a>] | + | [<a name="kor10">19</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 374: | Line 392: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kmor10">19</a>] | + | [<a name="kmor10">20</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 381: | Line 399: | ||
In <em>37th International Colloquium on Automata, Languages and | In <em>37th International Colloquium on Automata, Languages and | ||
Programming (ICALP'10)</em>, volume 6198 of <em>Lecture Notes in Computer | 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. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-14165-2_46">DOI</a> | | [ <a href="http://dx.doi.org/10.1007/978-3-642-14165-2_46">DOI</a> | | ||
<a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | <a href="http://arxiv.org/abs/1002.2419">arXiv</a> ] | ||
Line 391: | Line 409: | ||
<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">21</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 397: | Line 415: | ||
Anderson localization makes adiabatic quantum optimization fail. | Anderson localization makes adiabatic quantum optimization fail. | ||
<em><em>Proceedings of the National Academy of Sciences of the | <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. |
[ <a href="http://dx.doi.org/10.1073/pnas.1002116107">DOI</a> | | [ <a href="http://dx.doi.org/10.1073/pnas.1002116107">DOI</a> | | ||
<a href="http://arxiv.org/abs/0912.0746">arXiv</a> ] | <a href="http://arxiv.org/abs/0912.0746">arXiv</a> ] | ||
Line 407: | Line 425: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="kklr09">21</a>] | + | [<a name="kklr09">22</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 414: | Line 432: | ||
In <em>IARCS Annual Conference on Foundations of Software Technology | In <em>IARCS Annual Conference on Foundations of Software Technology | ||
and Theoretical Computer Science (FSTTCS'09)</em>, volume 4 of <em>Leibniz | and Theoretical Computer Science (FSTTCS'09)</em>, volume 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. | Dagstuhl, 2009. | ||
[ <a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2009.2322">DOI</a> | | [ <a href="http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2009.2322">DOI</a> | | ||
Line 425: | Line 443: | ||
<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">23</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 440: | Line 458: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dklr09">23</a>] | + | [<a name="dklr09">24</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 447: | Line 465: | ||
In <em>34th International Symposium on Mathematical Foundations of | In <em>34th International Symposium on Mathematical Foundations of | ||
Computer Science (MFCS'09)</em>, volume 5734 of <em>Lecture Notes in Computer | 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. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-03816-7_24">DOI</a> | | [ <a href="http://dx.doi.org/10.1007/978-3-642-03816-7_24">DOI</a> | | ||
<a href="http://arxiv.org/abs/0804.4859">arXiv</a> ] | <a href="http://arxiv.org/abs/0804.4859">arXiv</a> ] | ||
Line 457: | Line 475: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rs09">24</a>] | + | [<a name="rs09">25</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 464: | Line 482: | ||
In <em>36th International Colloquium on Automata, Languages and | In <em>36th International Colloquium on Automata, Languages and | ||
Programming (ICALP'09)</em>, volume 5555 of <em>Lecture Notes in Computer | 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. |
[ <a href="http://dx.doi.org/10.1007/978-3-642-02927-1_61">DOI</a> ] | [ <a href="http://dx.doi.org/10.1007/978-3-642-02927-1_61">DOI</a> ] | ||
Line 473: | Line 491: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="arc06">25</a>] | + | [<a name="arc06">26</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Olga Lopez Acevedo, Jérémie Roland, and Nicolas J. Cerf. | Olga Lopez Acevedo, Jérémie Roland, and Nicolas J. Cerf. | ||
Exploring scalar quantum walks on Cayley graphs. | Exploring scalar quantum walks on Cayley graphs. | ||
- | <em>Quantum Information & Computation</em>, 8(1&2):68-81, 2008. | + | <em>Quantum Information & Computation</em>, 8(1&2):68--81, 2008. |
[ <a href="http://arxiv.org/abs/quant-ph/0609234">arXiv</a> | | [ <a href="http://arxiv.org/abs/quant-ph/0609234">arXiv</a> | | ||
<a href="http://www.rintonpress.com/journals/qiconline.html#v8n12">http</a> ] | <a href="http://www.rintonpress.com/journals/qiconline.html#v8n12">http</a> ] | ||
Line 488: | Line 506: | ||
<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">27</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 504: | Line 522: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mnrs06">27</a>] | + | [<a name="mnrs06">28</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 511: | Line 529: | ||
Search via quantum walk. | Search via quantum walk. | ||
In <em>39th ACM Symposium on Theory of Computing (STOC'07)</em>, pages | In <em>39th ACM Symposium on Theory of Computing (STOC'07)</em>, pages | ||
- | 575-584, 2007. | + | 575--584, 2007. |
[ <a href="http://dx.doi.org/10.1145/1250790.1250874">DOI</a> | | [ <a href="http://dx.doi.org/10.1145/1250790.1250874">DOI</a> | | ||
<a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a> ] | <a href="http://arxiv.org/abs/quant-ph/0608026">arXiv</a> ] | ||
Line 521: | Line 539: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="ir06">28</a>] | + | [<a name="ir06">29</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Sofyan Iblisdir and Jérémie Roland. | Sofyan Iblisdir and Jérémie Roland. | ||
Optimal finite measurements and Gauss quadratures. | 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. |
[ <a href="http://dx.doi.org/doi:10.1016/j.physleta.2006.05.045">DOI</a> | | [ <a href="http://dx.doi.org/doi:10.1016/j.physleta.2006.05.045">DOI</a> | | ||
<a href="http://arxiv.org/abs/quant-ph/0410237">arXiv</a> ] | <a href="http://arxiv.org/abs/quant-ph/0410237">arXiv</a> ] | ||
Line 536: | Line 554: | ||
<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">30</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 543: | Line 561: | ||
Information transmission via entangled quantum states in Gaussian | Information transmission via entangled quantum states in Gaussian | ||
channels with memory. | 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, |
2006. | 2006. | ||
Proceedings of the International Workshop “Quantum Entanglement in | Proceedings of the International Workshop “Quantum Entanglement in | ||
- | Physical and Information Sciences” (December 14-18, 2004, Pisa, Italy). | + | Physical and Information Sciences” (December 14--18, 2004, Pisa, Italy). |
[ <a href="http://dx.doi.org/doi:10.1142/S021974990600189X">DOI</a> | | [ <a href="http://dx.doi.org/doi:10.1142/S021974990600189X">DOI</a> | | ||
<a href="http://arxiv.org/abs/quant-ph/0508197">arXiv</a> ] | <a href="http://arxiv.org/abs/quant-ph/0508197">arXiv</a> ] | ||
Line 556: | Line 574: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dr05">30</a>] | + | [<a name="dr05">31</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 570: | Line 588: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="dlr05">31</a>] | + | [<a name="dlr05">32</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 585: | Line 603: | ||
<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">33</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 602: | Line 620: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc05">33</a>] | + | [<a name="rc05">34</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 618: | Line 636: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="roland04">34</a>] | + | [<a name="roland04">35</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 632: | Line 650: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03b">35</a>] | + | [<a name="rc03b">36</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 647: | Line 665: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc03a">36</a>] | + | [<a name="rc03a">37</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 662: | Line 680: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="mprg02">37</a>] | + | [<a name="mprg02">38</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 677: | Line 695: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="rc02">38</a>] | + | [<a name="rc02">39</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Line 692: | Line 710: | ||
<tr valign="top"> | <tr valign="top"> | ||
<td align="right" class="bibtexnumber"> | <td align="right" class="bibtexnumber"> | ||
- | [<a name="hrb02">39</a>] | + | [<a name="hrb02">40</a>] |
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
Michel Hesse, Jérémie Roland, and Daniel Baye. | Michel Hesse, Jérémie Roland, and Daniel Baye. | ||
Solving the resonating-group equation on a Lagrange mesh. | Solving the resonating-group equation on a Lagrange mesh. | ||
- | <em>Nuclear Physics A</em>, 709:184-200, 2002. | + | <em>Nuclear Physics A</em>, 709:184--200, 2002. |
[ <a href="http://dx.doi.org/10.1016/S0375-9474(02)01040-0">DOI</a> ] | [ <a href="http://dx.doi.org/10.1016/S0375-9474(02)01040-0">DOI</a> ] | ||
</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.98.</em></p> | ||
- | <hr><p><em>This file was generated by | ||
- | <a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.97.</em></p> | ||