Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2401.08059 · Quantum Information Processing

Error-correctable efficient quantum homomorphic encryption using Calderbank–Shor–Steane codes

IlKwon Sohn, Boseon Kim, Kwangil Bae, Wooyeong Song, Wonhyuk Lee

Published Jan 23, 2025• 8 citations
arXivHTMLPDF
DOI
10.1007/s11128-025-04651-7

Related papers

A Search Algorithm for Bases of Calderbank-Shor-Steane Type Quantum Error-Correcting Codes

Kin‐ichiroh Tokiwa

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Mar 1, 2001•0 citations

A-6-10 Using Enlarged Calderbank-Shor-Steane Codes in Quantum Cryptography

Hachiro Fujita

電子情報通信学会総合大会講演論文集•Mar 5, 2008•0 citations

Quantum Secure Direct Communication Using Quantum Calderbank-Shor-Steane Error Correcting Codes

吕欣

The notion of quantum secure direct communication (QSDC) has been introduced recently in quantum cryptography as a replacement for quantum key distribution, in which two communication entities exchange secure classical messages without establishing any shared keys previously. In this paper, a quantum secure direct communication scheme using quantum Calderbank-Shor-Steane (CSS) error correction codes is proposed. In the scheme, a secure message is first transformed into a binary error vector and then encrypted (decrypted) via quantum coding (decoding) procedures. An adversary Eve, who has controlled the communication channel, can't recover the secrete messages because she doesn't know the deciphering keys. Security of this scheme is based on the assumption

Journal of Software•Jan 1, 2006•18 citations

Quantum Homomorphic Encryption

Tao Shang

Springer eBooks•Oct 15, 2024•0 citations

Calderbank-Shor-Steane holographic quantum error-correcting codes

Robert J. Harris, Nathan A. McMahon, Gavin K. Brennen +1 more

We expand the class of holographic quantum error-correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other holographic codes. We demonstrate this by introducing the self-dual Calderbank-Shor-Steane (CSS) heptagon holographic code, based on the 7-qubit Steane code. Finally, we show promising thresholds for the erasure channel by applying a straightforward, optimal erasure decoder to the heptagon code and benchmark it against existing holographic codes.

arXiv:1806.06472•Physical Review A•Nov 1, 2018•61 citations

Homomorphic Quantum Error Correction

Kornikar Sen, Miguel A. Martin-Delgado

We study the algebraic compatibility between quantum homomorphic encryption and stabilizer quantum error correction in an honest-but-curious model, restricting the encryption to the transversal block-Pauli mask $(X^aZ^b)^{\otimes n}$ controlled by two secret key bits $a$ and $b$. We prove a necessary and sufficient criterion for an $[[n,1,d]]$ stabilizer code to remain compatible with this mask, namely that the transversal $X$ and $Z$ operators commute with every stabilizer generator, and we specialize it to a classical-code criterion for Calderbank--Shor--Steane codes. Combining code-space preservation with the logical action of the mask, every stabilizer code falls, with respect to each of the two transversal mask operators, into exactly one of three classes: incompatible, compatible but trivially acting, or compatible with a nontrivial logical Pauli action; the two operators need not fall into the same class. We verify this classification by exact symplectic computation for rotated and planar surface codes, toric codes, triangular and toric color codes, the $[[15,1,3]]$ code and several small codes, and find that the class is fixed by the lattice size and the boundary presentation rather than by the topological phase: the surface-code family realizes all three classes, whereas color codes realize only the two compatible ones. For encrypted computation we show that the Shor code does not implement the logical $T$ gate by a transversal $T^{\otimes 9}$, whereas suitable triorthogonal codes do so up to a Clifford correction. We formulate logical-Pauli masking as a code-independent algebraic template. Syndrome extraction and recovery are key-independent whenever the mask preserves the code space, so that the client only needs the block size and the class of the code to decrypt.

quant-pharXiv:2605.25692•May 26, 2026•0 citations
The notion of quantum secure direct communication (QSDC) has been introduced recently in quantum cryptography as a replacement for quantum key distribution, in which two communication entities exchange secure classical messages without establishing any shared keys previously. In this paper, a quantum secure direct communication scheme using quantum Calderbank-Shor-Steane (CSS) error correction codes is proposed. In the scheme, a secure message is first transformed into a binary error vector and then encrypted (decrypted) via quantum coding (decoding) procedures. An adversary Eve, who has controlled the communication channel, can't recover the secrete messages because she doesn't know the deciphering keys. Security of this scheme is based on the assumption
We expand the class of holographic quantum error-correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other holographic codes. We demonstrate this by introducing the self-dual Calderbank-Shor-Steane (CSS) heptagon holographic code, based on the 7-qubit Steane code. Finally, we show promising thresholds for the erasure channel by applying a straightforward, optimal erasure decoder to the heptagon code and benchmark it against existing holographic codes.
We study the algebraic compatibility between quantum homomorphic encryption and stabilizer quantum error correction in an honest-but-curious model, restricting the encryption to the transversal block-Pauli mask (XaZb)⊗n(X^aZ^b)^{\otimes n}(XaZb)⊗n controlled by two secret key bits aaa and bbb. We prove a necessary and sufficient criterion for an [[n,1,d]][[n,1,d]][[n,1,d]] stabilizer code to remain compatible with this mask, namely that the transversal XXX and ZZZ operators commute with every stabilizer generator, and we specialize it to a classical-code criterion for Calderbank--Shor--Steane codes. Combining code-space preservation with the logical action of the mask, every stabilizer code falls, with respect to each of the two transversal mask operators, into exactly one of three classes: incompatible, compatible but trivially acting, or compatible with a nontrivial logical Pauli action; the two operators need not fall into the same class. We verify this classification by exact symplectic computation for rotated and planar surface codes, toric codes, triangular and toric color codes, the [[15,1,3]][[15,1,3]][[15,1,3]] code and several small codes, and find that the class is fixed by the lattice size and the boundary presentation rather than by the topological phase: the surface-code family realizes all three classes, whereas color codes realize only the two compatible ones. For encrypted computation we show that the Shor code does not implement the logical TTT gate by a transversal T⊗9T^{\otimes 9}T⊗9, whereas suitable triorthogonal codes do so up to a Clifford correction. We formulate logical-Pauli masking as a code-independent algebraic template. Syndrome extraction and recovery are key-independent whenever the mask preserves the code space, so that the client only needs the block size and the class of the code to decrypt.