Covert Entanglement Generation over Bosonic Channels
- URL: http://arxiv.org/abs/2506.09474v2
- Date: Fri, 10 Oct 2025 20:04:31 GMT
- Title: Covert Entanglement Generation over Bosonic Channels
- Abstract summary: We show that a square root law (SRL) for covert entanglement generation can be generated covertly over a bosonic channel.<n>We additionally analyze the performance of covert entanglement generation using single- and dual-rail photonic qubits.
- Score: 12.651177264821476
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We explore covert entanglement generation over the lossy thermal-noise bosonic channel, which is a quantum-mechanical model of many practical settings, including optical, microwave, and radio-frequency (RF) channels. Covert communication ensures that an adversary is unable to detect the presence of transmissions, which are concealed in channel noise. We show that a square root law (SRL) for covert entanglement generation similar to that for classical communication: $L_{\rm EG}\sqrt{n}$ entangled bits (ebits) can be generated covertly and reliably over $n$ uses of a bosonic channel. We report a single-letter expression for optimal $L_{\rm EG}$ as well as an achievable method. We additionally analyze the performance of covert entanglement generation using single- and dual-rail photonic qubits, which may be more practical for physical implementation.
Related papers
- The Gain-Engineered Transmon [68.89136228609398]
We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
arXiv Detail & Related papers (2026-08-26T17:00:42Z) - Scaling-optimal purification of noisy qubit unitary channels [12.189743655923008]
We construct a superchannel that purifies the noisy unitary back to the original unknown unitary.<n>We first provide numerical evidence that sequential strategies can strictly outperform parallel strategies when the number of channel uses is finite.<n>We then provide a concrete $mathrmU(2)$-covariant parallel protocol based on a novel entanglement-assisted quantum error-correcting code that suppresses the first-order noise strength.
arXiv Detail & Related papers (2026-06-10T17:55:25Z) - Covert Signaling for Communication and Sensing over the Bosonic Channels [3.4532054548640247]
We study sparse signaling over lossy thermal-noise bosonic channels.<n>We find an unintuitive optimal quantum state structure.<n>In particular, in the low-brightness regime, the optimal signal state is a mixture of vacuum and a single photon.
arXiv Detail & Related papers (2026-05-08T17:52:18Z) - Convex combinations of bosonic pure-loss channels [4.458381173954051]
We show that entanglement distribution and quantum key distribution can always be achieved at a strictly positive rate over any fading channel.<n>We identify regimes where the coherent information of thermal inputs vanishes, while optimized non-Gaussian states achieve strictly positive values.
arXiv Detail & Related papers (2026-04-29T16:42:12Z) - Experimental Quantum Channel Purification [6.303535911712495]
Channel purification emerges as a promising technique for suppressing noise in quantum channels without complex encoding and decoding operations.<n>We introduce an experimental setup for efficient channel purification, harnessing the spatial and polarization properties of photons.
arXiv Detail & Related papers (2025-10-31T15:08:16Z) - Sequential transmission at short times [0.0]
We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels.<n>We derive an exact error bound for the infinite dimensional pure-loss channel believed to be the dominant source of noise in networks.
arXiv Detail & Related papers (2025-06-12T01:48:59Z) - Achievability of Covert Quantum Communication [2.2474167740753557]
We show the achievability of a $textitsquare root law$ (SRL) for quantum covert communication similar to that for classical.<n>We lower bound $M(n)$ with and without assistance from a two-way covert classical channel.
arXiv Detail & Related papers (2025-01-22T18:59:08Z) - String commitment from unstructured noisy channels [53.04878543623513]
Noisy channels are valuable resources for cryptography, enabling primitives like bit commitment and oblivious transfer.<n>We present a protocol for string commitment over such channels that is complete, hiding, and binding, and derive its achievable commitment rate.<n>The commitment rate coincides with previous results when the adversarial channels are the same binary symmetric channel as in the honest case.
arXiv Detail & Related papers (2024-12-31T05:28:05Z) - Diffusion-Driven Semantic Communication for Generative Models with Bandwidth Constraints [66.63250537475973]
This paper introduces a diffusion-driven semantic communication framework with advanced VAE-based compression for bandwidth-constrained generative model.<n>Our experimental results demonstrate significant improvements in pixel-level metrics like peak signal to noise ratio (PSNR) and semantic metrics like learned perceptual image patch similarity (LPIPS)
arXiv Detail & Related papers (2024-07-26T02:34:25Z) - Entangling Quantum Memories at Channel Capacity [3.152708951218456]
Entangling quantum memories, mediated by optical-frequency or microwave channels, is key for linking qubits across short and long ranges.
We show that a cavity-assisted memory-photon interface can be used to entangle matter memories with Gottesman-Kitaev-Preskill (GKP) photonic qudits.
arXiv Detail & Related papers (2024-06-06T17:22:11Z) - Rethinking Transformer-Based Blind-Spot Network for Self-Supervised Image Denoising [94.09442506816724]
Blind-spot networks (BSN) have been prevalent neural architectures in self-supervised image denoising (SSID)<n>We build a Transformer-based Blind-Spot Network (TBSN) which shows strong local fitting and global perspective abilities.
arXiv Detail & Related papers (2024-04-11T15:39:10Z) - Covert Quantum Communication Over Optical Channels [2.094817774591302]
We show a emphsquare root law (SRL) for quantum covert communication similar to that for classical.
Our proof uses photonic dual-rail qubit encoding, which has been proposed for long-range repeater-based quantum communication.
Our converse employs prior covert signal power limit results and adapts well-known methods to upper bound quantum capacity of optical channels.
arXiv Detail & Related papers (2024-01-12T18:54:56Z) - Classical capacity of quantum non-Gaussian attenuator and amplifier
channels [0.8409980020848168]
We consider a quantum bosonic channel that couples the input mode via a beam splitter or two-mode squeezer to an environmental mode prepared in an arbitrary state.
We investigate the classical capacity of this channel, which we call a non-Gaussian attenuator or amplifier channel.
arXiv Detail & Related papers (2023-12-25T06:05:51Z) - Eavesdropper localization for quantum and classical channels via
nonlinear scattering [58.720142291102135]
Quantum key distribution (QKD) offers theoretical security based on the laws of physics.
We present a novel approach to eavesdropper location that can be employed in quantum as well as classical channels.
We demonstrate that our approach outperforms conventional OTDR in the task of localizing an evanescent outcoupling of 1% with cm precision inside standard optical fibers.
arXiv Detail & Related papers (2023-06-25T21:06:27Z) - Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
This paper studies the study of fault-tolerant channel coding for quantum channels.
We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario.
We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
arXiv Detail & Related papers (2022-10-06T14:09:16Z) - Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits.
We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
arXiv Detail & Related papers (2022-08-10T17:39:21Z) - High fidelity two-qubit gates on fluxoniums using a tunable coupler [47.187609203210705]
Superconducting fluxonium qubits provide a promising alternative to transmons on the path toward large-scale quantum computing.
A major challenge for multi-qubit fluxonium devices is the experimental demonstration of a scalable crosstalk-free multi-qubit architecture.
Here, we present a two-qubit fluxonium-based quantum processor with a tunable coupler element.
arXiv Detail & Related papers (2022-03-30T13:44:52Z) - Energy-Efficient Model Compression and Splitting for Collaborative
Inference Over Time-Varying Channels [52.60092598312894]
We propose a technique to reduce the total energy bill at the edge device by utilizing model compression and time-varying model split between the edge and remote nodes.
Our proposed solution results in minimal energy consumption and $CO$ emission compared to the considered baselines.
arXiv Detail & Related papers (2021-06-02T07:36:27Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Squeezing-enhanced communication without a phase reference [2.4499092754102874]
We study the problem of transmitting classical information using quantum Gaussian states on a family of phase-noise channels with a finite decoherence time.
This problem is relevant for long-distance communication in free space and optical fiber, where phase noise is typically considered as a limiting factor.
We show that the use of part of the energy to establish a reference frame is sub-optimal even at large energies.
arXiv Detail & Related papers (2020-06-11T15:38:29Z) - Bosonic quantum communication across arbitrarily high loss channels [68.58838842613457]
A general attenuator $Phi_lambda, sigma$ is a bosonic quantum channel that acts by combining the input with a fixed environment state.
We show that for any arbitrary value of $lambda>0$ there exists a suitable single-mode state $sigma(lambda)$.
Our result holds even when we fix an energy constraint at the input of the channel, and implies that quantum communication at a constant rate is possible even in the limit of arbitrarily low transmissivity.
arXiv Detail & Related papers (2020-03-19T16:50:11Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.