Results 31 to 40 of about 12,091 (250)
IEEE Access, 2020 For Internet of Vehicles (IoV) systems with multiple users, network coding can be introduced to provide efficient error control and throughput improvement services. However, if the heterogeneity characteristics and requirements of the end users (vehicles)
Chen Huang +3 more
doaj +1 more source
An explicit construction of quantum codes from one-generator generalized quasi-cyclic codes [PDF]
MATEC Web of Conferences, 2021 In this paper, we take advantage of a class of one-generator generalized quasi-cyclic (GQC) codes of index 2 to construct quantum error-correcting codes. By studying the form of Hermitian dual codes and their algebraic structure, we propose a sufficient condition for self-orthogonality of GQC codes with Hermitian inner product.
Yao Yu, Ma Yuena, Li Husheng, Lv Jingjie
openaire +2 more sources
Hyperdense coding and superadditivity of classical capacities in hypersphere theories
New Journal of Physics, 2015 In quantum superdense coding, two parties previously sharing entanglement can communicate a two bit message by sending a single qubit. We study this feature in the broader framework of general probabilistic theories.
Serge Massar +2 more
doaj +1 more source
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
Quantum soundness of testing tensor codes
Discrete Analysis, 2022 Quantum soundness of testing tensor codes, Discrete Analysis 2022:17, 73 pp. This paper proves an essential component of a major recent result in complexity theory, known as the MIP*=RE theorem, which was proved by the same authors.
Zhengfeng Ji +4 more
doaj +1 more source
Quantum Codes from Generalized Reed-Solomon Codes and Matrix-Product Codes
CoRR, 2015 One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized Reed-Solomon codes. We also present some classes of quantum codes from matrix-product codes.
Tao Zhang 0030, Gennian Ge
openaire +2 more sources
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
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.
Olai Å. Mostad +2 more
openaire +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
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.
Todd A. Brun +2 more
openaire +2 more sources