1 citations · 2 across the 8 of their papers we have counts for
9 papers
Transducer-based linear combination of unitaries: theory and applications
Dong An, Dekuan Dong, Changpeng Shao +2
Linear combination of unitaries (LCU) is a fundamental primitive in quantum algorithms, whose cost is typically governed by the most expensive unitary appearing in the combination.…
Quantum space-depth tradeoffs for coherent block encodings
Yuxin Zhang, Changpeng Shao
Block encodings are a basic interface between quantum algorithms and linear algebra. Standard LCU constructions achieve optimal circuit depth but typically require logarithmically…
Worst-case Harrow-Hassidim-Lloyd algorithm with average-case correct quantum Fourier transform
Changpeng Shao
In [\href{https://quantum-journal.org/papers/q-2022-12-07-872/}{Quantum 6, 872, 2022}], Linden and de Wolf proposed a lightweight protocol for verifying average-case correctness of…
Randomized Quantum Singular Value Transformation
Xinzhao Wang, Yuxin Zhang, Soumyabrata Hazra +3
We introduce the first randomized algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework for many quantum algorithms. Standard implementations of QSVT re…
Normalization of Quaternionic Polynomials in Coordinate-Free Quaternionic Variables in Conjugate-Alternating Order
Hongbo Li, Zhengyang Wang, Yue Liu +2
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Gr…
Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
Shantanav Chakraborty, Soumyabrata Hazra, Tongyang Li +3
We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for ne…
Reflective block Kaczmarz algorithms for least squares
Changpeng Shao
In [Steinerberger, Q. Appl. Math., 79:3, 419-429, 2021] and [Shao, SIAM J. Matrix Anal. Appl. 44(1), 212-239, 2023], two new types of Kaczmarz algorithms, which share some similari…
Quantum spectral method for gradient and Hessian estimation
Yuxin Zhang, Changpeng Shao
Gradient descent is one of the most basic algorithms for solving continuous optimization problems. In [Jordan, PRL, 95(5):050501, 2005], Jordan proposed the first quantum algorithm…
Lower bounds for quantum-inspired classical algorithms via communication complexity
Nikhil S. Mande, Changpeng Shao
Quantum-inspired classical algorithms provide us with a new way to understand the computational power of quantum computers for practically-relevant problems, especially in machine…