biber chap0

preface.tex

@@ -1,24 +1,44 @@
 % preface.tex
 \documentclass[main.tex]{subfiles}
 
+\ifSubfilesClassLoaded{
+  \addbibresource{main.bib}
+}
+
 \begin{document}
 
 \chapter*{Preface}
 \addcontentsline{toc}{chapter}{Preface}
 
-\section*{Philosophy}
-This book is intentionally small and opinionated:
-\begin{itemize}
-  \item Each chapter is a self-contained unit you can compile on its own.
-  \item Definitions are prioritized over intuition when the two conflict.
-  \item Every theorem should have an explicit list of dependencies:
-    what results it uses, and what background it assumes.
-\end{itemize}
+Non-commutative probability theory is a branch of generalized probability theory that studies the probability of events in non-commutative algebras (e.g. the algebra of observables in quantum mechanics). In the 20th century, non-commutative probability theory has been applied to the study of quantum mechanics as the classical probability theory is not enough to describe quantum mechanics~\cite{kummer1998elements}.
+
+Recently, the concentration of measure phenomenon has been applied to the study of non-commutative probability theory. Basically, the non-trivial observation, citing from Gromov's work~\cite{MGomolovs}, states that an arbitrary 1-Lipschitz function $f:S^n\to \mathbb{R}$ concentrates near a single value $a_0\in \mathbb{R}$ as strongly as the distance function does. That is,
+
+$$
+\mu\{x\in S^n: |f(x)-a_0|\geq\epsilon\} < \kappa_n(\epsilon)\leq 2\exp\left(-\frac{(n-1)\epsilon^2}{2}\right)
+$$
+
+is applied to computing the probability that, given a bipartite system $A\otimes B$, assume $\dim(B)\geq \dim(A)\geq 3$, as the dimension of the smaller system $A$ increases, with very high probability, a random pure state $\sigma=|\psi\rangle\langle\psi|$ selected from $A\otimes B$ is almost as good as the maximally entangled state.
+
+Mathematically, that is:
+
+Let $\psi\in \mathcal{P}(A\otimes B)$ be a random pure state on $A\otimes B$.
+
+If we define $\beta=\frac{1}{\ln(2)}\frac{d_A}{d_B}$, then we have
+
+$$
+\operatorname{Pr}[H(\psi_A) < \log_2(d_A)-\alpha-\beta] \leq \exp\left(-\frac{1}{8\pi^2\ln(2)}\frac{(d_Ad_B-1)\alpha^2}{(\log_2(d_A))^2}\right)
+$$
+
+where $d_B\geq d_A\geq 3$~\cite{Hayden_2006}.
+
+In this report, we will show the process of my exploration of the concentration of measure phenomenon in the context of non-commutative probability theory. We assume the reader is an undergraduate student in mathematics and is familiar with the basic concepts of probability theory, measure theory, linear algebra, and some basic skills of mathematical analysis. To make the report more self-contained, we will add detailed annotated proofs that I understand and references for the original sources.
 
 \section*{How to use the dependency graph}
-Think of the graph below as a diagnostic tool.
-If something feels like a black box, locate the nearest node you don’t fully own yet,
-then check the suggested “symptoms” under that node.
+
+Since our topic integrates almost everything I've learned during undergraduate study, I will try to make some dependency graph for reader and for me to keep track of what are the necessary knowledge to understand part of the report.
+
+One can imagine the project as a big tree, where the root is in undergrad math and branches out to the topics of the report, including many advanced topics and motivation to study them.
 
 \bigskip
 
@@ -27,7 +47,7 @@ then check the suggested “symptoms” under that node.
 \centering
 \begin{tikzpicture}[
   node distance=10mm and 18mm,
-  box/.style={draw, rounded corners, align=center, inner sep=4pt},
+  box/.style={draw, rectangle, fill=white, align=center, inner sep=4pt},
   arrow/.style={-Latex}
 ]
 
@@ -40,22 +60,27 @@ then check the suggested “symptoms” under that node.
 \node[box, below=12mm of top] (quant) {Quantum Formalism\\(states, observables, partial trace)};
 
 \node[box, below=14mm of func, xshift=25mm] (book) {This Book\\(Chapters 1--n)};
+% draw arrows behind nodes
+\begin{scope}[on background layer]
+  \draw[arrow] (lin) -- (func);
+  \draw[arrow] (real) -- (func);
+  \draw[arrow] (prob) -- (func);
+  \draw[arrow] (func) -- (quant);
+  \draw[arrow] (lin) -- (quant);
+  \draw[arrow] (top) -- (quant);
 
-\draw[arrow] (lin) -- (func);
-\draw[arrow] (real) -- (func);
-\draw[arrow] (prob) -- (func);
-\draw[arrow] (func) -- (quant);
-\draw[arrow] (lin) -- (quant);
-\draw[arrow] (top) -- (quant);
-
-\draw[arrow] (func) -- (book);
-\draw[arrow] (quant) -- (book);
-\draw[arrow] (prob) -- (book);
+  \draw[arrow] (func) -- (book);
+  \draw[arrow] (quant) -- (book);
+  \draw[arrow] (prob) -- (book);
+\end{scope}
 
 \end{tikzpicture}
 \caption{Dependency tree: prerequisites and how they feed into the main text.}
 \label{fig:dependency-tree}
 \end{figure}
 
+\ifSubfilesClassLoaded{
+  \printbibliography[title={References}]
+}
 
 \end{document}