- 查看更多
前往 Wikipedia 查看全部内容BQP - Wikipedia
In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances. It is the quantum analogue to the complexity class BPP. A decision problem is … 展开
BQP can be viewed as the languages associated with certain bounded-error uniform families of quantum circuits. A language L is in BQP if and only if there exists a 展开
• Hidden subgroup problem
• Polynomial hierarchy (PH)
• Quantum complexity theory
• QMA, the quantum equivalent to NP.
• QIP, the quantum equivalent to IP. 展开BQP is defined for quantum computers; the corresponding complexity class for classical computers (or more formally for probabilistic Turing machines) is BPP. Just like P and BPP, BQP is 展开
• Complexity Zoo link to BQP Archived 2013-06-03 at the Wayback Machine 展开
CC-BY-SA 许可证中的维基百科文本 关于 BQP 和 NP 之间的关系有哪些悬而未决的问题？如果 BQP 被 …
网页bqp 和 np 之间的关系是量子复杂性理论研究的一个活跃领域。 开放性问题包括 bqp 是否包含在 np 中、bqp 完全问题的存在性以及 bqp 是否等于 p 或 np。 解决这些问题将加深我 …
网页BQP is the class of languages decidable by quantum circuits with bounded error probability. Learn how BQP relates to P, NP, P #P, P SP ACE, and other complexity classes in this …
- 问与答
P，NP，PSPACE都是什么鬼？一文讲清计算复杂性分类 - 知乎
网页如果给出某问题一个答案，存在对答案正确性的简短的证明，那么该问题就是一个NP问题。. 如果输入一个字符串X，你需要确认答案的是否是“YES”，那么上述简短的证明指另外一 …
网页Is BQP in NP? More generally, is BQP contained anywhere in the polynomial hierar-chy PH = NP∪NPNP ∪NPNPNP ∪···? The “default” conjecture is presumably BQP ⊂ PH, since …
网页Learn how to simulate classical and probabilistic circuits with quantum circuits and how to generate random qubits. Explore the concepts of reversibility, unitarity, and accuracy in …
- 其他用户还问了以下问题
网页Abstract: If one modifies the laws of Quantum Mechanics to allow nonlinear evolu-tion of quantum states, this paper shows that NP-complete problems would be effi-ciently …
网页• There exists an oracle relative to which NPBQP 6ˆBQPPH, resolving a 2005 problem of Fortnow. As a corollary, there exists an oracle relative to which P = NP but BQP …
Computational Complexity: On NP in BQP
网页2007年2月25日 · On NP in BQP. In the wake of a misleading Economist article on the D-Wave quantum computer, Scott argues why he believes quantum computers cannot …
网页BQP is the quantum analog of BPP, the class of problems that can be solved efficiently by quantum algorithms. Learn the definition, universal gates, uncomputing, and oracle …
