Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.22985

Orthogonal Frequency Division Multiplexing Continuous Variable Terahertz Quantum Key Distribution

Mingqi Zhang·Kaveh Delfanazari
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a novel continuous-variable quantum key distribution (CVQKD) protocol that employs orthogonal frequency-division multiplexing (OFDM) in the terahertz (THz) band to enable high-throughput and secure quantum communication. By encoding quantum information across multiple subcarriers, the protocol enhances spectral efficiency and mitigates channel dispersion and atmospheric attenuation. We present a comprehensive security analysis under collective Gaussian attacks, considering both terrestrial free-space channels, accounting for humidity-induced absorption, and inter-satellite links, incorporating realistic intermodulation noise. Simulations show secret key rates (SKR) reaching ~72 bits per channel use in open-air conditions. While intermodulation noise imposes trade-offs, optimised modulation variance enables resilience and secure communication range. The maximum terrestrial quantum link extends up to 4.5 m due to atmospheric THz absorption, whereas inter-satellite links can support secure communication over distances exceeding 100 km, owing to minimal propagation channel losses in space. We evaluate the practical implementation of our protocol using recently developed on-chip coherent THz sources based on superconducting Josephson junctions. These compact, voltage-tunable emitters produce wideband coherent radiation, making them ideal candidates for integration in scalable quantum networks. By incorporating their characteristics into our simulations, we assess secure key generation under various environmental conditions. Our results show secure communication over distances up to 3 m in open air, and up to 26 km in cryogenic or vacuum environments. This work advances the prospect of compact, high-capacity CVQKD systems for both terrestrial and space-based THz quantum communication.

Explore related subjects

quant-phcs.SYeess.SYphysics.app-phphysics.ins-detphysics.optics

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mingqi Zhang, Kaveh Delfanazari. 2025-06-28. Orthogonal Frequency Division Multiplexing Continuous Variable Terahertz Quantum Key Distribution. https://arxiv.org/abs/2506.22985

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↗