From 350ed5401cd12679406f001ac63e924a5d8cb716 Mon Sep 17 00:00:00 2001
From: Nour Yosri <noureldinyosri@gmail.com>
Date: Wed, 27 Sep 2023 16:08:22 -0700
Subject: [PATCH] added DOI

---
 qualtran/bloqs/comparison_gates.ipynb | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)

diff --git a/qualtran/bloqs/comparison_gates.ipynb b/qualtran/bloqs/comparison_gates.ipynb
index 5d01743c9..3c4eb8102 100644
--- a/qualtran/bloqs/comparison_gates.ipynb
+++ b/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": {