POLYNOMIAL TIME QUANTUM ALGORITHMS FOR CERTAIN BIVARIATE HIDDEN POLYNOMIAL PROBLEMS

被引：0

作者：

Decker, Thomas ^{[1
]}

Hoyer, Peter ^{[2
,3
]}

Ivanyos, Gabor ^{[4
]}

Santha, Miklos ^{[1
,5
]}

机构：

[1] Natl Univ Singapore, Ctr Quantum Technol, Singapore 117543, Singapore

[2] Univ Calgary, Dept Comp Sci, Calgary, AB T2N 1N4, Canada

[3] Univ Calgary, Inst Quantum Sci & Technol, Calgary, AB T2N 1N4, Canada

[4] Hungarian Acad Sci, Inst Comp Sci & Control, H-1111 Budapest, Hungary

[5] Univ Paris Diderot, CNRS, LIAFA, F-75013 Paris, France

来源：

QUANTUM INFORMATION & COMPUTATION | 2014年 / 14卷 / 9-10期

基金：

新加坡国家研究基金会; 匈牙利科学研究基金会; 加拿大自然科学与工程研究理事会;

关键词：

Quantum algorithm; Hidden Polynomial Problem; SUBGROUP PROBLEM;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input consists of several level set superpositions, a more difficult version of the problem than the one where the input is given by an oracle. For constant degree, the algorithm is polylogarithmic in the size of the base field. We also apply the results to give an efficient quantum algorithm for the oracle version of the HPP for an interesting family of bivariate hidden functions. This family includes diagonal quadratic forms and elliptic curves.

引用

页码：790 / 806

页数：17

共 50 条

[41] The quantum query complexity of the hidden subgroup problem is polynomial
Ettinger, M
Hoyer, P
Knill, E
INFORMATION PROCESSING LETTERS, 2004, 91 (01) : 43 - 48
[42] Polynomial-Time Algorithms for Path Movement Problems on Trees and Unicyclic Graphs
Chouvatut, Varin
Jindaluang, Wattana
JOURNAL OF INTERNET TECHNOLOGY, 2019, 20 (06): : 1729 - 1735
[43] Polynomial-time quantum algorithms for finding the linear structures of Boolean function
Wu, WanQing
Zhang, HuanGuo
Wang, HouZhen
Mao, ShaoWu
QUANTUM INFORMATION PROCESSING, 2015, 14 (04) : 1215 - 1226
[44] Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation
van Iersel, Leo
Janssen, Remie
Jones, Mark
Murakami, Yukihiro
Zeh, Norbert
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2020, 17 (01) : 14 - 26
[45] PSEUDO-POLYNOMIAL TIME ALGORITHMS FOR COMBINATORIAL FOOD MIXTURE PACKING PROBLEMS
Imahori, Shinji
Karuno, Yoshiyuki
Tateishi, Kenju
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2016, 12 (03) : 1057 - 1073
[46] Sparse bivariate polynomial factorization
WU WenYuan
CHEN JingWei
FENG Yong
Science China(Mathematics), 2014, 57 (10) : 2123 - 2142
[47] Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, PW
SIAM REVIEW, 1999, 41 (02) : 303 - 332
[48] Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
Guan, Yongpei
Miller, Andrew J.
OPERATIONS RESEARCH, 2008, 56 (05) : 1172 - 1183
[49] Sparse bivariate polynomial factorization
Wu WenYuan
Chen JingWei
Feng Yong
SCIENCE CHINA-MATHEMATICS, 2014, 57 (10) : 2123 - 2142
[50] Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, PW
SIAM JOURNAL ON COMPUTING, 1997, 26 (05) : 1484 - 1509

← 1 2 3 4 5 →