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 [2019/08/19 13:00] jroland [Publications] |
members:jroland [2020/03/27 16:46] jroland [Short biography] |
||
---|---|---|---|
Line 85: | Line 85: | ||
<table> | <table> | ||
+ | |||
+ | |||
+ | <tr valign="top"> | ||
+ | <td align="right" class="bibtexnumber"> | ||
+ | [<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"> | <tr valign="top"> | ||
Line 91: | Line 107: | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Kyle Luh Shantanav Chakraborty and Jérémie Roland. | + | Shantanav Chakraborty, Kyle Luh and Jérémie Roland. |
On analog quantum algorithms for the mixing of markov chains. | On analog quantum algorithms for the mixing of markov chains. | ||
<em>arXiv e-prints</em>, arXiv:1904.11895, 2019. | <em>arXiv e-prints</em>, arXiv:1904.11895, 2019. | ||
Line 105: | Line 121: | ||
</td> | </td> | ||
<td class="bibtexitem"> | <td class="bibtexitem"> | ||
- | Gwenaël Joret Jean Cardinal and Jérémie Roland. | + | Jean Cardinal, Gwenaël Joret and Jérémie Roland. |
Information-theoretic lower bounds for quantum sorting. | Information-theoretic lower bounds for quantum sorting. | ||
<em>arXiv e-prints</em>, arXiv:1902.06473, 2019. | <em>arXiv e-prints</em>, arXiv:1902.06473, 2019. |