Quantum-enhanced maximum-likelihood identification
A quantum state is in a superposition of its eigenstates. When measured in that eigenbasis, the quantum state will collapse into one of the eigenstates depending on the probability amplitude of each eigenstate. Maximum likelihood identification (MLI), which is to determine the eigenstate with the h...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2024
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/175655 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | A quantum state is in a superposition of its eigenstates. When measured in that eigenbasis, the quantum state will collapse into one of the eigenstates depending on the probability amplitude of each eigenstate. Maximum likelihood identification (MLI), which is
to determine the eigenstate with the highest probability amplitude is important in areas
such as quantum sensing and quantum error corrections. The straight forward way to
determine the most dominant eigenvector is to simply measure the state multiple times.
However, this method does not have any quantum advantage, therefore it can be potentially sped up by some protocol. In this project, we analyzed the Balint Protocol and
Quantum Exploration Algorithms for Multi-Armed Bandits and extended them into
the problem of MLI. We also compiled the necessary modifications for the implementation
of these algorithms into MLI. We then implement some simple cases of these algorithms
with the Qiskit library, and analysed the theoretical bounds of the performance of
these algorithm in the MLI setting. |
|---|