Quantum information entropy
Information entropy, the expected amount of information produced by a random data source, has been a topic of interest since Shannon introduced the concept in 1948. The concept was later generalised to Rényi and Tsalli entropies for different research applications in the classical information theory...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
2019
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/78657 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | Information entropy, the expected amount of information produced by a random data source, has been a topic of interest since Shannon introduced the concept in 1948. The concept was later generalised to Rényi and Tsalli entropies for different research applications in the classical information theory. The information entropy becomes increasingly important when dealing with data compression and cryptography in this data-driven era which requires efficient management of the big data and effective extraction of meaningful information. Hence, in this final year project report, the author introduces the new representation of von Neumann entropy with less computational effort and new representations of Rényi and Tsalli in the quantum information domain. Meanwhile, the author investigates mathematically the feasibility of the proposed representations of von Neumann, Rényi and Tsalli entropies. Subsequently, the new representations are validated through MATLAB and case studies. |
|---|