Differences

This shows you the differences between two versions of the page.

--- members:jroland [2020/07/03 15:50]
jroland [Publications]
+++ members:jroland [2020/08/27 15:07]
jroland [Publications]
@@ Line 87: / Line 87: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="BAKR20">1</a>]
+[<a name="CNR20a">1</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Leonardo Novo, and J&eacute;r&eacute;mie Roland.
+ Finding a marked node on any graph via continuous-time quantum walks.
+ <em>Phys. Rev. A</em>, 102:022227, 2020.
+[&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevA.102.022227">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1807.05957">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="CLR20a">2</a>]
+</td>
+<td class="bibtexitem">
+Shantanav Chakraborty, Kyle Luh, and J&eacute;r&eacute;mie Roland.
+ Analog quantum algorithms for the mixing of markov chains.
+ <em>Physical Review A</em>, 102:022423, 2020.
+[&nbsp;<a href="http://dx.doi.org/10.1103/PhysRevA.102.022423">DOI</a>&nbsp;|
+<a href="http://arxiv.org/abs/1904.11895">arXiv</a>&nbsp;]
+</td>
+</tr>
+<tr valign="top">
+<td align="right" class="bibtexnumber">
+[<a name="BAKR20">3</a>]
 </td>
 <td class="bibtexitem">
@@ Line 102: / Line 132: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="CNR20">2</a>]
+[<a name="CNR20b">4</a>]
 </td>
 <td class="bibtexitem">
@@ Line 116: / Line 146: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="CLR20">3</a>]
+[<a name="CLR20b">5</a>]
 </td>
 <td class="bibtexitem">
@@ Line 131: / Line 161: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ARV19">4</a>]
+[<a name="ARV19">6</a>]
 </td>
 <td class="bibtexitem">
@@ Line 146: / Line 176: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="CLR19">5</a>]
+[<a name="CJR19">7</a>]
-</td>
-<td class="bibtexitem">
-Shantanav Chakraborty, Kyle Luh, and J&eacute;r&eacute;mie Roland.
- On analog quantum algorithms for the mixing of markov chains.
- <em>arXiv e-prints</em>, arXiv:1904.11895, 2019.
-[&nbsp;<a href="http://arxiv.org/abs/1904.11895">arXiv</a>&nbsp;]
-</td>
-</tr>
-<tr valign="top">
-<td align="right" class="bibtexnumber">
-[<a name="CJR19">6</a>]
 </td>
 <td class="bibtexitem">
@@ Line 174: / Line 190: @@
 <tr valign="top">
 <td align="right" class="bibtexnumber">
-[<a name="ARW19">7</a>]
+[<a name="ARW19">8</a>]
 </td>
 <td class="bibtexitem">
@@ Line 183: / Line 199: @@
 [&nbsp;<a href="http://dx.doi.org/10.1145/3313276.3316306">DOI</a>&nbsp;|
 <a href="http://arxiv.org/abs/1811.02984">arXiv</a>&nbsp;]
-</td>
-</tr>
-<tr valign="top">
-<td align="right" class="bibtexnumber">
-[<a name="CNR18">8</a>]
-</td>
-<td class="bibtexitem">
-Shantanav Chakraborty, Leonardo Novo, and J&eacute;r&eacute;mie Roland.
- Finding a marked node on any graph by continuous time quantum walk.
- <em>arXiv e-prints</em>, arXiv:1807.05957, 2018.
-[&nbsp;<a href="http://arxiv.org/abs/1807.05957">arXiv</a>&nbsp;]
 </td>