The quantum query complexity of the abelian hidden subgroup problem
Author:
Publisher
Elsevier BV
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. Quantum lower bounds for the collision and the element distinctness problems;Aaronson;Journal of the ACM,2004
2. Quantum computation of Fourier transforms over symmetric groups;Beals,1997
3. Quantum lower bounds by polynomials;Beals;Journal of the ACM,2001
4. Gilles Brassard, Peter Høyer, An exact quantum polynomial-time algorithm for Simon’s problem, in: Israel Symposium on Theory of Computing Systems, 1997, pp. 12–23
5. The quantum query complexity of the hidden subgroup problem is polynomial;Ettinger;Information Processing Letters,2004
Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Enhanced QSimon Algorithm for Attacking the Offset Two‐Round Scheme;Advanced Quantum Technologies;2024-08
2. Quantum Complexity for Discrete Logarithms and Related Problems;Lecture Notes in Computer Science;2024
3. Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher;Lecture Notes in Computer Science;2023-12-09
4. Quantum and classical query complexities for generalized Simon's problem;Theoretical Computer Science;2022-07
5. Tight Bounds for Simon’s Algorithm;Progress in Cryptology – LATINCRYPT 2021;2021
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3