Number of the records: 1
Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity
- 1.0321926 - MÚ 2009 RIV US eng C - Conference Paper (international conference)
Gavinsky, D. - Pudlák, Pavel
Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity.
[Exponenciální separace kvantové a klasické neinteraktivní vícestranné komunikační složitosti.]
23rd Annual IEEE Conference on Computational Complexity. Maryland: IEEE Computer Society, 2008, s. 332-339. ISBN 978-0-7695-3169-4.
[Annual IEEE Conference on Computational Complexity/23./. College Park (US), 23.06.2008-26.06.2008]
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : communication complexity * quantum computations * extremal graphs
Subject RIV: BA - General Mathematics
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing settings
Ukážeme první separaci mezi kvantovou a klasickou mnohostrannou komunikační složitostí
Permanent Link: http://hdl.handle.net/11104/0170325
File Download Size Commentary Version Access Pudlak.pdf 1 1.1 MB Author’s postprint open-access
Number of the records: 1