Bennett's laws

Bennett's laws of quantum information are: 1. * 1 qubit 1 bit (classical) 2. * 1 qubit 1 ebit (entanglement bit) 3. * 1 ebit + 1 qubit 2 bits (i.e… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1987-2017
02419872017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The present study examines both positive and negative norms of reciprocity in managerial work relationships by assessing three… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 1
Is this relevant?
2013
2013
 Mineralogical Association of Canada Short Course 43, Winnipeg MB, May 2013, p. xx-xx INTRODUCTION The direct disposal of spent… (More)
  • figure 11-2
  • figure 11-3
  • figure 11-4
  • figure 11-5
  • figure 11-6
Is this relevant?
2012
2012
We propose a new unconditionally secure bit commitment scheme based on Minkowski causality and the properties of quantum… (More)
  • figure 1
Is this relevant?
2008
2008
In quantum cryptosystems, variations in detector efficiency can be exploited to stage a successful attack. This happens when the… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2008
2008
We compare the performance of various quantum-key-distribution (QKD) systems using 1550 nm up-conversion single-photon detectors… (More)
Is this relevant?
2007
2007
There is a natural orthogonal basis of the 6-qubit decoherence-free (DF) space robust against collective noise. Interestingly… (More)
  • table I
Is this relevant?
2006
2006
We compare the performance of Bennett-Brassard 1984 BB84 and Scarani-Acin-Ribordy-Gisin 2004 SARG04 protocols, the latter of… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
The quantum circuit and design are presented for an optimized entangling probe attacking the BB84 Protocol of quantum key… (More)
Is this relevant?
1994
1994
We analyse the Bennett-Wiesner dense quantum coding scheme for non-maximally entangled carriers of information. Our… (More)
Is this relevant?
1987
1987
T wo measures of the "meaningful" complexity of an infini te string are shown to be equivalent up to a constant (under app… (More)
Is this relevant?