SearcharxivSearch

arXiv · 1910.03333

Memory-assisted long-distance phase-matching quantum key distribution

Abstract

We propose a scheme that generalizes the loss scaling properties of twin-field or phase-matching quantum key distribution (QKD) related to a channel of transmission $\eta_{total}$ from $\sqrt{\eta_{total}}$ to $\sqrt[2n]{\eta_{total}}$ by employing n-1 memory stations with spin qubits and n beam-splitter stations including optical detectors. Our scheme's resource states are similar to the coherent-state-based light-matter entangled states of a previous hybrid quantum repeater, but unlike the latter our scheme avoids the necessity of employing 2n-1 memory stations and writing the transmitted optical states into the matter memory qubits. The full scaling advantage of this memory-assisted phase-matching QKD (MA-PM QKD) is obtainable with threshold detectors in a scenario with only channel loss. We mainly focus on the obtainable secret-key rates per channel use for up to n=4 including memory dephasing and for n=2 (i.e., $\sqrt[4]{\eta_{total}}$-MA-PM QKD assisted by a single memory station) for error models including dark counts, memory dephasing and depolarization, and phase mismatch. By combining the twin-field concept of interfering phase-sensitive optical states with that of storing quantum states up to a cutoff memory time, distances well beyond 700 km with rates well above $\eta_{total}$ can be reached for realistic, high-quality quantum memories (up to 1s coherence time) and modest detector efficiencies. Similarly, the standard single-node quantum repeater, scaling as $\sqrt{\eta_{total}}$, can be beaten when approaching perfect detectors and exceeding spin coherence times of 5s; beating ideal twin-field QKD requires 1s. As for further experimental simplifications, our treatment includes the notion of weak nonlinearities for the light-matter states, a discussion on the possibility of using homodyne detectors, and a comparison between sequential and parallel entanglement distributions.

Explore related subjects

Keep this discovery

BibTeXRIS

Frank Schmidt, Peter van Loock. 2019-10-08. Memory-assisted long-distance phase-matching quantum key distribution. https://doi.org/10.1103/physreva.102.042614

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

KEEP EXPLORING

Related papers

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

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

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