SearcharxivSearch

arXiv subjects

Eleni Diamanti

Publications and source records attributed to Eleni Diamanti.

At least 19 recordsLinked to original sources

Experimental Private Quantum Networked Sensing

Entangling distant quantum sensors is a key application of future quantum networks, allowing for the estimation of global functions of local parameters, with precision that is not possible with stand-alone, individual, quantum sensors. However, with this advantage comes the risk of information leakage over the network via possible malicious parties. It is often particularly important that local parameters remain unknown and that only the global function is shared across the network. Recently, the notion of privacy has been introduced in this context, which ensures that only the agreed function of parameters is shared over the network, even when malicious parties control the network itself, whilst maintaining the estimation advantage. In this work, we introduce a noise-robust protocol for private quantum networked sensing, which we realise using a high-fidelity Greenberger-Horne-Zeilinger (GHZ) state source. We further run a comparative analysis and simulate attacks using three different quantum states, a four-qubit GHZ state, two Bell pairs, and a fully separable state. Our results highlight the clear advantage of GHZ states in maintaining high precision, accuracy, and privacy for the distributed estimation task.

quant-ph

Experimental Quantum Electronic Voting

Quantum information protocols offer significant advantages in properties such as security, anonymity, and privacy for communication and computing tasks. An application where guaranteeing the highest possible security and privacy is critical for democratic societies is electronic voting. As computational power continues to evolve, classical voting schemes may become increasingly vulnerable to information leakage. In this work, we present the experimental demonstration of an information-theoretically secure and efficient electronic voting protocol that, crucially, does not rely on election authorities, leveraging the unique properties of quantum states. Our experiment is based on a high-performance source of Greenberger-Horne-Zeilinger (GHZ) states and realizes a proof-of-principle implementation of the protocol in two scenarios: a configuration with four voters and two candidates employing privacy enhancement techniques and an election scenario supporting up to eight voters and sixteen candidates. The latter is particularly well-suited for secure board-level elections within organizations or small-scale governmental contexts.

quant-ph

Multiplexing of Continuous-Variable and Discrete-Variable Quantum Key Distribution Systems over Fibered and Free-Space Channels

Future quantum communication infrastructures will need to serve heterogeneous users on shared physical channels: short-range, high-throughput links favor Continuous-Variable Quantum Key Distribution (CV-QKD), while long-reach, high-loss links remain the domain of Discrete-Variable QKD (DV-QKD). Wavelength-division multiplexing (WDM) of the two protocols on a common channel would address both regimes simultaneously, but their markedly different noise sensitivities make coexistence non-trivial and, to date, experimentally untested. Here we report the first simultaneous operation of two independent CV- and DV-QKD systems on a common optical channel, using standard C-band DWDM filters at 1550.12 nm (CV) and 1545.32 nm (DV). We demonstrate joint operation on both optical fiber and a 620 m urban daylight free-space link. On fiber, the two systems exhibit the expected complementarity, crossing over at 7.56 dB of channel loss where both deliver $\sim$1.43 Mbit/s; in daylight free-space, both sustain Mbit/s key rates under time-varying atmospheric attenuation. Across all configurations we observe no measurable multiplexing-induced penalty in QBER or excess noise. These results establish hybrid CV-DV WDM as a practical building block for heterogeneous quantum communication networks, where metropolitan high-throughput users and long-reach backbone links can be served on a single physical infrastructure.

quant-ph

Fault-Tolerant Logical Operations and Efficient State Preparation in Modular Quantum Architectures with Noisy Interfaces

Modular quantum computing is a leading paradigm for scaling quantum computation beyond the resource limitations of monolithic devices. In this architecture, multiple quantum processing units (QPUs), employing identical or distinct qubit modalities, are interconnected via shared entanglement. Here, we investigate how errors at module interfaces and within individual QPUs affect fault-tolerant computation when qubits are encoded using the rotated surface code. Going beyond the logical-memory benchmark, we perform circuit-level simulations of fault-tolerant nonlocal CNOT gates implemented via lattice surgery between QPUs connected by noisy Bell pairs, and analyze the resulting logical error rates. Our results show that interfaces can tolerate noise up to an order of magnitude higher than intra-QPU noise, with only a minor reduction in the fault-tolerance threshold. We further develop an efficient protocol for preparing distributed fault-tolerant logical GHZ states, reducing ancilla overhead, time, and nonlocal Bell-pair consumption. We show that ancilla minimization in this setting is equivalent to a vertex-cover problem on an associated graph, and introduce a polynomial-time heuristic algorithm for finding low-overhead solutions. Our results provide quantitative evidence that distributed quantum error correction can enable scalable, fault-tolerant quantum computation in modular architectures.

