Fetching the paper…
Reading the bibliography…
We consider the power of various quantum complexity classes with the restriction that states and operators are defined over a real, rather than complex, Hilbert space.
Simulating quantum systems using real hilbert spaces
Matthew McKague, Michele Mosca, and Nicolas Gisin · 1923
Earlier work this paper cites.
Pspace has 2-round quantum interactive proof systems
John Watrous · 1999
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
Succinct quantum proofs for properties of finite groups
J. Watrous · 2000
Earlier work this paper cites.
Quantum certificate verification: Single versus multiple quantum certificates, October 2001
Hirotada Kobayashi, Keiji Matsumoto, and Tomoyuki Yamakami · 2001
Cited alongside, same era.
Limits on the power of quantum statistical zero-knowledge
John Watrous · 2002
Cited alongside, same era.
Quantum multi-prover interactive proof systems with limited prior entanglement
Hirotada Kobayashi and Keiji Matsumoto · 2003
Cited alongside, same era.
Computational Complexity, A Modern Approach
Sanjeev Arora and Boaz Barak · 2009
Cited alongside, same era.
Zero-knowledge against quantum attacks
John Watrous · 2009
Later among the works it cites.
An efficient test for product states, with applications to quantum merlin-arthur games
Aram Harrow and Ashley Montanaro · 2010
Later among the works it cites.
Quantum Information Processing with Adversarial Devices
Matthew McKague · 2010
Later among the works it cites.
Generalized self-testing and the security of the 6-state protocol
Matthew McKague and Michele Mosca · 2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…