6 citations · 7 across the 2 of their papers we have counts for
4 papers
-efficient unitary synthesis via block-sparse Hamiltonian simulation
Diyi Liu, Shuchen Zhu, Wibe Albert de Jong +3
We construct Clifford+ circuits implementing arbitrary -qubit unitaries with worst-case -count at constant operator-norm error, where , imp…
Exponentially Compressed and Garbage-Free Alias Sampling for Polynomial State Preparation
Diyi Liu, Hanyu Wang, Shuchen Zhu +4
Coherent alias sampling implement an important subroutine for block encoding and qubitization based quantum simulation using quantum lookup table. Related constructions exploit dat…
Low-gate-count block encodings for second-quantized fermionic Hamiltonians
Diyi Liu, Shuchen Zhu, Guang Hao Low +2
Efficient block encoding of many-body Hamiltonians is a central requirement for quantum algorithms in scientific computing, particularly in the early fault-tolerant era. In this wo…
Randomized Algorithms for Scientific Computing (RASC)
Aydin Buluc, Tamara G. Kolda, Stefan M. Wild +16
Randomized algorithms have propelled advances in artificial intelligence and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office o…