arXiv subjects

Boulat A. Bash

Publications and source records attributed to Boulat A. Bash.

At least 37 records · Page 2Linked to original sources

arXiv2024

Control Protocol for Entangled Pair Verification in Quantum Optical Networks

We consider quantum networks, where entangled photon pairs are distributed using fibre optic links from a centralized source to entangling nodes. The entanglement is then stored (via an entanglement swap) in entangling nodes' quantum memories until used in, e.g., distributed quantum computing, quantum key distribution, quantum sensing, and other applications. Due to the fibre loss, some photons are lost in transmission. Noise in the transmission link and the quantum memory also reduces fidelity. Thus, entangling nodes must keep updated records of photon-pair arrivals to each destination, and their use by the applications. This coordination requires classical information exchange between each entangled node pair. However, the same fibre link may not admit both classical and quantum transmissions, as the classical channels can generate enough noise (i.e., via spontaneous Raman scattering) to make the quantum link unusable. Here, we consider coordinating entanglement distribution using a standard Internet protocol (IP) network instead, and propose a control protocol to enable such. We analyse the increase in latency from transmission over an IP network, together with the effect of photon loss, quantum memory noise and buffer size, to determine the fidelity and rate of entangled pairs. We characterize the relationship between the latency of the non-ideal IP network and the decoherence time of the quantum memories, providing a comparison of promising quantum memory technologies.

cs.NI↗

arXiv2024

Routing and Spectrum Allocation in Broadband Degenerate EPR-Pair Distribution

We investigate resource allocation for quantum entanglement distribution over an optical network. We characterize and model a network architecture that employs a single quasideterministic time-frequency heralded EPR-pair source, and develop a routing scheme for distributing entangled photon pairs over such a network. We focus on fairness in entanglement distribution, and compare both the performance of various spectrum allocation schemes as well as their Jain index.

cs.NI↗

arXiv2024

Covert Quantum Communication Over Optical Channels

We explore covert communication of qubits over the lossy thermal-noise bosonic channel, which is a quantum-mechanical model of many practical channels, including optical. Covert communication ensures that an adversary is unable to detect the presence of transmissions, which are concealed in channel noise. We show a \emph{square root law} (SRL) for quantum covert communication similar to that for classical: $\propto\sqrt{n}$ qubits can be transmitted covertly and reliably over $n$ uses of an optical channel. Our achievability proof uses photonic dual-rail qubit encoding, which has been proposed for long-range repeater-based quantum communication and entanglement distribution. Our converse employs prior covert signal power limit results and adapts well-known methods to upper bound quantum capacity of optical channels. Finally, we believe that the gap between our lower and upper bounds for the number of reliable covert qubits can be mitigated by improving the quantum error correction codes and quantum channel capacity bounds.

quant-ph↗

arXiv2023

Capacity Bounds for Identification With Effective Secrecy

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound is improved by applying it to a prefix channel, formed by concatenating an auxiliary channel and the actual channel. The bounds are tight if the legitimate channel is more capable than the eavesdropper's channel. An illustrative example is provided for a wiretap channel that is composed of a point-to-point channel, and a parallel, reversely degraded wiretap channel. A comparison with results for message transmission and for identification with only secrecy constraint is provided.

cs.IT↗

arXiv2023

Bayesian minimum mean square error for transmissivity sensing

We address the problem of estimating the transmissivity of the pure-loss channel from the Bayesian point of view, i.e., we consider that some prior probability distribution function (PDF) on the unknown variable is available and we employ methods to compute the Bayesian minimum mean square error (MMSE). Specifically, we consider two prior PDFs: the two-point and the beta distributions. By fixing the input mean photon number to an integer, for the two-point PDF we prove analytically that the optimal state is the Fock state and the optimal measurement is photon-counting, while for the beta PDF our numerical investigation provides evidence on the optimality of the Fock state and photon-counting. Moreover, we investigate the situation where the input mean photon number is any (non-negative) real number. For said case, we conjecture the form of the optimal input states and we study the performance of photon-counting, which is a sub-optimal yet practical measurement. Our methods can be applied for any prior PDF. We emphasize that we compute the MMSE instead of Bayesian lower bounds on the mean square error based on the Fisherian approach.

