Entanglement-assisted operator codeword stabilized quantum codes

In this paper, we introduce a unified framework to construct entanglement-assisted quantum error-correcting codes (QECCs), including additive and nonadditive codes, based on the codeword stabilized (CWS) framework on subsystems. The CWS framework is a scheme to construct QECCs, including both additive and nonadditive codes, and gives a method to construct a QECC from a classical error-correcting code in standard form. Entangled pairs of qubits (ebits) can be used to improve capacity of quantum error correction. In addition, it gives a method to overcome the dual-containing constraint. Operator quantum error correction (OQEC) gives a general framework to construct QECCs. We construct OQEC codes with ebits based on the CWS framework. This new scheme, entanglement-assisted operator codeword stabilized (EAOCWS) quantum codes, is the most general framework we know of to construct both additive and nonadditive codes from classical error-correcting codes. We describe the formalism of our scheme, demonstrate the construction with examples, and give several EAOCWS codes     

利用立方图的线图构造量子纠错码

量子纠错码在量子通信和量子计算中起着非常重要的作用,之前的量子纠错码的构造大部分都是利用经典的纠错码来构造得到,如Hamming码,BCH码,RS码,Reed-Muller码等各种经典纠错码。目前,很少有人利用图生成的线性码方法来构造量子纠错码,提出了一个新的构造量子纠错码和非对称量子纠错码的方法,即利用[n]立方图的线图生成的二元线性码来构造量子纠错码和非对称量子纠错码,得到了一类新的量子纠错码和非对称量子纠错码,并且,当码字的长度较大时,对所构造的非对称量子纠错码,在非对称信道上有更大的纠错能力。     

On the distance of stabilizer quantum codes from <Emphasis Type="Italic">J</Emphasis>-affine variety codes

Self-orthogonal J-affine variety codes have been successfully used to obtain quantum stabilizer codes with excellent parameters. In a previous paper we gave formulae for the dimension of this family of quantum codes, but no bound for the minimum distance was given. In this work, we show how to derive quantum stabilizer codes with designed minimum distance from J-affine variety codes and their subfield-subcodes. Moreover, this allows us to obtain new quantum codes, some of them either with better parameters, or with larger distances than the previously known codes.     

Joint Measurements on Qubits and Cloning of Observables

Cloning of observables, unlike standard cloning of states, aims at copying the information encoded in the statistics of a class of observables rather then on quantum states themselves. In such a process the emphasis is on the quantum operation (evolution plus measurement) necessary to retrieve the original information. We analyze, for qubit systems, the cloning of a class generated by two noncommuting observables, elucidating the relationship between such a process and joint measurements. This helps in establishing an optimality criterion for cloning of observables. We see that, even if the cloning machine is designed to act on the whole class generated by two noncommuting observables, the same optimal performances of a joint measurement can be attained. Finally, the connection with state dependent cloning is enlightened.     

Limitations on post-processing assisted quantum programming

A quantum multimeter is a programmable device that can implement measurements of different observables depending on the programming quantum state inserted into it. The advantage of this arrangement over a single-purpose device is in its versatility: one can realize various measurements simply by changing the programming state. The classical manipulation of measurement output data is known as post-processing. In this work we study the post-processing assisted quantum programming, which is a protocol where quantum programming and classical post-processing are combined. We provide examples showing that these two processes combined can be more efficient than either of them used separately. Furthermore, we derive an inequality relating the programming resources to their corresponding programmed observables, thereby enabling us to study the limitations on post-processing assisted quantum programming.     

Quantum Set Theory Extending the Standard Probabilistic Interpretation of Quantum Theory

The notion of equality between two observables will play many important roles in foundations of quantum theory. However, the standard probabilistic interpretation based on the conventional Born formula does not give the probability of equality between two arbitrary observables, since the Born formula gives the probability distribution only for a commuting family of observables. In this paper, quantum set theory developed by Takeuti and the present author is used to systematically extend the standard probabilistic interpretation of quantum theory to define the probability of equality between two arbitrary observables in an arbitrary state. We apply this new interpretation to quantum measurement theory, and establish a logical basis for the difference between simultaneous measurability and simultaneous determinateness.     

