arXiv subjects

Boulat A. Bash

Publications and source records attributed to Boulat A. Bash.

At least 19 recordsLinked to original sources

arXiv2026

Emulation of Entanglement Distribution Networks on a Quantum Computer

We investigate how quantum computers can be used to emulate quantum networks and study their performance under practical impairments. In particular, we evaluate how degraded entanglement and communication latency affect teleportation-based distributed multipartite-entanglement-state construction. We model imperfect Bell-pair sources using depolarizing noise channels and classical communication delays using thermal relaxation. We implement the depolarization using Stinespring dilation, randomly applied Pauli errors, and quasi-probability decompositions, evaluating the latter two on IQM quantum hardware and all three in simulation. We then study the performance of the entanglement distribution under noise generated by the aforementioned models. Although these noise models are mathematically equivalent, we find that hardware constraints result in profound differences in the corresponding results, highlighting the importance of careful experiment design.

quant-ph↗

arXiv2026

Square-Root Law for Covert Communication with Warden-Favorable Side Information

Covert communication enables Alice to transmit to Bob while making the transmission difficult for Willie to detect. We study a scalar Gaussian covert-overlay model in which Alice's low-power covert signal is superimposed on an aggregate public component generated by Alice or other trackable sources. Willie is given all physically obtainable side information, including protocol details, timing, pilots, channel estimates, and calibration information, and subtracts his best estimate of the public component before testing. Covertness is imposed on the resulting residual through a relative-entropy constraint with budget $δ$ conditioned on Willie's side information. In the stationary case, the residual under no covert transmission has variance $σ_0^2=σ_W^2+σ_e^2$, where $σ_W^2$ is Willie's receiver-noise variance and $σ_e^2$ is the irreducible cancellation error. Over $n$ channel uses, the maximal reliably transmissible covert payload is $R_C^\star\sqrt{n}(1+o(1))$ bits, where $R_C^\star=\frac{σ_0^2}{σ_B^2\ln 2}\sqrtδ$, and $σ_B^2$ is Bob's receiver-noise variance. Thus, the square-root-law (SRL) constant is governed by the variance at Willie's actual detector input, not by receiver noise alone. Low-power Gaussian signaling achieves this constant, and a matching converse establishes first-order optimality within the conditioned additive Gaussian innovation model. For known time-varying conditioned residual variances, we also derive the first-order allocation, which assigns more covert power to larger residual variances. The results require a Gaussian post-cancellation null residual with known conditioned variance; non-Gaussian residuals and fixed non-vanishing variance uncertainty are outside the scope of this paper.

cs.IT↗

arXiv2026

Covert Signaling for Communication and Sensing over the Bosonic Channels

Preventing signal detection in communication and active sensing requires careful control of transmission power. In fact, the square-root laws (SRL) for covert classical and quantum communication and sensing prescribe that the average output energy per channel use scales as $1/\sqrt{n}$ for $n$ channel uses. \emph{Diffuse} and \emph{sparse} signaling achieve this. The former transmits signals whose energy decays as $1/\sqrt{n}$ over all $n$ channel uses, which is convenient for mathematical analysis. The latter transmits constant-energy signals only approximately $\propto\sqrt{n}$ times out of $n$ channel uses, remaining silent on the others. This offers significant practical advantages in compatibility with modern digital transmitters. Here, we study sparse signaling over the lossy thermal-noise bosonic channel, which is a quantum model of many practical channels (including optical, microwave, and radio-frequency). We characterize the input signal state that minimizes detectability. We find an unintuitive optimal quantum state structure: a mixture of just two consecutive photon-number states. In particular, in the low-brightness regime, the optimal signal state is a mixture of vacuum and a single photon. Since these states are generally suboptimal for both communication and active sensing, we explore the resulting trade-off and identify input-power thresholds for transitions between optimizing covertness and performance in communication and sensing tasks.

quant-ph↗

arXiv2026

Toward Practical Two-Way Covert Communication

We study two-way covert communication schemes, where information is transmitted by passively modulating a reflected signal back to the source. We consider optical systems, described by quantum bosonic channels. While broadband classical and quantum light sources offer high covert throughput in theory, the associated mode-matching and phase-synchronization requirements make them impractical. Therefore, we employ a narrowband laser source to experimentally demonstrate a proof-of-concept two-way covert communication system, where the adversary is assumed to be quantum-capable. Furthermore, we propose a correlator-based receiver that attains the broadband gain offered by a quantum light source without the need for precise mode matching.

