Belief Propagation with Quantum Messages for Quantum-Enhanced Classical Communications

Abstract

For space-based laser communications, when the mean photon number per received optical pulse is much smaller than one, there is a large gap between communications capacity achievable with a receiver that performs individual pulse-by-pulse detection, and the quantum-optimal "joint-detection receiver" that acts collectively on long codeword-blocks of modulated pulses; an effect often termed "superadditive capacity". In this paper, we consider the simplest scenario where a large superadditive capacity is known: a pure-loss channel with a coherent-state binary phase-shift keyed (BPSK) modulation. The two BPSK states can be mapped conceptually to two non-orthogonal states of a qubit, described by an inner product that is a function of the mean photon number per pulse. Using this map, we derive an explicit construction of the quantum circuit of a joint-detection receiver based on a recent idea of "belief-propagation with quantum messages" (BPQM) (arXiv:1607.04833). We quantify its performance improvement over the Dolinar receiver that performs optimal pulse-by-pulse detection, which represents the best "classical" approach. We analyze the scheme rigorously and show that it achieves the quantum limit of minimum average error probability in discriminating 8 (BPSK) codewords of a length-5 binary linear code with a tree factor graph. Our result suggests that a BPQM-receiver might attain the Holevo capacity of this BPSK-modulated pure-loss channel. Moreover, our receiver circuit provides an alternative proposal for a quantum supremacy experiment, targeted at a specific application that can potentially be implemented on a small, special-purpose, photonic quantum computer capable of performing cat-basis universal qubit logic.

arXiv commentv2: To appear in npj Quantum Information; see "supplementary_material.pdf" for additional content. Main paper: 22 pages single-column, 11 figures, includes simulations. Comments welcome!

References in corpus (21)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
• The dynamics of message passing on dense graphs, with applications to compressed sensing
• Quantum computation with optical coherent states
• Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC
• Schrodinger cats and their power for quantum information processing
• Quantum Graphical Models and Belief Propagation
• Structured optical receivers to attain superadditive capacity and the Holevo limit
• Quantum channels showing superadditivity in capacity
• Polar codes for classical-quantum channels
• Quantum Belief Propagation
• Threshold Saturation for Spatially-Coupled LDPC and LDGM Codes on BMS Channels
• Polar coding to achieve the Holevo capacity of a pure-loss optical channel
• Achieving minimum-error discrimination of an arbitrary set of laser-light pulses
• Optimal Measurements for Symmetric Quantum States with Applications to Optical Communication
• Belief propagation decoding of quantum channels by passing quantum messages
• Duality of channels and codes
• Fundamental limitations for measurements in quantum many-body systems
• Low-cost limit of classical communication with restricted quantum measurements
• A Semiclassical Proof of Duality Between the Classical BSC and the Quantum PSC
• A Message-Passing Algorithm for Graph Isomorphism

Cited by in corpus (9)

• Entanglement-Based Quantum Information Technology
• Quantum Receiver Enhanced by Adaptive Learning
• Demonstration of quantum advantage by a joint detection receiver for optical communications using quantum belief propagation on a trapped-ion device
• Quantum message-passing algorithm for optimal and efficient decoding
• Transceiver designs to attain the entanglement assisted communications capacity
• Decoherence and Quantum Error Correction for Quantum Computing and Communications
• A Semiclassical Proof of Duality Between the Classical BSC and the Quantum PSC
• Explicit decoders using fixed-point amplitude amplification based on QSVT
• Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing