Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy

Published:1999-11-08 Issue:1991 Volume:455 Page:3953-3966
ISSN:1364-5021
Container-title:Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
language:en
Short-container-title:Proc. R. Soc. Lond. A

Author:

Fenner Stephen¹,Green Frederic²,Homer Steven³,Pruim Randall⁴

Affiliation:

1. Computer Science Department, University of South Carolina, Columbia, SC 29208, USA

2. Department of Mathematics and Computer Science, Clark University, Worcester, MA 01610, USA

3. Computer Science Department, Boston University, Boston, MA 02215, USA

4. Department of Mathematics and Statistics, Calvin College, Grand Rapids, MI 49546, USA

Publisher

The Royal Society

Subject

General Physics and Astronomy,General Engineering,General Mathematics

Link

https://royalsocietypublishing.org/doi/pdf/10.1098/rspa.1999.0485

Reference25 articles.

1. Quantum Computability

2. Balcázar J. L. Díaz J. & Gabarró J. 1988 Structural complexity I. EATCS Monographs on Theoretical Computer Science vol. 11. Springer.

3. Strengths and Weaknesses of Quantum Computing

4. Quantum mechanical hamiltonian models of turing machines

5. Quantum Complexity Theory

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Guest Column: The 7 faces of quantum NP;ACM SIGACT News;2023-12-29

2. Positivity of the Symmetric Group Characters Is as Hard as the Polynomial Time Hierarchy;International Mathematics Research Notices;2023-11-24

3. Computational advantage of quantum random sampling;Reviews of Modern Physics;2023-07-20

4. Sumcheck-based delegation of quantum computing to rational server;Theoretical Computer Science;2022-07

5. Fermion Sampling: A Robust Quantum Computational Advantage Scheme Using Fermionic Linear Optics and Magic Input States;PRX Quantum;2022-05-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3