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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Communications in mathematical physics Ročník 270; číslo 2; s. 359 - 371
Hlavní autori:	Berry, Dominic W., Ahokas, Graeme, Cleve, Richard, Sanders, Barry C.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Heidelberg Springer 01.03.2007 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!