基于两步测量方法及其最少观测次数的任意量子纯态估计

量子状态层析所需要的完备观测次数d~2(d=2~n)随着状态的量子位数n的增加呈指数增长,这使得对高维量子态的层析变得十分困难.本文提出一种基于两步测量的量子态估计方法,可以对任意量子纯态的估计提供最少的观测次数.本文证明:当选择泡利观测算符,采用本文所提出的量子态估计方法对d=2n维希尔伯特空间中的任意n量子位纯态进行重构时,如果为本征态,那么所需最少观测次数memin仅为memin=n;对于包含l(2 6 l 6 d)个非零本征值的叠加态,重构所需最少观测次数msmin满足msmin=d+2l..3,此数目远小于压缩传感理论给出的量子态重构所需测量配置数目O(rd log d),以及目前已发表论文给出的纯态唯一确定所需最少观测次数4d..5.同时给出最少观测次数对应的最优观测算符集的构建方案,并通过仿真实验对本文所提出的量子态估计方法进行验证,实验中重构保真度均达到97%以上.     

Automated error correction in IBM quantum computer and explicit generalization

Construction of a fault-tolerant quantum computer remains a challenging problem due to unavoidable noise and fragile quantum states. However, this goal can be achieved by introducing quantum error-correcting codes. Here, we experimentally realize an automated error correction code and demonstrate the nondestructive discrimination of GHZ states in IBM 5-qubit quantum computer. After performing quantum state tomography, we obtain the experimental results with a high fidelity. Finally, we generalize the investigated code for maximally entangled n-qudit case, which could both detect and automatically correct any arbitrary phase-change error, or any phase-flip error, or any bit-flip error, or combined error of all types of error.     

Stronger uncertainty relations with improvable upper and lower bounds

The quantum superposition principle is used to establish improved upper and lower bounds for the Maccone–Pati uncertainty inequality, which is based on a “weighted-like” sum of the variances of observables. Our bounds include free parameters that not only guarantee nontrivial bounds but also effectively control the bounds’ tightness. Significantly, these free parameters depend on neither the state nor the observables. A feature of our method is that any nontrivial bound can always be improved. In addition, we generalize both bounds to uncertainty relations with multiple (three or more) observables, maintaining the uncertainty relations’ tightness. Examples are given to illustrate our improved bounds.     

Dynamical Solution to the Quantum Measurement Problem, Causality, and Paradoxes of the Quantum Century

A history and drama of the development of quantum theory is outlined starting from the discovery of the Plank's constant exactly 100 years ago. It is shown that before the rise of quantum mechanics 75 years ago, the quantum theory had appeared first in the form of the statistics of quantum thermal noise and quantum spontaneous jumps which have never been explained by quantum mechanics. Moreover, the only reasonable probabilistic interpretation of quantum theory put forward by Max Born was in fact in irreconcilable contradiction with traditional mechanical reality and causality. This led to numerous quantum paradoxes; some of them, related to the great inventors of quantum theory such as Einstein and Schrödinger, are reconsidered in the paper. The development of quantum measurement theory, initiated by von Neumann, indicated a possibility for the resolution of this interpretational crisis by a divorce of the algebra of dynamical generators and a subalgebra of the actual observables. It is shown that within this approach quantum causality can be rehabilitated in the form of a superselection rule for compatibility of past observables with the potential future. This rule together with self-compatibility of measurements ensuring the consitency of histories is called the nondemolition principle. The application of these rules in the form of dynamical commutation relations leads to the derivation of the von Neumann projection postulate, as well as to more general reductions, instantaneous, spontaneous, and even continuous in time. This gives a quantum probabilistic solution in the form of dynamical filtering equations to the notorious measurement problem which was tackled unsuccessfully by many famous physicists starting from Schrödinger and Bohr. The simplest Markovian quantum stochastic model for time-continuous measurements involves a boundary-value problem in second quantization for input "offer" waves in one extra dimension, and a reduction of the algebra of "actual" observables to an Abelian subalgebra for the output waves.     

DNA codes for nonadditive stem similarity

