2014/12/11 by Hussain Anwar, Anwar, Hussain, Sania Jevtic +6 · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.48550/arxiv.1412.3780
5 pages, all comments are welcome, updated version includes minor corrections (all results still hold)
arxiv created 2014/12/17 · arxiv updated 2014/12/19
An important problem in quantum information theory is to understand what makes entangled quantum systems non-local or hard to simulate efficiently. In this work we consider situations in which various parties have access to a restricted set of measurements on their particles, and construct entangled quantum states that are essentially classical for those measurements. In particular, given any set of local measurements on a large enough Hilbert space whose dual strictly contains (i.e. contains an open neighborhood of) a pure state, we use the PEPS formalism and ideas from generalized probabilistic theories to construct pure multiparty entangled states that have (a) local hidden variable models, and (b) can be efficiently simulated classically. We believe that the examples we construct cannot be efficiently classically simulated using previous techniques. Without the restriction on the measurements, the states that we construct are non-local, and in some proof-of-principle cases are universal for measurement based quantum computation.