Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1610.05676 · Physical Review A

Multiphase Hadamard receivers for classical communication on lossy bosonic channels

Matteo Rosati, Andrea Mari, Vittorio Giovannetti

Published Dec 20, 2016• 25 citations
arXivHTMLPDF

Abstract

A scheme for transferring classical information over a lossy bosonic channel is proposed by generalizing the proposal presented by Guha [Phys. Rev. Lett. 106, 240502 (2011)]. It employs code words formed by products of coherent states of fixed mean photon number with multiple phases which, through a passive unitary transformation, reduce to a pulse-position modulation code with multiple pulse phases. The maximum information rate achievable with optimal, yet difficult to implement detection schemes is computed and shown to saturate the classical capacity of the channel in the low-energy regime. An easy to implement receiver based on a conditional Dolinar detection scheme is also proposed, finding that while suboptimal, it allows for improvements in an intermediate photon-number regime with respect to previous proposals.

DOI
10.1103/physreva.94.062325

Related papers

Quantum memory receiver for superadditive communication using binary coherent states

Aleksandra Klimek, Michał Jachura, Wojciech Wasilewski +1 more

We propose a simple architecture based on multimode quantum memories for collective readout of classical information keyed using a pair coherent states, exemplified by the well-known binary phase shift keying format. Such a configuration enables demonstration of the superadditivity effect in classical communication over quantum channels, where the transmission rate becomes enhanced through joint detection applied to multiple channel uses. The proposed scheme relies on the recently introduced idea to prepare Hadamard sequences of input symbols that are mapped by a linear optical transformation onto the pulse position modulation format [Guha, S. Phys. Rev. Lett. 2011, 106, 240502]. We analyze two versions of readout based on direct detection and an optional Dolinar receiver which implements the minimum-error measurement for individual detection of a binary coherent state alphabet.

arXiv:1512.06561•Journal of Modern Optics•Apr 12, 2016•18 citations

Probabilistic pulse-position modulation for classical communication on quantum channels

Farzad Kianvash, Matteo Rosati

Classical communication over lossy quantum channels is an essential topic in quantum information theory, with practical implications for optical-fiber and free-space communications. Multiphase Hadamard codes, based on coherent-state binary phase-shift keying (BPSK) modulation and decoded using vacuum-or-pulse (VP) detectors, offer a promising approach for achieving high communication rates while relying only on linear optics and single-photon detectors (SPDs). However, their performance does not reach the ultimate Holevo limit. In this work, we propose a generalization of Hadamard codes that distributes the signal across multiple modes with optimized probabilities, rather than concentrating it in a single mode, dubbed probabilistic pulse-position modulation (PPPM). We derive an achievable communication rate, demonstrating that our PPPM can outperform traditional Hadamard codes in certain intermediate energy regimes.

arXiv:2502.04856•Physical Review A•May 23, 2025•3 citations

Capacity of optical communications over a lossy bosonic channel with a receiver employing the most general coherent electro-optic feedback control

Hye Won Chung, Saikat Guha, Lizhong Zheng

We study the problem of designing optical receivers to discriminate between multiple coherent states using coherent processing receivers---i.e., one that uses arbitrary coherent feedback control and quantum-noise-limited direct detection---which was shown by Dolinar to achieve the minimum error probability in discriminating any two coherent states. We first derive and reinterpret Dolinar's binary-hypothesis minimum-probability-of-error receiver as the one that optimizes the information efficiency at each time instant, based on recursive Bayesian updates within the receiver. Using this viewpoint, we propose a natural generalization of Dolinar's receiver design to discriminate $M$ coherent states, each of which could now be a codeword, i.e., a sequence of $N$ coherent states, each drawn from a modulation alphabet. We analyze the channel capacity of the pure-loss optical channel with a general coherent-processing receiver in the low-photon number regime and compare it with the capacity achievable with direct detection and the Holevo limit (achieving the latter would require a quantum joint-detection receiver). We show compelling evidence that despite the optimal performance of Dolinar's receiver for the binary coherent-state hypothesis test (either in error probability or mutual information), the asymptotic communication rate achievable by such a coherent-processing receiver is only as good as direct detection. This suggests that in the infinitely long codeword limit, all potential benefits of coherent processing at the receiver can be obtained by designing a good code and direct detection, with no feedback within the receiver.

