Quantum‐Accelerated Algorithms for Generating Random Primitive Polynomials Over Finite Fields
-
Published:2023-11-03
Issue:1
Volume:7
Page:
-
ISSN:2511-9044
-
Container-title:Advanced Quantum Technologies
-
language:en
-
Short-container-title:Adv Quantum Tech
Author:
Huang Shan12,
Yin Hua‐Lei1ORCID,
Chen Zeng‐Bing1,
Wu Shengjun12
Affiliation:
1. National Laboratory of Solid State Microstructures and School of Physics Collaborative Innovation Center of Advanced Microstructures Nanjing University Nanjing 210093 China
2. Institute for Brain Sciences and Kuang Yaming Honors School Nanjing University Nanjing 210023 China
Abstract
AbstractPrimitive polynomials over finite fields are crucial resources with broad applications across various domains in computer science, including classical pseudo‐random number generation, coding theory, and post‐quantum cryptography. Nevertheless, the pursuit of an efficient classical algorithm for generating random primitive polynomials over finite fields remains an ongoing challenge. In this work, it shows how this problem can be solved efficiently with the help of quantum computers. Moreover, the designs of specific quantum circuits to implement them are also presented. The research paves the way for the rapid and real‐time generation of random primitive polynomials in diverse quantum communication and computation applications.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Jiangsu Province
Fundamental Research Funds for the Central Universities
Subject
Electrical and Electronic Engineering,Computational Theory and Mathematics,Condensed Matter Physics,Mathematical Physics,Nuclear and High Energy Physics,Electronic, Optical and Magnetic Materials,Statistical and Nonlinear Physics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献