基于快速Jacket变换的量子纠错码*

受到基于Pauli矩阵的快速Jacket变换的启发,提出一种利用分块Jacket矩阵简化量子纠错码编码方案的方法。与已有的量子纠错码构造法相比,在构造量子Jacket码的稳定子的时候,不需要检验经典纠错码的“自对偶”条件,因此,它能促使高效地利用由分块Jacket矩阵产生的Pauli矩阵群的交换子群直接生成辛内积为零的独立向量,在此基础上构造出码长较大、参数较好的量子纠错码。该量子Jacket码具有构造快速、纠错行为渐进好的优点。     

Fast quantum codes based on Pauli block jacket matrices

Jacket matrices motivated by the center weight Hadamard matrices have played an important role in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a design approach for the Pauli block jacket matrix achieved by substituting some Pauli matrices for all elements of common matrices. Since, the well-known Pauli matrices have been widely utilized for quantum information processing, the large-order Pauli block jacket matrix that contains commutative row operations are investigated in detail. After that some special Abelian groups are elegantly generated from any independent rows of the yielded Pauli block jacket matrix. Finally, we show how the Pauli block jacket matrix can simplify the coding theory of quantum error-correction. The quantum codes we provide do not require the dual-containing constraint necessary for the standard quantum error-correction codes, thus allowing us to construct quantum codes of the large codeword length. The proposed codes can be constructed structurally by using the stabilizer formalism of Abelian groups whose generators are selected from the row operations of the Pauli block jacket matrix, and hence have advantages of being fast constructed with the asymptotically good behaviors.     

Abstract error groups via Jones unitary braid group representations at q = i

In this paper, we classify a type of abstract groups by the central products of dihedral groups and quaternion groups. We recognize them as abstract error groups which are often not isomorphic to the Pauli groups in the literature. We show the corresponding nice error bases equivalent to the Pauli error bases modulo phase factors. The extension of these abstract groups by the symmetric group are finite images of the Jones unitary representations (or modulo a phase factor) of the braid group at q = i or r = 4. We hope this work can finally lead to new families of quantum error correction codes via the representation theory of the braid group.      

Special sequences as subcodes of reed-solomon codes

We consider sequences in which every symbol of an alphabet occurs at most once. We construct families of such sequences as nonlinear subcodes of a q-ary [n, k, n − k + 1] _q Reed-Solomon code of length n ≤ q consisting of words that have no identical symbols. We introduce the notion of a bunch of words of a linear code. For dimensions k ≤ 3 we obtain constructive lower estimates (tight bounds in a number of cases) on the maximum cardinality of a subcode for various n and q, and construct subsets of words meeting these estimates and bounds. We define codes with words that have no identical symbols, observe their relation to permutation codes, and state an optimization problem for them.     

New Quasi-cyclic Degenerate Linear Codes over GF(8)

