Codes for entanglement-assisted classical communication
- URL: http://arxiv.org/abs/2310.19774v1
- Date: Mon, 30 Oct 2023 17:44:33 GMT
- Title: Codes for entanglement-assisted classical communication
- Authors: Tushita Prasad, Markus Grassl
- Abstract summary: Scheme transmits classical information over a quantum channel assisted by maximally entangled pairs.
We use direct coding or super-dense coding based on the amount of entanglement available.
- Score: 2.0305676256390934
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present a new entanglement assisted classical communication scheme which
can correct a fixed number of erasures or errors. The scheme transmits
classical information over a quantum channel assisted by maximally entangled
pairs. We establish a general framework to accomplish such a task by reducing
it to a classical problem. We use direct coding or super-dense coding based on
the amount of entanglement available. This results in a combination of two
classical channels. For this scenario we present an explicit encoding scheme.
We compare our scheme with specific bounds and find certain ranges of
parameters where the scheme is optimal. The presented scheme can easily be
realized. It requires only the implementation of super-dense coding which has
been demonstrated successfully in experiments.
Related papers
- Hybrid Quantum-Classical Machine Learning with String Diagrams [49.1574468325115]
This paper develops a formal framework for describing hybrid algorithms in terms of string diagrams.
A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces.
arXiv Detail & Related papers (2024-07-04T06:37:16Z) - Learning Linear Block Error Correction Codes [62.25533750469467]
We propose for the first time a unified encoder-decoder training of binary linear block codes.
We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
arXiv Detail & Related papers (2024-05-07T06:47:12Z) - Testing the Accuracy of Surface Code Decoders [55.616364225463066]
Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC)
This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
arXiv Detail & Related papers (2023-11-21T10:22:08Z) - Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds.
We engineer an error bias at the lowest level of encoding using the surface code.
We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
arXiv Detail & Related papers (2022-12-03T06:16:07Z) - Quantum Error Correction via Noise Guessing Decoding [0.0]
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation.
This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
arXiv Detail & Related papers (2022-08-04T16:18:20Z) - Conservation laws and quantum error correction: towards a generalised
matching decoder [2.1756081703276]
We explore decoding algorithms for the surface code, a prototypical quantum low-density parity-check code.
The decoder works by exploiting underlying structure that arises due to materialised symmetries among surface-code stabilizer elements.
We propose a systematic way of constructing a minimum-weight perfect-matching decoder for codes with certain characteristic properties.
arXiv Detail & Related papers (2022-07-13T18:00:00Z) - Error Probability Mitigation in Quantum Reading using Classical Codes [4.125187280299247]
Several tools can be applied in quantum reading to reduce the error probability in distinguishing the ensemble of channels.
Three families of codes are considered: Reed-Solomon codes, BCH codes, and Reed-Muller codes.
BCH codes in conjunction with Dolinar receiver turn out to be the optimal strategy for error mitigation in the quantum reading task.
arXiv Detail & Related papers (2021-11-22T11:52:37Z) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z) - Computing Sum of Sources over a Classical-Quantum MAC [13.561997774592664]
We propose and analyze a coding scheme based on coset codes.
The proposed technique enables the decoder recover the desired function without recovering the sources themselves.
This work is based on a new ensemble of coset codes that are proven to achieve the capacity of a classical-quantum point-to-point channel.
arXiv Detail & Related papers (2021-03-02T23:14:05Z) - Polar Codes for Quantum Reading [0.0]
We show how to construct low complexity encoding schemes that are interesting for channel discrimination.
We also show that the error probability of the scheme proposed decays exponentially with respect to the code length.
An analysis of the optimal quantum states to be used as probes is given.
arXiv Detail & Related papers (2020-12-14T01:24:11Z) - Universal classical-quantum superposition coding and universal
classical-quantum multiple access channel coding [67.6686661244228]
We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code.
We establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets.
arXiv Detail & Related papers (2020-11-01T03:26:08Z)
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.