arXiv subjects

Nathan Walk

Publications and source records attributed to Nathan Walk.

At least 19 recordsLinked to original sources

arXiv2026

Benchmarking Single-Photon Sources for Measurement-Device-Independent Quantum Key Distribution

Measurement-Device-Independent Quantum Key Distribution (MDI-QKD) enables secure communication without trusting the measurement devices, but its performance critically depends on the quality of the employed photon sources. We compare MDI-QKD implementations based on Weak Coherent Pulses (WCPs) with those employing Quantum Dot (QD) single-photon sources. WCP-based schemes are fundamentally limited by Poissonian photon-number statistics, imposing a trade-off between single- and multi-photon emissions, whereas QD sources exhibit sub-Poissonian statistics with low antibunching parameter $g^{(2)}(0)$. Using a decoy-state analysis for both source types, we find that even at moderate mean photon numbers, QD-based implementations outperform the best-case WCP configuration - where the mean photon number is optimised at each transmission distance - across the full range of transmission distances. We further incorporate the effect of imperfect photon indistinguishability via Hong-Ou-Mandel interference visibilities into the security framework and demonstrate that both source types are highly sensitive to even small deviations from ideal indistinguishability, significantly affecting achievable key rates and maximum transmission distance.

quant-ph↗

arXiv2026

Operational performance of finite-key entanglement-based satellite quantum key distribution

Establishing information-theoretically secure communication between arbitrary locations on Earth is a central goal of quantum networking, for which space-based distribution of quantum entanglement is a leading approach. Modelling and analysis of the performance of satellite entanglement pair distribution is therefore important for the architecture and design of future constellations and space systems. However, entanglement-based quantum key distribution in the absence of quantum repeaters, is especially prone to finite-key effects due to low coincident count rates compared to trusted-node single-path links. Quantifying these effects under realistic orbital conditions is therefore essential for the design of practical satellite quantum communication systems. Here, we develop a high-fidelity model of pair distribution from a low-Earth-orbit satellite that captures orbital dynamics, elevation-dependent loss, background noise, and extraneous detector effects. Integrating this with a finite-key security framework for the BBM92 protocol, we optimise the secret key length across different overpass geometries, orbital altitudes, and optical ground station (OGS) separations. We show that secure key generation remains feasible in early clear daytime conditions using baseline parameters representative of current technologies, while showing that modest system improvements could further extend daytime operation. Finally, we evaluate the annual secret key performance for representative intercity-scale OGS pairings. Our results provide quantitative performance bounds and practical design guidelines for near-term entanglement-based satellite QKD, enabling informed trade-offs between satellite payload complexity, ground infrastructure, and achievable secure key throughput.

quant-ph↗

arXiv2026

High-rate multipartite quantum secret sharing with composable security

Future quantum communication networks will conceivably support cryptographic tasks that require entanglement among more than two users. Quantum secret sharing is a prime example where entanglement provides a direct means to coordinate untrusted parties with security from eavesdropping in a multi-party setting. However, the canonical GHZ-based protocols can be vulnerable to participant attacks, in which untrusted parties try to learn the secret without collaborating. Here, we experimentally evaluate a discrete-variable $(n,n)$-threshold quantum secret-sharing protocol whose finite-key analysis provides composable security against general attacks, including participant attacks. Using two domain-engineered entangled photon pair sources, we generate 4-qubit GHZ states at rates above $5\times10^3$ fourfold events per second and a maximum asymptotic secret key rate of $750 \pm 10$ bits per second. We then distribute the state through a 4-arm star network comprising 20km of fibre in total. From the measured event rates and error statistics, we infer that a randomised 24-hour execution with the optimised basis probability would yield a composable finite-key lower bound of 8.7 Mbits, under the assumption that the measured source and device statistics remain stationary.

quant-ph↗

arXiv2026

Optimal stellar rank approximation of squeezed cat states with photon catalysis

Non-Gaussian quantum states and operations constitute essential resources for achieving quantum computational advantage and enabling quantum error correction in bosonic platforms. However, their generation in optical settings remains a challenging experimental task, often relying on probabilistic heralded protocols. Here, we present an in-depth analysis of the suitability of photon catalysis between low number Fock states and squeezed states for the generation of squeezed coherent state superpositions. We employ the stellar rank formalism to characterize the non-Gaussian complexity of input resources (including both states and measurements) and the generated states. This enables a systematic comparison of the fidelity between the catalyzed output and the target states to the maximum fidelity achievable by any protocol with the same non-Gaussian input resources. In this sense, we identify instances where the catalysis protocols considered here are provably optimal. We identify parameter regimes in which high-fidelity approximations of the target states can be achieved with minimal resources. Furthermore, we benchmark the performance of photon catalysis against Gaussian boson sampling-inspired protocols in terms of success probability and state quality, highlighting the advantages of deterministic Fock state sources. We also investigate the generation of related non-Gaussian resources including squeezed Fock states, relevant for quantum error correction. To account for experimental imperfections, we model losses across all optical modes using a Hilbert space truncation approach in the Fock basis and analyze the robustness of the generated states under realistic conditions. Our results quantify the trade-offs between non-Gaussian resource complexity, achievable fidelity, and losses in photon catalysis protocols, providing practical guidelines for near-term photonic implementations.

