Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

No-communication theorem

Known as: No communication, No communication theorem 
In physics, the no-communication theorem is a no-go theorem from quantum information theory which states that, during measurement of an entangled… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
This paper investigates voltage and reactive power control in distribution systems and how the presence of synchronous machine… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Most adults and adolescents in developed countries now own mobile phones and media devices, and for many people in developing… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider the control of interacting subsystems whose dynamics and constraints are decoupled, but whose state vectors are… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The prospect of receiving a monetary sanction for free riding has been shown to increase contributions to public goods. We ask… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
By colonizing and interconnecting more areas of life ever more deeply, empire has actually created the possibility for a… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a novel time-based positioning scheme (TPS) for efficient location discovery in outdoor sensor networks. TPS relies on… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the… Expand
  • figure 6
  • figure 7
  • figure 8
  • figure 9
  • figure 11
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The problem of nonpreemptively scheduling a set of m partially ordered tasks on n identical processors subject to interprocessor… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource requirements in a distributed… Expand
  • figure 1
  • figure 2
  • figure 7
  • figure 5
  • figure 8
Is this relevant?