Instantaneous Quantum Polynomial time
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:abbreviation |
gptkb:IQP
|
| gptkbp:definedIn |
quantum circuits with commuting gates
|
| gptkbp:field |
gptkb:quantum_computing
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Instantaneous Quantum Polynomial time
|
| gptkbp:introduced |
gptkb:Scott_Aaronson
gptkb:Daniel_Gottesman |
| gptkbp:introducedIn |
2008
|
| gptkbp:notableExample |
Boson sampling
commuting quantum circuits |
| gptkbp:property |
believed to be hard to simulate classically
can be efficiently simulated for some cases non-universal for quantum computation related to sampling problems subset of quantum polynomial time (BQP) uses only commuting gates |
| gptkbp:relatedTo |
gptkb:BQP
P NP classical simulation |
| gptkbp:bfsParent |
gptkb:IQP
|
| gptkbp:bfsLayer |
8
|