Quantum entanglement and the communication complexity of the inner product function

Thumbnail image of item number 1 in: 'Quantum entanglement and the communication complexity of the inner product function'.
Thumbnail image of item number 2 in: 'Quantum entanglement and the communication complexity of the inner product function'.
Thumbnail image of item number 3 in: 'Quantum entanglement and the communication complexity of the inner product function'.
Thumbnail image of item number 4 in: 'Quantum entanglement and the communication complexity of the inner product function'.
Showing 1-4 of 17 pages in this article.

PDF Version Also Available for Download.

Description

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 ... continued below

Physical Description

14 p.

Creation Information

Cleve, R.; Dam, W. van; Nielsen, M. & Tapp, A. August 1, 1998.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 11 times . More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Authors

  • Cleve, R. Univ. of Calgary, Alberta (Canada)
  • Dam, W. van Univ. of Oxford (United Kingdom)
  • Nielsen, M. Univ. of New Mexico, Albuquerque, NM (United States)
  • Tapp, A. Univ. de Montreal, Quebec (Canada)

Sponsors

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

About | Browse this Partner

Contact Us

Corrections Questions

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

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.

Physical Description

14 p.

Notes

OSTI as DE98003710

Source

  • 1. NASA international conference on quantum computing and quantum communications, Palm Springs, CA (United States), 15-20 Feb 1998

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Other: DE98003710
  • Report No.: LA-UR--98-725
  • Report No.: CONF-980245--
  • Grant Number: W-7405-ENG-36
  • Office of Scientific & Technical Information Report Number: 661703
  • Archival Resource Key: ark:/67531/metadc706249

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

About | Browse this Collection

What responsibilities do I have when using this article?

Digital Files

When

Dates and time periods associated with this article.

Creation Date

  • August 1, 1998

Added to The UNT Digital Library

  • Sept. 12, 2015, 6:31 a.m.

Description Last Updated

  • Oct. 3, 2017, 12:53 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 11
More Statistics

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

Thumbnail image of item number 1 in: 'Quantum entanglement and the communication complexity of the inner product function'.
Thumbnail image of item number 2 in: 'Quantum entanglement and the communication complexity of the inner product function'.
Thumbnail image of item number 3 in: 'Quantum entanglement and the communication complexity of the inner product function'.
Thumbnail image of item number 4 in: 'Quantum entanglement and the communication complexity of the inner product function'.

PDF Version Also Available for Download.

Citations, Rights, Re-Use

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Cleve, R.; Dam, W. van; Nielsen, M. & Tapp, A. Quantum entanglement and the communication complexity of the inner product function, article, August 1, 1998; New Mexico. (digital.library.unt.edu/ark:/67531/metadc706249/: accessed May 22, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.