Optimal and Efficient Decoding of Concatenated Quantum Block Codes

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published version

Scientific paper

10.1103/PhysRevA.74.052333

We consider the problem of optimally decoding a quantum error correction code -- that is to find the optimal recovery procedure given the outcomes of partial "check" measurements on the system. In general, this problem is NP-hard. However, we demonstrate that for concatenated block codes, the optimal decoding can be efficiently computed using a message passing algorithm. We compare the performance of the message passing algorithm to that of the widespread blockwise hard decoding technique. Our Monte Carlo results using the 5 qubit and Steane's code on a depolarizing channel demonstrate significant advantages of the message passing algorithms in two respects. 1) Optimal decoding increases by as much as 94% the error threshold below which the error correction procedure can be used to reliably send information over a noisy channel. 2) For noise levels below these thresholds, the probability of error after optimal decoding is suppressed at a significantly higher rate, leading to a substantial reduction of the error correction overhead.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Optimal and Efficient Decoding of Concatenated Quantum Block Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal and Efficient Decoding of Concatenated Quantum Block Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal and Efficient Decoding of Concatenated Quantum Block Codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-197642

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.