Quantum entanglement and the communication complexity of the inner product function
- Univ. of Calgary, Alberta (Canada)
- Univ. of Oxford (United Kingdom)
- Los Alamos National Lab., NM (United States)
- Univ. de Montreal, Quebec (Canada)
The authors consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of particles in an entangled quantum state. They prove linear lower bounds for both exact protocols, as well as for protocols that determine the answer with bounded-error probability. The proofs employ a novel kind of quantum reduction from multibit communication problems to the problem of computing the inner product. The communication required for the former problem can then be bounded by an application of Holevo`s theorem. They also give a specific example of a probabilistic scenario where entanglement reduces the communication complexity of the inner product function by one bit.
- Research Organization:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE Assistant Secretary for Management and Administration, Washington, DC (United States); Office of Naval Research, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 661703
- Report Number(s):
- LA-UR-98-725; CONF-980245-; ON: DE98003710; CNN: Grant ONR N00014-93-1-0116; TRN: AHC29814%%180
- Resource Relation:
- Conference: 1. NASA international conference on quantum computing and quantum communications, Palm Springs, CA (United States), 15-20 Feb 1998; Other Information: PBD: [1998]
- Country of Publication:
- United States
- Language:
- English
Similar Records
Communication cost of entanglement transformations
One-qubit fingerprinting schemes