activity
20232026
most citedQuantum algorithms for matrix geometric means

7 citations · 11 across the 11 of their papers we have counts for

collaborators

14 papers

cs.IT2026

Optimal Support Size Testing

Qisheng Wang

We present an optimal tester for support size that determines whether an unknown probability distribution is supported on elements or -far away (in total variation…

quant-ph2026

A Unified Complexity Framework for Quantum Property Testing

Qisheng Wang

We develop a unified framework for analyzing the complexity of quantum property testing through functionals of the form , where i…

quant-ph2026

Nearly Sample-Optimal Estimators for Quantum Rényi and Tsallis Entropies

Kean Chen, Qisheng Wang

In this paper, we provide estimators for quantum Rényi and Tsallis entropies with nearly optimal sample complexity. Specifically, for order , dimension , and additive error $…

quant-ph2026

Quantum Speedups for Log-Concave Sampling from Local Structure

Chenghua Liu, Qisheng Wang, Zhengfeng Ji

For a convex function , the problem of sampling from a distribution proportional to is called log-concave sampling. In many practi…

quant-ph2026

Estimating Fidelity to a Reference Quantum State

Qisheng Wang

We consider the problem of estimating the fidelity of an unknown quantum state to a known reference state to within additive error . We show that the sample complexity…

quant-ph2026

Strict Hierarchy for Quantum Channel Certification to Unitary

Kean Chen, Qisheng Wang, Zhicheng Zhang

We consider the problem of quantum channel certification to unitary, where one is given access to an unknown -dimensional channel , and wants to test whether $\math…

quant-ph2025

A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting

Kean Chen, Qisheng Wang, Zhicheng Zhang

Quantum sample-to-query lifting, a relation between quantum sample complexity and quantum query complexity presented in Wang and Zhang (SIAM J. Comput. 2025), was significantly str…

quant-ph2025

Simultaneous Estimation of Nonlinear Functionals of a Quantum State

Kean Chen, Qisheng Wang, Zhan Yu +1

We consider a fundamental task in quantum information theory, estimating the values of , , , for an observable and a quantum state . We…

quant-ph2025

Trace Estimation of Quantum State Powers: Sample Complexity and Computational Hardness

Kean Chen, Yupan Liu, Qisheng Wang

As often emerges in various basic quantum properties such as Rényi and Tsallis entropies, the trace of quantum state powers has attracted a lot of attention. The r…

quant-ph2024

Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via Samplizer

Qisheng Wang, Zhicheng Zhang

We settle the problem of estimating the trace distance and (square root) fidelity between -qubit pure quantum states to within additive error , given their independ…

quant-ph2024★ 2 cited

Tight Quantum Depth Lower Bound for Solving Systems of Linear Equations

Qisheng Wang, Zhicheng Zhang

Since Harrow, Hassidim, and Lloyd (2009) showed that a system of linear equations with variables and condition number can be solved on a quantum computer in $\operatorname{…

quant-ph2024★ 7 cited

Quantum algorithms for matrix geometric means

Nana Liu, Qisheng Wang, Mark M. Wilde +1

Matrix geometric means between two positive definite matrices can be defined from distinct perspectives - as solutions to certain nonlinear systems of equations, as points along ge…

quant-ph2024

Local Test for Unitarily Invariant Properties of Bipartite Quantum States

Kean Chen, Qisheng Wang, Zhicheng Zhang

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 \texti…

quant-ph2023★ 2 cited

Quantum Lower Bounds by Sample-to-Query Lifting

Qisheng Wang, Zhicheng Zhang

The polynomial method by Beals, Buhrman, Cleve, Mosca, and de Wolf (FOCS 1998, J. ACM 2001), the adversary method by Ambainis (STOC 2000, J. Comput. Syst. Sci. 2002), and the compr…