A quantum eigensolver for symmetric tridiagonal matrices (Q670017): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4917542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Divide and Conquer method for the symmetric tridiagonal eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient quantum algorithms for simulating sparse Hamiltonians / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465515 / rank
 
Normal rank

Revision as of 18:17, 18 July 2024

scientific article
Language Label Description Also known as
English
A quantum eigensolver for symmetric tridiagonal matrices
scientific article

    Statements

    A quantum eigensolver for symmetric tridiagonal matrices (English)
    0 references
    0 references
    0 references
    15 March 2019
    0 references
    quantum computation
    0 references
    quantum simulation
    0 references
    quantum algorithm
    0 references
    eigenproblem
    0 references
    tridiagonal matrices
    0 references

    Identifiers

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