Search Results - "Liu, Yupan"

Quantum state testing beyond the polarizing regime and quantum triangular discrimination by Liu, Yupan

“…The complexity class Quantum Statistical Zero-Knowledge ($\mathsf{QSZK}$) captures computational difficulties of the time-bounded quantum state testing problem…”
Get full text

On estimating the trace of quantum state powers by 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$,…”
Get full text

StoqMA meets distribution testing by Liu, Yupan

“…Proceedings of the 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021), Leibniz International Proceedings in…”
Get full text

Space-bounded quantum state testing via space-efficient quantum singular value transformation by Gall, François Le, Liu, Yupan, Wang, Qisheng

“…Driven by exploring the power of quantum computation with a limited number of qubits, we present a novel complete characterization for space-bounded quantum…”
Get full text

Space-bounded quantum interactive proof systems by Gall, François Le, Liu, Yupan, Nishimura, Harumichi, Wang, Qisheng

“…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…”
Get full text

Towards a quantum-inspired proof for IP = PSPACE by Green, Ayal, Kindler, Guy, Liu, Yupan

“…Quantum Inf. Comput. 21(5&6): 377-386 (2021) We explore quantum-inspired interactive proof systems where the prover is limited. Namely, we improve on a result…”
Get full text

Quantum Merlin-Arthur proof systems for synthesizing quantum states by Delavenne, Hugo, Gall, François Le, Liu, Yupan, Miyamoto, Masayuki

“…Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In…”
Get full text

StoqMA vs. MA: the power of error reduction by Aharonov, Dorit, Grilo, Alex B, Liu, Yupan

“…StoqMA characterizes the computational hardness of stoquastic local Hamiltonians, which is a family of Hamiltonians that does not suffer from the sign problem…”
Get full text