quant-ph↗

arXiv2022

Quantum-Enhanced Transmittance Sensing

We consider the problem of estimating unknown transmittance $θ$ of a target bathed in thermal background light. As quantum estimation theory yields the fundamental limits, we employ the lossy thermal-noise bosonic channel model, which describes sensor-target interaction quantum mechanically in many practical active-illumination systems (e.g., using emissions at optical, microwave, or radio frequencies). We prove that quantum illumination using two-mode squeezed vacuum (TMSV) states asymptotically achieves minimal quantum Cramér-Rao bound (CRB) over all quantum states (not necessarily Gaussian) in the limit of low transmitted power. We characterize the optimal receiver structure for TMSV input, and show its advantage over other receivers using both analysis and Monte Carlo simulation.

quant-ph↗

arXiv2022

Performance of Quantum Preprocessing under Phase Noise

Optical fiber transmission systems form the backbone of today's communication networks and will be of high importance for future networks as well. Among the prominent noise effects in optical fiber is phase noise, which is induced by the Kerr effect. This effect limits the data transmission capacity of these networks and incurs high processing load on the receiver. At the same time, quantum information processing techniques offer more efficient solutions but are believed to be inefficient in terms of size, power consumption and resistance to noise. Here we investigate the concept of an all-optical joint detection receiver. We show how it contributes to enabling higher baud-rates for optical transmission systems when used as a pre-processor, even under high levels of noise induced by the Kerr effect.

quant-ph↗

arXiv2022

Fundamental Limits of Thermal-noise Lossy Bosonic Multiple Access Channel

Bosonic channels describe quantum-mechanically many practical communication links such as optical, microwave, and radiofrequency. We investigate the maximum rates for the bosonic multiple access channel (MAC) in the presence of thermal noise added by the environment and when the transmitters utilize Gaussian state inputs. We develop an outer bound for the capacity region for the thermal-noise lossy bosonic MAC. We additionally find that the use of coherent states at the transmitters is capacity-achieving in the limits of high and low mean input photon numbers. Furthermore, we verify that coherent states are capacity-achieving for the sum rate of the channel. In the non-asymptotic regime, when a global mean photon-number constraint is imposed on the transmitters, coherent states are the optimal Gaussian state. Surprisingly however, the use of single-mode squeezed states can increase the capacity over that afforded by coherent state encoding when each transmitter is photon number constrained individually.

quant-ph↗

arXiv2021

Performance Analysis of Free-space Quantum Key Distribution Using Multiple Spatial Modes

In the diffraction-limited near-field propagation regime, free-space optical quantum key distribution (QKD) systems can employ multiple spatial modes to improve their key rate. Here, we analyze QKD using the non-orthogonal flat-top focused beams. Although they suffer from a rate penalty, their ease of implementation makes them an attractive alternative to the well-studied orthonormal Laguerre-Gauss (LG) modes. Indeed, in the presence of turbulence, the non-orthogonal modes may achieve higher QKD rate than the LG modes.

quant-ph↗

arXiv2020

Covert Capacity of Bosonic Channels

We investigate the quantum-secure covert-communication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels: $L_{\text{no-EA}}$, when Alice and Bob share only a classical secret, and $L_{\text{EA}}$, when they benefit from entanglement assistance. We find that entanglement assistance alters the fundamental scaling law for covert communication. Instead of $L_{\text{no-EA}}\sqrt{n}-r_{\text{no-EA}}(n)$, $r_{\text{no-EA}}(n)=o(\sqrt{n})$, entanglement assistance allows $L_{\text{EA}}\sqrt{n}\log n-r_{\text{EA}}(n)$, $r_{\text{EA}}(n)=o(\sqrt{n}\log n)$, covert bits to be transmitted reliably over $n$ channel uses.

quant-ph↗