quant-ph

Multidimensional Reconciliation in Continuous-Variable QKD: Review, Coding Schemes, and Open Source Simulation

Continuous-variable quantum key distribution (CV-QKD) requires highly efficient reconciliation techniques to operate at low signal-to-noise ratios and long distances. Multidimensional reconciliation addresses this challenge by transforming the physical Gaussian quantum channel into a virtual binary-input additive white Gaussian noise (BIAWGN) channel, enabling the use of modern errorcorrecting codes. In this work, we review the principles of multidimensional reconciliation, with a particular focus on high-dimensional constructions beyond the algebraic dimensions 1, 2, 4, 8. We describe the construction of the virtual channel, discuss practical coding schemes for reverse reconciliation, and analyse their integration with linear error-correcting codes. We also present an opensource simulation framework, HDirac, implementing multidimensional reconciliation for arbitrary dimensions, and use it to evaluate state-of-the-art LDPC codes. The results highlight key trade-offs between dimension, reconciliation efficiency, and frame error rate, providing practical guidance for CV-QKD system design.

cs.IT

Continuous-variable quantum communication

Tremendous progress in experimental quantum optics in recent decades has enabled the advent of quantum technologies, one of which is quantum communication. Aimed at novel methods for more secure or more efficient information transfer, quantum communication has developed into an active field of research and proceeds toward full-scale implementations and industrialization. Continuous-variable methods of multiphoton quantum state preparation, manipulation, and coherent detection, as well as the respective theoretical tools of phase-space quantum optics, offer the possibility of making quantum communication efficient, applicable, and accessible, thus boosting the development of the field. We review the methodology, techniques, and protocols of continuous-variable quantum communication from the first theoretical ideas through milestone implementations to recent developments. The review covers quantum key distribution as well as other quantum communication schemes that are suggested on the basis of continuous-variable states and measurements.

quant-ph

Experimental demonstration of quantum advantage in communication complexity for Euclidean distance problem

When considering the complexity of communication protocols, the aim is to perform a certain task with the minimum amount of communication resources, such as time and transmitted information. The use of quantum states may lead to an exponential advantage in the use of such resources. Here, we are interested in the task of calculating the Euclidean distance between two vectors representing real data sets. It has been previously shown that it is possible to obtain an advantage for this task based on quantum fingerprinting. This protocol is defined in the simultaneous message passing model of communication complexity, where the two parties do not communicate with each other but send data to a third party, and exploits practical fingerprints generated using trains of coherent state pulses instead of highly entangled qubit states that are hard to generate for large input sizes needed to demonstrate an exponential advantage. We perform a proof-of-principle experimental demonstration of the Euclidean distance protocol using amplitude modulation techniques for encoding non-binary data sets and high-performance superconducting nanowire single-photon detectors required to increase the accessible input size. We show a quantum advantage in transmitted information surpassing the best classical protocol for an input size of $10^8$, for diverse types of data sets, including those corresponding to real grayscale images, and with reasonable precision and error bounds. Our results highlight the potential of quantum communication complexity for use in a broad set of applications.

quant-ph

A Practical Protocol for Quantum Oblivious Transfer from One-Way Functions

We present a new simulation-secure quantum oblivious transfer (QOT) protocol based on one-way functions in the plain model. With a focus on practical implementation, our protocol surpasses prior works in efficiency, promising feasible experimental realization. We address potential experimental errors and their correction, offering analytical expressions to facilitate the analysis of the required quantum resources. Technically, we achieve simulation security for QOT through an equivocal and relaxed-extractable quantum bit commitment.

quant-ph

Terrestrial readiness campaign for space-to-ground quantum communications with a space-qualified entangled photon-pair system

