On Finite-Blocklength Noisy Classical-Quantum Channel Coding With Amplitude Damping Errors

• URL: http://arxiv.org/abs/2509.14852v1
• Date: Thu, 18 Sep 2025 11:16:29 GMT
• Title: On Finite-Blocklength Noisy Classical-Quantum Channel Coding With Amplitude Damping Errors
• Authors: Tamás Havas, Hsuan-Yin Lin, Eirik Rosnes, Ching-Yi Lai,
• Abstract summary: We investigate practical finite-blocklength classical-quantum channel coding over the quantum amplitude damping channel (ADC)<n>Our findings indicate that for any finite blocklength, a naive (uncoded) approach fails to offer any advantage over the ADC.
• Score: 12.479371199554214
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We investigate practical finite-blocklength classical-quantum channel coding over the quantum amplitude damping channel (ADC), aiming to transmit classical information reliably through quantum outputs. Our findings indicate that for any finite blocklength, a naive (uncoded) approach fails to offer any advantage over the ADC. Instead, sophisticated encoding strategies that leverage both classical error-correcting codes and quantum input states are crucial for realizing quantum performance gains at finite blocklengths.

Related papers

• Optimal Quantum Information Transmission Under a Continuous-Variable Erasure Channel [3.2648790955977915]
  We derive the quantum capacity and entanglement-assisted quantum capacity of the bosonic continuous-variable erasure channel.<n>We then construct random codes based on scrambling information within the typical subspace of the encoding state.<n>We find that information recovery depends on the ratio between the input and output modes.
  arXiv  Detail & Related papers  (2025-10-01T20:02:14Z)
• Efficient and optimal quantum state discrimination via quantum belief propagation [6.445605125467573]
  We present an efficient quantum algorithm for a structured state discrimination problem we call the subspace decoding task.<n>We show that the algorithm enables efficient and optimal decoding of certain families of structured classical linear codes transmitted over binary-input classical-quantum pure-state channels.
  arXiv  Detail & Related papers  (2025-09-23T18:00:07Z)
• Polar Codes for Erasure and Unital Classical-Quantum Markovian Channels [3.249879651054463]
  Arikan-constructed polar codes achieve the classical capacity for two key noise models.<n>The memory in the channel is assumed to be governed by a discrete-time, countable-state, aperiodic, irreducible, and positive recurrent Markov process.
  arXiv  Detail & Related papers  (2025-07-18T18:57:39Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• 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)
• Unital Qubit Queue-channels: Classical Capacity and Product Decoding [4.971638713979981]
  Quantum queue-channels arise naturally in the context of buffering in quantum networks. We show that the upper-bound on the capacity of an additive queue-channel has a simple expression, and is achievable for the erasure and depolarizing channels. Our results provide useful insights towards designing practical quantum communication networks.
  arXiv  Detail & Related papers  (2021-10-06T14:20:00Z)
• Towards fully-fledged quantum and classical communication over deployed fiber with up-conversion module [47.187609203210705]
  We propose and demonstrate a new method, based on up-conversion assisted receiver, for co-propagating classical light and QKD signals. Our proposal exhibits higher tolerance for noise in comparison to the standard receiver, thus enabling the distribution of secret keys in the condition of 4 dB-higher classical power.
  arXiv  Detail & Related papers  (2021-06-09T13:52:27Z)
• Dissipative Encoding of Quantum Information [0.45880283710344055]
  We explore the advantages of using Markovian evolution to prepare a quantum code in the desired logical space. We show that for stabilizer quantum codes on qubits, a finite-time dissipative encoder may always be constructed.
  arXiv  Detail & Related papers  (2021-02-08T21:07:08Z)
• 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)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.