- Bounded-error quantum polynomial time (BQP) is a complexity class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances123. It is the quantum analogue to the complexity class BPP1. If a problem belongs to BQP, there exists an algorithm that can be executed on a quantum computer in polynomial time and returns the correct answer with high probability2.了解详细信息：✕以上信息汇总借助人工智能技术，若访问原文请查看了解详细信息。
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...
en.wikipedia.org/wiki/BQP計算複雑性理論 において、 BQP とは、 量子コンピュータ によって誤り確率が高々1/3で 多項式時間 で解ける 決定問題 の 複雑性クラス である。 Bounded-error Quantum Polynomial time の頭文字をとったものである。 ある問題が BQP に属すなら、高い確率で正答を返し、多項式時間で実行可能な、量子コンピュータのための アルゴリズム が存在する。ja.wikipedia.org/wiki/BQPDie Komplexitätsklasse BQP (von englisch bounded-error quantum polynomial time) ist ein Begriff aus der Komplexitätstheorie, einem Teilgebiet der Theoretischen Informatik. Zu BQP gehören alle Probleme, die auf einem...
de.wikipedia.org/wiki/BQP - 其他用户还问了以下问题
BQP | 百度百科
网页在 计算复杂性理论 中，BQP（bounded-error quantum polynomial time）是 量子计算机 在多项式时间内可以解决的一类决策问题，所有实例的错误概率至多为1/3。. 它是复杂 …
Solving Sharp Bounded-error Quantum Polynomial Time Problem …
网页2024年6月5日 · Its complexity belongs to the problem of sharp bounded-error quantum polynomial time (#BQP) class and few methods are known for its solution. Finding …
网页This lecture begins by introducing the classical class BPP (Bounded-Error Probabilistic Polynomial Time), followed by BQP (i.e. \quantum Promise-BPP"). The lecture will …
BQP (复杂度) | 维基百科，自由的百科全书
BQP (Bounded-Error Quantum Polynomial Time)
网页2024年6月27日 · BQP, an acronym for Bounded-Error Quantum Polynomial Time, is a complexity class in quantum computing that encompasses problems solvable by a …
Solving Sharp Bounded-error Quantum Polynomial Time Problem …
网页Quantum computing, enhanced by quantum mechanics, is perceived to possess greater computational power than its classical counterparts. Certain NP problems can be solved …
网页A central task of quantum computing theory is to understand how BQP—meaning Bounded-Error Quantum Polynomial-Time, the class of all problems feasible for a …
BQP | Quantiki
网页BQP, in computational complexity theory, stands for "Bounded error, Quantum, Polynomial time". It denotes the class of problems solvable by a quantum computer in polynomial …
Solving Sharp Bounded-error Quantum Polynomial Time Problem …
网页2024年6月5日 · We combine our algorithm with power method, Lanczos method, and quantum imaginary time evolution method for different systems to illustrate the detection …
- 某些结果已被删除
跳至内容