On the efficiency of Hamiltonian-based quantum computation for low-rank matrices (Q2861773): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3920175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anderson localization makes adiabatic quantum optimization fail / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adiabatic theorem without a gap condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of a theorem of Johnson and Lindenstrauss / rank
 
Normal rank
Property / cites work
 
Property / cites work: A STRONG OPERATOR TOPOLOGY ADIABATIC THEOREM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adiabatic charge transport and the Kubo formula for Landau-type Hamiltonians / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3084090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the adiabatic approximation with applications to quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adiabatic approximation with exponential accuracy for many-body systems and quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise exponential estimates in adiabatic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear adiabatic theory. Exponential estimates / 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

Latest revision as of 00:32, 7 July 2024

scientific article
Language Label Description Also known as
English
On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
scientific article

    Statements

    On the efficiency of Hamiltonian-based quantum computation for low-rank matrices (English)
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    adiabatic quantum computing
    0 references
    Grover speedup
    0 references

    Identifiers

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