quant-ph↗

arXiv2026

Covert Entanglement Generation and Secrecy

We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission itself remains undetectable. The entanglement dimension follows a square root law (SRL) in the covert setting, i.e., $O(\sqrt{n})$ Einstein-Podolsky-Rosen (EPR) pairs can be distributed covertly and reliably over $n$ channel uses. We begin with covert communication of classical information under a secrecy constraint. We then leverage this result to construct a coding scheme for covert entanglement generation. Single-letter expressions are derived for the covert key-assisted and unassisted secrecy capacities, as well as for the covert entanglement-generation capacity.

quant-ph↗

arXiv2026

Toward Covert Quantum Computing

As quantum computers become available through multi-tenant cloud platforms, ensuring privacy against adversaries sharing the same quantum processing unit becomes critical. We introduce and explore \emph{covert quantum computing}, a new concept that ensures an adversary with access to all other quantum computational units (QCUs) of a quantum computer cannot detect computation on the subset that they cannot access. Analogous to covert communication, we employ information theory. However, since here the adversary controls the systems used for detection, we require a richer framework for covertness analysis that accounts for the use of quantum memories and adaptive operations. Thus, we adopt the \emph{quantum-strategy} framework used in quantum game theory and memory channel discrimination. Current quantum computers use planar graph circuit layouts and typically assume nearest-neighbor crosstalk. We derive discrete isoperimetric inequalities to show that, for an $n$-qubit circuit under this model, only $\mathcal{O}(\sqrt{n})$ border qubits provide detection information to the adversary. We then explore this scaling law on IQM's 54-qubit \emph{Emerald} processor and IBM's 156-qubit \emph{ibm\_fez} machine employing the Heron 2 architecture. We implement Ramsey experiments on qubits not used in computation, and detect nearest-neighbor crosstalk, as expected. However, we also observe long-range coupling effects beyond the border qubits, revealing a side channel that the adversary can exploit. We hypothesize that this long-range crosstalk is induced by leakage from the drive and control lines. Beyond weakening covertness, it exposes co-tenants to both adversarial and unintended crosstalk and degrades circuits that span spatially distributed qubits, motivating further work on spatial isolation and crosstalk characterization.

quant-ph↗

arXiv2026

Two-stage Quantum Estimation and the Asymptotics of Quantum-enhanced Transmittance Sensing

We consider estimation of a single unknown parameter embedded in a quantum state. Quantum Cramér-Rao bound (QCRB) is the ultimate limit of the mean squared error for any unbiased estimator. While it can be achieved asymptotically for a large number of quantum state copies, the measurement required often depends on the true value of the parameter of interest. Prior work addresses this paradox using a two-stage approach: in the first stage, a preliminary estimate is obtained by applying, on a vanishing fraction of quantum state copies, a sub-optimal measurement that does not depend on the parameter of interest. In the second stage, the preliminary estimate is used to construct the QCRB-achieving measurement that is applied to the remaining quantum state copies. This is akin to two-step estimators for classical problems with nuisance parameters. Unfortunately, the original analysis imposes conditions that severely restrict the class of classical estimators applied to the quantum measurement outcomes, hindering applications of this method. We relax these conditions to substantially broaden the class of usable estimators for single-parameter problems at the cost of slightly weakening the asymptotic properties of the two-stage method. We also account for nuisance parameters. We apply our results to obtain the asymptotics of quantum-enhanced transmittance sensing.

quant-ph↗

arXiv2026

Edge-Based Anisotropic Decoding for Generalized Bicycle Codes

Quantum low-density parity-check (QLDPC) codes provide non vanishing rates, distance scaling with the blocklength of the code, and facilitate fast iterative decoding because of their sparsity. However, in practice iterative decoding fails to exploit the distance of the code, because it cannot resolve the symmetries imposed by degeneracy. In this work, we provide a graph theoretic characterization of degeneracy for the family of generalized bicycle (GB) codes. This viewpoint shows that harmful degenerate error patterns persist whenever they remain related by automorphisms preserved by the decoder. Motivated by symmetry breaking via graph coloring, we compare three coloring approaches: no coloring, block-coloring, and edge-coloring. For GB codes, we show that edge-coloring can eliminate all automorphisms in low-weight stabilizer-induced subgraphs. We practically realize the coloring schemes as isotropic, block- anisotropic and edge-anisotropic min-sum (MS) decoding. Experimental results show that edge anisotropic min-sum decoding obtains improved performance over isotropic and block anisotropic decoding for several GB codes in a small number of iterations.

