We determine the quantum query complexity of testing $k$-juntas for Boolean functions, unitaries, and quantum channels. Let $n$ denote the number of input bits or qubits and $\varepsilon$ the distance parameter. For all sufficiently large $k$, $n \ge 2k$, and $2^{-k/16} \le \varepsilon \le 1/16$, we establish the follo...
We study the quantum query complexity of maximizing a non-negative submodular function, considering both the unconstrained setting and, for monotone functions, a cardinality constraint $k$ on an $n$-element ground set. In the exact reversible digital value-oracle model, our unconstrained algorithm achieves an expected...
Yong-Gang Jiang, Xiao-Ming Sun, Peng-Hui Yao et al.· 0 citations
Gaussian boson sampling (GBS) seeks quantum advantage by sampling photon-number patterns generated with squeezed inputs and passive linear optics. Many proposed GBS applications instead target function computation by applying functions to mode-resolved photon-number outcomes---a natural form of experimental postprocess...
Ruo-Ting Dou, Hao Zhan, Sheng-Jun Wu 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 study the query complexity of testing quantum juntas. Given an unknown $n$-qubit unitary or quantum channel, the goal is to decide whether it acts nontrivially on at most $k$ qubits or is $\varepsilon$-far from every such operation. For unitaries, we consider the forward-only model, where the tester has access to $U...
Jing Bao, Minbo Gao, Peng-Hui Yao· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.