PIRSA:14040060

Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution

Brassard, G. (2014). Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution. Perimeter Institute. https://pirsa.org/14040060

Brassard, Gilles. Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution. Perimeter Institute, Apr. 16, 2014, https://pirsa.org/14040060 

          @misc{ pirsa_PIRSA:14040060,
            doi = {10.48660/14040060},
            url = {https://pirsa.org/14040060},
            author = {Brassard, Gilles},
            keywords = {Quantum Information},
            language = {en},
            title = {Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution},
            publisher = {Perimeter Institute},
            year = {2014},
            month = {apr},
            note = {PIRSA:14040060 see, \url{https://pirsa.org}}
          }

Gilles Brassard

Université de Montréal

Talk number
PIRSA:14040060
Collection
Talk Type
Subject
Abstract
John Bell has shown that the correlations entailed by quantum mechanics cannot be reproduced by a classical process involving non-communicating parties. But can they be simulated with the help of bounded communication? This problem has been studied for more than twenty years and it is now well understood in the case of bipartite entanglement. However, the issue was still widely open for multipartite entanglement, even for the simplest case, which is the tripartite Greenberger-Horne-Zeilinger (GHZ) state. We give an exact simulation of arbitrary independent von Neumann measurements on general n-partite GHZ states. Our protocol requires O(n^2) bits of expected communication between the parties, and O(n log n) expected time is sufficient to carry it out in parallel. Furthermore, we need only an expectation of O(n) independent unbiased random bits, with no need for the generation of continuous real random variables nor prior shared random variables. In the case of equatorial measurements, we improve earlier results with a protocol that needs only O(n log n) bits of communication and O(log^2 n) parallel time. At the cost of a slight increase in the number of bits communicated, these tasks can be accomplished with a constant expected number of rounds.