User talk:Shitikanth/sandbox/QIP (complexity)
Shitikanth,
I noticed several gaps in the narrative on this page:
- 'quantum interactive proof', 'strategy', 'no matter what the prover does' (what is the prover allowed to do?), 'completeness' and 'soundness' are not defined (a definition or a reference should be given here)
- the description of the proof system for quantum circuit distinguishability is incomplete at best
- the proof of statement (1): the description of the protocol is clipped, and the proof seems incomplete
- the proof of statement (2) is also incomplete
- a description of the steps in the QIP = PSPACE proof would be helpful
- much of the notation in the section on parallel approximation is undefined (Phi_1, Phi_2, theta, Psi, ...)
- the loss matrix in the MMWU algorithm should be defined ("observe the loss matrix..." is probably a vestige from the generic scheme)
- details on approximate calculation of the matrix operations and implementation in PSPACE is missing
- reference for Reichardt et al. is missing
- check for typos everywhere; there are quite a few
Ashwin Nayak 05:11, 20 January 2014 (UTC) — Preceding unsigned comment added by Nayak ashwin (talk • contribs)
Start a discussion about improving the User:Shitikanth/sandbox/QIP (complexity) page
Talk pages are where people discuss how to make content on Wikipedia the best that it can be. You can use this page to start a discussion with others about how to improve the "User:Shitikanth/sandbox/QIP (complexity)" page.
