Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,825,518 papers from all fields of science
Search
Sign In
Create Free Account
Quantum capacity
Known as:
Hashing bound
, Quantum channel capacity
In the theory of quantum communication, the quantum capacity is the highest rate at which quantum information can be communicated over many…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Amplitude damping channel
Classical capacity
Coherent information
Entanglement-assisted classical capacity
Expand
Broader (6)
Classes of computers
Computational complexity theory
Information theory
Quantum cryptography
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
RELATIONSHIP BETWEEN THE VARIATION OF SEISMIC CAPACITY AFTER DAMAGING EARTHQUAKES, COLLAPSE PROBABILITY AND REPAIR COSTS: DETAILED EVALUATION FOR A NON-DUCTILE BUILDING
M. d'Aragona
,
M. Polese
,
A. Prota
2015
Corpus ID: 55144519
Decisions on reparability for damaged buildings after an earthquake are often controversial, and they should properly take into…
Expand
2014
2014
Wiretap channel with strictly causal side information at encoder
Amir Sonee
,
G. Hodtani
Iran Workshop on Communication and Information…
2014
Corpus ID: 16421268
In this paper, the wiretap channel with side information studied in [2] is revisited for the case in which the side information…
Expand
Review
2013
Review
2013
A Survey of Geometrically-Based MIMO Propagation Channel Models
Fatemeh Zadeh-Parizi
,
M. Mehrjoo
,
J. Ahmadi-shokouh
2013
Corpus ID: 6338598
The paper presents a classification of multiple-input multiple-output (MIMO) geometrybased stochastic channel models (GSCM…
Expand
2013
2013
Streaming erasure codes under mismatched source-channel frame rates
Pratik Patil
,
Ahmed Badr
,
A. Khisti
Canadian Workshop on Information Theory
2013
Corpus ID: 1380399
Streaming erasure codes sequentially encode a source stream into channel packets over a burst erasure channel and guarantee that…
Expand
2010
2010
Novel geometrical solution to additivity problem of classical quantum channel capacity
L. Gyongyosi
,
S. Imre
IEEE Sarnoff Symposium
2010
Corpus ID: 24754316
Quantum channel additivity is currently an active area of research in Quantum Information Theory. The additivity conjectures have…
Expand
2009
2009
Reliability and scalability analysis of low cost long distance IP-based wireless networks
Daniele Trinchero
,
R. Stefanelli
,
A. Galardini
ITU-T Kaleidoscope: Innovations for Digital…
2009
Corpus ID: 8973918
Low cost digital radios are sometimes proposed as an affordable tool for the realization of long distance (multikilometric - MKM…
Expand
2007
2007
On the Broadcast Capacity of Multihop Wireless Networks: Interplay of Power, Density and Interference
A. Keshavarz-Haddad
,
R. Riedi
Annual IEEE Communications Society Conference on…
2007
Corpus ID: 9365552
In wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such that all…
Expand
2002
2002
On Entangled Quantum Capacity
V. Belavkin
2002
Corpus ID: 59043136
The pure quantum entanglement is generalized to the case of mixed compoundstates to include the classical-quantum encoding as a…
Expand
1999
1999
A simplified method of calculating busbar inductance and its application for stray resonance analysis in an inverter dc link
K. Tsuboi
,
M. Tsuji
,
E. Yamada
1999
Corpus ID: 15924308
Sinusoidal PWM control is widely applied to power electronic converters. The carrier frequency of recent converter products is…
Expand
1993
1993
On the relation between Cantor’s capacity and the sectional capacity
R. Rumely
1993
Corpus ID: 14314551
0. Introduction. Recently, Chinburg (123) introduced a new kind of capacity for algebraic varieties, which he called the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE