scholarly journals The equivalence between correctability of deletions and insertions of separable states in quantum codes

Author(s):  
Taro Shibayama ◽  
Yingkai Ouyang
2021 ◽  
Vol 126 (16) ◽  
Author(s):  
Anatoly Dymarsky ◽  
Alfred Shapere
Keyword(s):  

2021 ◽  
Vol 20 (4) ◽  
Author(s):  
Hai Q. Dinh ◽  
Sachin Pathak ◽  
Tushar Bag ◽  
Ashish Kumar Upadhyay ◽  
Woraphon Yamaka

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Filip Rozpędek ◽  
Kyungjoo Noh ◽  
Qian Xu ◽  
Saikat Guha ◽  
Liang Jiang

AbstractWe propose an architecture of quantum-error-correction-based quantum repeaters that combines techniques used in discrete- and continuous-variable quantum information. Specifically, we propose to encode the transmitted qubits in a concatenated code consisting of two levels. On the first level we use a continuous-variable GKP code encoding the qubit in a single bosonic mode. On the second level we use a small discrete-variable code. Such an architecture has two important features. Firstly, errors on each of the two levels are corrected in repeaters of two different types. This enables for achieving performance needed in practical scenarios with a reduced cost with respect to an architecture for which all repeaters are the same. Secondly, the use of continuous-variable GKP code on the lower level generates additional analog information which enhances the error-correcting capabilities of the second-level code such that long-distance communication becomes possible with encodings consisting of only four or seven optical modes.


2014 ◽  
Vol 28 (06) ◽  
pp. 1450017 ◽  
Author(s):  
RUIHU LI ◽  
GEN XU ◽  
LUOBIN GUO

In this paper, we discuss two problems on asymmetric quantum error-correcting codes (AQECCs). The first one is on the construction of a [[12, 1, 5/3]]2 asymmetric quantum code, we show an impure [[12, 1, 5/3 ]]2 exists. The second one is on the construction of AQECCs from binary cyclic codes, we construct many families of new asymmetric quantum codes with dz> δ max +1 from binary primitive cyclic codes of length n = 2m-1, where δ max = 2⌈m/2⌉-1 is the maximal designed distance of dual containing narrow sense BCH code of length n = 2m-1. A number of known codes are special cases of the codes given here. Some of these AQECCs have parameters better than the ones available in the literature.


2014 ◽  
Vol 73 (2) ◽  
pp. 417-424 ◽  
Author(s):  
Petr Lisoněk ◽  
Vijaykumar Singh

AIP Advances ◽  
2017 ◽  
Vol 7 (4) ◽  
pp. 045020 ◽  
Author(s):  
P. A. Deymier ◽  
K. Runge

2017 ◽  
Vol 95 (2) ◽  
Author(s):  
Christopher Chamberland ◽  
Tomas Jochym-O'Connor ◽  
Raymond Laflamme
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document