PostBQP
id:
postbqp-292-240299
title:
PostBQP
text:
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. Postselection is not considered to be a feature that a realistic computer would possess, but nevertheless postselecting machines are interesting from a theoretical perspective. Removing either one of the two main features from PostBQP gives the following two complexity classes, both of which
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/PostBQP
date created:
date modified:
2023-04-30T01:28:05Z
main entity:
{"identifier":"Q7233606","url":"https://www.wikidata.org/entity/Q7233606"}
image:
fields total:
13
integrity:
13