Quantum hashing for finite abelian groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Hashing for Finite Abelian Groups

We propose a generalization of the quantum hashing technique based on the notion of the small-bias sets. These sets have proved useful in different areas of computer science, and here their properties give an optimal construction for succinct quantum presentation of elements of any finite abelian group, which can be used in various computational and cryptographic scenarios. The known quantum fi...

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

Finite Quantum Groups over Abelian Groups of Prime Exponent

– We classify pointed finite-dimensional complex Hopf algebras whose group of group-like elements is abelian of prime exponent p, p > 17. The Hopf algebras we find are members of a general family of pointed Hopf algebras we construct from Dynkin diagrams. As special cases of our construction we obtain all the Frobenius–Lusztig kernels of semisimple Lie algebras and their parabolic subalgebras. ...

متن کامل

Quantum Algorithm for Decomposing Black-Box Finite Abelian Groups

Cheung and Mosca [1] gave an efficient quantum algorithm for decomposing finite abelian groups in a unique-encoding group model. We present another efficient quantum algorithm for this problem in a more general model, the black-box group model, where each group element is not necessarily uniquely encoded.

متن کامل

Decomposing finite Abelian groups

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lobachevskii Journal of Mathematics

سال: 2016

ISSN: 1995-0802,1818-9962

DOI: 10.1134/s1995080216060184