quantumerror correction is an essential ingredient for universal quantum computing.D espite tremendous experimental efforts in the study of quantumerror correction,to date,there has been no demonstration in the real...
详细信息
quantumerror correction is an essential ingredient for universal quantum computing.D espite tremendous experimental efforts in the study of quantumerror correction,to date,there has been no demonstration in the realis ation of universal quantum error-correcting code,with the subsequent verification of all key features including the identification of an arbitrary physical error,the capability for transversal manipulation of the logical state and state *** address this challenge,we experimentally realise the [5,1,3]code,the so-called smallest perfect code that permits corrections of generic single-qubit *** the experiment,having optimised the encoding circuit,we employ an array of superconducting qubits to realise the [5,1,3] code for several typical logical states including the magic state,an indispensable resource for realising non-Clifford *** encoded states are prepared with an average fidelity of 57.1(3)% while with a high fidelity of 98.6(1)% in the code ***,the arbitrary single-qubit errors introduced manually are identified by measuring the *** further implement logical Pauli operations with a fidelity of 97.2(2)% within the code ***,we realise the decoding circuit and recover the input state with an overall fidelity of 74.5(6)%,in total with 92 *** work demonstrates each key aspect of the [5,1,3] code and verifies the viability of experimental realisation of quantum error-correcting codes with superconducting qubits.
We present a systematic way to construct p-ary quantumerrorcorrectingcodes using logic functions. As a consequence, for a given function with APC distance d′ 2, we can construct quantumcodes with parameters ((n, ...
详细信息
We present a systematic way to construct p-ary quantumerrorcorrectingcodes using logic functions. As a consequence, for a given function with APC distance d′ 2, we can construct quantumcodes with parameters ((n, K, d))p and gain a lower bound of K for all 2 d d′. The basic states of the constructed quantumcodes can be stated and the sufficient conditions for saturating quantum Singleton bound are also discussed. We give quantumcodes [[5, 1, 3]]p with p prime, [[6, 0, 4]], [[6, 2, 3]]p with p > 2 prime and [[2n, 2n - 2, 2]] as examples constructed in this way.
quantum secret sharing(QSS) is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code (QECC) to im...
详细信息
quantum secret sharing(QSS) is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code (QECC) to implement a quantum (k, 2k-1) threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.
Quasi-cyclic codes form a generalization of cyclic codes, and contain a large number of record breaking codes. In this paper, we provide a method for constructing self-orthogonal quasi-cyclic codes, and obtain a large...
详细信息
Quasi-cyclic codes form a generalization of cyclic codes, and contain a large number of record breaking codes. In this paper, we provide a method for constructing self-orthogonal quasi-cyclic codes, and obtain a large number of new quantum quasi-cyclic codes by CSS construction.
This paper proposes a simple framework for constructing a stabilizer code with an arbitrary binary matrix. We define a relation between A (1) and A (2) of a binary check matrix A = (A (1)|A (2)) associated with stabil...
详细信息
This paper proposes a simple framework for constructing a stabilizer code with an arbitrary binary matrix. We define a relation between A (1) and A (2) of a binary check matrix A = (A (1)|A (2)) associated with stabilizer generators of a quantum error-correcting code. Given an arbitrary binary matrix, we can derive a pair of A (1) and A (2) by the relation. As examples, we illustrate two kinds of stabilizer codes: quantum LDPC codes and quantum convolutional codes. By the nature of the proposed framework, the stabilizer codes covered in this paper belong to general stabilizer (non-CSS) codes.
Construction X and its variants are known from the theory of classical error control codes. We present instances of these constructions that produce binary stabilizer quantumerror control codes from arbitrary quatern...
详细信息
Construction X and its variants are known from the theory of classical error control codes. We present instances of these constructions that produce binary stabilizer quantumerror control codes from arbitrary quaternary linear codes. Our construction does not require the classical linear code that is used as the ingredient to satisfy the dual containment condition, or, equivalently, is not required to satisfy the self-orthogonality condition. We prove lower bounds on the minimum distance of quantumcodes obtained from our construction. We give examples of record breaking quantumcodes produced from our construction. In these examples, the ingredient code is nearly dual containing, or, equivalently, is nearly self-orthogonal, by which we mean that is positive but small.
In this paper, we consider to use the quantum stabilizer codes as secret sharing schemes for classical secrets. We give necessary and sufficient conditions for qualified and forbidden sets in terms of quantum stabiliz...
详细信息
In this paper, we consider to use the quantum stabilizer codes as secret sharing schemes for classical secrets. We give necessary and sufficient conditions for qualified and forbidden sets in terms of quantum stabilizers. Then, we give a Gilbert-Varshamov-type sufficient condition for existence of secret sharing schemes with given parameters, and by using that sufficient condition, we show that roughly 19% of participants can be made forbidden independently of the size of classical secret, in particular when an n-bit classical secret is shared among n participants having 1-qubit share each. We also consider how much information is obtained by an intermediate set and express that amount of information in terms of quantum stabilizers. All the results are stated in terms of linear spaces over finite fields associated with the quantum stabilizers.
This paper proposes a new construction of quantum low-density parity check (LDPC) codes that belong to the class of general stabilizer (non-CSS) codes. The method constructs a binary check matrix associated with the s...
详细信息
This paper proposes a new construction of quantum low-density parity check (LDPC) codes that belong to the class of general stabilizer (non-CSS) codes. The method constructs a binary check matrix associated with the stabilizer generators of a quantum LDPC code. The binary check matrix is obtained from a large bipartite graph built by combining several small bipartite graphs called seed graphs. Computer simulation results show that the proposed code has similar or better performance than other quantum LDPC codes, and can be improved by exploiting the degenerate effect of quantum error-correcting codes.
We develop the theory of entanglement-assisted quantumerror-correcting (EAQEC) codes, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to preshared entanglement...
详细信息
We develop the theory of entanglement-assisted quantumerror-correcting (EAQEC) codes, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to preshared entanglement. Conventional stabilizer codes are equivalent to self-orthogonal symplectic codes. In contrast, EAQEC codes do not require self-orthogonality, which greatly simplifies their construction. We show how any classical binary or quaternary block code can be made into an EAQEC code. We provide a table of best known EAQEC codes with code length up to 10. With the self-orthogonality constraint removed, we see that the distance of an EAQEC code can be better than any standard quantum error-correcting code with the same fixed net yield. In a quantum computation setting, EAQEC codes give rise to catalytic quantumcodes, which assume a subset of the qubits are noiseless. We also give an alternative construction of EAQEC codes by making classical entanglement-assisted codes coherent.
In this paper, we provide methods for constructing Hermitian dual-containing (HDC) matrix-product codes over F-q2 from some non-singular matrices and a special sequence of HDC codes and determine parameters of obtaine...
详细信息
In this paper, we provide methods for constructing Hermitian dual-containing (HDC) matrix-product codes over F-q2 from some non-singular matrices and a special sequence of HDC codes and determine parameters of obtained matrix-product codes when the input matrix and sequence of HDC codes satisfy some conditions. Then, using some nested HDC BCH codes with lengths n = q(4)-1/a (a = 1 or a = q +/- 1), we construct some HDC matrix-product codes with lengths N = 2n or 3n and derive nonbinary quantumcodes with length N from these matrix-product codes via Hermitian construction. Four classes of quantumcodes over F-q (3 <= q <= 5) are presented, whose parameters are better than those in the literature. Besides, some of our new quantumcodes can exceed the quantum Gilbert-Varshamov (GV) bound.
暂无评论