quant-ph↗

arXiv2026

Experimental Validation of Provably Covert Communication Using Software-Defined Radio

The fundamental information-theoretic limits of covert, or low probability of detection/intercept (LPD/LPI), communication have been extensively studied for over a decade, resulting in the square root law (SRL): only $L\sqrt{n}$ covert bits can be reliably transmitted over time-bandwidth product $n$, for constant $L>0$. Transmitting more either results in detection or decoding errors. The SRL imposes significant constraints on hardware realization of mathematically-guaranteed covert communication. Indeed, they preclude using standard link maintenance operations that are taken for granted in non-covert communication. Thus, experimental validation of covert communication is underexplored: to date, only two experimental studies of SRL-based covert communication are available, both focusing on optical channels. Here, we report a demonstration of provably-secure covert radio-frequency (RF) communication using software-defined radios (SDRs). This validates theoretical predictions, opens practical avenues for implementing covert communication systems, and raises further research questions.

cs.NI↗

arXiv2026

A Zero Added Loss Multiplexing (ZALM) Source Simulation

Zero Added Loss Multiplexing (ZALM) offers broadband, per channel heralded EPR pairs, with a rich parameter space that allows its performance to be tailored for specific applications. We present a modular ZALM simulator that demonstrates how design choices affect output rate and fidelity. Built in NetSquid with QSI controllers, it exposes 20+ tunable parameters, supports IDEAL and REALISTIC modes, and provides reusable components for Spontaneous Parametric Down Conversion (SPDC) sources, interference, Dense Wavelength Division Multiplexing (DWDM) filtering, fiber delay, active polarization gates, detectors, and lossy fiber. Physics based models capture Hong Ou Mandel (HOM) visibility, insertion loss, detector efficiency, gate errors, and attenuation. Using this tool, we map trade offs among fidelity, link distance, and entangled pairs per use, and show how SPDC bandwidth and DWDM grid spacing steer performance. Using the default configuration settings, average fidelity remains constant at 0.83 but the ebit rate decreases from 0.0175 at the source to 0.0 at 50 km; narrowing the SPDC degeneracy bandwidth increases the ebit rate significantly without affecting fidelity. The simulator enables codesign of source, filtering, and feedforward settings for specific quantum memories and integrates as a building block for end to end quantum network studies.

cs.NI↗

arXiv2025

Covert Entanglement Generation over Bosonic Channels

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.

quant-ph↗

arXiv2025

Entanglement Purification With Finite Latency Classical Communication in Quantum Networks

Quantum networks rely on high fidelity entangled pairs distributed to nodes, but maintaining their fidelity is challenged by environmental decoherence during storage. Entanglement purification is used to restore fidelity, but the idle periods imposed by the associated classical communication delays counteract this goal by exposing the states to further decoherence. In this work, we analyze the practical viability of entanglement purification protocols (BBPSSW, DEJMPS), under non-instantaneous classical coordination over Internet protocol (IP) communications networks. We present a comprehensive performance evaluation of these protocols in various network conditions for a range of quantum memory technologies. We employ a microscopic Lindblad treatment of the underlying quantum dynamics, and use current-generation metropolitan IP network latency statistics and parameters drawn from quantum memory testbeds. In doing so we identify the regions in which entanglement purification succeeds and fails, delineated by break-even iso-fidelity contours in the phase space. We then determine the total number of entangled pairs required to complete a multi-round purification protocol, and the steady-state throughput of entangled pairs with purified fidelities that exceed application-specific thresholds. This provides latency budgets, memory quality targets, and resource-overhead estimates for deploying purification on current and near-future networks.

cs.NI↗

arXiv2025

Experimental Covert Communication Using Software-Defined Radio

The fundamental information-theoretic limits of covert, or low probability of detection (LPD), communication have been extensively studied for over a decade, resulting in the square root law (SRL): only $L\sqrt{n}$ covert bits can be reliably transmitted over time-bandwidth product $n$, for constant $L>0$. Transmitting more either results in detection or decoding errors. The SRL imposes significant constraints on hardware realization of provably-secure covert communication. Thus, experimental validation of covert communication is underexplored: to date, only two experimental studies of SRL-based covert communication are available, both focusing on optical channels. Here, we report our initial results demonstrating the provably-secure covert radio-frequency (RF) communication using software-defined radios (SDRs). These validate theoretical predictions, open practical avenues for implementing covert communication systems, as well as raise future research questions.

