mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
zeekay
abf99d05fc
Restructured from flat .tex/.pdf files into per-paper subdirectories. Added Antje Worring as co-author on all papers. Synced PDFs to pdfs/ for download site.
40 lines
1.5 KiB
TeX
40 lines
1.5 KiB
TeX
\section{Introduction}
|
|
|
|
|
|
\subsection{Background}
|
|
|
|
Classical consensus protocols---PBFT, Tendermint, HotStuff,
|
|
Avalanche---operate entirely within the computational model of
|
|
classical Turing machines. Their security guarantees (BFT tolerance
|
|
of $f < n/3$, liveness under partial synchrony) are well understood.
|
|
However, as quantum computing hardware approaches fault-tolerant
|
|
scale, two questions arise:
|
|
|
|
\begin{enumerate}[nosep]
|
|
\item Can quantum computational primitives \emph{improve} consensus
|
|
performance (latency, throughput, or fault tolerance)?
|
|
\item Can a consensus protocol be designed such that its difficulty
|
|
adjustment is itself a quantum computation, enabling the network
|
|
to exploit quantum resources when available?
|
|
\end{enumerate}
|
|
|
|
The Quantum Consensus Protocol addresses both questions by using
|
|
Eisenstein series---objects from analytic number theory with natural
|
|
lattice structure---as the computational kernel of the consensus
|
|
mechanism.
|
|
|
|
\subsection{Goals}
|
|
|
|
\begin{itemize}[nosep]
|
|
\item A consensus protocol whose verification is classically efficient
|
|
but whose optimal \emph{proposal} computation benefits from
|
|
quantum speedup.
|
|
\item Difficulty adjustment via amplitude amplification (Grover's
|
|
algorithm~\cite{grover1996}), providing quadratic speedup for
|
|
parameter search.
|
|
\item Convergence guarantees derived from the analytic properties of
|
|
Eisenstein series.
|
|
\end{itemize}
|
|
|
|
%% ============================================================
|