4 citations · 9 across the 15 of their papers we have counts for
15 papers
Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform
Yupan Liu, Qisheng Wang
The Uhlmann fidelity is one of the most fundamental quantities in quantum information theory for quantifying the closeness betwe…
On estimating operator norm distance, with optimal trace distance estimation when one state is pure
Yupan Liu, Qisheng Wang, Zhan Yu
We investigate the computational complexity of estimating the operator norm distance , defined via the operator norm , give…
The power of unentanglement without destructive interference
Yupan Liu, Pei Wu
Stoquasticity, originating in sign-problem-free physical systems, gives rise to , introduced by Bravyi, Bessen, and Terhal (2006), a quantum-inspired intermediate class…
Computational hardness of estimating quantum entropies via binary entropy bounds
Yupan Liu
We investigate the computational hardness of estimating the quantum -Rényi entropy and the quantum -Tsallis entropy ${\…
A slightly improved upper bound for quantum statistical zero-knowledge
François Le Gall, Yupan Liu, Qisheng Wang
The complexity class Quantum Statistical Zero-Knowledge (), introduced by Watrous (FOCS 2002) and later refined in Watrous (SICOMP, 2009), has the best known upper b…
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…
On estimating Schatten norm and power distances between quantum states
Yupan Liu, Qisheng Wang
We study the computational complexity of estimating the quantum Schatten -norm distance , given -size state-preparation circuits of -qubit…
Space-bounded quantum interactive proof systems
François Le Gall, Yupan Liu, Harumichi Nishimura +1
We introduce two models of space-bounded quantum interactive proof systems, and . The model, a space-bounded variant of quantu…
On estimating the trace of quantum state powers
Yupan Liu, Qisheng Wang
We investigate the computational complexity of estimating the trace of quantum state powers for an -qubit mixed quantum state , given its state-preparation c…
Space-bounded quantum state testing via space-efficient quantum singular value transformation
François Le Gall, Yupan Liu, Qisheng Wang
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 enco…
Quantum state testing beyond the polarizing regime and quantum triangular discrimination
Yupan Liu
The complexity class Quantum Statistical Zero-Knowledge () captures computational difficulties of the time-bounded quantum state testing problem with respect to the…
Quantum Merlin-Arthur proof systems for synthesizing quantum states
Hugo Delavenne, François Le Gall, Yupan Liu +1
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it i…
StoqMA meets distribution testing
Yupan Liu
captures the computational hardness of approximating the ground energy of local Hamiltonians that do not suffer the so-called sign problem. We provide a novel con…
StoqMA vs. MA: the power of error reduction
Dorit Aharonov, Alex B. Grilo, Yupan Liu
StoqMA characterizes the computational hardness of stoquastic local Hamiltonians, which is a family of Hamiltonians that does not suffer from the sign problem. Although error reduc…
Towards a quantum-inspired proof for IP = PSPACE
Ayal Green, Guy Kindler, Yupan Liu
We explore quantum-inspired interactive proof systems where the prover is limited. Namely, we improve on a result by [AG17] showing a quantum-inspired interactive protocol ($\sf IP…