Zobrazeno 1 - 10
of 932
pro vyhledávání: '"Wang Qisheng"'
Logistic regression, the Support Vector Machine (SVM), and least squares are well-studied methods in the statistical and computer science community, with various practical applications. High-dimensional data arriving on a real-time basis makes the de
Externí odkaz:
http://arxiv.org/abs/2411.03925
We introduce two models of space-bounded quantum interactive proof systems, ${\sf QIPL}$ and ${\sf QIP_{\rm U}L}$. The ${\sf QIP_{\rm U}L}$ model, a space-bounded variant of quantum interactive proofs (${\sf QIP}$) introduced by Watrous (CC 2003) and
Externí odkaz:
http://arxiv.org/abs/2410.23958
Autor:
Wang, Qisheng, Zhang, Zhicheng
Trace distance and infidelity (induced by square root fidelity), as basic measures of the closeness of quantum states, are commonly used in quantum state discrimination, certification, and tomography. However, the sample complexity for their estimati
Externí odkaz:
http://arxiv.org/abs/2410.21201
Autor:
Liu, Yupan, Wang, Qisheng
We investigate the computational complexity of estimating the trace of quantum state powers $\text{tr}(\rho^q)$ for an $n$-qubit mixed quantum state $\rho$, given its state-preparation circuit of size $\text{poly}(n)$. This quantity is closely relate
Externí odkaz:
http://arxiv.org/abs/2410.13559
Autor:
Wang, Qisheng
Publikováno v:
IEEE Transactions on Information Theory, 70(12): 8791-8805, 2024
Measuring the distinguishability between quantum states is a basic problem in quantum information theory. In this paper, we develop optimal quantum algorithms that estimate both the trace distance and the (square root) fidelity between pure states to
Externí odkaz:
http://arxiv.org/abs/2408.16655
Autor:
Wang, Qisheng, Zhang, Zhicheng
Publikováno v:
Physical Review A, 110(1): 012422, 2024
Since Harrow, Hassidim, and Lloyd (2009) showed that a system of linear equations with $N$ variables and condition number $\kappa$ can be solved on a quantum computer in $\operatorname{poly}(\log(N), \kappa)$ time, exponentially faster than any class
Externí odkaz:
http://arxiv.org/abs/2407.06012
Matrix geometric means between two positive definite matrices can be defined equivalently from distinct perspectives - as solutions to certain nonlinear systems of equations, as points along geodesics in Riemannian geometry, and as solutions to certa
Externí odkaz:
http://arxiv.org/abs/2405.00673
We study the power of local test for bipartite quantum states. Our central result is that, for properties of bipartite pure states, unitary invariance on one part implies an optimal (over all global testers) local tester acting only on the other part
Externí odkaz:
http://arxiv.org/abs/2404.04599
Autor:
Wang, Qisheng, Zhang, Zhicheng
Publikováno v:
Proceedings of the 32nd Annual European Symposium on Algorithms, pp. 101:1-101:15, 2024
Entropy is a measure of the randomness of a system. Estimating the entropy of a quantum state is a basic problem in quantum information. In this paper, we introduce a time-efficient quantum approach to estimating the von Neumann entropy $S(\rho)$ and
Externí odkaz:
http://arxiv.org/abs/2401.09947
Driven by exploring the power of quantum computation with a limited number of qubits, we present a novel complete characterization for space-bounded quantum computation, which encompasses settings with one-sided error (unitary coRQL) and two-sided er
Externí odkaz:
http://arxiv.org/abs/2308.05079