Zhang Shengyu
Status: Alumnus (data might not be up-to-date)

Former Research Affiliate

Preprints

  • S. Zhang. Quantum Strategic Game Theory.
  • I. Kerenidis, S. Zhang. A quantum protocol for sampling correlated equilibria unconditionally and without a mediator.

Publications

  • R. Jain, Z.H. Wei, Penghui Yao, S. Zhang. (2017). Multipartite Quantum Correlation and Communication Complexities. Computational Complexity 26 199--228
  • Z.H. Wei, S. Zhang. (2017). Quantum Game Players Can Have Advantage Without Discord. Information and Computation 256 174-184
  • I. Arad, M. Santha, A. Sundaram, S. Zhang. (2016). Linear time algorithm for quantum 2SAT. Automata, Languages, and Programming 15 1-14
  • I. Arad, A. Bouland, D. Grier, M. Santha, A. Sundaram, S. Zhang. (2016). On the complexity of probabilistic trials for hidden satisfiability problems. International Symposium MFCS 12 1-14
  • Anna Pappa, Niraj Kumar, Thomas Lawson, M. Santha, S. Zhang, Eleni Diamanti, I. Kerenidis. (2015). Nonlocality and conflicting interest games. Phys. Rev. Lett. 020401
  • R. Jain, Yaoyun Shi, Z.H. Wei, S. Zhang. (2013). Efficient protocols for generating bipartite classical distributions and quantum states. IEEE Transactions on Information Theory 59 5171-5178
  • Z.H. Wei, S. Zhang. (2013). Full characterization of quantum correlated equilibria. Quantum Information and Computation 13 0846-0860
  • R. Jain, I. Kerenidis, Greg Kuperberg, M. Santha, Or Sattah, S. Zhang, Name of non-CQT author. (2012). On the power of a unique quantum witness. Theory of Computing 8 375-400
  • R. Jain, Yaoyun Shi, Z.H. Wei, S. Zhang. (2012). Correlation/Communication complexity of generating bipartite states. Symposium on Discrete Algorithms
  • S. Zhang. (2011). On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity. Proceedings of ICALP 1 49-60
  • R. Jain, S. Zhang. (2011). The influence lower bound via query elimination. Theory of Computing
  • T. Lee, S. Zhang. (2010). Composition theorems in communication complexity . Proceedings of ICALP
  • R. Jain, H. Klauck, S. Zhang. (2010). Depth-Independent Lower bounds on Communication Complexity of Read-Once Boolean Functions. COCOON 16