Many worlds, the cluster-state quantum computer, and the problem of the preferred basis (Q2436209): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171064311 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1110.2514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNITARY-CIRCUIT SEMANTICS FOR MEASUREMENT-BASED COMPUTATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One complexity theorist's view of quantum computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to many worlds in quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the role of entanglement in quantum-computational speed-up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computing Explained / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster-state quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time, quantum mechanics, and decoherence. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantum computer only needs one universe / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elusive source of quantum speedup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worlds in the Everett interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Everett and structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861851 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:56, 7 July 2024

scientific article
Language Label Description Also known as
English
Many worlds, the cluster-state quantum computer, and the problem of the preferred basis
scientific article

    Statements

    Many worlds, the cluster-state quantum computer, and the problem of the preferred basis (English)
    0 references
    0 references
    21 February 2014
    0 references
    quantum computation
    0 references
    quantum mechanics
    0 references
    many worlds
    0 references
    Everettian interpretation
    0 references
    quantum parallelism
    0 references
    quantum speed-up
    0 references
    cluster state
    0 references
    measurement-based
    0 references
    one-way
    0 references
    preferred basis problem
    0 references

    Identifiers

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