Secure multi-party quantum computation based on triply-even quantum error-correcting codes
| Autor: | Mishchenko, Petr A., Xagawa, Keita |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | In this paper we suggest secure multi-party quantum computation (MPQC) protocol based on a sub-class of Chalderbank-Shor-Steane (CSS) quantum error-correcting codes (QECCs), i.e., triply-even CSS QECCs. In order to achieve universal quantum computation (UQC) in the MPQC protocol based on triply-even CSS QECCs, in addition to the set of trivially implemented transversal quantum gates, one needs to implement a non-transversal $H$ gate, which can be accomplished by the gate teleportation technique with the logical ``plus'' state as an ancillary quantum state. In comparison, to achieve UQC in the previously suggested MPQC protocol based on another sub-class of CSS QECCs, i.e., self-dual CSS QECCs, instead of non-transversal $H$ gate one needs to implement a non-transversal $T$ gate. It also can be realized by the gate teleportation technique but requires additional verification of the logical ``magic'' state, which is used as an ancillary quantum state. Verification of the logical ``magic'' state suggested in the previous study not only requires extra workspace for the implementation but also employs a non-transversal $\mathrm{C}\text{-}XP^\dag$ gate, which may lead to a failure of the entire MPQC protocol. By replacing self-dual CSS QECCs with triply-even CSS QECCs, for which $T$ gate becomes transversal, we avoid verification of the logical ``magic'' state. Consequently, our demand for workspace per quantum node is reduced from $n^2 + 4n$ qubits in the previous suggestion to $n^2 + 3n$ qubits in our current suggestion, where $n$ is the number of quantum nodes participating in the MPQC protocol. Comment: 15 pages, 2 figures, 4 tables |
| Databáze: | arXiv |
| Externí odkaz: |
|