Let [n, k, d] _q code be a linear code of length n, dimension k, and minimum Hamming distance d over GF(q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, quasi-cyclic (QC) codes were proved to contain many such codes. In this paper, twenty-five new codes over GF(8) are constructed, which improve the best known lower bounds on minimum distance.     

Quantum Algorithms for Weighing Matrices and Quadratic Residues

Abstract. In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to devise new quantum algorithms. We show how the properties of a weighing matrix can be used to construct a problem for which the quantum query complexity is significantly lower than the classical one. It is pointed out that this scheme captures both Bernstein and Vazirani's inner-product protocol, as well as Grover's search algorithm. In the second part of the article we consider Paley's construction of Hadamard matrices, which relies on the properties of quadratic characters over finite fields. We design a query problem that uses the Legendre symbol χ (which indicates if an element of a finite field F _q is a quadratic residue or not). It is shown how for a shifted Legendre function f _s (i)=χ(i+s) , the unknown s ∈ F _q can be obtained exactly with only two quantum calls to f _s . This is in sharp contrast with the observation that any classical, probabilistic procedure requires more than log q + log ((1-ɛ )/2) queries to solve the same problem.     

Asymptotic estimation of the fraction of errors correctable by <Emphasis Type="Italic">q</Emphasis>-ary LDPC codes

We consider an ensemble of random q-ary LDPC codes. As constituent codes, we use q-ary single-parity-check codes with d = 2 and Reed-Solomon codes with d = 3. We propose a hard-decision iterative decoding algorithm with the number of iterations of the order of the logarithm of the code length. We show that under this decoding algorithm there are codes in the ensemble with the number of correctable errors linearly growing with the code length. We weaken a condition on the vertex expansion of the Tanner graph corresponding to the code.     

Dualities and identities for entanglement-assisted quantum codes

The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is the code resulting from exchanging the original code’s information qubits with its ebits. To introduce this notion, we show how entanglement-assisted repetition codes and accumulator codes are dual to each other, much like their classical counterparts, and we give an explicit, general quantum shift-register circuit that encodes both classes of codes. We later show that our constructions are optimal, and this result completes our understanding of these dual classes of codes. We also establish the Gilbert–Varshamov bound and the Plotkin bound for EAQEC codes, and we use these to examine the existence of some EAQEC codes. Finally, we provide upper bounds on the block error probability when transmitting maximal-entanglement EAQEC codes over the depolarizing channel, and we derive variations of the hashing bound for EAQEC codes, which is a lower bound on the maximum rate at which reliable communication over Pauli channels is possible with the use of pre-shared entanglement.     

The group of permutation automorphisms of a <Emphasis Type="Italic">q</Emphasis>-ary hamming code

We prove that the group of permutation automorphism of a q-ary Hamming code of length n = (q ^m − 1)/(q − 1) is isomorphic to the unitriangular group UT _m (q) if the code has a parity-check matrix composed of all columns of the form (0 ...0 1 * ... *)^T. We also show that the group of permutation automorphisms of a cyclic Hamming code cannot be isomorphic to UT _m (q). We thus show that equivalent codes can have different permutation automorphism groups.     

Application of constacyclic codes to entanglement-assisted quantum maximum distance separable codes

The entanglement-assisted stabilizer formalism overcomes the dual-containing constraint of standard stabilizer formalism for constructing quantum codes. This allows ones to construct entanglement-assisted quantum error-correcting codes (EAQECCs) from arbitrary linear codes by pre-shared entanglement between the sender and the receiver. However, it is not easy to determine the number c of pre-shared entanglement pairs required to construct an EAQECC from arbitrary linear codes. In this paper, let q be a prime power, we aim to construct new q-ary EAQECCs from constacyclic codes. Firstly, we define the decomposition of the defining set of constacyclic codes, which transforms the problem of determining the number c into determining a subset of the defining set of underlying constacyclic codes. Secondly, five families of non-Hermitian dual-containing constacyclic codes are discussed. Hence, many entanglement-assisted quantum maximum distance separable codes with \(c\le 7\) are constructed from them, including ones with minimum distance \(d\ge q+1\). Most of these codes are new, and some of them have better performance than ones obtained in the literature.     

A Breit–Pauli distorted wave implementation for autostructure

We describe the Breit–Pauli distorted wave (BPDW) approach for the electron-impact excitation of atomic ions that we have implemented within the autostructure code.

Program summary

Program title:autostructureCatalogue identifier: AEIV_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIV_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 130 987No. of bytes in distributed program, including test data, etc.: 1 031 584Distribution format: tar.gzProgramming language: Fortran 77/95Computer: GeneralOperating system: UnixHas the code been vectorized or parallelized?: Yes, a parallel version, with MPI directives, is included in the distribution.RAM: From several kbytes to several GbytesClassification: 2, 2.4Nature of problem: Collision strengths for the electron-impact excitation of atomic ions are calculated using a Breit–Pauli distorted wave approach with the optional inclusion of two-body non-fine-structure and fine-structure interactions.Solution method: General multi-configuration Breit–Pauli atomic structure. A jK-coupling partial wave expansion of the collision problem. Slater state angular algebra. Various model potential non-relativistic or kappa-averaged relativistic radial orbital solutions — the continuum distorted wave orbitals are not required to be orthogonal to the bound.Additional comments: Documentation is provided in the distribution file along with the test-case.Running time: From a few seconds to a few hours.     

Randomized naming using wait-free shared variables

A naming protocol assigns unique names (keys) to every process out of a set of communicating processes. We construct a randomized wait-free naming protocol using wait-free atomic read/write registers (shared variables) as process intercommunication primitives. Each process has its own private register and can read all others. The addresses/names each one uses for the others are possibly different: Processes p and q address the register of process r in a way not known to each other. For processes and , the protocol uses a name space of size and running time (read/writes to shared bits) with probability at least , and overall expected running time. The protocol is based on the wait-free implementation of a novel -Test&SetOnce object that randomly and fast selects a winner from a set of q contenders with probability at least in the face of the strongest possible adaptive adversary. Received: September 1994 / Accepted: January 1998     

Bounds on the minimum code distance for nonbinary codes based on bipartite graphs

The minimum distance of codes on bipartite graphs (BG codes) over GF(q) is studied. A new upper bound on the minimum distance of BG codes is derived. The bound is shown to lie below the Gilbert-Varshamov bound when q ≤ 32. Since the codes based on bipartite expander graphs (BEG codes) are a special case of BG codes and the resulting bound is valid for any BG code, it is also valid for BEG codes. Thus, nonbinary (q ≤ 32) BG codes are worse than the best known linear codes. This is the key result of the work. We also obtain a lower bound on the minimum distance of BG codes with a Reed-Solomon constituent code and a lower bound on the minimum distance of low-density parity-check (LDPC) codes with a Reed-Solomon constituent code. The bound for LDPC codes is very close to the Gilbert-Varshamov bound and lies above the upper bound for BG codes.     

Experimentally identifying the entanglement class of pure tripartite states

We use concurrence as an entanglement measure and experimentally demonstrate the entanglement classification of arbitrary three-qubit pure states on a nuclear magnetic resonance quantum information processor. Computing the concurrence experimentally under three different bipartitions, for an arbitrary three-qubit pure state, reveals the entanglement class of the state. The experiment involves measuring the expectation values of Pauli operators. This was achieved by mapping the desired expectation values onto the local z magnetization of a single qubit. We tested the entanglement classification protocol on twenty-seven different generic states and successfully detected their entanglement class. Full quantum state tomography was performed to construct experimental tomographs of each state and negativity was calculated from them, to validate the experimental results.     

q-Rung orthopair fuzzy sets-based decision-theoretic rough sets for three-way decisions under group decision making

As an extension of Pythagorean fuzzy sets, the q-rung orthopair fuzzy sets (q-ROFSs) can easily solve uncertain information in a broader perspective. Considering the fine property of q-ROFSs, we introduce q-ROFSs into decision-theoretic rough sets (DTRSs) and use it to portray the loss function. According to the Bayesian decision procedure, we further construct a basic model of q-rung orthopair fuzzy decision-theoretic rough sets (q-ROFDTRSs) under the q-rung orthopair fuzzy environment. At the same time, we design the corresponding method for the deduction of three-way decisions by utilizing projection-based distance measures and TOPSIS. Then, we extend q-ROFDTRSs to adapt the group decision-making (GDM) scenario. To fuse different experts’ evaluation results, we propose some new aggregation operators of q-ROFSs by utilizing power average (PA) and power geometric (PG) operators, that is, q-rung orthopair fuzzy power average, q-rung orthopair fuzzy power weighted average (q-ROFPWA), q-rung orthopair fuzzy power geometric, and q-rung orthopair fuzzy power weighted geometric (q-ROFPWG). In addition, with the aid of q-ROFPWA and q-ROFPWG, we investigate three-way decisions with q-ROFDTRSs under the GDM situation. Finally, we give the example of a rural e-commence GDM problem to illustrate the application of our proposed method and verify our results by conducting two comparative experiments.     

New q-ary quantum MDS codes with distances bigger than $$\frac{ q}{2}$$

The construction of quantum MDS codes has been studied by many authors. We refer to the table in page 1482 of (IEEE Trans Inf Theory 61(3):1474–1484, 2015) for known constructions. However, there have been constructed only a few q-ary quantum MDS \([[n,n-2d+2,d]]_q\) codes with minimum distances \(d>\frac{q}{2}\) for sparse lengths \(n>q+1\). In the case \(n=\frac{q^2-1}{m}\) where \(m|q+1\) or \(m|q-1\) there are complete results. In the case \(n=\frac{q^2-1}{m}\) while \(m|q^2-1\) is neither a factor of \(q-1\) nor \(q+1\), no q-ary quantum MDS code with \(d> \frac{q}{2}\) has been constructed. In this paper we propose a direct approach to construct Hermitian self-orthogonal codes over \(\mathbf{F}_{q^2}\). Then we give some new q-ary quantum codes in this case. Moreover many new q-ary quantum MDS codes with lengths of the form \(\frac{w(q^2-1)}{u}\) and minimum distances \(d > \frac{q}{2}\) are presented.     

Encoding an arbitrary state in a [7,1,3] quantum error correction code

We calculate the fidelity with which an arbitrary state can be encoded into a [7, 1, 3] Calderbank-Shor-Steane quantum error correction code in a non-equiprobable Pauli operator error environment with the goal of determining whether this encoding can be used for practical implementations of quantum computation. The determination of usability is accomplished by applying ideal error correction to the encoded state which demonstrates the correctability of errors that occurred during the encoding process. We also apply single-qubit Clifford gates to the encoded state and determine the accuracy with which these gates can be implemented. Finally, fault tolerant noisy error correction is applied to the encoded states allowing us to compare noisy (realistic) and perfect error correction implementations. We find the encoding to be usable for the states ${|0\rangle, |1\rangle}$ , and ${|\pm\rangle = |0\rangle\pm|1\rangle}$ . These results have implications for when non-fault tolerant procedures may be used in practical quantum computation and whether quantum error correction must be applied at every step in a quantum protocol.     

Construction of Perfect q-ary Codes by Sequential Switchings of $$\widetilde\alpha $$ -Components

We suggest a construction of perfect q-ary codes using sequential switchings of special-type components of the Hamming code. The construction yields a lower bound on the number of different q-ary codes.     

Some cosine similarity measures and distance measures between q-rung orthopair fuzzy sets

In this paper, we consider some cosine similarity measures and distance measures between q-rung orthopair fuzzy sets (q-ROFSs). First, we define a cosine similarity measure and a Euclidean distance measure of q-ROFSs, their properties are also studied. Considering that the cosine measure does not satisfy the axiom of similarity measure, then we propose a method to construct other similarity measures between q-ROFSs based on the proposed cosine similarity and Euclidean distance measures, and it satisfies with the axiom of the similarity measure. Furthermore, we obtain a cosine distance measure between q-ROFSs by using the relationship between the similarity and distance measures, then we extend technique for order of preference by similarity to the ideal solution method to the proposed cosine distance measure, which can deal with the related decision-making problems not only from the point of view of geometry but also from the point of view of algebra. Finally, we give a practical example to illustrate the reasonableness and effectiveness of the proposed method, which is also compared with other existing methods.