Switch order of challenges

src/final_presentation/main.tex

@@ -302,8 +302,8 @@
         \item Quantum systems are inherently fragile
         \item Interacting with the quantum state disturbs it
         \item Idea: Represent $k\in \mathbb{N} $ \schlagwort{logical
-            qubits} using $n \in \mathbb{N},~n>k$ \schlagwort{physical qubits}
+            qubits} using $n \in \mathbb{N}$ \schlagwort{physical qubits},
-            \citereferencemanual{Rof19}
+            $n>k$ \citereferencemanual{Rof19}
 
             \vspace*{2mm}
 
@@ -1532,8 +1532,8 @@
         \item \schlagwort{Detector error model} (DEM) combines
             detector error matrix and noise model
             \visible<2->{
-            \item Tanner graph of detector error matrix of \ac{bb} code
+            \item Tanner graph of detector error matrix of bivariate
-                \citereferencemanual{KSW$^+$25}
+                bicycle (\acs{bb}) code \citereferencemanual{KSW$^+$25}
             }
     \end{itemize}
 
@@ -1549,21 +1549,25 @@
 
     \vspace*{-5mm}
 
-    \visible<3->{
+    \begin{itemize}
-        \begin{itemize}
+            \visible<2->{
             \item Challenges
-                \begin{itemize}
+            }
+            \begin{itemize}
+                    \visible<2->{
+                    \item Fault tolerance: Additional error locations \\
+                        $\implies$ \schlagwort{Increased decoding
+                        complexity} \citereferencemanual{GCR24}
+                    }
+                    \visible<3->{
                     \item Quantum setting: Degeneracy and short
                         cycles \\
                         $\implies$ \schlagwort{Degraded performance}
                         of belief propagation (BP)
                         \citereferencemanual{BBA$^+$15}
-                    \item Fault tolerance: Additional error locations \\
+                    }
-                        $\implies$ \schlagwort{Increased decoding
+            \end{itemize}
-                        complexity} \citereferencemanual{GCR24}
+    \end{itemize}
-                \end{itemize}
-        \end{itemize}
-    }
 
     \vspace*{8mm}
 
@@ -1572,9 +1576,8 @@
         S. Koutsioumpas et al., ``Automorphism ensemble decoding of
         quantum LDPC codes,'' \emph{arXiv:2503.01738}, 2025.
     }
