Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01911843n
Noun Named Entity
Categories: Probabilistic complexity classes
EN
QIP  Quantum Interactive Polynomial  Quantum Interactive Polynomial time  quantum interactive protocol
EN
In computational complexity theory, the class QIP is the quantum computing analogue of the classical complexity class IP, which is the set of problems solvable by an interactive proof system with a polynomial-time verifier and one computationally unbounded prover. Wikipedia
English:
complexity
Definitions
Relations
Sources
EN
In computational complexity theory, the class QIP is the quantum computing analogue of the classical complexity class IP, which is the set of problems solvable by an interactive proof system with a polynomial-time verifier and one computationally unbounded prover. Wikipedia
A complexity class in computational complexity theory Wikipedia Disambiguation
Complexity class, quantum computing analogue of the class IP Wikidata
IS A
complexity class
SAID TO BE THE SAME AS
PSPACE
IP
Wikipedia
EN
QIP (complexity)
Wikidata
EN
QIP
Wikipedia Redirections
EN
Quantum Interactive Polynomial, Quantum Interactive Polynomial time, quantum interactive protocol
Wikidata Alias
EN
Quantum Interactive Polynomial time

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License