✦ LIBER ✦

Efficient Quantum Algorithms for Simulating Sparse Hamiltonians

✍ Scribed by Dominic W. Berry; Graeme Ahokas; Richard Cleve; Barry C. Sanders

Book ID: 105902708
Publisher: Springer
Year: 2006
Tongue: English
Weight: 191 KB
Volume: 270
Category: Article
ISSN: 0010-3616
DOI: 10.1007/s00220-006-0150-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the efficiency of quantum algorithms

On the efficiency of quantum algorithms for Hamiltonian simulation

✍ Anargyros Papageorgiou; Chi Zhang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 230 KB

Efficient Algorithms for Shortest Paths

Efficient Algorithms for Shortest Paths in Sparse Networks

✍ Johnson, Donald B. 📂 Article 📅 1977 🏛 Association for Computing Machinery 🌐 English ⚖ 833 KB

Efficient Algorithms for Sparse Cyclotom

Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing

✍ Qi Cheng; Sergey P. Tarasov; Mikhail N. Vyalyi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 538 KB

A sparse matrix technique for simulating

A sparse matrix technique for simulating semiconductor devices and its algorithms

✍ Ren Jianmin; Zhang Yimen 📂 Article 📅 1990 🏛 SP Science Press 🌐 English ⚖ 274 KB

An efficient algorithm for constructing

An efficient algorithm for constructing Hamiltonian paths in meshes

✍ Shao Dong Chen; Hong Shen; Rodney Topor 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 169 KB

This paper presents an efficient linear-time sequential algorithm for constructing Hamiltonian paths between two given vertices in meshes with horizontal size m and vertical size n. The algorithm first partitions the given mesh into a number of submeshes in constant steps, and then constructs a Hami

Quantum computing algorithm for electrom

Quantum computing algorithm for electromagnetic field simulation

✍ Siddhartha Sinha; Peter Russer 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 538 KB