Optimal computation with non-unitary quantum walks (Q2482461): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2125066927 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57950022 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0610240 / 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 polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential algorithmic speedup by a quantum walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoherence in quantum walks – a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional quantum walks with absorbing boundaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum walks in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity and quantum walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal computation with non-unitary quantum walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability Criterion for Density Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-State Entanglement and Distillation: Is there a “Bound” Entanglement in Nature? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem / rank
 
Normal rank

Latest revision as of 21:41, 27 June 2024

scientific article
Language Label Description Also known as
English
Optimal computation with non-unitary quantum walks
scientific article

    Statements

    Optimal computation with non-unitary quantum walks (English)
    0 references
    0 references
    0 references
    16 April 2008
    0 references
    0 references
    quantum computing
    0 references
    quantum walks
    0 references
    quantum algorithms
    0 references
    0 references
    0 references
    0 references