175 citations · 1.6k across the 65 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
quant-ph2009
QIP = PSPACE
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay +1
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a pa…
quant-ph2009★ 11 cited
Non-Identity Check Remains QMA-Complete for Short Circuits
Zhengfeng Ji, Xiaodi Wu
The Non-Identity Check problem asks whether a given a quantum circuit is far away from the identity or not. It is well known that this problem is QMA-Complete \cite{JWB05}. In this…