quant-ph↗

arXiv2026

Strategy optimization for quantum conference key agreement in asymmetric star networks

The distribution of entangled states is a core task for quantum networks facilitating quantum communication, and the use of multipartite entangled states comes with its own set of considerations. In this work, we analyze a quantum conference agreement protocol based on GHZ states in a network with a central station to which multiple clients are connected. Using comprehensive numerical simulations, we investigate how minor variations in the scenario-such as the number of parties, the number of memories, and asymmetric distances from the central station-can drastically influence the performance of the protocol. In particular, we demonstrate that it is crucial to adjust the strategy by optimizing cutoff times. From a broader perspective, we argue that numerical simulations are an indispensable tool for protocol design for devising realistic schemes for quantum communication.

quant-ph↗

arXiv2026

Certification of linear optical quantum state preparation

Certification is important to guarantee the correct functioning of quantum devices. A key certification task is verifying that a device has produced a desired output state. In this work, we study this task in the context of photonic platforms, where single photons are propagated through linear optical interferometers to create large, entangled resource states for metrology, communication, quantum advantage demonstrations and for so-called linear optical quantum computing (LOQC). This setting derives its computational power from the indistinguishability of the photons, i.e., their relative overlap. Therefore, standard fidelity witnesses developed for distinguishable particles (including qubits) do not apply directly, because they merely certify the closeness to some fixed target state. We introduce a measure of fidelity suitable for this setting and show several different ways to witness it, based on earlier proposals for measuring genuine multi-photon indistinguishability. We argue that a witness based upon the discrete Fourier transform is an optimal choice. We experimentally implement this witness and certify the fidelity of several multi-photon states.

quant-ph↗

arXiv2025

High-dimensional quantum key distribution with resource-efficient detection

While quantum key distribution (QKD) based on two-dimensional (qubit) encoding is a mature, field-tested technology, its performance is lacking for many cryptographic applications. High-dimensional encoding for QKD enables increased achievable key rates and robustness as compared to the standard qubit-based systems. However, experimental implementations of such systems are more complicated, expensive, and require careful security analysis as they are less common. In this work we present a proof of principle high-dimensional time-phase BB84 QKD experiment using only one single-photon detector per measurement basis. We employ the temporal Talbot effect to detect QKD symbols in the control basis, and show experimentally-obtained simplistic key rates for the two-dimensional and four-dimensional case, including in an urban fiber network. We present a comparison of a simplistic secret key rate obtained from a standard security proof with the one derived from a recently devised proof using a tunable beam splitter to display security issues stemming from asymmetric detection efficiencies in the two bases. Our results contribute to the discussion of the benefits of high-dimensional encoding and highlight the impact of security analysis on the achievable QKD performance.

quant-ph↗

arXiv2025

Advantage of multi-partite entanglement for quantum cryptography over long and short ranged networks

The increasing sophistication of available quantum networks has seen a corresponding growth in the pursuit of multi-partite cryptographic protocols. Whilst the use of multi-partite entanglement is known to offer an advantage in certain abstractly motivated contexts, the quest to find practical advantage scenarios is ongoing and substantial difficulties in generalising some bi-partite security proofs still remain. We present rigorous results that address both these challenges at the same time. First, we prove the security of a variant of the GHZ state based secret sharing protocol against general attacks, including participant attacks which break the security of the original GHZ state scheme. We then identify parameters for a performance advantage over realistic bottleneck networks. We show that whilst channel losses limit the advantage region to short distances over direct transmission networks, the addition of quantum repeaters unlocks the performance advantage of multi-partite entanglement over point-to-point approaches for long distance quantum cryptography.

quant-ph↗

arXiv2025

Coherently mitigating boson samplers with stochastic errors