Realizing a global quantum internet relies on the deployment of robust satellite-based entanglement distribution links. While pioneering demonstrations have established the feasibility of such links, the transition to operational infrastructure demands the validation of robust, integrated space-to-ground architectures. Here, we report on a free-space Quantum Key Distribution experiment conducted over a 1.8 km free-space link using an engineering model of the quantum payload onboard the SpeQtre satellite and the Abu Dhabi Quantum Optical Ground Station. By implementing a BBM92 protocol with polarization-entangled photons, a secret key rate of approximately 7.56 kbps with a mean quantum bit error rate of 4.78%+-0.24% was produced. The deployed system featured spectral and spatial filtering approaches identical to those in the space segment, thus validating the link budget and background rejection capabilities under realistic atmospheric conditions. These results confirm the operational compatibility between the ground and space segments, establishing a critical performance baseline for the SpeQtre mission and future space-based, large-scale quantum networks.

quant-ph

Unconditional Authentication in Quantum Key Distribution via Hybrid Entangled Physical Unclonable Functions

Quantum Key Distribution (QKD) enables Information-Theoretically Secure (ITS) key exchange, robust even against future quantum computing threats. However, a fundamental limitation of QKD is the requirement for an authenticated classical channel, which necessitates a pre-shared secret key. In this work, we address this challenge by adopting a Hybrid Entangled Physical Unclonable Function (PUF) protocol for authentication. We demonstrate that this PUF-based method generates an ITS initial key under minimal explicit hardware assumptions. This approach allows us to experimentally perform a fully ITS-authenticated entanglement-based QKD protocol that relies solely on such assumptions, effectively eliminating the need for pre-shared secrets. This represents a significant step towards the practical realization of quantum network protocols using lightweight, readily available hardware assumptions, without weakening security guarantees.

quant-ph

Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers

Just as classical computing relies on distributed systems, the quantum computing era requires new kinds of infrastructure and software tools. Quantum networks will become the backbone of hybrid, quantum-augmented data centers, in which quantum algorithms are distributed over a local network of quantum processing units (QPUs) interconnected via shared entanglement. In this context, it is crucial to develop methods and software that minimize the number of inter-QPU communications. Here we describe key features of the quantum compiler araQne, which is designed to minimize distribution cost, measured by the number of entangled pairs required to distribute a monolithic quantum circuit using gate teleportation protocols. We establish the crucial role played by circuit reordering strategies, which strongly reduce the distribution cost compared to a baseline approach.

quant-ph

Quantum bounds for compiled XOR games and $d$-outcome CHSH games

Nonlocal games play a crucial role in quantum information theory and have numerous applications in certification and cryptographic protocols. Kalai et al. (STOC 2023) introduced a procedure to compile a nonlocal game into a single-prover interactive proof, using a quantum homomorphic encryption scheme, and showed that their compilation method preserves the classical bound of the game. Natarajan and Zhang (FOCS 2023) then showed that the quantum bound is preserved for the specific case of the CHSH game. Extending the proof techniques of Natarajan and Zhang, we show that the compilation procedure of Kalai et al. preserves the quantum bound for two classes of games: XOR games and d-outcome CHSH games. We also establish that, for any pair of qubit measurements, there exists an XOR game such that its optimal winning probability serves as a self-test for that particular pair of measurements.

quant-ph

Analysis of untrusted-node quantum key distribution from a geostationary satellite

In pursuit of a global quantum key distribution (QKD) network, a service based on untrusted nodes on geostationary satellites could offer wide coverage, continuous operation, and enhanced security compared to the trusted node alternative. Although this scenario has been studied for entanglement-based protocols, such an approach would require large-area telescopes both on the ground and in space. In this work, we analyze the performance of two QKD protocols well adapted to this scenario, namely twin-field (TF) and mode-pairing (MP) QKD, which exhibit high resilience to high-loss channels. Leveraging an in-depth simulation of communication channels corrected with adaptive optics, we assess the expected secret key rates for both protocols in a configuration involving two 50 cm telescopes on board the satellite and ground-based telescopes ranging from 20 cm to 1 m in aperture. Our results show that, in the best case and considering realistic detectors, it is possible to achieve secret key rates on the order of a few hundred bit/s for both TF and MP-QKD. We show, notably, that secret key generation is potentially feasible even with 20 cm ground telescopes, highlighting the high scalability potential of such a configuration.

quant-ph

