排序方式: 共有3条查询结果,搜索用时 15 毫秒
1
1.
Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with what
we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices.
Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary
to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount
of communication that would be classically required.
Pseudo-telepathy is a surprising application of quantum information processing to communication complexity. Thanks to entanglement,
perhaps the most nonclassical manifestation of quantum mechanics, two or more quantum players can accomplish a distributed
task with no need for communication whatsoever, which would be an impossible feat for classical players. After a detailed
overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and not-so-recent work on the subject.
In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors.
Supported in Part by Canada’s Natural Sciences and Engineering Research Council (NSERC), the Canada Research Chair programme
and the Canadian Institute for Advanced Research (CIAR).
Supported in part by a scholarship from Canada’s NSERC.
Supported in part by Canada’s NSERC
Québec’s Fonds de recherche sur la nature et les technologies (FQRNT), the CIAR and the Mathematics of Information Technology
and Complex Systems Network (MITACS). 相似文献
2.
Gilles Brassard 《Foundations of Physics》2003,33(11):1593-1616
Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits—unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational tasks for which quantum communication cannot be simulated efficiently by classical means. In some cases, the effect of transmitting quantum bits cannot be achieved classically short of transmitting an exponentially larger number of bits. In a similar vein, can entanglement be used to save on classical communication? It is well known that entanglement on its own is useless for the transmission of information. Yet, there are distributed tasks that cannot be accomplished at all in a classical world when communication is not allowed, but that become possible if the non-communicating parties share prior entanglement. This leads to the question of how expensive it is, in terms of classical communication, to provide an exact simulation of the spooky power of entanglement. 相似文献
3.
1