Gunhee Park 박건희
@quantumgunhee.bsky.social
PhD at Caltech
Tensor Networks, Open quantum systems, and Quantum Embedding theory
Garnet Chan group
Tensor Networks, Open quantum systems, and Quantum Embedding theory
Garnet Chan group
📊 With this new method, we benchmarked against recent IBM experiments on kicked Ising dynamics (heavy-hex lattice) and simulated 2D TFIM quenches on square lattices—capturing long-time dynamics beyond the reach of traditional methods!
arxiv.org/abs/2504.07344
arxiv.org/abs/2504.07344
Simulating quantum dynamics in two-dimensional lattices with tensor network influence functional belief propagation
Describing nonequilibrium quantum dynamics remains a significant computational challenge due to the growth of spatial entanglement. The tensor network influence functional (TN-IF) approach mitigates t...
arxiv.org
April 11, 2025 at 4:50 PM
📊 With this new method, we benchmarked against recent IBM experiments on kicked Ising dynamics (heavy-hex lattice) and simulated 2D TFIM quenches on square lattices—capturing long-time dynamics beyond the reach of traditional methods!
arxiv.org/abs/2504.07344
arxiv.org/abs/2504.07344
🧩 BP works well on tree-like lattices—but on 2D square lattices, loops introduce errors.
To go beyond this BP limit, we developed a cluster expansion for IF-BP that systematically captures loop-induced correlations.
To go beyond this BP limit, we developed a cluster expansion for IF-BP that systematically captures loop-induced correlations.
April 11, 2025 at 4:50 PM
🧩 BP works well on tree-like lattices—but on 2D square lattices, loops introduce errors.
To go beyond this BP limit, we developed a cluster expansion for IF-BP that systematically captures loop-induced correlations.
To go beyond this BP limit, we developed a cluster expansion for IF-BP that systematically captures loop-induced correlations.
🧠 A key idea: we shift the computational bottleneck from spatial to temporal entanglement.
While spatial entanglement grows linearly with time, we find that temporal entanglement entropy grows only logarithmically—enabling simulations with polynomial cost.
While spatial entanglement grows linearly with time, we find that temporal entanglement entropy grows only logarithmically—enabling simulations with polynomial cost.
April 11, 2025 at 4:50 PM
🧠 A key idea: we shift the computational bottleneck from spatial to temporal entanglement.
While spatial entanglement grows linearly with time, we find that temporal entanglement entropy grows only logarithmically—enabling simulations with polynomial cost.
While spatial entanglement grows linearly with time, we find that temporal entanglement entropy grows only logarithmically—enabling simulations with polynomial cost.
🔄 Instead of representing the wavefunction as a tensor network state,
we reformulate the dynamics as a path integral over the subsystem—captured by an influence functional MPS (IF-MPS).
We adapt BP to efficiently construct the IF-MPS for 2D lattices.
we reformulate the dynamics as a path integral over the subsystem—captured by an influence functional MPS (IF-MPS).
We adapt BP to efficiently construct the IF-MPS for 2D lattices.
April 11, 2025 at 4:50 PM
🔄 Instead of representing the wavefunction as a tensor network state,
we reformulate the dynamics as a path integral over the subsystem—captured by an influence functional MPS (IF-MPS).
We adapt BP to efficiently construct the IF-MPS for 2D lattices.
we reformulate the dynamics as a path integral over the subsystem—captured by an influence functional MPS (IF-MPS).
We adapt BP to efficiently construct the IF-MPS for 2D lattices.
I will be here this morning!
March 18, 2025 at 4:26 PM
I will be here this morning!
Reposted by Gunhee Park 박건희
Feel free to message me if you want to chat with me during APS or ACS!
March 11, 2025 at 10:09 PM
Feel free to message me if you want to chat with me during APS or ACS!
Feel free to message me if you want to chat with me during APS or ACS!
March 11, 2025 at 10:09 PM
Feel free to message me if you want to chat with me during APS or ACS!
APS Tutorial Talk
March 16 (Sun) 1:30 - 5:30 summit.aps.org/events/MAR-8...
APS Contributed Talk
March 19 (Wed) 4:36 - 4:48
summit.aps.org/events/MAR-N...
ACS contributed Talk
March 27 (Thu) 10:40 - 11:00
acs.digitellinc.com/live/34/sess...
March 16 (Sun) 1:30 - 5:30 summit.aps.org/events/MAR-8...
APS Contributed Talk
March 19 (Wed) 4:36 - 4:48
summit.aps.org/events/MAR-N...
ACS contributed Talk
March 27 (Thu) 10:40 - 11:00
acs.digitellinc.com/live/34/sess...
March 11, 2025 at 10:09 PM
APS Tutorial Talk
March 16 (Sun) 1:30 - 5:30 summit.aps.org/events/MAR-8...
APS Contributed Talk
March 19 (Wed) 4:36 - 4:48
summit.aps.org/events/MAR-N...
ACS contributed Talk
March 27 (Thu) 10:40 - 11:00
acs.digitellinc.com/live/34/sess...
March 16 (Sun) 1:30 - 5:30 summit.aps.org/events/MAR-8...
APS Contributed Talk
March 19 (Wed) 4:36 - 4:48
summit.aps.org/events/MAR-N...
ACS contributed Talk
March 27 (Thu) 10:40 - 11:00
acs.digitellinc.com/live/34/sess...
Congratulations!
December 5, 2024 at 10:15 PM
Congratulations!