added DOI

qualtran/bloqs/comparison_gates.ipynb

@@ -1017,6 +1017,23 @@
     "\n",
     "The implementation above has a T complexity of exactly $4n$ since there are exactly $n$ And gates each uses $4$ Ts. Note however that the first of them is not needed since one of its inputs is in the $\\ket{1}$ state so it collapses to either identity or `cirq.X` depending on the most significant bit of $B$. This gives a T complexity of $4(n-1) = 4n - 4$."
    ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "## Citation\n",
+    "\n",
+    "```\n",
+    "@article{Noureldin_2023,\n",
+    "\tdoi = {10.5281/zenodo.8384491},\n",
+    "\turl = {https://doi.org/10.5281/zenodo.8384491},  \n",
+    "\tyear = 2023,\n",
+    "\tauthor = {Noureldin Yosri},  \n",
+    "\ttitle = {T Complexity Of Comparison Gates},\n",
+    "}\n",
+    "```"
+   ]
   }
  ],
  "metadata": {