Quantum computing, postselection, and probabilistic polynomial-time (Q5428317): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower bounds for local search by quantum arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of Quantum Advice and One-Way Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory of probability and decisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under truth-table reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity limitations on quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bound for 2-query locally decodable codes via a quantum argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computations: algorithms and error correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weinberg’s nonlinear quantum mechanics and the Einstein-Podolsky-Rosen paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perceptrons, PP, and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unknown quantum states: The quantum de Finetti representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Computation and Cryptographic Security / rank
 
Normal rank

Latest revision as of 13:19, 27 June 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
    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
    0 references
    0 references
    0 references