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.
- NSF-PAR ID:
- 10194557
- Date Published:
- Journal Name:
- 2020 IEEE International Symposium on Information Theory (ISIT)
- Page Range / eLocation ID:
- 1824 to 1829
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract -
Motivated by estimation of quantum noise models, we study the problem of learning a Pauli channel, or more generally the Pauli error rates of an arbitrary channel. By employing a novel reduction to the "Population Recovery" problem, we give an extremely simple algorithm that learns the Pauli error rates of an n -qubit channel to precision ϵ in ℓ ∞ using just O ( 1 / ϵ 2 ) log ( n / ϵ ) applications of the channel. This is optimal up to the logarithmic factors. Our algorithm uses only unentangled state preparation and measurements, and the post-measurement classical runtime is just an O ( 1 / ϵ ) factor larger than the measurement data size. It is also impervious to a limited model of measurement noise where heralded measurement failures occur independently with probability ≤ 1 / 4 .We then consider the case where the noise channel is close to the identity, meaning that the no-error outcome occurs with probability 1 − η . In the regime of small η we extend our algorithm to achieve multiplicative precision 1 ± ϵ (i.e., additive precision ϵ η ) using just O ( 1 ϵ 2 η ) log ( n / ϵ ) applications of the channel.more » « less
-
M-ary pulse-amplitude modulation (PAM) meets the requirements of data center communication because of its simplicity, but coarse entropy granularity cannot meet the dynamic bandwidth demands, and there is a large capacity gap between uniform formats and the Shannon limit. The dense wavelength division multiplexing (DWDM) system is widely used to increase the channel capacity, but low spectral efficiency of the intensity modulation/direct detection (IM/DD) solution restricts the throughput of the modern DWDM data center networks. Probabilistic shaping distribution is a good candidate to offer us a fine entropy granularity and efficiently reduce the gap to the Shannon limit, and Nyquist pulse shaping is widely used to increase the spectral efficiency. We aim toward the joint usage of probabilistic shaping and Nyquist pulse shaping with low-density parity-check (LDPC) coding to improve the bit error rate (BER) performance of 8-PAM signal transmission. We optimized the code rate of the LDPC code and compared different Nyquist pulse shaping parameters using simulations and experiments. We achieved a 0.43 dB gain using Nyquist pulse shaping, and a 1.1 dB gain using probabilistic shaping, while the joint use of probabilistic shaping and Nyquist pulse shaping achieved a 1.27 dB gain, which offers an excellent improvement without upgrading the transceivers.more » « less
-
n/a (Ed.)Because noise is inherent to all measurements, optical communication requires error identification and correction to protect and recover user data. Yet, error correction, routinely used in classical receivers, has not been applied to receivers that take advantage of quantum measurement. Here, we show how information uniquely available in a quantum measurement can be employed for efficient error correction. Our quantum-enabled forward error correction protocol operates on quadrature phase shift keying (QPSK) and achieves more than 80 dB error suppression compared to the raw symbol error rate and approximately 40 dB improvement of symbol error rates beyond the QPSK classical limit. With a symbol error rate below 10−9 for just 11 photons per bit, this approach enables reliable use of quantum receivers for ultra-low power optical communications. Limiting optical power improves the information capacity of optical links and enables scalable networks with coexisting quantum and classical channels in the same optical fiber.more » « less
-
Recent constructions of quantum low-density parity-check (QLDPC) codes provide optimal scaling of the number of logical qubits and the minimum distance in terms of the code length, thereby opening the door to fault-tolerant quantum systems with minimal resource overhead. However, the hardware path from nearest-neighbor-connection-based topological codes to long-range-interaction-demanding QLDPC codes is likely a challenging one. Given the practical difficulty in building a monolithic architecture for quantum systems, such as computers, based on optimal QLDPC codes, it is worth considering a distributed implementation of such codes over a network of interconnected medium-sized quantum processors. In such a setting, all syndrome measurements and logical operations must be performed through the use of high-fidelity shared entangled states between the processing nodes. Since probabilistic many-to-1 distillation schemes for purifying entanglement are inefficient, we investigate quantum error correction based entanglement purification in this work. Specifically, we employ QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing (DQC), e.g. for fault-tolerant Steane syndrome extraction. This protocol is applicable beyond the application of DQC since entanglement distribution and purification is a quintessential task of any quantum network. We use the min-sum algorithm (MSA) based iterative decoder with a sequential schedule for distilling-qubit GHZ states using a ratefamily of lifted product QLDPC codes and obtain an input fidelity threshold ofunder i.i.d. single-qubit depolarizing noise. This represents the best threshold for a yield offor any GHZ purification protocol. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of-qubit GHZ states to construct a scalable GHZ purification protocol.