相关论文: Indeterminate-length quantum coding
We introduce quantum pin codes: a class of quantum CSS codes. Quantum pin codes are a generalization of quantum color codes and Reed-Muller codes and share a lot of their structure and properties. Pin codes have gauge operators, an…
The development of quantum computers has been the stimulus that enables the realization of Quantum Machine Learning (QML), an area that integrates the calculational framework of quantum mechanics with the adaptive properties of classical…
B. Schumacher and M. Westmoreland have established a quantum analog of a well-known classical information theory result on a role of relative entropy as a measure of non-optimality in (classical) data compression. In this paper, we provide…
We introduce a new graphical framework for designing quantum error correction codes based on classical principles. A key feature of this graphical language, over previous approaches, is that it is closely related to that of factor graphs or…
Finding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the…
We present a general construction of asymmetric quantum codes based on additive codes under the trace Hermitian inner product. Various families of additive codes over $\F_{4}$ are used in the construction of many asymmetric quantum codes…
We study different notions of quantum correlations in multipartite systems of distinguishable and indistinguishable particles. Based on the definition of quantum coherence for a single particle, we consider two possible extensions of this…
We consider the quantum dynamics of a test particle in noncommutative space under the influence of linearized gravitational waves in the long wave-length and low-velocity limit. A prescription for quantizing the classical Hamiltonian for…
The indeterministic outcome of a measurement of an individual quantum is certified by the impossibility of the simultaneous, definite, deterministic pre-existence of all conceivable observables from physical conditions of that quantum…
A famous open problem in the theory of quantum error-correcting codes is whether or not the parameters of an impure quantum code can violate the quantum Hamming bound for pure quantum codes. We partially solve this problem. We demonstrate…
In this work, we provide a detailed analysis of the issue of encoding of quantum information which is invariant with respect to arbitrary Lorentz transformations. We significantly extend already known results and provide compliments where…
Quantum, in contrast to classical, information theory, allows for different incompatible types (or species) of information which cannot be combined with each other. Distinguishing these incompatible types is useful in understanding the role…
Additive codes and some nonadditive codes use the single and multiple invariant subspaces of the stabilizer G, respectively, to construct quantum codes, so the selection of the invariant subspaces is a key problem. In this paper, I provide…
Long quantum codes using projective Reed-Muller codes are constructed. Projective Reed-Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum…
Classical evaluations of configurations of intertwined quantum contexts induce relations, such as true-implies-false, true-implies-true, but also nonseparability among the input and output terminals. When combined, these exploitable…
Quantum inequalities are lower bounds for local averages of quantum observables that have positive classical counterparts, such as the energy density or the Wick square. We establish such inequalities in general (possibly interacting)…
The classical limit of non-integrable quantum systems is studied. We define non-integrable quantum systems as those which have, as their classical limit, a non-integrable classical system. In order to obtain this limit, the self-induced…
Quantum inequalities are bounds on negative time-averages of the energy density of a quantum field. They can be used to rule out exotic spacetimes in general relativity. We study quantum inequalities for a scalar field with a background…
A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems. When each subsystem is a complex…
We discuss inequalities holding between the vocabulary size, i.e., the number of distinct nonterminal symbols in a grammar-based compression for a string, and the excess length of the respective universal code, i.e., the code-based analog…