Searcharxiv⌕ Search

arXiv subjects

Dina Abdelhadi

Publications and source records attributed to Dina Abdelhadi.

5 recordsLinked to original sources

Entanglement sharing across a damping-dephasing channel

Entanglement distillation is a fundamental information processing task whose implementation is key to quantum communication and modular quantum computing. Noise experienced by such communication and computing platforms occurs not only in the form of Pauli noise such as dephasing (sometimes called $T_2$) but also non-Pauli noise such as amplitude damping (sometimes called $T_1$). We initiate a study of practical and asymptotic distillation over what we call the joint damping-dephasing noise channel. In the practical setting, we propose a distillation scheme that completely isolates away the damping noise. In the asymptotic setting we derive lower bounds on the entanglement sharing capacities including the coherent and reverse coherent information. Like the protocol achieving the reverse coherent information, our scheme uses only backward classical communication. However, for realistic damping noise ($T_1 \neq 2T_2$) our strategy can exceed the reverse coherent strategy, which is the best known for pure damping. In the forward communication setting we numerically exceed the single-letter coherent information strategy by observing the channel displays non-additivity at the two-letter level. The work shows non-additivity can also be found in realistic noise models with magnitudes of non-additivity similar to those found in more idealized noise channels.

quant-ph↗

Reed-Muller Codes for Quantum Pauli and Multiple Access Channels

Reed-Muller (RM) codes have undergone significant analytical advancements over the past decade, particularly for binary memoryless symmetric (BMS) channels. We extend the scope of RM codes development and analysis to multiple-access channels (MACs) and quantum Pauli channels, leveraging a unified approach. Specifically, we first derive the achievable rate region for RM codes on so-called Q-MACs, a class of MACs with additive correlated noise. This is achieved via a generalization of the bending and boosting arguments defined in arXiv:2304.02509. We then put forward a connection between the rate region of these QMACs and quantum RM codes designed for Pauli noise channels. This connection highlights a universality property of quantum RM codes, demonstrating their rate-optimal performance across a range of channel parameters, rather than for a single Pauli channel.

cs.IT↗

Interpolation of Quantum Polar Codes and Quantum Reed-Muller Codes

Good quantum error-correcting codes that fulfill practical considerations, such as simple encoding circuits and efficient decoders, are essential for functional quantum information processing systems. Quantum polar codes satisfy some of these requirements but lack certain critical features, thereby hindering their widespread use. Existing constructions either require entanglement assistance to produce valid quantum codes, suffer from poor finite-size performance, or fail to tailor polar codes to the underlying channel properties. Meanwhile, quantum Reed-Muller (RM) codes demonstrate strong performance, though no known efficient decoding algorithm exists for them. In this work, we propose strategies to interpolate between quantum polar codes and quantum RM codes, thus addressing the challenges of designing valid quantum polar codes without entanglement assistance and improving finite-size code performance.

quant-ph↗

Adaptive Channel Reshaping for Improved Entanglement Distillation

Quantum communication and computation heavily rely on entanglement distillation protocols. There is a plethora of distillation protocols for Pauli channels and also for some non-Pauli channels. However, an effort to relate the effectiveness of these protocols has been missing. For most quantum channels, the gap between the existing lower and upper bounds on distillation rates is substantial, and improvements of achievable rates have been stagnant for decades. In this work, we improve the best known distillation lower bounds, for both the amplitude damping and depolarizing channels. We build on a key observation that distillation protocols reshape several uses of a very noisy channel into a better effective channel. We apply this channel processing in an adaptive and recurrent manner. For the amplitude damping channel, our suggested protocol reshapes the channel into an erasure channel, achieving rates exceeding the best known lower bound given by the channel's reverse coherent information. For the depolarizing channel, we introduce the Greedy recurrence protocol with proven performance guarantees and construct a combined protocol improving upon previously known distillation rates. Improved bounds on attainable distillation rates give insights for both practical implementations and theoretical understanding of quantum information processing.

quant-ph↗

On the Second-Order Asymptotics of the Partially Smoothed Conditional Min-Entropy & Application to Quantum Compression

Recently, Anshu et al. introduced "partially" smoothed information measures and used them to derive tighter bounds for several information-processing tasks, including quantum state merging and privacy amplification against quantum adversaries [arXiv:1807.05630 [quant-ph]]. Yet, a tight second-order asymptotic expansion of the partially smoothed conditional min-entropy in the i.i.d. setting remains an open question. Here we establish the second-order term in the expansion for pure states, and find that it differs from that of the original "globally" smoothed conditional min-entropy. Remarkably, this reveals that the second-order term is not uniform across states, since for other classes of states the second-order term for partially and globally smoothed quantities coincides. By relating the task of quantum compression to that of quantum state merging, our derived expansion allows us to determine the second-order asymptotic expansion of the optimal rate of quantum data compression. This closes a gap in the bounds determined by Datta and Leditzky [IEEE Trans. Inf. Theory 61, 582 (2015)], and shows that the straightforward compression protocol of cutting off the eigenspace of least weight is indeed asymptotically optimal at second order.

quant-ph↗