arXiv:1610.07578•Physical Review A•Jul 17, 2017•12 citations

Multi-pulse Fourier codes for bit transmission at the quantum limit

Matteo Rosati

Abstract Bit-transmission can be enhanced by the use of quantum detection techniques, realizing a joint-detection receiver (JDR) that is able to decode transmitted signals via a collective operation and achieve the Holevo channel capacity. Explicit JDR designs proposed so far employ the Hadamard or Fourier transform to perform a phase-to-intensity translation of the information encoding, effectively falling in the class of on-off-keying (OOK) modulation techniques; they improve over classical decoders but fall short of the Holevo capacity, particularly at large signal mean photon number n ≳ 1 . Here we introduce new families of decoders based on multi-pulse and multi-level codes. We compute the rate of these codes exactly, and provide a comprehensive study of their performance. We show that multi-pulse codes can approach the rate of OOK closely, providing a simplified design for quantum-enhanced communication in the photon-starved regime; furthermore, multi-level codes can approach generalized-OOK strategies with multiple pulse types, thus they can be employed in the larger photon-number regime.

New Journal of Physics•Jan 1, 2025•0 citations

Quantum-message-passing receiver for quantum-enhanced classical communications

Narayanan Rengaswamy, Henry D. Pfister, Kaushik Parasuram Seshadreesan +1 more

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---measured in bits communicated per pulse---achievable with a receiver that detects (converts from optical to electrical domain) each modulated pulse one at a time, versus with the quantum-optimal joint-detection receiver that acts on a long codeword comprised of $n$ modulated pulses; an effect often termed superadditive capacity. The action of this receiver cannot be described as the detection of each individual pulse, interspersed with classical feedforward and soft-information post-processing. 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 single qubit, described by an inner product that is a function of the mean photon number of each BPSK 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 analyze this 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. We quantify its performance improvement over the (Dolinar) receiver that optimally detects one pulse at a time. Our result suggests that a BPQM-receiver might attain the Holevo capacity, the quantum limit of classical communication capacity, of this BPSK-modulated pure-loss channel. This suggests a new application for a small, special-purpose, photonic quantum computer capable of so-called cat-basis universal qubit logic.

•Mar 9, 2020•1 citation

Belief propagation with quantum messages for quantum-enhanced classical communications