Translating Bell Non-Locality to Prepare-and-Measure Scenarios under Dimensional Constraints

Understanding the connections between different quantum information protocols has been proven fruitful for both theoretical insights and experimental applications. In this work, we explore the relationship between non-local and prepare-and-measure scenarios, proposing a systematic way to translate bipartite Bell inequalities into dimensionally-bounded prepare-and-measure tasks. We identify sufficient conditions under which the translation preserves the quantum bound and self-testing properties, enabling a wide range of certification protocols originally developed for the non-local setting to be adapted to the sequential framework of prepare-and-measure with a dimensional bound. While the dimensionality bound is not device-independent, it still is a practical and experimentally reasonable assumption in many cases of interest. In some instances, we find new experimentally-friendly certification protocols. In others, we demonstrate equivalences with already known prepare-and-measure protocols, where self-testing results were previously established using alternative mathematical methods. Our results unify different quantum correlation frameworks, and contribute to the ongoing research effort of studying the interplay between parallel and sequential protocols.

quant-ph

Quantum Key Distribution with Efficient Post-Quantum Cryptography-Secured Trusted Node on a Quantum Network

Quantum Key Distribution (QKD) enables two distant users to exchange a secret key with information-theoretic security, based on the fundamental laws of quantum physics. While it is arguably the most mature application of quantum cryptography, it has inherent limitations in the achievable distance and the scalability to large-scale infrastructures. While the applicability of QKD can be readily increased with the use of intermediary trusted nodes, this adds additional privacy requirements on third parties. In this work, we present an efficient scheme leveraging a trusted node with lower privacy requirements thanks to the use of post-quantum cryptographic techniques, and implement it on a deployed fiber optic quantum communication network in the Paris area.

quant-ph

Integrated InP-based transmitter for Continuous-Variable Quantum Key Distribution

Developing quantum key distribution (QKD) systems using monolithic photonic integrated circuits (PICs) can accelerate their adoption by a wide range of markets, thanks to the potential reduction in size, complexity of the overall system, power consumption, and production cost. In this work, we design, fabricate and characterize an InP-based PIC transmitter for continuous-variable (CV) QKD applications. In a proof-of-principle experiment implementing a pulsed Gaussian-modulated coherent state (GMCS) CV-QKD protocol over an optical fiber channel of 11 km, the system showed a performance compatible with a secret key rate of 78 kbps in the asymptotic regime. These results show the potential of InP technologies to integrate CV-QKD systems onto a monolithic platform.

quant-ph

QOSST: A Highly-Modular Open Source Platform for Experimental Continuous-Variable Quantum Key Distribution

Quantum Key Distribution (QKD) enables secret key exchange between two remote parties with information-theoretic security rooted in the laws of quantum physics. Encoding key information in continuous variables (CV), such as the values of quadrature components of coherent states of light, brings implementations much closer to standard optical communication systems, but this comes at the price of significant complexity in the digital signal processing techniques required for operation at low signal-to-noise ratios. In this work, we wish to lower the barriers to entry for CV-QKD experiments associated to this difficulty by providing a highly modular, open source software that is in principle hardware agnostic and can be used in multiple configurations. We benchmarked this software, called QOSST, using an experimental setup with a locally generated local oscillator, frequency multiplexed pilots and RF-heterodyne detection, and obtained state-of-the-art secret key rates of the order of Mbit/s over metropolitan distances at the asymptotic limit. We hope that QOSST can be used to stimulate further experimental advances in CV-QKD and be improved and extended by the community to achieve high performance in a wide variety of configurations.

quant-ph

Increasing the secret key rate of satellite-to-ground entanglement-based QKD assisted by adaptive optics

Future quantum networks will be composed of both terrestrial links for metropolitan and continent-scale connections and space-based links for global coverage and infrastructure resilience. However, the propagation of quantum signals through the atmosphere is severely impacted by the effects of turbulence. This is even more the case for entanglement-based quantum communication protocols requiring two free-space channels to be considered simultaneously. In this work, we assess the advantage of turbulence mitigation by adaptive optics, in particular during daytime link operation, so as to increase the coupling of the received signal into an optical fiber. We show in particular that this improves the performance of entanglement-based quantum key distribution by up to a few hundred bits per second when compared with the uncorrected scenario

quant-ph