Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Krylov Complexity as a Physical-Layer Eavesdropper Detector in Quantum Key Distribution: Theory, Simulation, and Experimental Validation

Daniel Süß

Published Mar 10, 2026• 0 citations
Publisher

Abstract

Version 2: Now includes Section 6 — Connection to the Loschmidt Echo. The Krylov detection score is formally equivalent to a time-averaged operator-space Loschmidt echo (Pearson r = 0.838–0.958, all p < 10⁻⁵, N = 20). The operator echo decays faster than the state-space echo, explaining the detector's superior sensitivity. This connects QKD security to the broader framework of quantum chaos diagnostics. Companion paper with full numerical details: DOI 10.5281/zenodo.18939996.

DOI
10.5281/zenodo.18938722

Related papers

The Krylov Eavesdropper Detector as an Operator-Space Loschmidt Echo

Daniel Süß

We establish a formal and numerical connection between the Krylov-based eavesdropper detector for quantum key distribution (QKD) and the Loschmidt echo. We introduce the operator-space Loschmidt echo M_op(t) and show analytically that the Krylov detection score is equivalent to the time-averaged operator echo. Numerical simulations on an 8-qubit Heisenberg chain with N=20 coupling strengths confirm this equivalence: gamma^2 vs. Lanczos distortion (r=0.958, p<1e-10), echo decay vs. Lanczos distortion (r=0.838, p<1e-5), and Krylov score vs. echo decay (r=0.850, p<1e-5). The operator-space echo decays faster than the state-space echo, explaining why the Krylov detector is more sensitive than state-based fidelity measures. These results connect the Krylov QKD framework to experimental Loschmidt echo platforms (NMR, ultracold atoms, superconducting qubits). Includes reproducible Python code and all numerical data.

•Mar 10, 2026•0 citations

Krylov complexity as a cryptographic resource: eavesdropper detection in quantum key distribution via operator-growth channel fingerprints

Daniel Süß

Abstract I present a physical-layer monitoring framework for quantum key distribution (QKD) implementations based on Krylov/operator-growth diagnostics. Running alongside standard parameter estimation, privacy amplification, and composable security proofs, it addresses a focused question: whether the temporal correlation structure of an observed quantum bit error rate (QBER) stream carries additional information about physical channel perturbations. Within a specified local-Hamiltonian channel model, the Lanczos coefficients of the channel Liouvillian define an operator-growth autocorrelation template, and deviations from it serve as anomaly scores for implementation monitoring. For the model studied here, the QBER autocorrelation relates to the operator autocorrelation through a proportionality relation, $C_{\mathrm{QBER}}(\tau )=\alpha (N)C_{\mathrm{op}}(\tau )$ C QBER ( τ ) = α ( N ) C op ( τ ) , with $\alpha (N)$ α ( N ) an explicitly specified calibration factor. Local Hamiltonian perturbations generically distort the associated Krylov fingerprint once the perturbation reaches the support of the monitored observable, consistent with the locality of the Lanczos recursion and with Lieb–Robinson bounds. The resulting three-layer pipeline combines adaptive frequency filtering, Krylov-template extraction, and calibrated slope detection. On simulated BB84-like QBER data with realistic hardware noise, the detector achieves high anomaly discrimination under the tested perturbation classes ( $\mathrm{AUC}=0.9899$ AUC = 0.9899 ). On $181{,}606$ 181 , 606 public QBER measurements from a deployed fiber-optic QKD system, it yields a 4.5% clean-test alarm rate against a 5% design target and detects injected perturbations with 96.0% sensitivity at $\Delta \mathrm{QBER}={+}0.5\%$ Δ QBER = + 0.5 % ( $\mathrm{AUC}=0.981$ AUC = 0.981 ). Certification of final key secrecy remains governed by the underlying QKD protocol, parameter estimation, finite-key analysis, and privacy amplification.

EPJ Quantum Technology•Jul 22, 2026•0 citations

Lieb-Robinson Bounds and Krylov Unforgeability: A Rigorous Framework

Süß Daniel