DNA sequences are sequences with elements from the quaternary DNA alphabet {A, C, G, T}. An important property of them is their directedness and ability to form duplexes as a result of hybridization process, i.e., coalescing two oppositely directed sequences. In biological experiments exploiting this property it is necessary to generate an ensemble of such sequences (DNA codes) consisting of pairs of DNA sequences referred to as Watson-Crick duplexes. Furthermore, for any two words of the DNA code that do not form a Watson-Crick duplex, hybridization energy—stability measure of a potential DNA duplex—is upper bounded by a constant specified by conditions of an experiment. This problem can naturally be interpreted in terms of coding theory. Continuing our previous works, we consider a nonadditive similarity function for two DNA sequences, which most adequately models their hybridization energy. For the maximum cardinality of DNA codes based on this similarity, we establish a Singleton upper bound and present an example of an optimal construction. Using ensembles of DNA codes with special constraints on codewords, which we call Fibonacci ensembles, we obtain a random-coding lower bound on the maximum cardinality of DNA codes under this similarity function.     

Flavour Les Houches Accord: Interfacing flavour related codes

We present the Flavour Les Houches Accord (FLHA) which specifies a set of conventions for flavour-related parameters and observables. The FLHA uses the generic SUSY Les Houches Accord (SLHA) file structure. It defines the relevant Standard Model masses, Wilson coefficients, decay constants, bag parameters, flavour observables, etc. The accord provides a universal and model-independent interface between codes evaluating and/or using flavour-related observables.     

三元域上对偶距离为3的自正交码构造

自正交码是一类特别重要的线性码,是构造量子码的基础。研究了三元域F3上对偶距离为3的自正交码的构造。对两类码长n,用递归和组合的方法构造出对偶距离为3的三元自正交码。依据所得到的自正交码构造距离为3的三元量子码,所得到的量子码具有很好的参数。     

两个非对称图量子MDS码的构造

量子纠错编码技术在量子信息理论中一直以来有着重要的地位,在量子纠错编码方案中,Schingemann和Werner两人提出了通过构造具有某些性质的图（矩阵）来构造非二元量子码的方法,他们利用这种图论方法构造出很多好的量子码,特别给出量子码[[[5,1,3]]p][(p≥3)]存在性的一个新证明。此方法可从对称量子码推广至非对称量子码的构造,利用推广方法证明了非对称图量子MDS码[[[5,1,4/2]]p],[(p>5)]和[[[7,1,6/2]]p][(p>7)]的存在性。     

Towards Approximation of Equilibrium States in Nonadditive Lattice Systems

We propose a framework for solving the problem of approximation of equilibrium-like like states in one-dimensional classical lattice systems with superadditive Hamiltonians. Systems of this type arise naturally in the generalisation of thermodynamic formalism dealing with the dynamics generated by nonconformal maps, [4,5]. It is known that although a generalised version of variational principle holds for such systems, equilibrium states may not exist in general. Our approach is to characterise approximately equilibrium states by linear functionals bounded by free energy on a suitable Banach space of Hamiltonians. We construct a map binding states on the algebra of observables with linear functionals on the space of (nonadditive) Hamiltonians and study its basic properties.     

A class of quantum low-density parity check codes by combining seed graphs

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 $A=(A_{1}|A_{2})$ 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.     

Asymmetric quantum codes: new codes from old

In this paper we extend to asymmetric quantum error-correcting codes the construction methods, namely: puncturing, extending, expanding, direct sum and the $({ \mathbf u}| \mathbf{u}+{ \mathbf v})$ construction. By applying these methods, several families of asymmetric quantum codes can be constructed. Consequently, as an example of application of quantum code expansion developed here, new families of asymmetric quantum codes derived from generalized Reed-Muller codes, quadratic residue, Bose-Chaudhuri-Hocquenghem, character codes and affine-invariant codes are constructed.     

Quantum value indefiniteness

The indeterministic outcome of a measurement of an individual quantum is certified by the impossibility of the simultaneous, unique, definite, deterministic pre-existence of all conceivable observables from physical conditions of that quantum alone.     

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

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