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

International Journal of Theoretical Physics

On Realization of Partially Ordered Abelian Groups

Ivan Chajda, Jan Paseka, Qiang Lei

Published Dec 4, 2012• 2 citations
Publisher
DOI
10.1007/s10773-012-1426-x

Related papers

Quantum logic and partially ordered abelian groups

David J. Foulis, Richard J. Greechie

Elsevier eBooks•Jan 1, 2007•12 citations

On decomposing finite abelian groups

Sándor Szabó

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

Partial Abelian semigroups

Alexander Wilce

International Journal of Theoretical Physics•Aug 1, 1995•16 citations

Solvable weak-graph duals of partially frozen vertex models

M. Kolesík, Ladislav Šamaj, P. Markoš

A family of q-state vertex models on a square lattice is solved exactly using the generalized weak-graph transformation. Concrete physical symmetries of vertex weights turn out to be closely related to abelian groups. The possibility of occurrence of the first-order phase transition is discussed.

Journal de Physique I•Jul 1, 1992•0 citations

A classification of finite quantum kinematics

J Tolar

Quantum mechanics in Hilbert spaces of finite dimension N is reviewed from the number theoretic point of view. For composite numbers N possible quantum kinematics are classified on the basis of Mackey's Imprimitivity Theorem for finite Abelian groups. This yields also a classification of finite Weyl-Heisenberg groups and the corresponding finite quantum kinematics. Simple number theory gets involved through the fundamental theorem describing all finite discrete Abelian groups of order N as direct products of cyclic groups, whose orders are powers of not necessarily distinct primes contained in the prime decomposition of N. The representation theoretic approach is further compared with the algebraic approach, where the basic object is the corresponding operator algebra. The consideration of fine gradings of this associative algebra then brings a fresh look on the relation between the mathematical formalism and physical realizations of finite quantum systems.

arXiv:1411.6390•Journal of Physics Conference Series•Oct 10, 2014•1 citation

Complexity of hidden abelian group action problem in quantum computing

Andrii Fesenko

The paper first examines the Hidden Abelian Group Action problem’s complexity in quantum computing model. This algebraic problem is fundamental in determining the hardness of a one-way function constructed on the basis of commutative and locally commutative maps and ciphers. In fact, finding new one-way functions that will be resistant in quantum computing model is very important for modern cryptography.The main objective of the study is to assess the complexity of the Hidden Abelian Group Action problem by using a reduction to already known problems, such as the Hidden Subgroup problem and the Hidden Shift problem. In this paper, reduction of the Hidden Abelian Group Action problem to the Hidden Shift problem was first shown, and limitations that distinguish them were first demonstrated. As a result, on the one hand, the existing partial solutions to the Hidden Shift problem, and general Kuperberg’s subexponential algorithm can be extended to the case of the Hidden Abelian Group Action problem. Moreover, more limitations give more chances to effective general solution to this problem. On the other hand, the reduction and similarity to a known challenge in quantum computing model also indicate the complexity of the Hidden Abelian Group Action problem, which leaves a chance for making a real stand one-way function in quantum computing model based on a locally commutative mapping

Восточно-Европейский журнал передовых технологий•Jan 1, 2013•0 citations
Quantum mechanics in Hilbert spaces of finite dimension N is reviewed from the number theoretic point of view. For composite numbers N possible quantum kinematics are classified on the basis of Mackey's Imprimitivity Theorem for finite Abelian groups. This yields also a classification of finite Weyl-Heisenberg groups and the corresponding finite quantum kinematics. Simple number theory gets involved through the fundamental theorem describing all finite discrete Abelian groups of order N as direct products of cyclic groups, whose orders are powers of not necessarily distinct primes contained in the prime decomposition of N. The representation theoretic approach is further compared with the algebraic approach, where the basic object is the corresponding operator algebra. The consideration of fine gradings of this associative algebra then brings a fresh look on the relation between the mathematical formalism and physical realizations of finite quantum systems.
The paper first examines the Hidden Abelian Group Action problem’s complexity in quantum computing model. This algebraic problem is fundamental in determining the hardness of a one-way function constructed on the basis of commutative and locally commutative maps and ciphers. In fact, finding new one-way functions that will be resistant in quantum computing model is very important for modern cryptography.The main objective of the study is to assess the complexity of the Hidden Abelian Group Action problem by using a reduction to already known problems, such as the Hidden Subgroup problem and the Hidden Shift problem. In this paper, reduction of the Hidden Abelian Group Action problem to the Hidden Shift problem was first shown, and limitations that distinguish them were first demonstrated. As a result, on the one hand, the existing partial solutions to the Hidden Shift problem, and general Kuperberg’s subexponential algorithm can be extended to the case of the Hidden Abelian Group Action problem. Moreover, more limitations give more chances to effective general solution to this problem. On the other hand, the reduction and similarity to a known challenge in quantum computing model also indicate the complexity of the Hidden Abelian Group Action problem, which leaves a chance for making a real stand one-way function in quantum computing model based on a locally commutative mapping