Quantum computing, postselection, and probabilistic polynomial-time (Q5428317)

From MaRDI portal
Revision as of 09:32, 24 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    21 November 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum computers
    0 references
    computational complexity
    0 references
    Born's rule
    0 references