• Home
  • Search
  • Lower bounds on the communication complexity of two-party (quantum) processes
  • Open Access IconOpen Access
  • Cite Icon3
  • https://doi.org/10.1109/isit.2014.6875080Copy DOI Icon

Lower bounds on the communication complexity of two-party (quantum) processes

  • Jun 1, 2014
  • Alberto Montina +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The process of state preparation, its transmission and subsequent measurement can be classically simulated through the communication of some amount of classical information. Recently, we proved that the minimal communication cost is the minimum of a convex functional over a space of suitable probability distributions. It is now proved that this optimization problem is the dual of a geometric programming maximization problem, which displays some appealing properties. First, the number of variables grows linearly with the input size. Second, the objective function is linear in the input parameters and the variables. Finally, the constraints do not depend on the input parameters. These properties imply that, once a feasible point is found, the computation of a lower bound on the communication cost in any two-party process is linearly complex. The studied scenario goes beyond quantum processes and includes the communication complexity scenario introduced by Yao. We illustrate the method by analytically deriving some non-trivial lower bounds. Finally, we conjecture the lower bound $n 2^n$ for a noiseless quantum channel with capacity $n$ qubits. This bound can have an interesting consequence in the context of the recent quantum-foundational debate on the reality of the quantum state.

Similar Papers
  • Conference Article
  • Citations388

Quantum vs. classical communication and computation

  • Jan 01, 1998
  • Harry Buhrman +2
  • Research Article
  • Citations8

Classical versus quantum communication in XOR games

  • Apr 05, 2018
  • Quantum Information Processing
  • Marius Junge +2
  • Research Article
  • Citations20

Communication Cost Minimization in Wireless Sensor and Actor Networks for Road Surveillance

  • Feb 01, 2011
  • IEEE Transactions on Vehicular Technology
  • Wenzhong Li +4
  • Research Article
  • Citations5

Observation of Genuine High-dimensional Multi-partite Non-locality in Entangled Photon States

  • May 30, 2025
  • Nature Communications
  • Xiao-Min Hu +12
  • Research Article
  • Citations54

Observation of Quantum Fingerprinting Beating the Classical Limit.

  • Jun 13, 2016
  • Physical Review Letters
  • Jian-Yu Guan +12
  • PDF
  • Research Article
  • Citations27

Multi-bit quantum random number generation from a single qubit quantum walk

  • Aug 23, 2019
  • Scientific Reports
  • Anupam Sarkar +1
  • Research Article
  • Citations154

Quantum Communication Complexity

  • Nov 01, 2003
  • Foundations of Physics
  • Gilles Brassard
  • PDF
  • Research Article
  • Citations14

Distributed detection of sequential anomalies in univariate time series

  • Mar 25, 2021
  • The VLDB Journal
  • Johannes Schneider +2
  • Conference Article
  • Citations25

Adaptive statistical sampling methods for decentralized estimation and detection of localized phenomena

  • Apr 24, 2005
  • E.B Ermis +1
  • Conference Article
  • Citations37

EEM-LEACH: Energy efficient multi-hop LEACH routing protocol for clustered WSNs

  • Jul 01, 2014
  • Ashlyn Antoo +1
  • Conference Article
  • Citations3

Block Design-Based Local Differential Privacy Mechanisms

  • Jun 25, 2023
  • Hyun-Young Park +2
  • Conference Article
  • Citations6

Tensor norms and the classical communication complexity of nonlocal quantum measurement

  • May 22, 2005
  • Yaoyun Shi
  • Conference Article
  • Citations109

The pattern matrix method for lower bounds on quantum communication

  • May 17, 2008
  • Alexander A Sherstov
  • Research Article
  • Citations14

Incorporating geographical location for team formation in social coding sites

  • Sep 12, 2019
  • World Wide Web
  • Liang Chen +5
  • Conference Article
  • Citations10

Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity

  • Jun 01, 2008
  • Dmitry Gavinsky +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.