Error Probability Mitigation in Quantum Reading using Classical Codes
- URL: http://arxiv.org/abs/2111.11135v1
- Date: Mon, 22 Nov 2021 11:52:37 GMT
- Title: Error Probability Mitigation in Quantum Reading using Classical Codes
- Authors: Francisco Revson Fernandes Pereira and Stefano Mancini
- Abstract summary: 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.
- Score: 4.125187280299247
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: A general framework describing the statistical discrimination of an ensemble
of quantum channels is given by the name of quantum reading. Several tools can
be applied in quantum reading to reduce the error probability in distinguishing
the ensemble of channels. Classical and quantum codes can be envisioned for
this goal. The aim of this paper is to present a simple but fruitful protocol
for this task using classical error-correcting codes. Three families of codes
are considered: Reed-Solomon codes, BCH codes, and Reed-Muller codes. In
conjunction to the use of codes, we also analyze the role of the receiver. In
particular, heterodyne and Dolinar receivers are taken in consideration. The
encoding and measurement schemes are connected by the probing step. As probe we
consider coherent states. In such simple manner, interesting results are
obtained. As we show, for any fixed rate and code, there is a threshold under
which using codes surpass optimal and sophisticated schemes. However, there are
codes and receiver schemes giving lower thresholds. BCH codes in conjunction
with Dolinar receiver turn out to be the optimal strategy for error mitigation
in the quantum reading task.
Related papers
- Small Quantum Codes from Algebraic Extensions of Generalized Bicycle
Codes [4.299840769087443]
Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance.
We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
arXiv Detail & Related papers (2024-01-15T10:38:13Z) - 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) - Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit.
These codes can be customized to the specific physical errors on the qudit, effectively suppressing them.
We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
arXiv Detail & Related papers (2023-07-20T10:51:23Z) - Pauli Manipulation Detection codes and Applications to Quantum Communication over Adversarial Channels [0.08702432681310403]
We introduce and explicitly construct a quantum code we coin a "Pauli Manipulation Detection" code (or PMD), which detects every Pauli error with high probability.
We apply them to construct the first near-optimal codes for two tasks in quantum communication over adversarial channels.
arXiv Detail & Related papers (2023-04-13T05:05:35Z) - 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) - 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) - 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) - Optimizing quantum codes with an application to the loss channel with
partial erasure information [1.90365714903665]
We investigate the loss channel, which plays a key role in quantum communication, and in particular in quantum key distribution over long distances.
We develop a numerical set of tools that allows to optimize an encoding specifically for recovering lost particles both deterministically and probabilistically.
This allows us to arrive at new codes ideal for the distribution of entangled states in this particular setting, and also to investigate if encoding in qudits or allowing for non-deterministic correction proves advantageous compared to known QECCs.
arXiv Detail & Related papers (2021-05-27T15:24:57Z) - 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) - 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)
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.