We develop a rigorous mathematical framework proving that the QKD Krylov Detector, a three-layer eavesdropper detection system for Quantum Key Distribution based on Krylov complexity and sidereal filtering, provides information-theoretically grounded security against physically realizable attacks. The central results are: (1) Krylov Locality Theorem: An eavesdropper coupling at distance d from the monitored operator cannot affect the first d Lanczos coefficients. This is an exact algebraic identity, not an approximation. (2) Perturbation Detectability Theorem: The first affected Lanczos coefficient scales as gamma^2, with computable upper and lower bound constants derived from second-order perturbation theory applied to the Lanczos recursion. (3) Information-Distortion Bound: Eve's accessible information (Holevo quantity) scales as O(gamma^2), while the Krylov distortion scales as O(gamma^4), yielding an explicit tradeoff chi <= const * sqrt(Delta_K). Verified numerically using an explicit Eve ancilla model. (4) Krylov Unforgeability Theorem: Any Hamiltonian perturbation that extracts nonzero information from the quantum channel necessarily distorts the Lanczos coefficients beyond the detection threshold. No physically realizable attack can simultaneously extract information and preserve the clean Krylov signature. (5) Coherent Attack Invariance: The Lanczos coefficients are operator-space quantities independent of any quantum state, rendering coherent and entangled attack strategies unable to circumvent detection. (6) Time-Dependent Unforgeability: Time-dependent coupling strategies gamma(t) produce strictly more distortion than constant coupling at the same average strength, by Jensen's inequality applied via a rigorous stroboscopic argument. All results include full proofs and numerical verification for chain lengths N = 6, 8, 10, 12. This work provides the formal security foundation for the QKD Krylov Detector framework developed across six prior publications. Companion code: https://github.com/quantumspiritresearch-crypto/qkd-krylov-detector

•Mar 9, 2026•0 citations

Krylov Complexity from Loschmidt Amplitude

Debarghya Chakraborty

Krylov complexity is a powerful diagnostic of quantum dynamics, with clear connections to other measures of quantum chaos and operator growth. One such measure is the Loschmidt amplitude, defined as the overlap of initially identical states evolved under two slightly different Hamiltonians. Its decay in certain systems is controlled by the classical Lyapunov exponent. Using the algebraic properties of the Krylov complexity operator, we express Krylov complexity as the derivative of a Loschmidt amplitude whose perturbation is parameterized by an angular variable $φ$. This formulation allows us to define a spectral propagator that encodes the entire complexity distribution, which we characterize for specific types of systems. We study the two-dimensional quantum geometry spanned by time and $φ$ where the original and deformed trajectories reside, demonstrating that Krylov complexity is upper-bounded by its volume. We also express the time derivative of Krylov complexity in terms of a distinct Loschmidt amplitude. Depending on the growth of the Lanczos coefficients, the perturbation term in this amplitude can be truncated. We propose that the strength of this perturbation provides a classification scheme for Krylov complexity dynamics and relate it to the $φ$-derivative of the spectral propagator. Using this analytical framework, we derive general relations between the time-dependence of the survival amplitude and Krylov space measures.

hep-thCross-listedarXiv:2607.10921•Jul 14, 2026•1 citation

QKD Eve Detector: A Research Collection on Eavesdropper Detection in Quantum Key Distribution

Daniel Süß

This collection presents three interconnected papers on eavesdropper (Eve) detection in Quantum Key Distribution (QKD) channels, following the chronological development of the framework. Part I Eve Detection in QKD via Dual-Layer Sidereal Filtering and Krylov Complexity Analysis (v4): The empirical starting point. Eve is modeled as a Hamiltonian perturbation at the kappa-coupling interface. Krylov-Statistical Mapping establishes a correlation between b_n deviation and QBER statistical moments (r=0.948, kurtosis; r=0.943, |skewness|) across 50 gamma values. Crossover spectral regime (⟨r⟩=0.366) explicitly documented. Part II: Distinguishing Quantum Scrambling from Eavesdropping via Krylov Temporal Structure and Sidereal Filtering (v2, with Robustness Analysis): The theoretical foundation. A Gaussian autocorrelation template C(t) = exp(−0.5·(slope·t)²) is derived from Krylov-Lanczos b_n coefficients. Under realistic hardware noise (AR(1) + 1/f + afterpulsing + bursts): AUC=0.9899, separation=12.13 sigma. Three methodological killer tests included. All results are simulation-based (N=8 crossover regime; not yet validated on real QKD hardware). Part III: QKD Eve Detector: A Unified Framework (Synthesis): The three-layer detector combining all prior work: (1) Dual-Layer Sidereal Filter for environmental noise removal, (2) Krylov Dynamic Detector for template matching, (3) Multi-Vector Attack Classifier distinguishing six attack types. Self-contained implementation provided in the accompanying demo notebook.Accompanying notebooks reproduce all figures and results. Dependencies: NumPy, SciPy, QuTiP. No special hardware required.

•Mar 5, 2026•0 citations

Quantum analogues of exponential sensitivity: from Loschmidt echo to Krylov complexity

Ignacio García-Mata, Diego A. Wisniacki

