Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2102.01853

Enhanced Uplink Quantum Communication with Satellites via Downlink Channels

Eduardo Villaseñor·Mingjian He·Ziqing Wang·Robert Malaney·Moe Z. Win
View original source ↗Read source document ↗Export metadata ↓

Abstract

In developing the global Quantum Internet, quantum communication with low-Earth-orbit satellites will play a pivotal role. Such communication will need to be two way: effective not only in the satellite-to-ground (downlink) channel but also in the ground-to-satellite channel (uplink). Given that losses on this latter channel are significantly larger relative to the former, techniques that can exploit the superior downlink to enhance quantum communication in the uplink should be explored. In this work we do just that - exploring how continuous variable entanglement in the form of two-mode squeezed vacuum (TMSV) states can be used to significantly enhance the fidelity of ground-to-satellite quantum-state transfer relative to direct uplink-transfer. More specifically, through detailed phase-screen simulations of beam evolution through turbulent atmospheres in both the downlink and uplink channels, we demonstrate how a TMSV teleportation channel created by the satellite can be used to dramatically improve the fidelity of uplink coherent-state transfer relative to direct transfer. We then show how this, in turn, leads to the uplink-transmission of a higher alphabet of coherent states. Additionally, we show how non-Gaussian operations acting on the received component of the TMSV state at the ground station can lead to even further enhancement. Since TMSV states can be readily produced in situ on a satellite platform and form a reliable teleportation channel for most quantum states, our work suggests future satellites forming part of the emerging Quantum Internet should be designed with uplink-communication via TMSV teleportation in mind.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Eduardo Villaseñor, Mingjian He, Ziqing Wang, Robert Malaney, Moe Z. Win. 2021-02-03. Enhanced Uplink Quantum Communication with Satellites via Downlink Channels. https://doi.org/10.1109/tqe.2021.3091709

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↗