Quantum computation and pseudo-telepathic games

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages

Scientific paper

A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information-processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of 'pseudo-telepathic' games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players' correlated responses in a game).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantum computation and pseudo-telepathic games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum computation and pseudo-telepathic games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum computation and pseudo-telepathic games will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-518855

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.