Sampling experiments provide a viable route to show quantum advantages of quantum devices over classical computers in well-defined computational tasks. However, quantum devices such as boson samplers are susceptible to various errors, including stochastic errors due to fabrication imperfections. These cause the implemented unitary operations to deviate randomly from their intended targets, following distributions with finite variance. Whilst full-scale quantum error correction remains challenging in the near term, quantum error mitigation schemes have been devised to estimate expectation values, but it is unclear how these schemes would work for sampling experiments. In this work, we demonstrate that, given access to multiple stochastic unitaries, it is possible to mitigate the effect of these errors in sampling experiments. We adopt the unitary averaging protocol which employs multiple stochastic boson samplers to generate a distribution that approximates the ideal boson sampler distribution as the number of samplers increases. We derive a rigorous upper bound on the trace distance between the output probability distributions induced by invertible vacuum-heralded networks based on the Schur-Weyl duality. This result can be seen concretely as an error mitigation scheme in sampling experiments against stochastic errors. On a broader level, it suggests a path towards understanding error mitigation for sampling experiments and developing analysis tools for photonic circuits incorporating measurements and feed-forward. We further provide other applications of unitary averaging, including its use in implementing the linear combination of unitaries and benchmarking fabrication repeatability in linear optics.

quant-ph↗

arXiv2025

Quantum Key Distribution with Basis-Dependent Detection Probability

Quantum Key Distribution (QKD) is a promising technology for secure communication. Nevertheless, QKD is still treated with caution in certain contexts due to potential gaps between theoretical models and actual QKD implementations. A common assumption in security proofs is that the detection probability at the receiver, for a given input state, is independent of the measurement basis, which might not always be verified and could lead to security loopholes. This paper presents a security proof for QKD protocols that does not rely on the above assumption and is thus applicable in scenarios with detection probability mismatches, even when induced by the adversary. We demonstrate, through simulations, that our proof can extract positive key rates for setups vulnerable to large detection probability mismatches. This is achieved by monitoring whether an adversary is actively exploiting such vulnerabilities, instead of considering the worst-case scenario as in previous proofs. Our work highlights the importance of accounting for basis-dependent detection probabilities and provides a concrete solution for improving the security of practical QKD systems.

quant-ph↗

arXiv2024

Experimental quantum randomness enhanced by a quantum network

The certification of randomness is essential for both fundamental science and information technologies. Unlike traditional random number generators, randomness obtained from nonlocal correlations is fundamentally guaranteed to be unpredictable. However, it is also highly susceptible to noise. Here, we show that extending the conventional bipartite Bell scenario to hybrid quantum networks -- which incorporate both quantum channels and entanglement sources -- enhances the robustness of certifiable randomness. Our protocol even enables randomness to be certified from Bell-local states, broadening the range of quantum states useful for this task. Through both theoretical analysis and experimental validation in a photonic network, we demonstrate enhanced performance and improved noise resilience.

quant-ph↗

arXiv2024

ReQuSim: Faithfully simulating near-term quantum repeaters

Quantum repeaters have long been established to be essential for distributing entanglement over long distances. Consequently, their experimental realization constitutes a core challenge of quantum communication. However, there are numerous open questions about implementation details for realistic, near-term experimental setups. In order to assess the performance of realistic repeater protocols, we here present ReQuSim, a comprehensive Monte-Carlo based simulation platform for quantum repeaters that faithfully includes loss and models a wide range of imperfections such as memories with time-dependent noise. Our platform allows us to perform an analysis for quantum repeater setups and strategies that go far beyond known analytic results: This refers to being able to both capture more realistic noise models and analyse more complex repeater strategies. We present a number of findings centered around the combination of strategies for improving performance, such as entanglement purification and the use of multiple repeater stations, and demonstrate that there exist complex relationships between them. We stress that numerical tools such as ours are essential to model complex quantum communication protocols aimed at contributing to the quantum internet.

quant-ph↗

arXiv2023

Anonymous conference key agreement in linear quantum networks

Sharing multi-partite quantum entanglement between parties allows for diverse secure communication tasks to be performed. Among them, conference key agreement (CKA), an extension of key distribution to multiple parties, has received much attention recently. Interestingly, CKA can also be performed in a way that protects the identities of the participating parties, therefore providing anonymity. In this work, we propose an anonymous CKA protocol for three parties that is implemented in a highly practical network setting. Specifically, a line of quantum repeater nodes is used to build a linear cluster state among all nodes, which is then used to anonymously establish a secret key between any three of them. The nodes need only share maximally entangled pairs with their neighbours, therefore avoiding the necessity of a central server sharing entangled states. This repeater setup makes our protocol an excellent candidate for implementation in future quantum networks. We explicitly prove that our protocol protects the identities of the participants from one another and perform an analysis of the key rate in the finite regime, contributing to the quest of identifying feasible quantum communication tasks for network architectures beyond point-to-point.

