Quantum factor graphs

@article{Parker2001QuantumFG,
  title={Quantum factor graphs},
  author={Matthew G. Parker},
  journal={Annales des T{\'e}l{\'e}communications},
  year={2001},
  volume={56},
  pages={472-483}
}
The natural Hilbert Space of quantum particles can implement maximumlikelihood (ML) decoding of classical information. The ’Quantum Product Algorithm’ (QPA) is computed on a Factor Graph, where function nodes are unitary matrix operations followed by appropriate quantum measurement. QPA is like the Sum-Product Algorithm (SPA), but without summary, giving optimal decode with exponentially finer detail than achievable using SPA. Graph cycles have no effect on QPA performance. QPA must be repeated… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Near ShannonLimit Error - Correcting Coding and Decoding : TurboCodes ”

  • P. DiVINCENZOD.
  • Proc . 1993 IEEE Int . Conf . on Communications
  • 1993

Similar Papers

Loading similar papers…