arXiv2019

Fundamental limits of quantum-secure covert communication over bosonic channels

We investigate the fundamental limit of quantum-secure covert communication over the lossy thermal noise bosonic channel, the quantum-mechanical model underlying many practical channels. We assume that the adversary has unlimited quantum information processing capabilities as well as access to all transmitted photons that do not reach the legitimate receiver. Given existence of noise that is uncontrolled by the adversary, the square root law (SRL) governs covert communication: up to c*sqrt{n} covert bits can be transmitted reliably in n channel uses. Attempting to surpass this limit results in detection with unity probability as n approaches infinity. Here we present the expression for c, characterizing the SRL for the bosonic channel. We also prove that discrete-valued coherent state quadrature phase shift keying (QPSK) constellation achieves the optimal c, which is the same as that achieved by a circularly-symmetric complex-valued Gaussian prior on coherent state amplitude. Finally, while binary phase shift keying (BPSK) achieves the Holevo capacity for non-covert bosonic channels in the low received signal-to-noise ratio regime, we show that it is strictly sub-optimal for covert communication.

cs.IT↗

arXiv2018

Covert sensing using floodlight illumination

We propose a scheme for covert active sensing using floodlight illumination from a THz-bandwidth amplified spontaneous emission (ASE) source and heterodyne detection. We evaluate the quantum-estimation-theoretic performance limit of covert sensing, wherein a transmitter's attempt to sense a target phase is kept undetectable to a quantum-equipped passive adversary, by hiding the signal photons under the thermal noise floor. Despite the quantum state of each mode of the ASE source being mixed (thermal), and hence inferior compared to the pure coherent state of a laser mode, the thousand-times higher optical bandwidth of the ASE source results in achieving a substantially superior performance compared to a narrowband laser source by allowing the probe light to be spread over many more orthogonal temporal modes within a given integration time. Even though our analysis is restricted to single-mode phase sensing, this system could be applicable extendible for various practical optical sensing applications.

quant-ph↗

arXiv2018

Multi-Hop Routing in Covert Wireless Networks

In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared to the distance between Alice and Willie(s), the performance of covert communication will be degraded. In this case, multi-hop message transmission via intermediate relays can help to improve performance. Hence, in this work multi-hop covert communication over a moderate size network and in the presence of multiple collaborating Willies is considered. The relays can transmit covertly using either a single key for all relays, or different independent keys at the relays. For each case, we develop efficient algorithms to find optimal paths with maximum throughput and minimum end-to-end delay between Alice and Bob. As expected, employing multiple hops significantly improves the ability to communicate covertly versus the case of a single-hop transmission. Furthermore, at the expense of more shared key bits, analytical results and numerical simulations demonstrate that multi-hop covert communication with different independent keys at the relays has better performance than multi-hop covert communication with a single key.

cs.NI↗

arXiv2017

Bounding the quantum limits of precision for phase estimation with loss and thermal noise

We consider the problem of estimating an unknown but constant carrier phase modulation $θ$ using a general -- possibly entangled -- $n$-mode optical probe through $n$ independent and identical uses of a lossy bosonic channel with additive thermal noise. We find an upper bound to the quantum Fisher information (QFI) of estimating $θ$ as a function of $n$, the mean and variance of the total number of photons $N_{\rm S}$ in the $n$-mode probe, the transmissivity $η$ and mean thermal photon number per mode ${\bar n}_{\rm B}$ of the bosonic channel. Since the inverse of QFI provides a lower bound to the mean-squared error (MSE) of an unbiased estimator $\tildeθ$ of $θ$, our upper bound to the QFI provides a lower bound to the MSE. It already has found use in proving fundamental limits of covert sensing, and could find other applications requiring bounding the fundamental limits of sensing an unknown parameter embedded in a correlated field.

quant-ph↗

arXiv2017

Covert Communication in the Presence of an Uninformed Jammer