quant-ph↗

arXiv2022

Simulating quantum repeater strategies for multiple satellites

A global quantum repeater network involving satellite-based links is likely to have advantages over fiber-based networks in terms of long-distance communication, since the photon losses in free space scale only polynomially with the distance -- compared to the exponential losses in optical fibers. To simulate the performance of such networks, we have introduced a scheme of large-scale event-based Monte Carlo simulation of quantum repeaters with multiple memories that can faithfully represent loss and imperfections in these memories. In this work, we identify the quantum key distribution rates achievable in various satellite and ground station geometries for feasible experimental parameters. The power and flexibility of the simulation toolbox allows us to explore various strategies and parameters, some of which only arise in these more complex, multi-satellite repeater scenarios. As a primary result, we conclude that key rates in the kHz range are reasonably attainable for intercontinental quantum communication with three satellites, only one of which carries a quantum memory.

quant-ph↗

arXiv2022

Rate limits in quantum networks with lossy repeaters

The derivation of ultimate limits to communication over certain quantum repeater networks have provided extremely valuable benchmarks for assessing near-term quantum communication protocols. However, these bounds are usually derived in the limit of ideal devices and leave questions about the performance of practical implementations unanswered. To address this challenge, we quantify how the presence of loss in repeater stations affect the maximum attainable rates for quantum communication over linear repeater chains and more complex quantum networks. Extending the framework of node splitting, we model the loss introduced at the repeater stations and then prove the corresponding limits. In the linear chain scenario we show that, by increasing the number of repeater stations, the maximum rate cannot overcome a quantity which solely depends on the loss of a single station. We introduce a way of adapting the standard machinery for obtaining bounds to this realistic scenario. The difference is that whilst ultimate limits for any strategy can be derived given a fixed channel, when the repeaters introduce additional decoherence, then the effective overall channel is itself a function of the chosen repeater strategy (e.g., one-way versus two-way classical communication). Classes of repeater strategies can be analysed using additional modelling and the subsequent bounds can be interpreted as the optimal rate within that class.

quant-ph↗

arXiv2022

Sharing classical secrets with continuous-variable entanglement: Composable security and network coding advantage

Secret sharing is a multi-party cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed). When sharing classical secrets (as opposed to quantum states), one can distinguish between protocols that leverage bi-partite quantum key distribution (QKD) and those that exploit multi-partite entanglement. The latter class are known to be vulnerable to so-called participant attacks and, while progress has been made recently, there is currently no analysis that quantifies their performance in the composable, finite-size regime which has become the gold standard for QKD security. Given this - and the fact that distributing multi-partite entanglement is typically challenging - one might well ask: Is there any virtue in pursuing multi-partite entanglement based schemes? Here, we answer this question in the affirmative for a class of secret sharing protocols based on continuous variable graph states. We establish security in a composable framework and identify a network topology, specifically a bottleneck network of lossy channels, and parameter regimes within the reach of present day experiments for which a multi-partite scheme outperforms the corresponding QKD based method in the asymptotic and finite-size setting. Finally, we establish experimental parameters where the multi-partite schemes outperform any possible QKD based protocol. This one of the first concrete compelling examples of multi-partite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication and represents a rigorous, operational benchmark to assess the usefulness of such resources.

quant-ph↗

arXiv2021

Experimental demonstration of an efficient, semi-device-independent photonic indistinguishability witness

Efficient and reliable measurements of photonic indistinguishability are crucial to solidify claims of a quantum advantage in photonics. Existing indistinguishability witnesses may be vulnerable to implementation loopholes, showing the need for a measurement which depends on as few assumptions as possible. Here, we introduce a semi-device-independent witness of photonic indistinguishability and measure it on an integrated photonic processor, certifying three-photon indistinguishability in a way that is insensitive to implementation errors in our processor.

quant-ph↗

arXiv2020

Certified Quantum Random Numbers from Untrusted Light

A remarkable aspect of quantum theory is that certain measurement outcomes are entirely unpredictable to all possible observers. Such quantum events can be harnessed to generate numbers whose randomness is asserted based upon the underlying physical processes. We formally introduce, design and experimentally demonstrate an ultrafast optical quantum random number generator that uses a totally untrusted photonic source. While considering completely general quantum attacks, we certify and generate in real-time random numbers at a rate of $8.05\,$Gb/s with a rigorous security parameter of $10^{-10}$. Our security proof is entirely composable, thereby allowing the generated randomness to be utilised for arbitrary applications in cryptography and beyond. To our knowledge, this represents the fastest composably secure source of quantum random numbers ever reported.

quant-ph↗