Results 41 to 50 of about 96,137 (178)
Hybrid Continuous-discrete Variable Quantum Key Distribution
Guangtongxin yanjiu, 2023 As one of the main applications of quantum cryptography, Quantum Key Distribution (QKD) is a promising secure key transmission method. Compared with traditional communication methods, QKD protocols based on the basic principles of quantum mechanics have ...
JIN An-ran, LI He
doaj
IEEE Access, 2019 The employment of quantum error correction codes (QECCs) within quantum computers potentially offers a reliability improvement for both quantum computation and communications tasks.
Daryus Chandra +6 more
doaj +1 more source
Optimal dense coding with mixed state entanglement [PDF]
, 2000 I investigate dense coding with a general mixed state on the Hilbert space $C^{d}\otimes C^{d}$ shared between a sender and receiver. The following result is proved.
+6 more
core +2 more sources
The chain rule implies Tsirelson's bound: an approach from generalized mutual information
New Journal of Physics, 2012 In order to analyze an information theoretical derivation of Tsirelson's bound based on information causality, we introduce a generalized mutual information (GMI), defined as the optimal coding rate of a channel with classical inputs and general ...
Eyuri Wakakuwa, Mio Murao
doaj +1 more source
Quantum state redistribution based on a generalized decoupling
, 2008 We develop a simple protocol for a one-shot version of quantum state redistribution, which is the most general two-terminal source coding problem. The protocol is simplified from a combination of protocols for the fully quantum reverse Shannon and fully ...
M. A. Nielsen +3 more
core +1 more source
Generalizing Quantum Tanner Codes
2024 IEEE International Symposium on Information Theory Workshops (ISIT-W)In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Zémor, which contains a construction of asymptotically good quantum LDPC codes. Quantum Tanner codes have so far been constructed equivalently from groups, Cayley graphs, or square complexes constructed from groups.
Mostad, Olai Å. +2 more
openaire +2 more sources
Towers of generalized divisible quantum codes [PDF]
Physical Review A, 2018 A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is $2^ $ for a positive integer $ $, then one can construct a Calderbank-Shor-Steane (CSS) code, where $X$-stabilizer space is the divisible classical code, that admits a transversal gate in the $ $-th level of Clifford hierarchy.
openaire +2 more sources
General entanglement-assisted quantum error-correcting codes [PDF]
Physical Review A, 2007 Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-existing entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs which can only be constructed from dual-containing codes.
Hsieh, Min-Hsiu +2 more
openaire +2 more sources
, 2011 We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages.
Devetak, Igor +2 more
core +1 more source
Quantum generalized Reed-Solomon codes: Unified framework for quantum MDS codes
, 2008 We construct a new family of quantum MDS codes from classical generalized Reed-Solomon codes and derive the necessary and sufficient condition under which these quantum codes exist. We also give code bounds and show how to construct them analytically.
Li, Zhuo, Xing, Li-Juan, Wang, Xin-Mei
openaire +2 more sources