Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2104.04360

High Rate CV-QKD Secured Mobile WDM Fronthaul for Dense 5G Radio Networks

Dinka Milovančev·Nemanja Vokić·Fabian Laudenbach·Christoph Pacher·Hannes Hübel·Bernhard Schrenk
View original source ↗Read source document ↗Export metadata ↓

Abstract

A coherent transmission methodology for a continuous-variable quantum key distribution (CV-QKD) system based on quantum-heterodyne measurement through a coherent intradyne receiver is experimentally demonstrated in the framework of 5G mobile fronthaul links. Continuous optical carrier synchronization is obtained through training information, which is multiplexing to the quantum signal as pilot tone in both, frequency and polarization. Spectral tailoring by means of optical carrier suppression and single-sideband modulation is adopted to simultaneously mitigate crosstalk into the quantum channel and self-interference for the pilot tone, thus allowing for a high signal-to-noise ratio for this training signal. Frequency offset correction and optical phase estimation for the free-running local oscillator of the receiver is accurately performed and guarantees low-noise quantum signal reception at high symbol rates of 250 MHz and 500 MHz with additional Nyquist pulse shaping. A low excess noise in the order of 0.1% to 0.5% of shot-noise units is obtained for fiber-based transmission over a fronthaul link reach of 13.2 km. Moreover, co-existence with 11 carrier-grade classical signals is experimentally investigated. Joint signal transmission in the C-band of both, quantum signal and classical signals, is successfully demonstrated. Secure-key rates of 18 and 10 Mb/s are obtained under strict security assumptions, where Eve has control of the receiver noise, for a dark and a lit fiber link, respectively. Moreover, rates of 85 and 72 Mb/s are resulting for a trusted receiver scenario. These secure-key rates are well addressing the requirements for time-shared CV-QKD system in densified 5G radio access networks with cloud-based processing.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dinka Milovančev, Nemanja Vokić, Fabian Laudenbach, Christoph Pacher, Hannes Hübel, Bernhard Schrenk. 2021-04-09. High Rate CV-QKD Secured Mobile WDM Fronthaul for Dense 5G Radio Networks. https://doi.org/10.1109/jlt.2021.3068963

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