Recent work has established that when transmitter Alice wishes to communicate reliably to recipient Bob without detection by warden Willie, with additive white Gaussian noise (AWGN) channels between all parties, communication is limited to $\mathcal{O}(\sqrt{n})$ bits in $n$ channel uses. However, this assumes Willie has an accurate statistical characterization of the channel. When Willie has uncertainty about such and his receiver is limited to a threshold test on the received power, Alice can transmit covertly with a power that does not decrease with $n$, thus conveying $\mathcal{O}(n)$ bits covertly and reliably in $n$ uses of an AWGN channel. Here, we consider covert communication of $\mathcal{O}(n)$ bits in $n$ channel uses while generalizing the environment and removing any restrictions on Willie's receiver. We assume an uninformed "jammer" is present to help Alice, and we consider AWGN and block fading channels. In some scenarios, Willie's optimal detector is a threshold test on the received power. When the channel between the jammer and Willie has multiple fading blocks per codeword, a threshold test on the received power is not optimal. However, we establish that Alice can remain covert with a transmit power that does not decrease with $n$ even when Willie employs an optimal detector.

cs.IT↗

arXiv2017

Fundamental limits of quantum-secure covert optical sensing

We present a square root law for active sensing of phase $θ$ of a single pixel using optical probes that pass through a single-mode lossy thermal-noise bosonic channel. Specifically, we show that, when the sensor uses an $n$-mode covert optical probe, the mean squared error (MSE) of the resulting estimator $\hatθ_n$ scales as $\langle (θ-\hatθ_n)^2\rangle=\mathcal{O}(1/\sqrt{n})$; improving the scaling necessarily leads to detection by the adversary with high probability. We fully characterize this limit and show that it is achievable using laser light illumination and a heterodyne receiver, even when the adversary captures every photon that does not return to the sensor and performs arbitrarily complex measurement as permitted by the laws of quantum mechanics.

quant-ph↗

arXiv2016

Quantum Key Distribution Using Multiple Gaussian Focused Beams

The secret key rate attained by a free-space QKD system in the {\em near-field} propagation regime (relevant for $1$-$10$ km range using $\approx 7$ cm radii transmit and receive apertures and $1.55~μ$m transmission center wavelenght) can benefit from the use of multiple spatial modes. A suite of theoretical research in recent years have suggested the use of orbital-angular-momentum (OAM) bearing spatial modes of light to obtain this improvement in rate. We show that most of the aforesaid rate improvement in the near field afforded by spatial-mode multiplexing can be realized by a simple-to-build overlapping Gaussian beam array (OGBA) and a pixelated detector array. With the current state-of-the-art in OAM-mode-sorting efficiencies, the key-rate performance of our OGBA architecture could come very close to, if not exceed, that of a system employing OAM modes, but at a fraction of the cost.

quant-ph↗

arXiv2016

Covert Communication Gains from Adversary's Ignorance of Transmission Time

The recent square root law (SRL) for covert communication demonstrates that Alice can reliably transmit $\mathcal{O}(\sqrt{n})$ bits to Bob in $n$ uses of an additive white Gaussian noise (AWGN) channel while keeping ineffective any detector employed by the adversary; conversely, exceeding this limit either results in detection by the adversary with high probability or non-zero decoding error probability at Bob. This SRL is under the assumption that the adversary knows when Alice transmits (if she transmits); however, in many operational scenarios he does not know this. Hence, here we study the impact of the adversary's ignorance of the time of the communication attempt. We employ a slotted AWGN channel model with $T(n)$ slots each containing $n$ symbol periods, where Alice may use a single slot out of $T(n)$. Provided that Alice's slot selection is secret, the adversary needs to monitor all $T(n)$ slots for possible transmission. We show that this allows Alice to reliably transmit $\mathcal{O}(\min\{\sqrt{n\log T(n)},n\})$ bits to Bob (but no more) while keeping the adversary's detector ineffective. To achieve this gain over SRL, Bob does not have to know the time of transmission provided $T(n)<2^{c_{\rm T}n}$, $c_{\rm T}=\mathcal{O}(1)$.

cs.IT↗