Quantum computing, postselection, and probabilistic polynomial-time (Q5428317): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29042439, #quickstatements; #temporary_batch_1709550817224 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 21:56, 5 March 2024
scientific article; zbMATH DE number 5213604
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quantum computing, postselection, and probabilistic polynomial-time |
scientific article; zbMATH DE number 5213604 |
Statements
Quantum computing, postselection, and probabilistic polynomial-time (English)
0 references
21 November 2007
0 references
quantum computers
0 references
computational complexity
0 references
Born's rule
0 references
