Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Q3088963): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56689365 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100618339 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1005.1407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computing, postselection, and probabilistic polynomial-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchgate and space-bounded quantum computations are equivalent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporally unstructured quantum computation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:33, 4 July 2024

scientific article
Language Label Description Also known as
English
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
scientific article

    Statements

    Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2011
    0 references
    quantum computational complexity
    0 references
    quantum simulation
    0 references
    polynomial hierarchy
    0 references

    Identifiers