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• 3 citations
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•2 citations

Algebraic conditions for a function on an abelian group

Stanley Gudder

Letters in Mathematical Physics•Mar 1, 1979•5 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•7 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•6 citations

On the Wehrl entropy lower bound for a locally compact abelian group

Evgenii Igorevich Zelenov

A Wehrl entropy construction is proposed for an arbitrary locally compact abelian group $G$. It is proved that the Wehrl entropy is not less than a non-negative integer, which is an invariant of the group $G$. The minimum of the Wehrl entropy is achieved on coherent states.

arXiv:2306.15357•Jun 27, 2023•1 citation
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.
A Wehrl entropy construction is proposed for an arbitrary locally compact abelian group GGG. It is proved that the Wehrl entropy is not less than a non-negative integer, which is an invariant of the group GGG. The minimum of the Wehrl entropy is achieved on coherent states.