Related papers: On binary constructions of quantum codes
Hybrid codes simultaneously encode both quantum and classical information into physical qubits. We give several general results about hybrid codes, most notably that the quantum codes comprising a genuine hybrid code must be impure and that…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
We derive weighted sums, including binomial and double binomial sums, for the generalized Fibonacci sequence $\{G_m\}$ where for $m\ge 2$, $G_m=G_{m-1}+G_{m-2}$ with initial values $G_0$ and $G_1$.
A new generalization of the Gray map is introduced. The new generalization $\Phi: Z_{2^k}^n \to Z_{2}^{2^{k-1}n}$ is connected with the known generalized Gray map $\phi$ in the following way: if we take two dual linear $Z_{2^k}$-codes and…
We demonstrate that small quantum memories, realized via quantum error correction in multi-qubit devices, can benefit substantially by choosing a quantum code that is tailored to the relevant error model of the system. For a biased noise…
New upper and lower bounds for the error probability over an erasure channel are provided, making use of Wei's generalized weights, hierarchy and spectra. In many situations the upper and lower bounds coincide and this allows improvement of…
Loop Quantum Gravity is widely developed using canonical quantization in an effort to find the correct quantization for gravity. Affine quantization, which is like canonical quantization augmented bounded in one orientation, e.g., a…
We generalize probabilistic amplitude shaping (PAS) with binary codes to the case of non-binary codes defined over prime finite fields. Firstly, we introduce probabilistic shaping via time sharing where shaping applies to information…
For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…
Treating general relativity as an effective field theory, we compute the leading-order quantum corrections to the orbits and gravitational-wave emission of astrophysical compact binaries. These corrections are independent of the (unknown)…
We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show…
A unified framework for different formulations of quantum theoery is introduced specifying what is meant by a quantum mechanical theory in general.
We formulate a Born rule for families of quantum systems parametrized by a noncommutative space of control parameters. The resulting formalism may be viewed as a generalization of quantum mechanics where overlaps take values in a…
Motivated by applications in polymer-based data storage we introduced the new problem of characterizing the code rate and designing constant-weight binary $B_2$-sequences. Binary $B_2$-sequences are collections of binary strings of length…
Given some group $G$ of logical gates, for instance the Clifford group, what are the quantum encodings for which these logical gates can be implemented by simple physical operations, described by some physical representation of $G$? We…
The structure of counterterms in higher derivative quantum gravity is reexamined. Nontrivial dependence of charges on the gauge and parametrization is established. Explicit calculations of two-loop contributions are carried out with the…
We consider the problem of determining the weights of a quantum ensemble. That is to say, given a quantum system that is in a set of possible known states according to an unknown probability law, we give strategies to estimate the…
We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code;…
We introduce new families of pure quantum states that are constructed on top of the well-known Gilmore-Perelomov group-theoretic coherent states. We do this by constructing unitaries as the exponential of operators quadratic in Cartan…
We propose a new formalism of quantum subsystems which allows to unify the existing and new methods of reduced description of quantum systems. The main mathematical ingredients are completely positive maps and correlation functions. In this…