Audit and remove overly long tooltips

learning/courses/basics-of-quantum-information/single-systems/classical-information.ipynb

@@ -25,14 +25,19 @@
    "source": [
     "# Classical information\n",
     "\n",
-    "To describe quantum information and how it works, we will begin with an overview of <DefinitionTooltip definition=\"The term classical refers to concepts, ideas, and descriptions based on physical theories (such as Newtonian physics) that predate the discovery of quantum theory. In the context of information, it can be interpreted as meaning not specifically connected to quantum information\">classical</DefinitionTooltip> information.\n",
+    "To describe quantum information and how it works, we will begin with an overview of classical information.\n",
+    "The term classical refers to concepts, ideas, and descriptions based on physical theories (such as Newtonian physics) that predate the discovery of quantum theory. In the context of information, it can be interpreted as meaning not specifically connected to quantum information.\n",
     "It is natural to wonder why so much attention is paid to classical information in a course on quantum information, but there are good reasons.\n",
     "\n",
     "For one, although quantum and classical information are different in some spectacular ways, their mathematical descriptions are actually quite similar.\n",
     "Classical information also serves as a familiar point of reference when studying quantum information, as well as a source of analogy that goes a surprisingly long way.\n",
     "It is common that people ask questions about quantum information that have natural classical analogs, and often those questions have simple answers that can provide both clarity and insight into the original questions about quantum information.\n",
     "Indeed, it is not at all unreasonable to claim that one cannot truly understand quantum information without understanding classical information.\n",
     "\n",
+    "<Admonition type=\"tip\">\n",
+    "In the context of information, \"classical\" can be interpreted as meaning not specifically connected to quantum information.\n",
+    "</Admonition>\n",
+    "\n",
     "Some readers may already be familiar with the material to be discussed in this section, while others may not — but the discussion is meant for both audiences.\n",
     "In addition to highlighting the aspects of classical information that are most relevant to an introduction to quantum information, this section introduces the *Dirac notation*, which is often used to describe vectors and matrices in quantum information and computation.\n",
     "As it turns out, the Dirac notation is not specific to quantum information; it can equally well be used in the context of classical information, as well as for many other settings in which vectors and matrices arise.\n",
@@ -395,7 +400,7 @@
     "\n",
     "One can check that this matrix does the correct thing by multiplying the two standard basis vectors by it.\n",
     "\n",
-    "For an arbitrary choice of a classical state set, we can describe the set of all probabilistic operations in mathematical terms as those that are represented by <DefinitionTooltip definition=\"Stochastic roughly means random. A stochastic matrix represents a random process.\">stochastic</DefinitionTooltip> matrices, which are matrices satisfying these two properties:\n",
+    "For an arbitrary choice of a classical state set, we can describe the set of all probabilistic operations in mathematical terms as those that are represented by <DefinitionTooltip definition=\"Stochastic roughly means random, and a stochastic matrix represents a random process.\">stochastic</DefinitionTooltip> matrices, which are matrices satisfying these two properties:\n",
     "\n",
     "1. All entries are nonnegative real numbers.\n",
     "2. The entries in every column sum to $1.$\n",

learning/courses/basics-of-quantum-information/single-systems/introduction.ipynb

@@ -17,7 +17,9 @@
     "\n",
     "<IBMVideo id=\"134056207\" title=\"In this video, John Watrous describes classical and quantum state vectors. He introduces some critical notation for quantum states and operators, including unitary matrices for operations on qubit systems.\"/>\n",
     "\n",
-    "This lesson introduces the basic framework of <DefinitionTooltip definition=\"Quantum information is both a concept and a framework for modeling and describing information in quantum systems. While it is based on and motivated by quantum physics, the physical details can largely be abstracted away, leaving a mathematical framework that is applicable to a variety of specific physical systems.\">quantum information</DefinitionTooltip>, including the description of quantum states as vectors with complex number entries, measurements that allow classical information to be extracted from quantum states, and operations on quantum states that are described by unitary matrices.\n",
+    "This lesson introduces the basic framework of quantum information, including the description of quantum states as vectors with complex number entries, measurements that allow classical information to be extracted from quantum states, and operations on quantum states that are described by unitary matrices.\n",
+    "Quantum information is both a concept and a framework for modeling and describing information in quantum systems.\n",
+    "While it is based on and motivated by quantum physics, the physical details can largely be abstracted away, leaving a mathematical framework that is applicable to a variety of specific physical systems.\n",
     "\n",
     "We will restrict our attention in this lesson to the comparatively simple setting in which a *single system* is considered in isolation.\n",
     "In the next lesson, we'll expand our view to *multiple systems,* which can interact with one another and be correlated."

learning/courses/fundamentals-of-quantum-algorithms/phase-estimation-and-factoring/introduction.ipynb

@@ -17,10 +17,13 @@
     "# Introduction\n",
     "\n",
     "In this lesson, we'll discuss the phase estimation problem and how to solve it with a quantum computer.\n",
-    "We'll then use this solution to obtain\n",
-    "<DefinitionTooltip definition=\"In addition to his integer factorization algorithm, Peter Shor also discovered an efficient quantum algorithm for the different but related problem of computing discrete logarithms. The two algorithms appeared in the same paper, first published as a conference paper in 1994 and then as a journal paper in 1997.\">Shor's algorithm</DefinitionTooltip> — an efficient quantum algorithm for the integer factorization problem.\n",
+    "We'll then use this solution to obtain Shor's algorithm — an efficient quantum algorithm for the integer factorization problem.\n",
     "Along the way, we'll encounter the quantum Fourier transform, and we'll see how it can be implemented efficiently by a quantum circuit.\n",
     "\n",
+    "<Admonition type=\"note\">\n",
+    "In addition to his integer factorization algorithm, Peter Shor also discovered an efficient quantum algorithm for the different but related problem of computing discrete logarithms. The two algorithms appeared in the same paper, first published as a conference paper in 1994 and then as a journal paper in 1997.\n",
+    "</Admonition>\n",
+    "\n",
     "## Lesson video\n",
     "\n",
     "In the following video, John Watrous steps you through the content in this lesson on quantum phase estimation. Alternatively, you can open the [YouTube video](https://youtu.be/4nT0BTUxhJY?list=PLOFEBzvs-VvqKKMXX4vbi4EB1uaErFMSO) for this lesson in a separate window. [Download the slides](https://ibm.box.com/public/static/jxase3mly99ui1n1fg8pvp6bzymbdgrh.pdf) for this lesson.\n",

learning/courses/fundamentals-of-quantum-algorithms/quantum-query-algorithms/query-model-of-computation.ipynb

@@ -27,9 +27,11 @@
     "\n",
     "In the *query model* of computation, the entire input is not provided to the computation like in a more standard model suggested above.\n",
     "Rather, the input is made available in the form of a *function*, which the computation accesses by making *queries*.\n",
-    "Alternatively, we may view computations in the query model as having\n",
-    "<DefinitionTooltip definition=\"Random access, also known as direct access, refers to the ability to look at elements at chosen positions within a sequence directly, without having to scan through the entire sequence to find them (which is called sequential access).\">random access</DefinitionTooltip>\n",
-    "to bits (or segments of bits) of the input.\n",
+    "Alternatively, we may view computations in the query model as having random access to bits (or segments of bits) of the input.\n",
+    "\n",
+    "<Admonition type=\"note\">\n",
+    "Random access, also known as direct access, refers to the ability to look at elements at chosen positions within a sequence directly, without having to scan through the entire sequence to find them (which is called sequential access).\n",
+    "</Admonition>\n",
     "\n",
     "![Illustration of a computation in the query model.](/learning/images/courses/fundamentals-of-quantum-algorithms/quantum-query-algorithms/query-computation.svg)\n",
     "\n",

learning/courses/general-formulation-of-quantum-information/quantum-channels/representations-of-channels.ipynb

@@ -29,12 +29,17 @@
     "In essence, the question being asked is: How can we do something analogous for channels?\n",
     "\n",
     "To answer this question, we'll require some additional mathematical machinery.\n",
-    "We'll see that channels can, in fact, be described mathematically in a few different ways, including representations named in honor of three individuals who played key roles in their development:\n",
-    "<DefinitionTooltip definition=\"William Forrest Stinespring (1929 – 2012) was a mathematician who specialized in operator theory, which is a topic in functional analysis having many interesting implications for quantum information.\">Stinespring,</DefinitionTooltip>\n",
-    "<DefinitionTooltip definition=\"Karl Kraus (1938 – 1988) was a theoretical physicist who specialized in the foundations of quantum mechanics. Much of the mathematical formalism discussed in this lesson was explained in his 1983 lecture notes (States, effects, and operations: fundamental notions of quantum theory).\" align=\"top-left\">Kraus,</DefinitionTooltip> and\n",
-    "<DefinitionTooltip definition=\"Man-Duen Choi is a Professor Emeritus at the University of Toronto who specializes in operator theory and matrix theory. His 1975 paper on completely positive maps provides a key mathematical tool for understanding channels.\" align=\"top-left\">Choi.</DefinitionTooltip>\n",
+    "We'll see that channels can, in fact, be described mathematically in a few different ways, including representations named in honor of three individuals who played key roles in their development: Stinespring, Kraus, and Choi.\n",
     "Together, these different ways of describing channels offer different angles from which they can be viewed and analyzed.\n",
     "\n",
+    "<Admonition type=\"note\">\n",
+    "William Forrest Stinespring (1929 – 2012) was a mathematician who specialized in operator theory, which is a topic in functional analysis having many interesting implications for quantum information.\n",
+    "\n",
+    "Karl Kraus (1938 – 1988) was a theoretical physicist who specialized in the foundations of quantum mechanics. Much of the mathematical formalism discussed in this lesson was explained in his 1983 lecture notes (States, effects, and operations: fundamental notions of quantum theory).\n",
+    "\n",
+    "Man-Duen Choi is a Professor Emeritus at the University of Toronto who specializes in operator theory and matrix theory. His 1975 paper on completely positive maps provides a key mathematical tool for understanding channels.\n",
+    "</Admonition>\n",
+    "\n",
     "## Stinespring representations\n",
     "\n",
     "Stinespring representations are based on the idea that every channel can be implemented in a standard way,\n",