Communication Complexity as a Principle of Quantum Mechanics

Author(s):  
Adán Cabello
2010 ◽  
Vol 08 (01n02) ◽  
pp. 259-269
Author(s):  
ANNE BROADBENT ◽  
ALAIN TAPP

We present a brief survey of results where quantum information processing is useful for performing distributed computation tasks. We describe problems that are impossible to solve using classical resources but that become feasible with the help of quantum mechanics. We also give examples where the use of quantum information significantly reduces the need for communication. The main focus of the survey is on communication complexity but we also address other distributed tasks.


Quantum ◽  
2017 ◽  
Vol 1 ◽  
pp. 10 ◽  
Author(s):  
Mateus Araújo ◽  
Adrien Feix ◽  
Miguel Navascués ◽  
Časlav Brukner

To study which are the most general causal structures which are compatible with local quantum mechanics, Oreshkov et al. introduced the notion of a process: a resource shared between some parties that allows for quantum communication between them without a predetermined causal order. These processes can be used to perform several tasks that are impossible in standard quantum mechanics: they allow for the violation of causal inequalities, and provide an advantage for computational and communication complexity. Nonetheless, no process that can be used to violate a causal inequality is known to be physically implementable. There is therefore considerable interest in determining which processes are physical and which are just mathematical artefacts of the framework. Here we make the first step in this direction, by proposing a purification postulate: processes are physical only if they are purifiable. We derive necessary conditions for a process to be purifiable, and show that several known processes do not satisfy them.


Author(s):  
Gennaro Auletta ◽  
Mauro Fortunato ◽  
Giorgio Parisi
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document