Narayanan Rengaswamy, Kaushik Parasuram Seshadreesan, Saikat Guha +1 more

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). 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:2003.04356•npj Quantum Information•Jun 15, 2021•22 citations
A scheme for transferring classical information over a lossy bosonic channel is proposed by generalizing the proposal presented by Guha [Phys. Rev. Lett. 106, 240502 (2011)]. It employs code words formed by products of coherent states of fixed mean photon number with multiple phases which, through a passive unitary transformation, reduce to a pulse-position modulation code with multiple pulse phases. The maximum information rate achievable with optimal, yet difficult to implement detection schemes is computed and shown to saturate the classical capacity of the channel in the low-energy regime. An easy to implement receiver based on a conditional Dolinar detection scheme is also proposed, finding that while suboptimal, it allows for improvements in an intermediate photon-number regime with respect to previous proposals.
We propose a simple architecture based on multimode quantum memories for collective readout of classical information keyed using a pair coherent states, exemplified by the well-known binary phase shift keying format. Such a configuration enables demonstration of the superadditivity effect in classical communication over quantum channels, where the transmission rate becomes enhanced through joint detection applied to multiple channel uses. The proposed scheme relies on the recently introduced idea to prepare Hadamard sequences of input symbols that are mapped by a linear optical transformation onto the pulse position modulation format [Guha, S. Phys. Rev. Lett. 2011, 106, 240502]. We analyze two versions of readout based on direct detection and an optional Dolinar receiver which implements the minimum-error measurement for individual detection of a binary coherent state alphabet.
Classical communication over lossy quantum channels is an essential topic in quantum information theory, with practical implications for optical-fiber and free-space communications. Multiphase Hadamard codes, based on coherent-state binary phase-shift keying (BPSK) modulation and decoded using vacuum-or-pulse (VP) detectors, offer a promising approach for achieving high communication rates while relying only on linear optics and single-photon detectors (SPDs). However, their performance does not reach the ultimate Holevo limit. In this work, we propose a generalization of Hadamard codes that distributes the signal across multiple modes with optimized probabilities, rather than concentrating it in a single mode, dubbed probabilistic pulse-position modulation (PPPM). We derive an achievable communication rate, demonstrating that our PPPM can outperform traditional Hadamard codes in certain intermediate energy regimes.
We study the problem of designing optical receivers to discriminate between multiple coherent states using coherent processing receivers---i.e., one that uses arbitrary coherent feedback control and quantum-noise-limited direct detection---which was shown by Dolinar to achieve the minimum error probability in discriminating any two coherent states. We first derive and reinterpret Dolinar's binary-hypothesis minimum-probability-of-error receiver as the one that optimizes the information efficiency at each time instant, based on recursive Bayesian updates within the receiver. Using this viewpoint, we propose a natural generalization of Dolinar's receiver design to discriminate MMM coherent states, each of which could now be a codeword, i.e., a sequence of NNN coherent states, each drawn from a modulation alphabet. We analyze the channel capacity of the pure-loss optical channel with a general coherent-processing receiver in the low-photon number regime and compare it with the capacity achievable with direct detection and the Holevo limit (achieving the latter would require a quantum joint-detection receiver). We show compelling evidence that despite the optimal performance of Dolinar's receiver for the binary coherent-state hypothesis test (either in error probability or mutual information), the asymptotic communication rate achievable by such a coherent-processing receiver is only as good as direct detection. This suggests that in the infinitely long codeword limit, all potential benefits of coherent processing at the receiver can be obtained by designing a good code and direct detection, with no feedback within the receiver.
Abstract Bit-transmission can be enhanced by the use of quantum detection techniques, realizing a joint-detection receiver (JDR) that is able to decode transmitted signals via a collective operation and achieve the Holevo channel capacity. Explicit JDR designs proposed so far employ the Hadamard or Fourier transform to perform a phase-to-intensity translation of the information encoding, effectively falling in the class of on-off-keying (OOK) modulation techniques; they improve over classical decoders but fall short of the Holevo capacity, particularly at large signal mean photon number n ≳ 1 . Here we introduce new families of decoders based on multi-pulse and multi-level codes. We compute the rate of these codes exactly, and provide a comprehensive study of their performance. We show that multi-pulse codes can approach the rate of OOK closely, providing a simplified design for quantum-enhanced communication in the photon-starved regime; furthermore, multi-level codes can approach generalized-OOK strategies with multiple pulse types, thus they can be employed in the larger photon-number regime.
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---measured in bits communicated per pulse---achievable with a receiver that detects (converts from optical to electrical domain) each modulated pulse one at a time, versus with the quantum-optimal joint-detection receiver that acts on a long codeword comprised of nnn modulated pulses; an effect often termed superadditive capacity. The action of this receiver cannot be described as the detection of each individual pulse, interspersed with classical feedforward and soft-information post-processing. 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 single qubit, described by an inner product that is a function of the mean photon number of each BPSK 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 analyze this scheme rigorously and show that it achieves the quantum limit of minimum average error probability in discriminating 888 (BPSK) codewords of a length-555 binary linear code with a tree factor graph. We quantify its performance improvement over the (Dolinar) receiver that optimally detects one pulse at a time. Our result suggests that a BPQM-receiver might attain the Holevo capacity, the quantum limit of classical communication capacity, of this BPSK-modulated pure-loss channel. This suggests a new application for a small, special-purpose, photonic quantum computer capable of so-called cat-basis universal qubit logic.
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). 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.