1 citations · 1 across the 1 of their papers we have counts for
7 papers
Asymptotic bounds on quantum partial search algorithm and its applications to parallel search
Yan-Bo Jiang, Xiao-Hui Wang, Kun Zhang +1
Grover's algorithm provides a quadratic speedup over classical algorithms for searching an unstructured database and is known to be strictly optimal in oracle query complexity, wit…
Diverse Dictionary Learning
Yujia Zheng, Zijian Li, Shunxing Fan +2
Given only observational data , where both the latent variables and the generating process are unknown, recovering is ill-posed without additional assumptions…
Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm
Kun Zhang, Kang-Yuan Chen, Xiao-Hui Wang +1
Grover's algorithm is a cornerstone of quantum algorithms and is strictly optimal in oracle-query complexity. While the full search problem admits no further improvement, one may t…
Minimal nonintegrable models with three-site interactions
Wen-Ming Fan, Kun Hao, Xiao-Hui Wang +3
We study integrability breaking in translationally invariant spin- chains with genuine three-site interactions. Using a two-qubit composite representation, we prove that the d…
Absence of local conserved charges of the Fredkin spin chain and its truncated versions
Wen-Ming Fan, Kun Hao, Yang-Yang Chen +3
Conservation laws serve as the hallmark of integrability. The absence of conserved charges typically implies that the model is nonintegrable. The recently proposed Fredkin spin cha…
Near-deterministic quantum search algorithm without phase design
Zhen Wang, Kun Zhang, Vladimir Korepin
Grover's algorithm solves the unstructured search problem. Grover's algorithm can find the target state with certainty only if searching one out of four. Designing the deterministi…