Information for "PostBQP"

From HandWiki

Basic information

Display titlePostBQP
Default sort keyPostbqp
Page length (in bytes)20,171
Namespace ID0
Page ID190488
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>LinXED
Date of page creation08:00, 27 June 2023
Latest editorimported>LinXED
Date of latest edit08:00, 27 June 2023
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Magic word (1)
  • __TOC__
Transcluded templates (28)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
In computational complexity theory, PostBQP is a complexity class consisting of all of the computational problems solvable in polynomial time on a quantum Turing machine with postselection and bounded error (in the sense that the algorithm is correct at least 2/3 of the time on all inputs). Postselection...
Information from Extension:WikiSEO