Odd-numbered posters are presented in this session.
- Effective discrete-modulated CVQKD under general attacksMariana Navarro; Antonio Acín; Carlos Pascual[abstract]Abstract: Continuous variable quantum key distribution via discrete modulations (DM CVQKD) ensures information-theoretic security using standard telecom technologies, providing affordable and scalable quantum communications with simplified classical postprocessing. However, existing security proofs against general attacks often rely on restrictive assumptions, such as a bounded dimension for coherent states, or require impractically large block sizes. In this work, we develop a finite-size security analysis that removes these limitations while incorporating realistic experimental features. Our approach combines the dimension reduction technique, a security proof based on the marginal-constrained entropy accumulation, and a trusted detector model accounting for the receiver imperfections. We report positive key rates in the finite-size regime for relevant block sizes of the order of 10^8. These results contribute to narrowing the gap between theoretical security proofs and practical implementations of DM CVQKD systems.
- A complexity theory for non-local quantum computationAndreas Bluhm; Simon Höfer; Alex May; Mikka Stasiuk; Philip Verduyn Lunel; Henry Yuen[abstract]Abstract: Non-local quantum computation (NLQC) replaces a local interaction between two systems with a single round of communication and shared entanglement. Despite many partial results, it is known that a characterization of entanglement cost in at least certain NLQC tasks would imply significant breakthroughs in complexity theory. Here, we avoid these obstructions and take an indirect approach to understanding resource requirements in NLQC, which mimics the approach used by complexity theorists: we study the relative hardness of different NLQC tasks by identifying resource efficient reductions between them. Most significantly, we prove that $f$-measure and $f$-route, the two best studied NLQC tasks, are in fact equivalent under $O(1)$ overhead reductions. This result simplifies many existing proofs in the literature and extends several new properties to $f$-measure. For instance, we obtain sub-exponential upper bounds on $f$-measure for all functions, and efficient protocols for functions in the complexity class $\mathsf{Mod}_k\mathsf{L}$. Beyond this, we study a number of other examples of NLQC tasks and their relationships.
- Finite-size quantum key distribution rates from Rényi entropies using conic optimizationMariana Navarro; Andrés González Lorente; Pablo V. Parellada; Carlos Pascual-García; Mateus Araújo[abstract]Abstract: Finite-size general security proofs for quantum key distribution based on Rényi entropies have recently been introduced. These approaches are more flexible and provide tighter bounds on the secret key rate than traditional formulations based on the von Neumann entropy. However, deploying them requires minimizing the conditional Rényi entropy, a difficult optimization problem that has hitherto been tackled using ad-hoc techniques based on the Frank-Wolfe algorithm, which are unstable and can only handle particular cases. In this work, we introduce a method based on non-symmetric conic optimization for solving this problem. Our technique is fast, reliable, and completely general. We illustrate its performance on several protocols, whose results represent an improvement over the state of the art.
- Exact Non-Identity Check and Gate-Teleportation-Based Indistinguishability Obfuscation at Low T-DepthJoshua Nevin[abstract]Abstract: In 2021, Broadbent and Kazmi developed a gate-teleportation-based protocol for computational indistinguishability obfuscation of quantum circuits. This protocol is efficient for Clifford+T circuits with logarithmically many T-gates, where the limiting factor in the efficiency of the protocol is the difficulty, on input a quantum circuit C, of the classical task of producing a description of the unitary obtained by conjugating a Pauli P (corresponding to a Bell-measurement outcome) by C, where this description only depends on the input-output functionality of the conjugate of P by C. The task above, in turn, is at least as hard as the problem of determining whether two n-qubit quantum circuits are perfectly equivalent up to global phase (Exact Non-Identity Check, ENIC), which is known to be NQP-complete (Tanaka, 2010). Motivated by this, we consider in this work what happens when we pass from low T-count to low T-depth. We show that, for Clifford+T-circuits of T-depth O(log(n)), deciding ENIC remains NP-hard. In particular, we show this by relating certain decision problems on Pauli coefficients of Clifford+T unitaries to well-known hardness results for codeword weights in binary linear codes. This effectively rules out the possibility, for Clifford+T-circuits of logarithmic T-depth, of either efficient ENIC or efficient gate-teleportation-based computational indistinguishability obfuscation, unless P = NP.
- Randomness from causally independent processesMartin Sandfuchs; Carla Ferradini; Renato Renner[abstract]Abstract: We consider a pair of causally independent processes, modelled as the tensor product of two channels, acting on a possibly correlated input to produce random outputs X and Y. We show that, assuming the processes produce a sufficient amount of randomness, one can extract uniform randomness from X and Y. This generalizes prior results, which assumed that X and Y are (conditionally) independent. Note that in contrast to the independence of quantum states, the independence of channels can be enforced through spacelike separation. As a consequence, our results allow for the generation of randomness under more practical and physically justifiable assumptions than previously possible. We illustrate this with the example of device-independent randomness amplification, where we can remove the constraint that the adversary only has access to classical side information about the source.
- Interactive proofs with efficient quantum prover for oracle problemsSamuel Ducharme[abstract]Abstract: There are many known oracle problems that provably separate BPP and BQP. There are also many kinds of interactive proof systems that have been developed over the last twenty years to make quantum computations done by a BQP machine verifiable by a BPP machine. Sadly, none of these techniques trivially relativize to oracle problems. This leads us to the following question: do these oracle problems also admit an interactive proof between a BQP prover and a BPP verifier, or is the existence of such interactive proof provably impossible? We show that Simon's problem and the Forrelation problem, two of the very few known oracle problems for which the previous question was still unanswered, do admit interactive proofs, under the assumption that the verifier has small and limited quantum capabilities. To do so, we introduce the first ever known interactive proofs with a BQP prover for these problems, as well as their corresponding proofs of security (completeness and soundness).
- Finite-Key Security of Passive-Measurement Decoy-State BB84 ProtocolAkihiro Mizutani; Shun Kawakami; Go Kato[abstract]Abstract: The decoy-state Bennett–Brassard 1984 (BB84) quantum key distribution (QKD) protocol is widely regarded as the de facto standard for practical implementations. On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators and eliminates the need for optical modulators. Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking. In this work, we present a simple analytical finite-key security proof for this setting, yielding a closed-form secret-key rate formula that can be directly evaluated using experimentally accessible parameters. Numerical simulations show that the key rates of passive- and active-measurement implementations are nearly identical, indicating that passive measurement does not compromise key-generation efficiency in practical QKD systems.
- Security Proof of a Novel Authentication Scheme for Quantum Key DistributionClaudia De Lazzari; Francesco Stocco; Edoardo Signorini; Giacomo Fregona; Fernando Chirici; Damiano Giani; Tommaso Occhipinti; Guglielmo Morgari; Alessandro Zavatta; Davide Bacco[abstract]Abstract: Quantum Key Distribution (QKD) protocols require Information‑Theoretically Secure (ITS) authentication of the classical channel to preserve the unconditional security of the distilled key. Standard ITS schemes are based on one-time keys: once a key is used to authenticate a message, it must be discarded. Since QKD requires mutual authentication, two independent one-time keys are typically consumed per round, imposing a non-trivial overhead on the net security key rate. In this work, we present the \emph{authentication-with-response} scheme, a novel ITS authentication scheme based on $\varepsilon$-Almost Strongly Universal\textsubscript{2} ($\varepsilon$-ASU\textsubscript{2}) functions, whose IT security can be established in the Universal Composability (UC) framework. The scheme achieves mutual authentication consuming a single one-time key per QKD round, halving key consumption compared to the state-of-the-art.
- From the Promise of Quantum Security to Operational Network Security RealityHedwig Koerfgen; Mario Camilo Pardo[abstract]Abstract: Quantum Key Distribution (QKD) networks form a multi-layer cyber-physical infrastructure in which quantum-optical systems interact with classical devices, creating security dependencies that are not captured by protocol-level analyses. We present a structured approach for systematic security engineering of QKD networks that introduces stakeholder-centered risk views linked to established cybersecurity methods. Applied to a metropolitan QKD network, the framework connects quantum security assumptions with threat analysis, and supports practical security assessments for network operators.
- Noise‑Robust O‑Band Quantum Key Distribution at 1295.56 nm for Coexistence in WDM NetworksJavier Núñez-Bon; Alberto Boaron; Damien Stucki; Boris Korzh; Rob Thew; Gianluca Boso[abstract]Abstract: Integrating Quantum Key Distribution (QKD) into optical metropolitan networks is a crucial step toward bringing quantum technologies into existing telecommunication fiber infrastructures. However, current state-of-the-art solutions still face major challenges, including their sensitivity to classical noise, especially spontaneous Raman scattering, limited transmission distances, and performance degradation under heterogeneous network conditions. In this work, we present a new QKD system operating in the O-band at 1295.56 nm, where the effect of the main noise sources is significantly reduced. Combined with narrow spectral filtering at the receiver, without the need for active temperature control, the system shows strong robustness across a wide range of dense wavelength division multiplexing scenarios, making it a practical option for real-world deployment. We validate its performance through extensive testing and demonstrate stable key generation while coexisting with different classical traffic conditions, with total launch powers of up to 17 dBm. These results represent an important step forward for the integration of QKD into existing fiber networks, supporting the path toward secure quantum communications at scale.
- Implementation and Validation of a Quantum-Secure Metropolitan Network in Real-World ScenarioClaudia De Lazzari; Nicola Biagi; Damiano Giani; Marco Russo; Fernando Chirici; Francesco Stocco; Saverio Francesconi; Giacomo Ferranti; Alessandro Soureal; Antonella Sanguineti; Bartolomeo Montrucchio; Christian Laurenzi; Oliviero Testa; Guglielmo Morgari; Antonio Manzalini; Tommaso Occhipinti; Alessandro Zavatta; Davide Bacco[abstract]Abstract: The advent of cryptographically relevant quantum computers poses an existential threat to classical public-key infrastructure. Quantum Key Distribution (QKD) addresses this challenge by providing information-theoretic security for key establishment, independently of any computational hardness assumption. In this work, the deployment and experimental validation of a metropolitan-scale quantum-secure network between data centers in Milan is reported. The network operates over installed fiber infrastructure and implements a layered architecture integrating QKD hardware, standards-compliant Key Management (KM), and centralized Software-Defined Networking (SDN) orchestration. Dynamic path reconfiguration via active optical switching and trusted-node routing allow automated fail-over solutions. Application-layer validation across diverse protocols and workloads confirms the seamless interoperability of all system components. These results establish the technical and operational readiness of metropolitan QKD networks for production deployment, and offer a replicable blueprint for building quantum-secure communication infrastructure at metropolitan scale.
- Mind the gap: Settings of Measurement-Based Delegated Quantum ComputingFabian Wiesner; Jens Eisert; Anna Pappa[abstract]Abstract: Delegated quantum computing (DQC) allows clients with low quantum capabilities to outsource computations to a server hosting a quantum computer. This process is often envisioned within the measurement-based quantum computing framework, as it naturally facilitates blindness of inputs and computation. Hence, the overall process of setting up and conducting the computation encompasses a sequence of three stages: preparing the qubits, entangling the qubits to obtain the resource state, and measuring the qubits to run the computation. There are two primary approaches to distributing these stages between the client and the server that impose different constraints on cryptographic techniques and experimental implementations. In the prepare-and-send setting, the client prepares the qubits and sends them to the server, whereas in the receive-and-measure setting, the client receives the qubits from the server and measures them. Although these settings have been extensively studied independently, their interrelation and whether setting-dependent theoretical constraints are inevitable remain unclear. By implementing the key components of most DQC protocols in the respective missing setting, we provide a method to build prospective protocols in both settings simultaneously and to translate existing protocols from one setting into the other. Our results suggest an equivalence that aligns with a heuristic translation between the two settings, replacing measurements with preparations and vise versa. We further investigate this intuition by introducing an equivalence definition that requires an equivalence of secure constructions, i.e., if one protocol implements an ideal resource, an equivalent protocol implements this ideal resource with the same security. Hence, our definition of equivalence is meaningful for composable security and allows for formalizing the suspected equivalence between settings: Every protocol in one setting should have an equivalent counterpart in the other setting. We find that despite the strong indication, the settings are, in fact, inequivalent. In order to derive this inequivalence, we introduce an axiomatic formulation of composable cryptography and prove theoretical results of independent interest.
- Measurement-Device-Independent Bit Commitment with Realistic Photon SourcesJuliette van Mil; Timothé Bramas; Kaushik Senthoor; Jérémy Ribeiro; Stephanie Wehner[abstract]Abstract: Bit commitment is a fundamental primitive of secure two-party computation. While unconditional quantum security remains impossible without additional assumptions, the noisy-storage model offers a path forward by assuming limited adversarial quantum memory. Existing protocols in the noisy-storage model have addressed realistic photon sources. However, Measurement-Device-Independence (MDI), a powerful technique developed primarily for Quantum Key Distribution to eliminate vulnerabilities from untrusted measurement devices, has not yet been applied to bit commitment. In this work, we introduce MDI protocols for Randomised String Commitment (RSC) in the noisy-storage model and analyse their security with both ideal single-photon sources and practical photon sources. Our first protocol handles multiphoton emissions from weak coherent pulse sources using decoy-state techniques. We demonstrate that positive secure committed string rates are achievable in the asymptotic limit despite source imperfections. Our second protocol takes a fundamentally different approach, drawing inspiration from Twin-Field Quantum Key Distribution: both parties send phase-modulated coherent pulses to a central station performing single-photon interference. Showing that this protocol achieves positive committed string rates is part of ongoing work. Our work brings MDI bit commitment closer to experimental realisation and opens a new design direction by leveraging the toolbox developed for twin-field protocols.
- New Quantum Internet Applications via Verifiable One-Time ProgramsLev Stambler[abstract]Abstract: We introduce Verifiable One-Time Programs (VOTPs) and use them to construct single-round Open Secure Computation (OSC), a novel primitive enabling applications like (1) single-round sealed-bid auctions, (2) single-round and honest-majority atomic proposes---a building block of consensus protocols, (3) fair-exchange, and (4) single-round differentially private statistical aggregation without pre-registration. The underlying quantum requirement is minimal: only single-qubit states are needed alongside a hardware assumption on the receiver's quantum resources. However, our construction relies on advanced classical primitives (multi-key FHE, NIZKs), making classical computational overhead the primary barrier to practice. Our work therefore provides a new framework for quantum-assisted cryptography that may be implementable with near-term quantum technology.
- Wavelength-Division Multiplexing of Independent CV- and DV-QKD Systems over Shared Fiber and Daylight Free-Space LinksMattia Sabatini; Edoardo Rossi; Matías R. Bolaños; Francesco Vedovato; Thomas Liege; Eleni Diamanti; Giuseppe Vallone; Paolo Villoresi; Yoann Piétri; Marco Avesani[abstract]Abstract: We report, to the best of our knowledge, the first experimental demonstration of wavelength-division multiplexing between independent continuous-variable (CV) and discrete-variable (DV) quantum key distribution (QKD) systems operating simultaneously on the same optical link. We validate coexistence over a fiber and a daylight free-space channel, benchmarking the Secret Key Rate (SKR) versus channel attenuation while both systems operate simultaneously. We observe the expected CV-DV complementarity, with CV-QKD providing higher SKR at low loss and DV-QKD becoming advantageous in the high-loss regime. In free-space daylight, both systems sustain Mbit/s key rates under atmospheric fluctuations. In all scenarios analyzed, simultaneous operation introduces negligible multiplexing-induced penalty. These results provide a validation of hybrid CV-DV architectures for heterogeneous quantum communication infrastructures, where high-throughput metropolitan users and long-reach links can be simultaneously served on the same physical channel.
- Optimal key rates for quantum key distribution with partial source characterizationMargarida Pereira; Guillermo Currás-Lorenzo; Mateus Araújo[abstract]Abstract: Numerical security proofs based on conic optimization are known to deliver optimal secret-key rates, but so far they have mostly assumed that the emitted states are fully characterized. In practice, this assumption is unrealistic, since real devices inevitably suffer from imperfections and side channels that are extremely difficult to model in detail. Here, we extend conic-optimization methods to scenarios where only partial information about the emitted states is known, covering both prepare-and-measure and measurement-device-independent protocols. We demonstrate that our method outperforms state-of-the-art analytical and numerical approaches under realistic source imperfections, especially for protocols that use non-qubit encodings. These results advance numerical-based proofs towards a standard, implementation-ready framework for evaluating quantum key distribution protocols in the presence of source imperfections.
- Simple Semi-Device-Independent Randomness Generation Based on Photon-Number ConstraintsTommaso Bertapelle; Mattia Sabatini; Andrea Peri; Yoann Piétri; Matías R. Bolanos; Giuseppe Vallone; Paolo Villoresi; Marco Avesani; Carles Roch i Carceller; Armin Tavakoli[abstract]Abstract: Quantum Random Number Generators (QRNGs) are essential components for modern cryptography, as they are a practical source of true randomness, without which the security of such protocols cannot be guaranteed. Among the proposed schemes, Semi-Device-Independent QRNGs (SDI-QRNGs) based on photon-number constraints offer an appealing balance of security, speed, and experimental simplicity, but demonstrations have so far focused mainly on binary encoding and conditional min‑entropy certification. In this work, we report the first experimental implementation of a Continuous‑Variable SDI‑QRNG in a prepare‑and‑measure configuration building on the SDP‑based (Semi-Definite Programming) framework of Ref.~\cite{carceller2025}. This approach allows us to directly lower‑bound the conditional Shannon entropy, employ more complex modulation formats, and apply entropy‑accumulation techniques beyond the i.i.d. assumption. The experiment combines a low-loss integrated photonic heterodyne receiver with a simple transmitter built from commercial components, generating coherent‑state Quadrature-Phase-Shift-Keying (QPSK) modulation, to preserve experimental practicality while enabling high‑speed operation.
- Eavesdropper-Blind Remote State Preparation and Applications to Quantum Public-Key EncryptionKaniuar Bacho; Alexandru Cojocaru; Tomoyuki Morimae[abstract]Abstract: Remote state preparation (RSP) is a central primitive in quantum cryptography, enabling classical parties to remotely construct quantum states using only classical communication. As a result, RSP serves as a key building block in numerous protocols involving classical clients and quantum servers, allowing classical parties to leverage the advantages offered by powerful quantum computers. All known constructions of RSP rely on strong cryptographic assumptions, typically variants of trapdoor claw-free functions (TCFs). In this work, we initiate the study of a weaker form of remote state preparation, which we call eavesdropper-blind remote state preparation (EB-RSP). Informally, EB-RSP requires blindness only against external observers who see the transcript of the honest protocol, rather than against the quantum server itself. Despite this relaxed adversarial model, the resulting notion remains sufficient for useful cryptographic applications. In particular, we show that two-message EB-RSP already suffices to construct quantum public-key encryption with classical public keys and quantum ciphertexts. We then construct two-message EB-RSP protocols from specific one-way group actions, yielding a first step toward RSP-type primitives based on assumptions that do not rely on trapdoors. Finally, we observe that existing RSP constructions are likely naturally adaptable to the two-message EB-RSP notion; we demonstrate this explicitly for a concrete TCF-based RSP construction.
- Advantage Distillation with Repetition Codes in Decoy-State Quantum Key DistributionJonas Treplin; Philipp Kleinpaß; Davide Orsucci[abstract]Abstract: Advantage Distillation (AD) is a classical post-processing technique that enhances Quantum Key Distribution (QKD) protocols by increasing the maximum acceptable Quantum Bit Error Rate (QBER) and thus extending the distance at which QKD links can be securely established. AD operates by post-selecting blocks of bits and extracting fewer high-fidelity bits, exhibiting a reduced QBER and thus lowering the amount of information that has to be disclosed during the information reconciliation step. In this work we present the first comprehensive finite key-size analysis of decoy-state BB84 enhanced via AD post-processing. We demonstrate that through the use of AD the maximum acceptable QBER increases from around 9.5% to around 17.3% for realistic key sizes. This result shows that substantial performance enhancements can be achieved in scenarios which are constrained by the maximum tolerable QBER via improvements of the post-processing method alone.
- Noise-Robustness for Delegated Quantum Computation in the Circuit ModelJoshua Nevin; Anne Broadbent[abstract]Abstract: Cloud-based quantum computing, coupled with the rapid progress in quantum algorithms, brings to the forefront the question of verifiability in delegated quantum computations. In the current landscape of noisy quantum devices, this question must be addressed alongside noise tolerance. In this work, we revisit the circuit-based framework for verifiable quantum computation introduced by Broadbent [Theory of Computing, 2018], and extend it to the setting of server-side noise. Our contribution is an improved upper bound on the noise-tolerance threshold, achieved through a protocol that interleaves computation and test rounds in an indistinguishable manner. This structure enables a concise security proof against arbitrary deviations by the server, while ensuring robustness to realistic noise.
- An SDP formulation for the device-dependent guessing probabilityRaffaele D'Avino; Aurora Mugnai; Miguel Navascues; Antonio Acín; Gabriel Senno[abstract]Abstract: In a previous work [Senno et al., Phys. Rev. Lett. 131, 130202 (2023)], we provided a framework to quantify the amount of intrinsic randomness produced by characterized but untrusted prepare-and-measure (P\&M) setups. While the cases of pure state preparations or extremal measurements were shown to be defined by semidefinite programs (SDPs), up until now we were missing computational methods for the general scenario of mixed states and nonextremal measurements. In this work, we present a hierarchy of SDP relaxations to lower bound the device-dependent conditional min-entropy. Benchmarking against known special cases, we find that the first level of the hierarchy already attains the optimal value. We then provide two applications. First, for setups affected by global depolarizing noise, we compute a matching lower bound to the analytical attack derived in [Curran et al., arXiv:2506.22294 (2025)], thus showing its optimality. Finally, we show that restricting the correlations between the P\&M boxes to be classical strictly decreases an adversary's predictive power, already in the most elementary setup of a qubit binary measurement.
- Decoy-state optical quantum information processing with coherent statesWenyuan Wang; H.F. Chau[abstract]Abstract: Photons play an important role in quantum information processing as they are easy to manipulate locally and transfer over a long distance. Photonic qubits are widely used in tasks such as linear optical quantum computing (LOQC), quantum sensing/metrology, and quantum communication. However, to date, efficient high-speed single photon sources are still difficult to make. Here we propose that we can use "classical" phase-randomized coherent states, combined with post-processing, to perform various quantum information processing tasks. Specifically, we divide the tasks into two scenarios: ones with a circuit of a known Hilbert space dimension, describable by a unitary matrix, such as LOQC and metrology, as well as ones with an unknown channel, such as quantum communication. We propose methods that can hugely improve the numerical precision and applicable dimensions in both scenarios, including a machine learning method for the former and a linear interpolation method for the latter, opening up a wide variety of applications that can be implemented with easily attainable coherent light sources and threshold detectors, such as linear optical quantum computing, quantum metrology, or state preparation for quantum communications.
- Experimental realizations of advanced continuous-variable quantum networkRunjia Zhang; Huy Q. Nguyen; Akash nag Oruganti; Adnan A.E. Hajomer; Ivan Derkach; Ulrik L. Andersen; Vladyslav C. Usenko; Tobias Gehring[abstract]Abstract: In recent years, continuous-variable (CV) quantum communication has become a nascent but promising alternative to secure multiple end-users sharing the same telecommunication backbone. Continuous-variable quantum key distribution (CV-QKD) with reverse reconciliation enables natural scalability from point-to-point communication to quantum access networks with passive quantum broadcasting channels. Here, we report two experimental demonstrations on a $1:4$ quantum communication network with protocols advancing from two fronts, either moving beyond the asymptotic limit or the Gaussian assumption of the modulation. We demonstrate for the first time a network of four active users simultaneously achieving high secret key rates with finite-size security against collective attacks. A comprehensive security analysis was performed to cover different scenarios on how each end user prefers to trust others. In addition, with the same optical configuration, we implement an initial CV quantum network accounting for four users (two active) with discrete modulation with the conservative untrusted broadcast protocol. The results establish the viability of CV quantum network for practical security with imperfect devices when broadly deployed to connect end users to existing infrastructures.
- Efficient Quantum Fully Homomorphic EncryptionFengxia Liu; Zixian Gong; Maozhi Xu; Zhiming Zheng[abstract]Abstract: Quantum fully homomorphic encryption (QFHE) enables arbitrary quantum computations on encrypted data, but existing constructions require prohibitive quantum resources—specifically, O($\lambda^{2}$) EPR pairs per $\mathsf{T}$-gate evaluation using the Barrington based approach of Dulek-Schaffner-Speelman (CRYPTO 2016). This paper introduces a unified framework achieving exponential improvement over the generic Barrington-based approach in terms of program length (from $O(\lambda^2)$ to $O(\lambda \log ^2\lambda)$). The central innovation of this paper is a novel modular arithmetic program(MA-Program) tailored to the algebraic structure of LWE decryption. We demonstrate that LWE decryption computes $⟨sk,ct⟩$ mod $q$—a modular inner product that is \textbf{NOT} a symmetric function. Consequently, prior symmetric-function optimizations (Sinha's $O(n)$-state-count branching programs) do not apply. Our MA-Program tracks partial sums modulus $q$ with state space $\mathbb{Z}_q$ requiring $O(\log q)$ bits, yielding programs of state count $O(\lambda)$ with binary encoding $O(\log \lambda)$ and length $O(\lambda \log \lambda)$. This reduces the quantum gadget size from $O(\lambda^{2})$ to $O(\lambda \log^2 \lambda)$ EPR pairs. To achieve a \textbf{fully classical client}, we transfer all quantum resource requirements (EPR pair preparation, Bell measurements, adaptive error correction) to the server via the MA‑Program gadget framework, requiring clients only to perform classical LWE key generation, Pauli key encryption/decryption under classical FHE, and no quantum operations; a layered key structure where gadget information is encrypted under fresh public keys further eliminates circular security assumptions. For \textbf{parallel computation}, we adopt the MBQC framework with flow functions, which supports up to $O(\log\lambda)$ parallel measurements per layer (matching the binary encoding width of our MA‑Program), and separates offline resource preparation (batch EPR pair generation) from online adaptive measurement, enabling parallel processing of measurement tasks while maintaining deterministic evaluation.
- Information-Theoretic Solutions for Seedless QRNG Bootstrapping and Hybrid PQC-QKD Key CombinationJuan Antonio Vieira Giestinhas; Timothy Spiller[abstract]Abstract: From Seedless QRNGs to Hybrid Key Combining This poster addresses two hurdles in practical quantum networks: the "randomness loop" in QRNGs and the limitations of XOR-based key combining. Leveraging universal hash functions and the Quantum Leftover Hash Lemma, a bootstrapping method using two independent, seedless entropy sources is proposed. Furthermore, standard XOR combiners is replaced with strong seeded extractors. This ensures that even if one key is compromised, the output retains quantifiable min-entropy. By modeling Post-Quantum Cryptography (PQC) keys with HILL entropy, our framework extends Information-Theoretic Security to hybrid PQC-QKD (Quantum Key Distribution) systems, providing a rigorous, future-proof defense against quantum adversaries.
- Signature-Based Backdoors in Variational Quantum ModelsEleanor Kedem; Ryan Sweke; Prof. Francesco Petruccione[abstract]Abstract: Variational Quantum Models represent a promising tool in the emerging field of quantum machine learning, and can potentially be used for a large variety of sectors and purposes. However, for the foreseeable future, only a select number of entities and organizations have access to machines that can run them. Therefore, training and inference of such models need to be delegated, outsourced, or externally influenced by those organizations, which may have ulterior motives than those of the original model owner. As such, understanding this vulnerability, particularly in adversarial settings, is of utmost importance. This raises a natural cryptographic question: can hidden malicious functionality be embedded into such models in a way that remains attacker-controlled yet difficult to recognize from the expected circuit structure? In classical machine learning, recent work has shown the existence of undetectable backdoors using cryptographically structured triggers. We investigate the corresponding question for parameterized quantum classifiers. Our approach is based on digital-signature verification. The core idea is to embed a verifier-like mechanism into a parameterized quantum classifier so that a signed input activates a hidden malicious behavior, while unsigned inputs continue through the ordinary classification pathway. Signature-based triggers are appealing because they are rare, secret-controlled, and non-replicable, making them structurally different from standard backdoor triggers. This digital-signature-based mechanism realizes a black-box, undetectable backdoor. We then study the setting of gray-box undetectability, namely how the verifier-like mechanism can be disguised within a given model family to avoid detection under partial circuit inspection. We consider three construction families. The first is a hard verifier, which most closely follows exact GPV-style verification logic and retains explicit arithmetic structure. The second is a soft verifier, which replaces exact acceptance by a smoother approximate mechanism. The third is a trainable verifier, which learns trigger behavior without enforcing the full arithmetic structure of exact verification. These three constructions span a spectrum from cryptographic faithfulness to implementation flexibility. Our main message is that these constructions expose a central trade-off. The more faithfully one implements exact cryptographic verification inside a quantum classifier, the larger and more structurally visible the resulting circuit becomes. This effect is already apparent at the level of raw verifier overhead, such as excessive gate and ancilla requirements, even before additional camouflage is introduced to blend the verifier into an expected ansatz. Softer and trainable constructions offer greater flexibility and may integrate more naturally into variational circuit structure, but they move away from exact cryptographic semantics. Our contribution is therefore to identify a gray-box threat setting relevant to VQMs, present three concrete verifier-based construction paradigms, and compare them through the combined lens of trigger functionality, concealment strategy, and circuit resource overhead. The results suggest that signature-based backdoors are a meaningful and underexplored cryptographic threat model for quantum learning systems, while also highlighting the substantial gap between cryptographic elegance and practical embedding cost.
- Demonstration of a blinding attack on a CV-QKD receiverDaniel Pereira; Vana Pezelj; Hannes Hübel; Florian Prawits[abstract]Abstract: Continuous-variable quantum key distribution (CV-QKD) provides a theoretical unconditionally secure solution to distribute symmetric keys among users in a communication network. However, the practical devices used to implement these systems are intrinsically imperfect, and, as a result, open the door to eavesdropper attacks. We present a novel implementation of a coherent detector blinding attack, in which the eavesdropper hinders the capability of the receiver to properly estimate the channel parameters, hiding the impact of their intercept-resend attack. Our results show that excess noise in excess of 2.5 SNU can be reliably hidden by the eavesdropper, thus demonstrating the feasibility of the attack.
- Reduced State Embedding for High-dimensional Quantum CryptographyAmit Kam; Kfir Sulimany; Shai Tsesses; Uzi Pereg[abstract]Abstract: We introduce encoding strategy of k-symbol embeddings within a d-dimensional Hilbert space, validate using d=25 experimental data and determine optimum at k=5. These findings pave the way for error-correction and modulation for quantum cryptography.
- Practical Countermeasure Against Attacks on Detection Efficiency Mismatch in Quantum Key DistributionBen Taylor[abstract]Abstract: We demonstrate a practical countermeasure against a well-known class of attacks on quantum key distribution (QKD) systems that exploit detection efficiency mismatch, where the receiver’s detectors do not exhibit identical responses to incoming photons across all degrees of freedom. This class of quantum hacking strategies is broad and significantly includes the time-shift attack, which targets an arrival-time-dependent side channel at the receiver. The four-state countermeasure, previously only proven to be secure in theory, is implemented here on a GHz-clocked prototype QKD system and evaluated for its security and performance. We show that its presence enables almost complete recovery of the system’s ideal secret key rate. Our results provide strong justification for adopting this countermeasure as a standard component in future scalable and practical QKD systems.
- Equivocation-resistant multiparty digital signature for quantum networksFederico Grasselli; Gaetano Russo; Carlo Liorni; Giuseppe De Falco; Massimiliano Proietti[abstract]Abstract: Digital signatures are a critical cryptographic primitive requiring quantum-safe solutions. One possibility are quantum digital signatures (QDS), which offer information-theoretic (IT) security without a trusted authority. However, even the most promising QDS proposals are largely limited to the tripartite scenario (one sender, two receivers) and are vulnerable to equivocation-based attacks that hinder transferability and non-repudiation. To overcome such limitations, we introduce an equivocation-resistant signature (ERS) protocol based on preshared keys and universal hashing that achieves IT security and scales to an arbitrary number of receivers. We benchmark the ERS protocol against state-of-the-art QDS schemes demonstrating orders-of-magnitude reductions in preshared key consumption and signature size. Our findings position our ERS protocol as a strong candidate for implementing IT-secure digital signatures in today’s quantum communication infrastructures.
- A Security Interface for Polarization MDI-QKD over Turbulent Free-Space LinksHeyang Peng; Seid Koudia; Symeon Chatzinotas[abstract]Abstract: Atmospheric turbulence poses a significant challenge to free-space measurement-device-independent quantum key distribution (FSO MDI-QKD) by inducing polarization distortions and stochastic propagation losses, which together degrade the secret key rate (SKR). In this paper, we propose a composite channel framework that unifies phase perturbations, beam spreading, beam drift, receiver-aperture truncation, scintillation-induced fading, and atmospheric attenuation into a compact set of closed-form interface parameters: an effective depolarization parameter, an effective decoherence parameter, and an effective end-to-end detection probability. By modeling turbulence-induced polarization changes as random polarization rotations with axis statistics captured by a directional distribution, we obtain a Pauli-diagonal effective depolarizing–dephasing description and derive an analytic SKR evaluation that can be directly embedded into standard MDI-QKD security analysis. We incorporate representative clear, overcast, and hazy profiles through weather-dependent attenuation and turbulence conditions, and the resulting parameterization enables computationally efficient SKR evaluation and link-parameter sweeps. Numerical case studies on a ground-to-satellite free-space link illustrate the SKR trends under the proposed framework, supporting physical-layer design and performance assessment for satellite-based MDI-QKD networks.
- Distributed-Control Key Relay and Routing Table Management in a Hierarchical Large-Scale QKD NetworkKazuma Tsuda; Ririka Takahashi; Mayuko Koezuka; Yoshimichi Tanizawa; Mariko Honda; Mikio Fujiwara[abstract]Abstract: We considered research and development aimed at improving the operability and scalability of large-scale QKD net-works (QKDNs) by introducing hierarchical control architecture. This paper focus on a distributed-control QKDN within such a hierarchical large scale QKDN and presents the design and implementation of a QKDN controller (QKDN-C) that selects appropriate key relay routes in response to control instructions from an orchestrator (QKDN-O). In particular, it describes a method for distributed key relay and routing table management, in which the routing tables of individual key managers (KMs) are dynamically updated on instructions from the QKDN-O. It also shows that, in a hierarchically structured QKDN, coordinated operation between the QKDN-O and distributed QKDNs enable key re-laying to be realized over optimal routes.
- Communication-Optimal Blind Quantum ComputationEthan Davies[abstract]Abstract: A user, Alice, wants to get server Bob to implement a quantum computation for her. However, she wants to leave him blind to what she’s doing. What are the minimal communication resources Alice must use in order to achieve information-theoretic security? In this paper, we consider a single step of the protocol, where Alice conveys to Bob whether or not he should implement a specific gate. We use an entropy-bounding technique to quantify the minimum number of qubits that Alice must send so that Bob cannot learn anything about the gate being implemented. We provide a protocol that saturates this bound. In this optimal protocol, the states that Alice sends may be entangled. For Clifford gates, we prove that it is sufficient for Alice to send separable states.
- Reconfigurable QKD transmitter for phase, time-bin, and polarization encodingSilas Eul; Aaron Vornhagen; Julian Struck; Ömer Bayraktar; Johannes Schmidt; Maximilian Tippmann; Christoph Marquardt[abstract]Abstract: We present an overview of a reconfigurable QKD transmitter capable of phase, time-bin, and polarization encoding. We highlight how the same driving electronics and electro-optic components enable seamless switching between operation modes, supporting rapid and stable modulation up to the GHz range. Practical implementation strategies are discussed, including photonic integrated circuit designs that ensure compactness, stability, and scalability. Potential applications in long-distance quantum communication—such as satellite-based QKD—are discussed, and preliminary experimental results from key platform components are presented.
- Exploring new dimensions in polarization-dependent efficiency mismatch evaluation in superconducting nanowire single-photon detectorsNitin Jain; Fadri Grünenfelder; Ulrik L. Andersen; Tobias Gehring[abstract]Abstract: A quantum key distribution (QKD) implementation can be vulnerable to detector-control attacks by Eve if the receiver exhibits detection efficiency mismatch. It is well known that superconducting nanowire single photon detectors (SNSPDs) exhibit polarization-dependent efficiency. Since no two SNSPDs can be identical, a QKD receiver employing a pair of SNSPDs will necessarily exhibit some mismatch. A previous work has shown how to experimentally measure and exploit such a polarization-dependent efficiency mismatch by varying a single ‘polarization angle’ of the photons impinging on the SNSPDs. We show that varying the photon polarization along two independent dimensions (azimuth and elliptical angles) enables a more accurate and systematic evaluation of this vulnerability. Experimentally, it offers the complete efficiency mismatch landscape (from Eve's perspective) and eases setup alignment. We also develop a new theoretical model that shows a good match with the experimental results.
- Power Stabilization for Chip-Based QKD Transmitters Using Homodyne DetectionJunsang Oh; Kap-Joong Kim; Joong-Seon Choe; Ju Hee Baek; Chun Ju Youn; Byung-Seok Choi[abstract]Abstract: Stable optical output power is essential in chip-based QKD transmitters because fluctuations in the emitted mean photon number directly affect security analysis and the secret key rate. Conventional monitoring at the laser diode output cannot directly reflect downstream drift from intensity modulators, variable optical attenuators, thermo-optic elements, and driving circuits. Here, we propose a homodyne detection-based optical output power stabilization method using the complementary port signal of a final Mach-Zehnder-based variable optical attenuator. As a preliminary step toward a chip-based near-output monitor, we demonstrate its feasibility with a bulk-optics proof-of-concept experiment.
- Overcoming the Phase Diffusion Limit in a Semiconductor Laser-based QRNGAdam Brzosko; Yuen San Lo; Peter Raymond Smith; Taofiq Paraiso; Sergio Juarez; James Dynes; Robert Woodward; Mark Stevenson; Andrew Shields[abstract]Abstract: We report a novel technique of extracting randomness from the phase of optical pulses coming from a gain-switched Distributed Feedback (DFB) laser cavity beyond the phase diffusion limit, with a demonstration at 10 GHz.
- 1.3 km Free-Space Entanglement-Based QKD with Robust Sagnac-Based Polarization Entangled Photon SourceTaewon Kim; Hyeokin Kang; Gibeen Gu; Jaeyoon Kim; Heonoh Kim; Young-Jin Kim[abstract]Abstract: Quantum key distribution (QKD) is a promising technology for secure communication, particularly for satellite-based global networks, but its implementation is limited by atmospheric turbulence. In this study, we develop a 1.3 km campus-scale free-space optical link as a testbed for entanglement-based QKD and implement a Sagnac-based polarization-entangled photon source using a type-II PPKTP crystal. The photon-pair generation rate is characterized as a function of pump power, showing slopes of 244.8 kHz/mW with a 10 nm bandpass filter, achieving up to 1 MHz pair rate. The coincidence-to-accidental ratio (CAR) is also measured, revealing a trade-off between pair rate and multi-pair-induced degradation. These results establish a robust platform for future entanglement distribution over atmospheric channels and provide a foundation for satellite-based QKD systems.
- Effect of Optical Phased Array Sidelobes on QKD Performance Using a Simplified Loss ModelMinchul Kim; Kyongchun Lim; Junsang Oh; Jin-Woo Kim; Chun Ju Youn; Hoon Kim[abstract]Abstract: Optical phased arrays (OPAs) are beam-steering devices that control the direction of light by adjusting the relative phase of multiple emitters and have been widely studied in free-space optical communications and LiDAR. Recently, their potential has also been explored in quantum applications such as free-space quantum key distribution (QKD). However, the far-field pattern of OPAs inherently includes not only a main lobe in the desired direction but also sidelobes, whose impact on QKD performance has not yet been investigated. In this work, we study the effect of sidelobes on QKD performance from a system-level perspective. We relate the sidelobe suppression ratio (SSR) of an OPA transmitter to QKD performance based on a decoy-state BB84 model. We focus on how power leakage into sidelobes reduces the signal intensity in the main beam and lowers the secure key rate. To capture this effect, we adopt a simplified model in which sidelobe power is treated as a loss from the main beam. Under a linear optical assumption, this loss can be treated in the same way as channel attenuation in standard QKD analysis. This work connects OPA beam characteristics, including sidelobe effects, to QKD system performance.
- Effect of Non-Ideal Beacon Beam Profiles on Performance of Fine Beam Tracking System in Free-Space Quantum Key DistributionHye Lyn Kwak; Jongchoel Won; Minchul Kim; Byung-seok Choi; Chun Ju Youn; Jun Heo[abstract]Abstract: Recent advances in quantum computing pose a potential threat to conventional public-key crypto systems such as RSA(Rivest-Shamir-Adleman), motivating the development of quantum key distribution systems. In free-space quantum key distribution, fiber-coupling efficiency is a critical factor because optical loss directly affects the secret key rate and ultimately limits the achievable transmission distance. Therefore, minimizing coupling loss through stable beam tracking is essential, particularly in free-space QKD platforms involving satellites, drones, and mobile terminals[1,2]. In fine beam-tracking systems, beacon signals for the fast-steering mirror control loop can be detected using either quadrant detectors or CMOS cameras. Quadrant detectors offer fast response times and are suitable for real-time feedback control, but their tracking performance can be strongly affected by the spatial profile, size, and symmetry of the incident beam[3]. In contrast, CMOS cameras provide direct beam-profile information and are less sensitive to beam-shape distortion, but they generally suffer from slower response times. In this work, we investigate a fine-tracking configuration in which a beacon laser is transmitted through a central aperture in an off-axis parabolic mirror. As a result, the reflected beam has a centrally obscured, non-ideal Gaussian profile, which may degrade the tracking accuracy of a quadrant-detector-based system. We compare the performance of quadrant-detector- and CMOS-camera-based feedback schemes for fast steering mirror control under non-ideal beam-detection conditions. Furthermore, we analyze the influence of beam size and beam-profile distortion on tracking performance and discuss optimization strategies for stable fiber coupling in free-space QKD systems.
- Real-time CV-QKD with a chip-scale transmitterIgor Servello; Martin Hauer; Moritz Baier; Emmeran Sollner; Peter Gleissner; Sebastian Randel; Ulrich Eismann; Emanuel Eichhammer; Imran Khan[abstract]Abstract: Continuous-variable quantum key distribution (CV-QKD) enables secure communication over standard telecom infrastructure, yet its scaling is stalled by bulky, discrete optical hardware. We address this bottleneck by demonstrating a real-time CV-QKD system driven by a chip-scale hybrid transmitter built from commercial telecom components. By integrating a micro-optic external-cavity laser with a monolithic photonic integrated IQ modulator, we provide high performance, enabling secret-key generation over 102 km of optical fiber, while reducing the size of the optics by 95%. Moreover, real-time operation overcomes the offline post-processing bottlenecks of experimental setups. This work bridges laboratory demonstrations and field-deployable technology, with a scalable architecture for cost-effective quantum networks.
- 1-Mbps Twin-Field Quantum Key Distribution over 200 km Using Independent Dissipative Kerr SolitonsHao Dong; Tian-jiao Zhang[abstract]Abstract: Twin-field quantum key distribution (TF-QKD) dramatically enhances the secure key rate (SKR) over inter-city distances through its square-root scaling. Further improvements in aggregate SKR can be achieved by wavelength-division multiplexing (WDM) of parallel QKD channels. However, direct implementation in TF-QKD poses significant challenges, as each wavelength channel requires an independent ultra-stable seed laser, narrow-linewidth transmitters, and optical phase locked loops (OPLLs), which are not easily scalable. Here, we circumvent these limitations by employing two independent, integrated dissipative Kerr soliton (DKS) microcombs at Alice and Bob as multi-wavelength sources. High-visibility single-photon interference across all wavelength channels is achieved by stabilizing the frequencies of every comb line—requiring only the stabilization of the pump wavelength and repetition rates of the two microcombs. Based on this architecture, we perform a full TF-QKD experiment using the sending-or-not-sending protocol, achieving a total SKR of 1.57 Mbps over 201.1 km of fiber using 16 DWDM channels. This result represents more than an order-of-magnitude enhancement compared with single-wavelength TF-QKD at the same distance. Given that a single DKS comb can support over 100 coherent lines across the C-band, this approach offers a scalable pathway toward high-rate quantum key distribution over inter-city distances.
- Hardening Measures for Trusted-Node QKD NetworksJonas Berl; Mario Wenning; Tobias Fehenberger[abstract]Abstract: QKD networks rely on trusted nodes to overcome the limited reach of present-day QKD devices, weakening end-to-end security. We propose four complementary hardening measures, including secret sharing, PQC hybridization, path verification, and confidential computing, to reduce trust assumptions and enable more secure deployments in meshed QKD networks.
- Study of a simulation framework for satellite-to-ground QKD links and optical-conversion assisted fiber network extensionJungyu Park; Heonoh Kim; June-Koo Kevin Rhee[abstract]Abstract: While long-distance fiber QKD suffers from transmission loss, satellite-to-ground quantum key distribution (Sat-QKD) can extend key distribution through free-space links. However, to make such keys usable in terrestrial QKD networks, a satellite link must be connected to ground fiber infrastructure through wavelength and encoding interfaces. This work studies a simulation framework for Sat-QKD as a key-supply layer for fiber-based QKD networks. The framework focuses on downlink decoy-state BB84 and combines LEO pass geometry, candidate OGS atmospheric data, receiver/detector models, QBER estimation, and finite-key analysis. After satellite-to-OGS free-space collection, an OGS-side optical-conversion interface is modeled before ground fiber extension. The simulator compares direct backhaul, 850-to-1550 nm quantum frequency conversion (QFC), polarization to time-bin degree-of-freedom (DOF) conversion, and the combined QFC + DOF path. The results show that the preferred wavelength depends on the link section: 850 nm provides higher annual finite-key volume in the satellite free-space link, while 1550 nm is favorable for the fiber-extension layer. QFC connects the free-space-favorable 850 nm link to the fiber-favorable 1550 nm layer, and DOF conversion introduces conversion loss but suppresses polarization-drift-induced QBER. The framework is intended as an engineering-level tool for comparing candidate OGS sites and optical-conversion paths for satellite–fiber QKD network extension.
- On the Practical Construction of Zero-knowledge Proof of QuantumnessYao Ma[abstract]Abstract: Proofs of quantumness (PoQ) allows a classical verifier to certify that a remote prover possesses genuine quantum computational power. While existing PoQ protocols primarily address security against malicious provers, recent work by Phan et al. introduced zero-knowledge proofs of quantumness (ZKPoQ) to additionally protect honest provers from malicious verifiers seeking to extract information beyond the mere fact of quantum capability. In this work, we advance the ZKPoQ framework with two concrete contributions aimed at practical deployment. First, we instantiate two interactive ZKPoQ protocols---based on factoring and on learning with errors (LWE), respectively---each incorporating an extractable zero-knowledge gadget that the verifier must provide on its witness before the PoQ protocol proceeds. Notably, our constructions eliminate the dependency on a common reference string (CRS) required in prior work, thereby reducing architectural assumptions and simplifying real-world adoption. Second, we apply the Fiat--Shamir heuristic to transform both interactive protocols into non-interactive variants, improving communication efficiency. We formally prove that our schemes satisfy quantum completeness, classical soundness, and computational zero-knowledge under the ZKPoQ framework. Finally, we propose concrete parameter settings for practical deployment, provide a detailed analysis of communication costs across both interactive and non-interactive variants, and present a comparative summary of their efficiency trade-offs.
- Field Deployment of a Time-Shared Full-Mesh Entangled QKD NetworkYury Kurochkin; Vadim Rodimin; Alexei Ponasenko; Attila Pereszlenyi; Vlad Revici; Rodrigo Piera; Tahar Mehri; Karen Sloyan; Jaideep Singh; James A. Grieve[abstract]Abstract: Deployable networks and regulatory feedback are creating new challenges for quantum communication research. One of the most important challenges highlighted in QKD position papers is the trusted-node concept. At city scale, this problem is already practical issue: 5–50 users may need to share secret keys in an any-to-any topology. In a conventional trusted-node architecture, the telecom operator responsible for the quantum network becomes a trusted organization for all users and all sensitive data. Three approaches can be considered to overcome this limitation: (i) equip every user with both a transmitter and a receiver and use an N × N optical switch [3]; (ii) distribute entanglement between selected user pairs; (iii) use MDI-QKD or TF-QKD with a 2 × N optical switch. In this work, we demonstrate a field deployment of time-shared entanglement distribution between users selected on demand. We consider this approach highly practical because it keeps network management simple and allows the same receiver implementation to be used for every user. Our deployment is located in the Abu Dhabi Global Market (ADGM) free zone in Abu Dhabi. It opens an opportunity for finance-sector clients to test end-user solutions on a quantum-safe network, both by using AES encryptors fed by quantum-generated keys and by applying ETSI GS QKD 014 to request keys at the application layer.
- Modular SD-KMS and LP Multipath Routing for Enhanced Resilience in a Field-Deployed QKD NetworkKonstantinos Tsimvrakidis; Antonis Selentis; Alkinoos Papageorgopoulos; Ilias Papastamatiou; Konstantinos Christodoulopoulos; George T. Kanellos[abstract]Abstract: We introduce a dynamic Software-Defined Key Management System (SD-KMS) framework designed as a modular orchestration platform to overcome the limitations of static routing in Quantum Key Distribution (QKD) networks. The central Controller manages routing via three distinct mechanisms: an active polling interface for external solvers, a passive injection API for enforcing custom commands, and an embedded Dijkstra fallback engine to guarantee baseline service. Paired with this open architecture, we implemented a novel batch-based Linear Programming (LP) routing engine. This algorithm utilizes a "just-enough" proactive routing strategy that computes multi-path routes in polynomial time. By periodically processing demand batches, it optimizes end-to-end services to stay above safety thresholds, guaranteeing QoS by immediate key provisioning for dynamic application demands while allowing physical link pools to seamlessly absorb inherent QKD generation fluctuations. The capabilities of the SD-KMS and the LP engine were experimentally validated on a field-deployed, 5-node, multi-vendor QKD ring network. Functioning as a unified overlay across heterogeneous QKD systems, the framework successfully navigated a dynamic evolution scenario featuring key generation fluctuations, varying demands, and an intentional link failure. During periods of heavy key demands, the LP engine effectively performed load balancing by dynamically routing a portion of relay flows to secondary paths, preventing pool starvation and outperforming standard single-path solutions. When an active link was deliberately disrupted, the engine instantly redirected all traffic to the remaining functional path to ensure uninterrupted service continuity. Finally, upon link restoration, the system automatically engaged multipath routing across both available paths, maximizing the total key provisioning rate to optimize the volume of served request.
- All-optical turbulence mitigation for free-space quantum key distribution using stimulated parametric down-conversionAaron Adrian Aguilar-Cardoso; C Li; T Luck; M Ferrer-Garcia; J Upham; Jeff Lundeen; Robert Boyd[abstract]Abstract: Free-space quantum communications offers a promising route for securely transmitting information over long distances. However, a major challenge for these systems is atmospheric turbulence, which distorts the spatial structure of light and can severely limit the amount of information that can be reliably transmitted. In this work, we propose and demonstrate a turbulence-resilient scheme for free-space quantum communication. By leveraging the phase conjugation property of stimulated parametric down-conversion, our scheme enables all-optical dynamic correction of spatial-mode distortion induced by atmospheric turbulence, thereby enhancing the secure key rate in high-dimensional quantum key distribution. We develop a theoretical model that provides detailed guidelines for selecting the optimal basis and spatial properties needed to maximize the efficiency of the proposed scheme. Both numerical simulations and experimental results show that, even under strong turbulence, our scheme can reduce the quantum error rates well below the security threshold. These results highlight the potential of nonlinear optical approaches as powerful tools for robust quantum communication in realistic free-space environments.
- GHz-Rate Phase-Randomized Decoy state Time-Bin QKD Source Based on a SLED PlatformShashank Kumar; Alessandro Marcomini; Loic Millet; Towsif Taher; Raphael Houlmann; David Cabrerizo; Gianluca Boso; Marcos Curty; Rob Thew; Boris Korzh[abstract]Abstract: Phase randomization is essential for the security of practical quantum key distribution (QKD) systems. Commonly, implementations rely on laser sources (either actively phase-randomized, or gain-switched). However, at high repetition rates these show correlations, which can ultimate compromise security and performance. We present a 1.25 GHz fully phase-randomized QKD source based on a super luminescent diode (SLED) operating in the C-band as a compact and cost-effective alternative. The source generates ∼ 100 ps optical pulses with 400 ps time-bin separation, compatible with high-speed time-bin encoding. Interferometric measurements demonstrate > 99% visibility between adjacent time bins, confirming strong first-order coherence within a qubit, while the spontaneous-emission-driven nature of the SLED ensures intrinsic pulse to pulse phase randomization. The broadband architecture further enables operation across multiple ITU channels, supporting wavelength-multiplexed QKD from a single emitter. This work establishes a scalable SLED-based platform for high-speed time-bin QKD systems.
- Encrypted Federated Learning of Quantum Neural Networks via Continuous-Rotation Homomorphic EncryptionMarcel Mordarski; Nathan Mani; Arshad Patel; William Knottenbelt; Roberto Bondesan[abstract]Abstract: Federated learning (FL) trains a shared model across many data holders without pooling raw data, but the parameter exchange itself is vulnerable to gradient-inversion attacks. Among privacy-preserving remedies, fully homomorphic encryption (FHE) is the strongest cryptographic option that lets an honest-but-curious server aggregate updates without ever seeing them in the clear. Extending FHE to quantum machine learning, where the model parameters are continuous rotation angles of a variational quantum circuit, has so far required either thousands of interactive client--server rounds per training step or compiling every rotation into long sequences of a discrete gate alphabet, an overhead that destroys any quantum-side advantage. The central technical observation of this work is that single-qubit rotation composition under the quaternion representation of $\mathrm{SU}(2)$ reduces to a degree-2 polynomial on $\mathbb{R}^4$, which the CKKS scheme evaluates within a single multiplicative depth without bootstrapping. The consequence is a practical construction that enables non-interactive encrypted federated training of hybrid quantum--classical neural networks: information-theoretic security at the quantum-state level is composed with RLWE-based computational security for the classical aggregation. A small-scale feasibility study ($\leq\!3$ clients, $\leq\!5$ FL rounds) on the California Housing regression benchmark shows that the encrypted model matches or slightly improves over the plaintext quantum baseline in every run ($\mathrm{MSE}=0.612$ versus $0.727$) and approaches the classical CKKS-FedAvg baseline ($0.591$), an effect that is consistent with, and which we hypothesise is driven by, mild stochastic regularisation from CKKS approximation noise. Homomorphic FedAvg matches plaintext FedAvg to within $4{\times}10^{-8}$ rad of rotation-angle error in our runs. A protocol-accounting cost model predicts a $10\times$--$30\times$ reduction in per-rotation compute relative to the discrete-gate baseline as target precision tightens, and round-trip state fidelity of $0.992$ is measured on the 156-qubit \texttt{ibm\_fez} processor. The accompanying open-source release is, to the best of our knowledge, the first publicly available implementation of continuous-rotation quantum homomorphic encryption, and is intended to lower the barrier to further work on privacy-preserving quantum machine learning.
- Towards a Digital Twin for the Quantum EncrYption and Science SatelliteHenri Morin; Alex Maierean; Brendon Higgins; Ian DSouza; Vinodh Muthu; Thomas Jennewein[abstract]Abstract: We present a novel Monte Carlo based QKD simulator, developed to be the digital twin of the Quantum EncrYption and Science Satellite (QEYSSat). The simulator will be used to validate mission objectives, and generated predictions will be updated against real experimental data. Stochastic processes such as afterpulsing and recharge time are incorporated.
- Multipartite Bell inequalities with interferometric multiportsIeline Ahmed; Seyed Arash Ghoreishi; Giovanni Scala[abstract]Abstract: We propose a characteristic–function approach to Bell inequalities implemented with interferometric multiport measurements. By encoding d-valued outcomes as roots of unity, Bell functionals become linear combinations of Fourier correlators. This unified scheme reproduces CHSH, CGLMP, and MABK inequalities, and systematically generates new ones in higher-dimensional and multi setting scenarios. Optimizing over entangled states and multiport phase shifts provides explicit quantum strategies. Our framework thus offers a compact, experimentally natural route to Bell tests beyond the standard families.
- Capacity and SKR Trade-off in Coexisting Classical and CV-QKD Metro-Reach LinksCagla Ozkan; Lucas Alves Zischler; Kadir Gumus; João dos Reis Frazão; Cristian Antonelli; Chigo Okonkwo[abstract]Abstract: We analyse the secret-key rate (SKR) of continuous-variable quantum key distribution (CV-QKD) when the quantum channel shares a fibre with classical DWDM traffic. Using a physical model of an 88-channel, 50 GHz-spaced C-band link that captures four-wave mixing, spontaneous Raman scattering, Rayleigh backscatter, and out-of-band effects with full frequency dependence, we compute the asymptotic SKR under Gaussian collective attacks across guardband size, quantum-channel position, classical launch power, link distance, and propagation direction. We report three results. First, placing the quantum channel at the band edge with a 150 GHz guardband yields a 108% SKR gain at 3.4% classical capacity loss, half the cost of symmetric centre-band protection. Second, counter-propagation without any guardband produces the same SKR as guardbanded co-propagation at the same operating point. Third, a power threshold near -2 dBm/ch separates two operating regimes: below threshold the link is Raman-limited and the SKR is essentially insensitive to the guardband, while above threshold four-wave mixing dominates and the SKR depends sharply on guardband size and band-edge proximity. These rules apply across the operating regimes typical of installed DWDM metropolitan fibre.
- Stronger Bounds in the Parallel Quantum Random Oracle ModelJeremiah Blocki; Blake Holman[abstract]Abstract: The random oracle model is a common setting for proving security of cryptographic primitives by replacing the underlying hash function with a uniformly random function. For some primitives, including memory-hard functions, proofs of sequential work, and proofs of space, security must be proved against highly parallel attackers, which motivates the parallel random oracle model. Existing quantum analogues of this model were introduced to study these primitives against quantum attackers, but they impose extra restrictions on the adversary’s parallel query sizes: one model fixes the same query size in every round, while another fixes the entire schedule of query sizes before the oracle is sampled. These restrictions have an unintended consequence, as there are problems for which a classical adaptive PROM algorithm uses asymptotically fewer queries than any quantum algorithm in the restricted PQROM models. We therefore introduce the adaptive PQROM, where the adversary may choose the next parallel query size after the previous oracle interaction, as the canonical quantum analogue of the classical PROM. We then extend compressed-oracle techniques to this setting and prove query bounds for natural problems including inversion, collision finding, k-sum, and proofs of sequential work.
- Device-Independent Quantum Key Distribution in the Minimal Bell ScenarioKai-Siang Chen; Jaskaran Singh; Subhankar Bera; Gelo Noel M. Tabia; Yeong-Cherng Liang[abstract]Abstract: Device-independent quantum key distribution allows two distant parties to certify a secret key directly from the correlations observed in an experiment, without relying on a detailed model of the devices. In this work, we study this task in the minimal Bell scenario, where each party has only two measurement choices and two possible outcomes. We show that secure key generation can be certified in this simplest setting by using tailored Bell inequalities together with simple constraints on the observed probabilities. In particular, we identify a family of quantum correlations that enables perfect key generation in a spot-checking protocol. The security follows from a self-testing property: the observed data certify the relevant quantum state and measurements, and hence certify that the adversary has no information about the generated key. Our results show that maximal device-independent key generation is possible in the minimal Bell scenario, even for arbitrarily small Bell non-locality. This highlights the importance of using the full structure of the observed correlations, rather than only a single Bell-inequality value, for certifying device-independent quantum key distribution.
- Optical Quantum Random Number Generator Based on the Photodetection Process over a Multipixel DetectorDelfina B. Amenta; Miguel A. Larotonda[abstract]Abstract: Various tasks related to classical and quantum cryptography, as well as information security, rely extensively on genuine random numbers and random bits that are irreproducible, unbiased, and unpredictable. Consequently, generating these numbers is considered a critical task; the numerical sequences from which they are extracted cannot be generated deterministically using algorithms, as they could eventually be replicated. The non-deterministic nature of quantum systems appears as a natural source of entropy for this application. In this regard, a Quantum Random Number Generator (QRNG) emerges as a native solution to the problem of unpredictable random number generation. Under this premise, the objective of this work is to develop a randomness source based on the quantum characteristics of the photodetection process, along with its corresponding extractor. We present the development progress of a portable and modular device capable of generating arbitrary streams of uniform random bits based on the quantum fluctuations of photons emitted by a light-emitting diode (LED) and detected by a CMOS camera. We designed and implemented an optoelectronic system featuring active intensity control via a feedback loop. Raw image data is processed to acquire intensity values, and image capture parameters have been optimized to achieve a homogeneous illumination profile. For randomness generation, a noise model of the photodetection process was established, and a Toeplitz-hashing extractor was implemented based on a measured bound of the min-entropy.

