Perfect state distinguishability and computational speedups with postselected closed timelike curves (Q427292): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59832633 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113645261 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1008.0433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Example of a New Type of Cosmological Solutions of Einstein's Field Equations of Gravitation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed timelike curves produced by pairs of moving cosmic strings: Exact solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed timelike curves make quantum and classical computing equivalent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting consistency conditions for quantum states of systems on closed timelike curves: an epistemic perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels / 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: Unambiguous discrimination between linearly independent quantum states. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptography using any two nonorthogonal states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptography: public key distribution and coin tossing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank

Latest revision as of 08:55, 5 July 2024

scientific article
Language Label Description Also known as
English
Perfect state distinguishability and computational speedups with postselected closed timelike curves
scientific article

    Statements

    Perfect state distinguishability and computational speedups with postselected closed timelike curves (English)
    0 references
    0 references
    0 references
    13 June 2012
    0 references
    postselected closed time-like curves
    0 references
    state distinguishability
    0 references
    paradoxical computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references