English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we suggest secure multi-party quantum computation (MPQC)protocol based on a sub-class of Chalderbank-Shor-Steane (CSS) quantumerror-correcting codes (QECCs), i.e., triply-even CSS QECCs. In order toachieve universal quantum computation (UQC) in the MPQC protocol based ontriply-even CSS QECCs, in addition to the set of trivially implementedtransversal 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 inthe 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 toimplement a non-transversal $T$ gate. It also can be realized by the gateteleportation technique but requires additional verification of the logical``magic'' state, which is used as an ancillary quantum state. Verification ofthe logical ``magic'' state suggested in the previous study not only requiresextra workspace for the implementation but also employs a non-transversal$\mathrm{C}\text{-}XP^\dag$ gate, which may lead to a failure of the entireMPQC protocol. By replacing self-dual CSS QECCs with triply-even CSS QECCs, forwhich $T$ gate becomes transversal, we avoid verification of the logical``magic'' state. Consequently, our demand for workspace per quantum node isreduced from $n^2 + 4n$ qubits in the previous suggestion to $n^2 + 3n$ qubitsin our current suggestion, where $n$ is the number of quantum nodesparticipating in the MPQC protocol.

Secure multi-party quantum computation based on triply-even quantum error-correcting codes