Polynomial transformations are basic primitives in quantum algorithms: quantum signal processing and singular value transformation compile univariate polynomials into circuits with query complexity essentially set by degree. Multivariable transformations of noncommuting matrices, however, lack a comparable synthesis th...
Zhe-Yu Shen, Yu-Sen Wu, Xiao Yuan et al.· 0 citations
A depth lower bound of $\Omega(\log n/\log\log n)$, showing that global accuracy can require increasing depth as the lattice grows, and unconditional worst-case lower bounds using time-independent, purely dissipative processes that transport quantum information are proved.
Zhe-Yu Shen, Yu-Sen Wu, Xiao Yuan et al.· 0 citations
Understanding the dynamics of interacting quantum systems is a central goal of quantum simulation. For geometrically local Hamiltonians, locality suggests that digital simulation should retain much of the parallelism of the underlying dynamics. For a target accuracy $\epsilon$, we construct a nearest-neighbor quantum c...
Zhe-Yu Shen, Yu-Sen Wu, Peng-Hui Yao et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.