Efficient Quantum Algorithms for Simulating Sparse Hamiltonians

We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a constant number of nonzero entries in each row...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Communications in mathematical physics Jg. 270; H. 2; S. 359 - 371
Hauptverfasser: Berry, Dominic W., Ahokas, Graeme, Cleve, Richard, Sanders, Barry C.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Heidelberg Springer 01.03.2007
Springer Nature B.V
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Classical and quantum physics: mechanics and fields
Computer science; control theory; systems
Exact sciences and technology
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Physics
Quantum computation
Quantum information
Qubits (quantum computing)
Sciences and techniques of general use
Simulation
Theoretical computing
Quantum algorithm
Qubit
Hamiltonians
Mathematical physics
ISSN:0010-3616, 1432-0916
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a constant number of nonzero entries in each row/column, and ||H|| is bounded by a constant, we may select any positive integer k such that the simulation requires O((log*n)t1+1/2k) accesses to matrix entries of H. We also show that the temporal scaling cannot be significantly improved beyond this, because sublinear time scaling is not possible.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0010-3616
1432-0916
DOI:10.1007/s00220-006-0150-x