-    {GCR24}{A. Gong, S. Cammerer, and J. M. Renes, ``Toward
+    {GCR24}{A. Gong et al., ``Toward low-latency iterative decoding
-        low-latency iterative decoding of qLDPC codes under
+        of qLDPC codes under circuit-level noise,'' arXiv:2403.18901, 2024.
-        circuit-level noise,'' arXiv:2403.18901, 2024.
     }
     {BBA$^+$15}{
         Z. Babar et al., ``Fifteen years of
@@ -1634,9 +1637,8 @@
 %     S. Huang and S. Puri, ``Improved noisy syndrome decoding of
 %     quantum LDPC codes with sliding window,'' \emph{arXiv:2311.03307}, 2023.
 % }
-% {GCR24}{A. Gong, S. Cammerer, and J. M. Renes, ``Toward
+% {GCR24}{A. Gong et al., ``Toward low-latency iterative decoding
-%     low-latency iterative decoding of qLDPC codes under
+%     of qLDPC codes under circuit-level noise,'' arXiv:2403.18901, 2024.
-%     circuit-level noise,'' arXiv:2403.18901, 2024.
 % }
 % {RWB$^+$20}{
 %     J. Roffe et al., ``Decoding across the quantum low-density
@@ -1734,9 +1736,8 @@
         S. Huang and S. Puri, ``Improved noisy syndrome decoding of
         quantum LDPC codes with sliding window,'' \emph{arXiv:2311.03307}, 2023.
     }
-    {GCR24}{A. Gong, S. Cammerer, and J. M. Renes, ``Toward
+    {GCR24}{A. Gong et al., ``Toward low-latency iterative decoding
-        low-latency iterative decoding of qLDPC codes under
+        of qLDPC codes under circuit-level noise,'' arXiv:2403.18901, 2024.
-        circuit-level noise,'' arXiv:2403.18901, 2024.
     }
     \stopreferencesmanual
 \end{frame}
@@ -2882,11 +2883,12 @@
         \vspace*{-10mm}
         \centering
         \begin{itemize}
-            \only<1>{\vspace*{10mm}}
+                \only<1>{\vspace*{10mm}}
             \item Most errors due to non-convergence
                 \vspace*{10mm}
                 \visible<2-> {
-                \item BPGD algorithm \citereferencemanual{YLH+24}
+                \item BP with guided decimation (BPGD)
+                    \citereferencemanual{YLH+24}
                     \begin{enumerate}
                         \item Perform $T$ \schlagwort{BP iterations}
                         \item Hard decision on \schlagwort{most
@@ -2906,12 +2908,12 @@
             \vspace*{-10mm}
 
             \begin{itemize}
-                \item $[[882, 24, 18 \le d \le 24]]$ - generalized
+                \item $\llbracket 882, 24, 18 \le d \le 24
-                    hypergraph product (GHP) code, \\
+                    \rrbracket$ generalized hypergraph product (GHP) code,
                     bit-flip noise \citereferencemanual{YLH+24}
             \end{itemize}
 
-            \vspace*{-5mm}
+            % \vspace*{-5mm}
 
             \begin{figure}[H]
                 \centering
@@ -2971,7 +2973,7 @@
         }
     \end{minipage}
 
-    \vspace*{2mm}
+    \vspace*{5mm}
 
     \addreferencesmanual
     {YLH+24}{Hanwen Yao et al. ``Belief propagation decoding of quantum
@@ -3329,7 +3331,7 @@
             \item Parameters
                 \begin{itemize}
                     \item $T = 1$
-                    \item $n_\text{iterations} = n$
+                    \item $n_\text{iterations} = 3{,}600$
                     \item $W = 5$
                 \end{itemize}
         \end{itemize}
@@ -3885,9 +3887,8 @@
     \vspace*{15mm}
 
     \addreferencesmanual
-    {GCR24}{A. Gong, S. Cammerer, and J. M. Renes, ``Toward
+    {GCR24}{A. Gong et al., ``Toward low-latency iterative decoding
-        low-latency iterative decoding of qLDPC codes under
+        of qLDPC codes under circuit-level noise,'' arXiv:2403.18901, 2024.
-        circuit-level noise,'' arXiv:2403.18901, 2024.
     }
     {MSL$^+$25}{
         S. Miao et al., ``Quaternary neural belief propagation
@@ -4107,9 +4108,8 @@
     \vspace*{30mm}
 
     \addreferencesmanual
-    {GCR24}{A. Gong, S. Cammerer, and J. M. Renes, ``Toward
+    {GCR24}{A. Gong et al., ``Toward low-latency iterative decoding
-        low-latency iterative decoding of qLDPC codes under
+        of qLDPC codes under circuit-level noise,'' arXiv:2403.18901, 2024.
-        circuit-level noise,'' arXiv:2403.18901, 2024.
     }
     \stopreferencesmanual
 \end{frame}
@@ -4170,9 +4170,8 @@
     \vspace*{5mm}
 
     \addreferencesmanual
-    {GCR24}{A. Gong, S. Cammerer, and J. M. Renes, ``Toward
+    {GCR24}{A. Gong et al., ``Toward low-latency iterative decoding
-        low-latency iterative decoding of qLDPC codes under
+        of qLDPC codes under circuit-level noise,'' arXiv:2403.18901, 2024.
-        circuit-level noise,'' arXiv:2403.18901, 2024.
     }
     \stopreferencesmanual
 \end{frame}

src/thesis/chapters/2_fundamentals.tex

@@ -643,6 +643,8 @@ output \cite[Sec.~3.2.2]{griffiths_introduction_1995}.
 Operators are useful to describe the relations between different
 quantities relating to a particle.
 An example of this is the differential operator $\partial x$.
+Two operators $P_1$ and $P_2$ are said to \emph{commute}, if $P_1P_2
+= P_2P_1$ and \emph{anti-commute} if $P_1P_2 = -P_2P_1$.
 
 %%%%%%%%%%%%%%%%
 \subsection{Observables}
@@ -871,7 +873,7 @@ Take for example the two qubits
 \end{align*}
 % TODO: Fix the fact that \psi is used above for the single-qubit
 % case and below for the multi-qubit case
-We examine the state $\ket{\psi}$ of the composite system as.
+We examine the state $\ket{\psi}$ of the composite system.
 Assuming the qubits are independent, this is a \emph{product state}
 $\ket{\psi} = \ket{\psi_1}\otimes\ket{\psi_2}$.
 When not ambiguous, we may omit the tensor product symbol or even write
@@ -893,6 +895,12 @@ We have
 \end{align}
 We call $\ket{x_0, \ldots, x_n}~, x_i \in \{0,1\}$ the
 \emph{computational basis states} \cite[Sec.~4.6]{nielsen_quantum_2010}.
+To additionally simplify set notation, we define
+\begin{align*}
+    \mathcal{M}^{\otimes n} := \underbrace{\mathcal{M}\otimes \ldots
+    \otimes \mathcal{M}}_{n \text{ times}}
+    .%
+\end{align*}
 
 % Entanglement
 
@@ -933,7 +941,7 @@ After examining the modelling of single- and multi-qubit systems,
 we now shift our focus to describing the evolution of their states.
 We model state changes as operators.
 Unlike classical systems, where there are only two possible states and
-thus the only possible state change is a bit-flip, a gerenal qubit
+thus the only possible state change is a bit-flip, a general qubit
 state as shown in \autoref{eq:gen_qubit_state} lives on a continuum of values.
 We thus technically also have an infinite number of possible state changes.
 Luckily, we can express any operator as a linear combination of the
@@ -968,12 +976,20 @@ Luckily, we can express any operator as a linear combination of the
         \hspace{2.75mm}\ket{1} \mapsto -j\ket{0} \hspace*{1mm}.
     \end{array}
 \end{align*}
+In fact, if we allow for complex coefficients, the $X$ and $Z$
+operators are sufficient to express any other operator as a linear
+combination \cite[Sec.~2.2]{roffe_quantum_2019}.
 $I$ is the identity operator and $X$ and $Z$ are referred to as
 \emph{bit-flips} and \emph{phase-flips} respectively.
-We also call these operators \emph{gates}.
+We call the set $\mathcal{G}_n = \left\{ \pm I,\pm jI, \pm X,\pm jX,
+\pm Y,\pm jY, \pm Z, \pm jZ \right\}^{\otimes n}$ the \emph{Pauli
+group} over $n$ qubits.
+
+In the context of modifying qubit states, we also call operators \emph{gates}.
 When working with multi-qubit systems, we can also apply Pauli gates
-to individual qubits independently, e.g., $I_1 X_2 I_3 Z_4 Y_5$.
+to individual qubits independently, which we write ask e.g., $I_1 X_2
-We often omit the identity operators, instead writing $X_2 Z_4 Y_5$.
+I_3 Z_4 Y_5$.
+We often omit the identity operators, instead writing, e.g., $X_2 Z_4 Y_5$.
 Other important operators include the \emph{Hadamard} and
 \emph{controlled-NOT (CNOT)} gates \cite[Sec.~1.3]{nielsen_quantum_2010}
 \vspace*{-7mm}
@@ -1010,20 +1026,51 @@ Other important operators include the \emph{Hadamard} and
 \noindent Many more operators relevant to quantum computing exist, but they are
 not covered here as they are not central to this work.
 
-\indent\red{[We only need to consider X and Z errors]
-\cite[Equation~8]{roffe_quantum_2019}} \\
-\indent\red{[Explain commuting/anticommuting property of operators]
-[Journal~p.~46]}
-
 %%%%%%%%%%%%%%%%
 \subsection{Quantum Circuits}
 \label{Quantum Circuits}
 
-\noindent\indent\red{[Controlled operations]
+% Intro
-\cite[Sec.~4.3]{nielsen_quantum_2010}} \\
+
-\indent\red{[In case this reference is needed: Measurements
+Using these quantum gates, we can construct \emph{circuits} to manipulate
-\cite[Sec.~4.4]{nielsen_quantum_2010}]} \\
+the states of qubits \cite[Sec.~1.3.4]{nielsen_quantum_2010}.
-\indent\red{[General circuit stuff] \cite[Sec.~1.3.4]{nielsen_quantum_2010}}
+Circuits are read from left to right and each horizontal wire
+represents a qubit whose state evolves as it passes through
+successive gates.
+
+% General notation
+
+A single line carries a quantum state, while a double line
+denotes a classical bit, typically used to carry the result of a measurement.
+A measurement is represented by a meter symbol.
+In general, gates are represented as labeled boxes placed on one or more wires.
+An exception is the CNOT gate, where the operation is represented as
+the symbol $\oplus$.
+
+% Controlled gates & example
+
+We can additionally add a control input to a gate.
+This conditions its application on the state of another qubit
+\cite[Sec.~4.3]{nielsen_quantum_2010}.
+The control connection is represented by a vertical line connecting
+the gate to the corresponding qubit, where a filled dot is placed.
+A controlled gate applies the respective operation only if the
+control qubit is in state $\ket{1}$.
+An example of this is the CNOT gate introduced in
+\autoref{subsec:Qubits and Multi-Qubit States}, which is depicted in
+\autoref{fig:cnot_circuit}.
+
+\begin{figure}[t]
+    \centering
+
+    \begin{quantikz}
+        \lstick{$\ket{\psi}_1$} & \ctrl{1} & \\
+        \lstick{$\ket{\psi}_2$} & \targ{}  & \\
+    \end{quantikz}
+
+    \caption{CNOT gate circuit.}
+    \label{fig:cnot_circuit}
+\end{figure}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{Quantum Error Correction}
@@ -1063,16 +1110,17 @@ three main restrictions apply \cite[Sec.~2.4]{roffe_quantum_2019}:
 % General idea (logical vs. physical gates) + notation
 
 Much like in classical error correction, in \ac{qec} information
-is protected by mapping it onto codewords in an expanded space,
+is protected by mapping it onto codewords in a higher-dimensional space,
 thereby introducing redundancy.
 To this end, $k \in \mathbb{N}$ \emph{logical qubits} are mapped onto
-$n \in \mathbb{N},~n>k$ \emph{physical qubits}.
+$n \in \mathbb{N}$ \emph{physical qubits}, $n>k$.
-We circumvent the no-cloning restriction by not copying the state of
+We circumvent the no-cloning restriction by not copying the state of any of
-the $k$ logical qubits, instead spreading it out over all $n$
+the $k$ logical qubits, instead spreading the total state out over all $n$
-physical ones \cite[Intro.]{calderbank_good_1996}
+physical ones \cite[Intro.]{calderbank_good_1996}.
-To differentiate a quantum codes from classical ones, we denote a
+To differentiate quantum codes from classical ones, we denote a
 code with parameters $k,n$ and minimum distance $d_\text{min}$ using
-double brackets, as $[[ n,k,d_\text{min} ]]$ \cite[Sec.~4]{roffe_quantum_2019}.
+double brackets, as $\llbracket n,k,d_\text{min} \rrbracket$
+\cite[Sec.~4]{roffe_quantum_2019}.
 
 %%%%%%%%%%%%%%%%
 \subsection{Stabilizer Measurements}
@@ -1261,8 +1309,10 @@ Formally, we define the \emph{stabilizer group} $\mathcal{S}$ as
     \mathcal{S} = \left\{P_i \in \mathcal{G}_n ~:~ P_i \ket{\psi}_\text{L} =
         (+1)\ket{\psi}_\text{L} \forall \ket{\psi}_\text{L} ~\cap~
     [P_i,P_j] = 0 \forall i,j\right\}
-    .%
+    ,%
 \end{align*}
+where $[P_i,P_j] := P_iP_j - P_j P_i$ is called the \emph{commutator}
+of $P_i$ and $P_j$.
 We care in particular about the commuting properties of stabilizers
 with respect to possible errors.
 The measurement circuit for an arbitrary stabilizer $P_i$ modifies
@@ -1388,25 +1438,8 @@ $Z$ operators and some with only $X$ operators.
             \end{itemize}
             \textbf{Content:}
             \begin{itemize}
-                \item  General context
-                    \begin{itemize}
-                        \item Why we need QEC (correcting errors due
-                            to noisy gates)
-                        \item Main challenges of QEC compared to classical
-                            error correction
-                        \item Logical vs physical states, logical vs
-                            physical operators
-                    \end{itemize}
                 \item Stabilizer codes
                     \begin{itemize}
-                        \item Definition of a stabilizer code
-                        \item The stabilizer its generators (note somewhere
-                                that the generators have to commute
-                                to be able to
-                            be measured without disturbing each other)
-                            (Why we need commutativity of the
-                                stabilizers [Journal,
-                            p.~51], [Got97, p.~6])
                         \item syndrome extraction circuit
                         \item Stabilizer codes are effectively the QM
                             % TODO: Actually binary linear codes or
@@ -1418,8 +1451,6 @@ $Z$ operators and some with only $X$ operators.
                             rather than working with the states directly
                             \cite[Sec.~10.5.1]{nielsen_quantum_2010}
                     \end{itemize}
-                \item Digitization of errors
-                \item CSS codes
                 \item Color codes?
                 \item Surface codes?
             \end{itemize}

src/thesis/main.tex

@@ -18,6 +18,8 @@
 %     sorting=nty,
 % ]{biblatex}
 \usepackage{todonotes}
+\usepackage{quantikz}
+\usepackage{stmaryrd}
 
 \usetikzlibrary{calc, positioning, arrows, fit}