23 research outputs found
Weight Distribution of Classical Codes Influences Robust Quantum Metrology
Quantum metrology (QM) is expected to be a prominent use-case of quantum
technologies. However, noise easily degrades these quantum probe states, and
negates the quantum advantage they would have offered in a noiseless setting.
Although quantum error correction (QEC) can help tackle noise, fault-tolerant
methods are too resource intensive for near-term use. Hence, a strategy for
(near-term) robust QM that is easily adaptable to future QEC-based QM is
desirable. Here, we propose such an architecture by studying the performance of
quantum probe states that are constructed from binary block codes of
minimum distance . Such states can be interpreted as a logical
state of a CSS code whose logical group is defined by the aforesaid binary
code. When a constant, , number of qubits of the quantum probe state are
erased, using the quantum Fisher information (QFI) we show that the resultant
noisy probe can give an estimate of the magnetic field with a precision that
scales inversely with the variances of the weight distributions of the
corresponding shortened codes. If is any code concatenated with inner
repetition codes of length linear in , a quantum advantage in QM is
possible. Hence, given any CSS code of constant length, concatenation with
repetition codes of length linear in is asymptotically optimal for QM with
a constant number of erasure errors. We also explicitly construct an observable
that when measured on such noisy code-inspired probe states, yields a precision
on the magnetic field strength that also exhibits a quantum advantage in the
limit of vanishing magnetic field strength. We emphasize that, despite the use
of coding-theoretic methods, our results do not involve syndrome measurements
or error correction. We complement our results with examples of probe states
constructed from Reed-Muller codes.Comment: 21 pages, 3 figure
Kerdock Codes Determine Unitary 2-Designs
The non-linear binary Kerdock codes are known to be Gray images of certain
extended cyclic codes of length over . We show that
exponentiating these -valued codewords by produces stabilizer states, that are quantum states obtained using
only Clifford unitaries. These states are also the common eigenvectors of
commuting Hermitian matrices forming maximal commutative subgroups (MCS) of the
Pauli group. We use this quantum description to simplify the derivation of the
classical weight distribution of Kerdock codes. Next, we organize the
stabilizer states to form mutually unbiased bases and prove that
automorphisms of the Kerdock code permute their corresponding MCS, thereby
forming a subgroup of the Clifford group. When represented as symplectic
matrices, this subgroup is isomorphic to the projective special linear group
PSL(). We show that this automorphism group acts transitively on the Pauli
matrices, which implies that the ensemble is Pauli mixing and hence forms a
unitary -design. The Kerdock design described here was originally discovered
by Cleve et al. (arXiv:1501.04592), but the connection to classical codes is
new which simplifies its description and translation to circuits significantly.
Sampling from the design is straightforward, the translation to circuits uses
only Clifford gates, and the process does not require ancillary qubits.
Finally, we also develop algorithms for optimizing the synthesis of unitary
-designs on encoded qubits, i.e., to construct logical unitary -designs.
Software implementations are available at
https://github.com/nrenga/symplectic-arxiv18a, which we use to provide
empirical gate complexities for up to qubits.Comment: 16 pages double-column, 4 figures, and some circuits. Accepted to
2019 Intl. Symp. Inf. Theory (ISIT), and PDF of the 5-page ISIT version is
included in the arXiv packag
On Cyclic Polar Codes and the Burst Erasure Performance of Spatially-Coupled LDPC Codes
In this thesis, we produce our work on two of the state-of-the-art techniques in modern coding theory: polar codes and spatially-coupled LDPC codes.
Polar codes were introduced in 2009 and proven to achieve the symmetric capacity of any binary-input discrete memoryless channel under low-complexity successive cancellation decoding. Since then, finite length (non-asymptotic) performance has been the primary concern with respect to polar codes. In this work, we construct cyclic polar codes based on a mixed-radix Cooley-Tukey decomposition of the Galois field Fourier transform. The main results are: we can, for the first time, construct, encode and decode polar codes that are cyclic, with their blocklength being arbitrary; for a given target block erasure rate, we can achieve significantly higher code rates on the erasure channel than the original polar codes, at comparable blocklengths; on the symmetric channel with only errors, we can perform much better than equivalent rate Reed-Solomon codes with the same blocklength, by using soft-decision decoding; and, since the codes are subcodes of higher rate RS codes, a RS decoder can be used if suboptimal performance suffices for the application as a trade-o_ for higher decoding speed. The programs developed for this work can be accessed at https://github.com/nrenga/cyclic_polar.
In 2010, it was shown that spatially-coupled low-density parity-check (LDPC) codes approach the capacity of binary memoryless channels, asymptotically, with belief-propagation (BP) decoding. In our work, we are interested in the finite length average performance of randomly coupled LDPC ensembles on binary erasure channels with memory. The significant contributions of this work are: tight lower bounds for the block erasure probability (PB) under various scenarios for the burst pattern; bounds focused on practical scenarios where a burst affects exactly one of the coupled codes; expected error floor for the bit erasure probability (Pb) on the binary erasure channel; and, characterization of the performance of random regular ensembles, on erasure channels, with a single vector describing distinct types of size-2 stopping sets. All these results are verified using Monte-Carlo simulations. Further, we show that increasing variable node degree combined with expurgation can improve PB by several orders of magnitude in the number of bits per coupled code
Kerdock Codes Determine Unitary 2-Designs
The binary non-linear Kerdock codes are Gray images of β€_4-linear Kerdock codes of length N =2^m . We show that exponentiating Δ±=ββ-1 by these β€_4-valued codewords produces stabilizer states, which are the common eigenvectors of maximal commutative subgroups (MCS) of the Pauli group. We use this quantum description to simplify the proof of the classical weight distribution of Kerdock codes. Next, we partition stabilizer states into N +1 mutually unbiased bases and prove that automorphisms of the Kerdock code permute the associated MCS. This automorphism group, represented as symplectic matrices, is isomorphic to the projective special linear group PSL(2,N) and forms a unitary 2-design. The design described here was originally discovered by Cleve et al. (2016), but the connection to classical codes is new. This significantly simplifies the description of the design and its translation to circuits
Mitigating Coherent Noise by Balancing Weight-2 -Stabilizers
Physical platforms such as trapped ions suffer from coherent noise where
errors manifest as rotations about a particular axis and can accumulate over
time. We investigate passive mitigation through decoherence free subspaces,
requiring the noise to preserve the code space of a stabilizer code, and to act
as the logical identity operator on the protected information. Thus, we develop
necessary and sufficient conditions for all transversal -rotations to
preserve the code space of a stabilizer code, which require the weight-
-stabilizers to cover all the qubits that are in the support of some
-component. Further, the weight- -stabilizers generate a direct
product of single-parity-check codes with even block length. By adjusting the
size of these components, we are able to construct a large family of QECC
codes, oblivious to coherent noise, that includes the Shor
codes. Moreover, given even and any stabilizer code, we can
construct an stabilizer code that is oblivious to coherent
noise.
If we require that transversal -rotations preserve the code space only up
to some finite level in the Clifford hierarchy, then we can construct
higher level gates necessary for universal quantum computation. The
-stabilizers supported on each non-zero -component form a classical
binary code C, which is required to contain a self-dual code, and the classical
Gleason's theorem constrains its weight enumerator. The conditions for a
stabilizer code being preserved by transversal -rotations at level in the Clifford hierarchy lead to
generalizations of Gleason's theorem that may be of independent interest to
classical coding theorists.Comment: Jingzhen Hu and Qingzhong Liang contributed equally to this work. The
paper was accepted to IEEE Transactions on Information Theory. The ISIT paper
is available as an ancillary fil