One of the fundamental manifestations of classical chaos is exponential sensitivity to initial conditions that is, two trajectories starting from nearly identical initial states diverge exponentially over time. This behavior is quantified by the Lyapunov exponents. Due to the unitary nature of quantum mechanics, such exponential divergence is elusive in quantum systems. As a result, several alternative quantities have been proposed and studied in recent years to capture analogous behavior. In this article, we present a pedagogical overview of three such quantities that have been the focus of intense research in recent years: the Loschmidt echo, out-of-time-order correlators (OTOCs), and Krylov complexity.

quant-pharXiv:2604.12707•Apr 15, 2026•0 citations
Version 2: Now includes Section 6 — Connection to the Loschmidt Echo. The Krylov detection score is formally equivalent to a time-averaged operator-space Loschmidt echo (Pearson r = 0.838–0.958, all p < 10⁻⁵, N = 20). The operator echo decays faster than the state-space echo, explaining the detector's superior sensitivity. This connects QKD security to the broader framework of quantum chaos diagnostics. Companion paper with full numerical details: DOI 10.5281/zenodo.18939996.
We establish a formal and numerical connection between the Krylov-based eavesdropper detector for quantum key distribution (QKD) and the Loschmidt echo. We introduce the operator-space Loschmidt echo M_op(t) and show analytically that the Krylov detection score is equivalent to the time-averaged operator echo. Numerical simulations on an 8-qubit Heisenberg chain with N=20 coupling strengths confirm this equivalence: gamma^2 vs. Lanczos distortion (r=0.958, p<1e-10), echo decay vs. Lanczos distortion (r=0.838, p<1e-5), and Krylov score vs. echo decay (r=0.850, p<1e-5). The operator-space echo decays faster than the state-space echo, explaining why the Krylov detector is more sensitive than state-based fidelity measures. These results connect the Krylov QKD framework to experimental Loschmidt echo platforms (NMR, ultracold atoms, superconducting qubits). Includes reproducible Python code and all numerical data.
Abstract I present a physical-layer monitoring framework for quantum key distribution (QKD) implementations based on Krylov/operator-growth diagnostics. Running alongside standard parameter estimation, privacy amplification, and composable security proofs, it addresses a focused question: whether the temporal correlation structure of an observed quantum bit error rate (QBER) stream carries additional information about physical channel perturbations. Within a specified local-Hamiltonian channel model, the Lanczos coefficients of the channel Liouvillian define an operator-growth autocorrelation template, and deviations from it serve as anomaly scores for implementation monitoring. For the model studied here, the QBER autocorrelation relates to the operator autocorrelation through a proportionality relation, CQBER(τ)=α(N)Cop(τ)C_{\mathrm{QBER}}(\tau )=\alpha (N)C_{\mathrm{op}}(\tau )CQBER​(τ)=α(N)Cop​(τ) C QBER ( τ ) = α ( N ) C op ( τ ) , with α(N)\alpha (N)α(N) α ( N ) an explicitly specified calibration factor. Local Hamiltonian perturbations generically distort the associated Krylov fingerprint once the perturbation reaches the support of the monitored observable, consistent with the locality of the Lanczos recursion and with Lieb–Robinson bounds. The resulting three-layer pipeline combines adaptive frequency filtering, Krylov-template extraction, and calibrated slope detection. On simulated BB84-like QBER data with realistic hardware noise, the detector achieves high anomaly discrimination under the tested perturbation classes ( AUC=0.9899\mathrm{AUC}=0.9899AUC=0.9899 AUC = 0.9899 ). On 181,606181{,}606181,606 181 , 606 public QBER measurements from a deployed fiber-optic QKD system, it yields a 4.5% clean-test alarm rate against a 5% design target and detects injected perturbations with 96.0% sensitivity at ΔQBER=+0.5%\Delta \mathrm{QBER}={+}0.5\%ΔQBER=+0.5% Δ QBER = + 0.5 % ( AUC=0.981\mathrm{AUC}=0.981AUC=0.981 AUC = 0.981 ). Certification of final key secrecy remains governed by the underlying QKD protocol, parameter estimation, finite-key analysis, and privacy amplification.
We develop a rigorous mathematical framework proving that the QKD Krylov Detector, a three-layer eavesdropper detection system for Quantum Key Distribution based on Krylov complexity and sidereal filtering, provides information-theoretically grounded security against physically realizable attacks. The central results are: (1) Krylov Locality Theorem: An eavesdropper coupling at distance d from the monitored operator cannot affect the first d Lanczos coefficients. This is an exact algebraic identity, not an approximation. (2) Perturbation Detectability Theorem: The first affected Lanczos coefficient scales as gamma^2, with computable upper and lower bound constants derived from second-order perturbation theory applied to the Lanczos recursion. (3) Information-Distortion Bound: Eve's accessible information (Holevo quantity) scales as O(gamma^2), while the Krylov distortion scales as O(gamma^4), yielding an explicit tradeoff chi <= const * sqrt(Delta_K). Verified numerically using an explicit Eve ancilla model. (4) Krylov Unforgeability Theorem: Any Hamiltonian perturbation that extracts nonzero information from the quantum channel necessarily distorts the Lanczos coefficients beyond the detection threshold. No physically realizable attack can simultaneously extract information and preserve the clean Krylov signature. (5) Coherent Attack Invariance: The Lanczos coefficients are operator-space quantities independent of any quantum state, rendering coherent and entangled attack strategies unable to circumvent detection. (6) Time-Dependent Unforgeability: Time-dependent coupling strategies gamma(t) produce strictly more distortion than constant coupling at the same average strength, by Jensen's inequality applied via a rigorous stroboscopic argument. All results include full proofs and numerical verification for chain lengths N = 6, 8, 10, 12. This work provides the formal security foundation for the QKD Krylov Detector framework developed across six prior publications. Companion code: https://github.com/quantumspiritresearch-crypto/qkd-krylov-detector
Krylov complexity is a powerful diagnostic of quantum dynamics, with clear connections to other measures of quantum chaos and operator growth. One such measure is the Loschmidt amplitude, defined as the overlap of initially identical states evolved under two slightly different Hamiltonians. Its decay in certain systems is controlled by the classical Lyapunov exponent. Using the algebraic properties of the Krylov complexity operator, we express Krylov complexity as the derivative of a Loschmidt amplitude whose perturbation is parameterized by an angular variable φφφ. This formulation allows us to define a spectral propagator that encodes the entire complexity distribution, which we characterize for specific types of systems. We study the two-dimensional quantum geometry spanned by time and φφφ where the original and deformed trajectories reside, demonstrating that Krylov complexity is upper-bounded by its volume. We also express the time derivative of Krylov complexity in terms of a distinct Loschmidt amplitude. Depending on the growth of the Lanczos coefficients, the perturbation term in this amplitude can be truncated. We propose that the strength of this perturbation provides a classification scheme for Krylov complexity dynamics and relate it to the φφφ-derivative of the spectral propagator. Using this analytical framework, we derive general relations between the time-dependence of the survival amplitude and Krylov space measures.
This collection presents three interconnected papers on eavesdropper (Eve) detection in Quantum Key Distribution (QKD) channels, following the chronological development of the framework. Part I Eve Detection in QKD via Dual-Layer Sidereal Filtering and Krylov Complexity Analysis (v4): The empirical starting point. Eve is modeled as a Hamiltonian perturbation at the kappa-coupling interface. Krylov-Statistical Mapping establishes a correlation between b_n deviation and QBER statistical moments (r=0.948, kurtosis; r=0.943, |skewness|) across 50 gamma values. Crossover spectral regime (⟨r⟩=0.366) explicitly documented. Part II: Distinguishing Quantum Scrambling from Eavesdropping via Krylov Temporal Structure and Sidereal Filtering (v2, with Robustness Analysis): The theoretical foundation. A Gaussian autocorrelation template C(t) = exp(−0.5·(slope·t)²) is derived from Krylov-Lanczos b_n coefficients. Under realistic hardware noise (AR(1) + 1/f + afterpulsing + bursts): AUC=0.9899, separation=12.13 sigma. Three methodological killer tests included. All results are simulation-based (N=8 crossover regime; not yet validated on real QKD hardware). Part III: QKD Eve Detector: A Unified Framework (Synthesis): The three-layer detector combining all prior work: (1) Dual-Layer Sidereal Filter for environmental noise removal, (2) Krylov Dynamic Detector for template matching, (3) Multi-Vector Attack Classifier distinguishing six attack types. Self-contained implementation provided in the accompanying demo notebook.Accompanying notebooks reproduce all figures and results. Dependencies: NumPy, SciPy, QuTiP. No special hardware required.
One of the fundamental manifestations of classical chaos is exponential sensitivity to initial conditions that is, two trajectories starting from nearly identical initial states diverge exponentially over time. This behavior is quantified by the Lyapunov exponents. Due to the unitary nature of quantum mechanics, such exponential divergence is elusive in quantum systems. As a result, several alternative quantities have been proposed and studied in recent years to capture analogous behavior. In this article, we present a pedagogical overview of three such quantities that have been the focus of intense research in recent years: the Loschmidt echo, out-of-time-order correlators (OTOCs), and Krylov complexity.