Name
Abstract | ||
|---|---|---|
The hat problem has been investigated in plenty of papers and has become a hot mathematical topic. In this paper, we will investigate the hat problem by employing quantum stabilizer code and classical Hamming code. On the one hand, a new strategy is proposed in this paper by utilizing higher-dimensional quantum stabilizer code, which, to the best of our knowledge, can be considered as a new approach to work around that problem for the first time. The solvability of the hat problem is no longer a matter of a hat game for each participant. However, it is simplified into a question about the information detected and corrected through the quantum network. On the other hand, we have performed a detailed feasibility analysis through a series of theorems in quantum space and established the implementation process with an example. Furthermore, our strategy can be applied to a variant of the more general hat problem and approximated to the optimal winning probability. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s11128-022-03451-7 | Quantum Information Processing |
Keywords | DocType | Volume |
Hat problem, Quantum stabilizer code, Quantum circuit, Winning probability, Pauli operator | Journal | 21 |
Issue | ISSN | Citations |
3 | 1570-0755 | 0 |
PageRank | References | Authors |
0.34 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liyun Zhao | 1 | 0 | 0.34 |
| Xiu-Bo Chen | 2 | 163 | 36.11 |
| Gang Xu | 3 | 0 | 0.68 |
| Yixian Yang | 4 | 1121 | 140.62 |