CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Kempe-J"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2011 | 2010 | 2008 | 2006 | 2004 | 2001
Number of items: 9.

2011

Kempe, Julia and Kobayashi, Hirotada and Matsumoto, Keiji et al. (2011) Entangled Games Are Hard to Approximate. SIAM Journal on Computing, 40 (3). pp. 848-877. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:20110713-155400829

Kempe, Julia and Vidick, Thomas (2011) Parallel Repetition of Entangled Games. In: Proceedings of the 43rd annual ACM symposium on Theory of computing. ACM , New York, NY, pp. 353-362. ISBN 978-1-4503-0691-1. https://resolver.caltech.edu/CaltechAUTHORS:20140910-135518364

2010

Kempe, J. and Vidick, T. (2010) Quantum Algorithms. In: Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments. Lecture Notes in Physics. No.808. Springer , Berlin, pp. 309-342. ISBN 978-3-642-11913-2. https://resolver.caltech.edu/CaltechAUTHORS:20200804-153453452

2008

Kempe, Julia and Kobayashi, Hirotada and Matsumoto, Keiji et al. (2008) Entangled games are hard to approximate. In: 49th Annual Symposium on Foundations-of-Computer-Science (FOCS). IEEE Computer Society , Los Alamitos, CA, pp. 447-456. ISBN 978-0-7695-3436-7. https://resolver.caltech.edu/CaltechAUTHORS:20140910-085511133

Kempe, Julia and Kobayashi, Hirotada and Matsumoto, Keiji et al. (2008) Using Entanglement in Quantum Multi-Prover Interactive Proofs. In: 23rd Annual IEEE Conference on Computational Complexity. IEEE , Piscataway, NJ, pp. 211-222. ISBN 978-0-7695-3169-4. https://resolver.caltech.edu/CaltechAUTHORS:20140910-083116800

2006

Kempe, Julia and Vidick, Thomas (2006) On the Power of Entangled Quantum Provers. . (Submitted) https://resolver.caltech.edu/CaltechAUTHORS:20160322-085312434

Kempe, Julia and Kitaev, Alexei and Regev, Oded (2006) The Complexity of the Local Hamiltonian Problem. SIAM Journal on Computing, 35 (5). pp. 1070-1097. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:KEMsiamjc06

2004

Kempe, Julia and Kitaev, Alexei and Regev, Oded (2004) The Complexity of the Local Hamiltonian Problem. In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. No.3328. Springer , Berlin, pp. 372-383. ISBN 978-3-540-24058-7. https://resolver.caltech.edu/CaltechAUTHORS:20191011-072647725

2001

Nielsen, M. A. and Kempe, J. (2001) Separable States Are More Disordered Globally than Locally. Physical Review Letters, 86 (22). pp. 5184-5187. ISSN 0031-9007. https://resolver.caltech.edu/CaltechAUTHORS:NIEprl01

This list was generated on Fri Aug 7 06:25:10 2020 PDT.