cs.NI↗

arXiv2025

Fundamental Limits Of Quickest Change-point Detection With Continuous-Variable Quantum States

We generalize the quantum CUSUM (QUSUM) algorithm for quickest change-point detection, analyzed in finite dimensions by Fanizza, Hirche, and Calsamiglia (Phys. Rev. Lett. 131, 020602, 2023), to infinite-dimensional quantum systems. Our analysis relies on a novel generalization of a result by Hayashi (Hayashi, J. Phys. A: Math. Gen. 34, 3413, 2001) concerning the asymptotics of quantum relative entropy, which we establish for the infinite-dimensional setting. This enables us to prove that the QUSUM strategy retains its asymptotic optimality, characterized by the relationship between the expected detection delay and the average false alarm time for any pair of states with finite relative entropy. Consequently, our findings apply broadly, including continuous-variable systems (e.g., Gaussian states), facilitating the development of optimal change-point detection schemes in quantum optics and other physical platforms, and rendering experimental verification feasible.

quant-ph↗

arXiv2025

Identification Under the Semantic Effective Secrecy Constraint

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy communication. Additionally, we introduce the related problem of combining approximation-of-output statistics and transmission. We derive a capacity theorem for approximation-of-output statistics transmission codes. For a general model, we present lower and upper bounds on the capacity, showing that these bounds are tight for more capable wiretap channels. We also provide illustrative examples for more capable wiretap channels, along with examples of wiretap channel classes where a gap exists between the lower and upper bounds.

cs.IT↗

arXiv2025

Achievability of Covert Quantum Communication

We explore covert communication of qubits over an arbitrary quantum channel. Covert communication conceals the transmissions in the channel noise, ensuring that an adversary is unable to detect their presence. We show the achievability of a $\textit{square root law}$ (SRL) for quantum covert communication similar to that for classical: $M(n)\propto\sqrt{n}$ qubits can be transmitted covertly and reliably over $n$ uses of a general quantum channel. We lower bound $M(n)$ with and without assistance from a two-way covert classical channel. In the former case, we quantify the number of classical covert bits sufficient for our protocol.

quant-ph↗

arXiv2025

Fundamental Limits of Covert Communication over Classical-Quantum Channels

We investigate covert communication over general memoryless classical-quantum channels with fixed finite-size input alphabets. We show that the square root law (SRL) governs covert communication in this setting when product of $n$ input states is used: $L_{\rm SRL}\sqrt{n}+o(\sqrt{n})$ covert bits (but no more) can be reliably transmitted in $n$ uses of classical-quantum channel, where $L_{\rm SRL}>0$ is a channel-dependent constant that we call covert capacity. We also show that ensuring covertness requires $J_{\rm SRL}\sqrt{n}+o(\sqrt{n})$ bits secret shared by the communicating parties prior to transmission, where $J_{\rm SRL}\geq0$ is a channel-dependent constant. We assume a quantum-powerful adversary that can perform an arbitrary joint (entangling) measurement on all $n$ channel uses. We determine the single-letter expressions for $L_{\rm SRL}$ and $J_{\rm SRL}$, and establish conditions when $J_{\rm SRL}=0$ (i.e., no pre-shared secret is needed). Finally, we evaluate the scenarios where covert communication is not governed by the SRL.

quant-ph↗

arXiv2024

Routing and Spectrum Allocation in Broadband Quantum Entanglement Distribution

We investigate resource allocation for quantum entanglement distribution over an optical network. We characterize and model a network architecture that employs a single broadband quasi-deterministic time-frequency heralded Einstein-Podolsky-Rosen (EPR) pair source, and develop a routing and spectrum allocation scheme for distributing entangled photon pairs over such a network. As our setting allows separately solving the routing and spectrum allocation problems, we first find an optimal polynomial-time routing algorithm. We then employ max-min fairness criterion for spectrum allocation, which presents an NP-hard problem. Thus, we focus on approximately-optimal schemes. We compare their performance by evaluating the max-min and median number of EPR-pair rates assigned by them, and the associated Jain index. We identify two polynomial-time approximation algorithms that perform well, or better than others under these metrics. We also investigate scalability by analyzing how the network size and connectivity affect performance using Watts-Strogatz random graphs. We find that a spectrum allocation approach that achieves higher minimum EPR-pair rate can perform significantly worse when the median EPR-pair rate, Jain index, and computational resources are considered. Additionally, we evaluate the effect of the source node placement on the performance.

cs.NI↗