Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · quant-ph/0507110

Differential phase shift quantum key distribution experiment over 105 km fibre

H. Takesue·E. Diamanti·T. Honjo·C. Langrock·M. M. Fejer·K. Inoue·Y. Yamamoto
View original source ↗Read source document ↗Export metadata ↓

Abstract

Since several papers appeared in 2000, the quantum key distribution (QKD) community has been well aware that photon number splitting (PNS) attack by Eve severely limits the secure key distribution distance in BB84 QKD systems with Poissonian photon sources. In attempts to solve this problem, entanglement-based QKD, single-photon based QKD, and entanglement swapping-based QKD, have been studied in recent years. However, there are many technological difficulties that must be overcome before these schemes can become practical systems. Here we report a very simple QKD system, in which secure keys were generated over >100 km fibre for the first time. We used an alternative protocol of differential phase shift keying (DPSK) but with a Poissonian source. We analysed the security of the DPSK protocol and showed that it is robust even against hybrid attacks including collective PNS attack over consecutive pulses, intercept-and-resend (I-R) attack and beamsplitting (BS) attack, because of the non-deterministic collapse of a wavefunction in a quantum measurement. To implement this protocol, we developed a new detector for the 1.5 um band based on frequency up-conversion in a periodically poled lithium niobate (PPLN) waveguide followed by a Si avalanche photodiode (APD). The use of the new detectors increased the sifted key generation rate up to > 1 Mbit/s over 30 km fibre, which is two orders of magnitude larger than the previous record.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

H. Takesue, E. Diamanti, T. Honjo, C. Langrock, M. M. Fejer, K. Inoue, Y. Yamamoto. 2005-07-12. Differential phase shift quantum key distribution experiment over 105 km fibre. https://doi.org/10.1088/1367-2630%2F7%2F1%2F232

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↗