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:2302.02188 · Lecture notes in computer science

Lower Bounds of Functions on Finite Abelian Groups

Jianting Yang, Ke Ye, Lihong Zhi

Published Dec 8, 2023• 1 citation
arXivHTMLPDF
DOI
10.1007/978-3-031-49193-1_12

Related papers

On decomposing finite abelian groups

Sándor Szabó

Acta Mathematica Academiae Scientiarum Hungaricae•Mar 1, 1980•8 citations

A Gottesman-Knill theorem for all finite Abelian groups

Juan Bermejo-Vega, Maarten Van den Nest

•Jan 1, 2012•3 citations

Algebraic conditions for a function on an abelian group

Stanley Gudder

Letters in Mathematical Physics•Mar 1, 1979•4 citations

A Fusion Algorithm for Solving the Hidden Shift Problem in Finite Abelian Groups

Wouter Castryck, Ann Dooms, Carlo Emerencia +1 more

Lecture notes in computer science•Jan 1, 2021•8 citations

Abelian and Non-Abelian Quantum Two-Block Codes

Renyu Wang, Hsiang-Ku Lin, Leonid P. Pryadko

We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices. Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian. We present code construction and give several expressions for code dimension, applicable depending on whether the constituent group is cyclic, abelian, or non-abelian. This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such a code based on an abelian group. We also give a lower bound on the distance which, in particular, applies to the case when a 2BGA code reduces to a hypergraph-product code constructed from a pair of classical group codes.

arXiv:2305.06890•International Symposium on Turbo Codes and Iterative Information Processing•Sep 4, 2023•26 citations

The role of Mrs. Gerber's lemma for evaluating the information leakage of masked computations

Olivier Rioul

In the context of secret sharing computation in some finite Abelian group, given noisy observations of each share, how can one measure the information leakage of the secret? We show that in various instances of this problem, it boils down to establishing some variation of a ”Mrs. Gerber’s lemma”. That is, find a lower bound on some randomness measure of a sum of discrete random variables in the Abelian group in terms of the product of individual randomnesses of each discrete random variable. It is an open problem to generalize these approaches in a suitable framework.

•Feb 12, 2023•0 citations
We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices. Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian. We present code construction and give several expressions for code dimension, applicable depending on whether the constituent group is cyclic, abelian, or non-abelian. This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such a code based on an abelian group. We also give a lower bound on the distance which, in particular, applies to the case when a 2BGA code reduces to a hypergraph-product code constructed from a pair of classical group codes.
In the context of secret sharing computation in some finite Abelian group, given noisy observations of each share, how can one measure the information leakage of the secret? We show that in various instances of this problem, it boils down to establishing some variation of a ”Mrs. Gerber’s lemma”. That is, find a lower bound on some randomness measure of a sum of discrete random variables in the Abelian group in terms of the product of individual randomnesses of each discrete random variable. It is an open problem to generalize these approaches in a suitable framework.