# PhD Seminar • Quantum Computing — A Quantum Algorithm for Simulating Non-sparse Hamiltonians

Tuesday, April 24, 2018 — 2:00 PM EDT

Chunhao Wang, PhD candidate
David R. Cheriton School of Computer Science

We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the assumption that the entries of the Hamiltonian are stored in a data structure that allows for the efficient preparation of states that encode the rows of the Hamiltonian. We use a linear combination of quantum walks to achieve a poly-logarithmic dependence on the precision.

The time complexity measured in terms of circuit depth of our algorithm is $O(t\sqrt{N}\norm{H}\polylog(N, t\norm{H}, 1/\epsilon))$, where $t$ is the evolution time, $N$ is the dimension of the system, and $\epsilon$ is the precision. Our algorithm can directly be applied as a subroutine for unitary implementations and solving linear systems, achieving a $\widetilde{O}(\sqrt{N})$ dependence for both applications.

Location
QNC - Quantum Nano Centre
1201
200 University Avenue West

Waterloo, ON N2L 3G1

### January 2022

S M T W T F S
26
27
28
29
30
31
1
2
3
5
7
8
9
11
12
15
16
18
22
23
25
26
28
29
30
1
2
3
4
5
1. 2022 (20)
1. February (2)
2. January (18)
2. 2021 (210)
1. December (21)
2. November (13)
3. October (12)
4. September (21)
5. August (20)
6. July (17)
7. June (11)
8. May (16)
9. April (27)
10. March (20)
11. February (13)
12. January (19)
3. 2020 (217)
4. 2019 (255)
5. 2018 (217)
6. 2017 (36)
7. 2016 (21)
8. 2015 (36)
9. 2014 (33)
10. 2013 (23)
11. 2012 (4)
12. 2011 (1)
13. 2010 (1)
14. 2009 (1)
15. 2008 (1)