arXiv subjects

Markus Grassl

Publications and source records attributed to Markus Grassl.

At least 19 recordsLinked to original sources

arXiv2026

Space-sharing and Singleton Bounds for Entanglement-assisted Classical Coding

Recent work has noted that a space-sharing argument proves the tightness of the entropic quantum Singleton bounds, which was left open in the literature for various settings involving only-quantum messages, only-classical messages, or both classical and quantum messages. Focusing on the setting of entanglement-assisted classical coding (EACC), in this letter we first elaborate upon the space-sharing argument and the tight Singleton bound for this setting, and then establish a new tight entropic Singleton bound for EACC codes with entanglement assistance distributed across a subset of encoders when only local quantum operations are allowed at each encoder.

quant-ph↗

arXiv2026

The punctured dodecacode is unique

The punctured dodecacode is an additive $4$-ary code of length $11$ and distance $5$ which is uniformly packed. We show that a code with the same weight distribution is equivalent to it. This code is also shown to be nonlinear. We also establish the nonexistence of analogues of the dodecacode and the punctured dodecacode in Doob graphs. To that end, we classify two-weight codes of weights $6$ and $8$ in Doob and $4$-ary Hamming graphs of diameter $9$ and the corresponding strongly regular graphs. Keywords: dodecacode, additive code, trace Hermitian duality, uniformly packed code, completely regular code, Doob graph, strongly regular graph

math.CO↗

arXiv2025

A Conjecture on Almost Flat SIC-POVMs

A well supported conjecture states that SIC-POVMs -- maximal sets of complex equiangular lines -- with anti-unitary symmetry give rise to an identity expressing some of its overlaps as squares of the (rescaled) components of a suitably chosen fiducial vector. In number theoretical terms the identity essentially expresses Stark units as sums of products of pairs of square roots of Stark units. We investigate whether the identity is enough to determine these Stark units. The answer is no, but the failure might be quite mild.

quant-ph↗

arXiv2024

Puncturing Quantum Stabilizer Codes

Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. For quantum codes, a form of puncturing is known, but its description is based on the code space rather than its generators. In this work, we generalize the puncturing procedure to allow more freedom in the choice of which coded states are kept and which are removed. We describe this puncturing by focusing on the stabilizer matrix containing the generators of the code. In this way, we are able to explicitly describe the stabilizer matrix of the punctured code given the stabilizer matrix of the original stabilizer code. The additional freedom in the procedure also opens up new ways to construct new codes from old, and we present several ways to utilize this for the search of codes with good or even optimal parameters. In particular, we use the construction to obtain codes whose parameters exceed the best previously known. Lastly, we generalize the proof of the Griesmer bound from the classical setting to stabilizer codes since the proof relies heavily on the puncturing technique.

cs.IT↗

arXiv2024

Fast Algorithms and Implementations for Computing the Minimum Distance of Quantum Codes

The distance of a stabilizer quantum code is a very important feature since it determines the number of errors that can be detected and corrected. We present three new fast algorithms and implementations for computing the symplectic distance of the associated classical code. Our new algorithms are based on the Brouwer-Zimmermann algorithm. Our experimental study shows that these new implementations are much faster than current state-of-the-art licensed implementations on single-core processors, multicore processors, and shared-memory multiprocessors. In the most computationally-demanding cases, the performance gain in the computational time can be larger than one order of magnitude. The experimental study also shows a good scalability on shared-memory parallel architectures.

quant-ph↗

arXiv2024

Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes

Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. We expand the choices of the inner product to also cover the symplectic and trace-symplectic inner products, in addition to the original Hermitian one. A refined lower bound on the minimum distance of the resulting quantum codes is established and illustrated. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.

quant-ph↗

arXiv2024

Equivalence of constacyclic codes with shift constants of different orders

Let $a$ and $b$ be two non-zero elements of a finite field $\mathbb{F}_q$, where $q>2$. It has been shown that if $a$ and $b$ have the same multiplicative order in $\mathbb{F}_q$, then the families of $a$-constacyclic and $b$-constacyclic codes over $\mathbb{F}_q$ are monomially equivalent. In this paper, we investigate the monomial equivalence of $a$-constacyclic and $b$-constacyclic codes when $a$ and $b$ have distinct multiplicative orders. We present novel conditions for establishing monomial equivalence in such constacyclic codes, surpassing previous methods of determining monomially equivalent constacyclic and cyclic codes. As an application, we use these results to search for new linear codes more systematically. In particular, we present more than $70$ new record-breaking linear codes over various finite fields, as well as new binary quantum codes.

cs.IT↗

arXiv2024

SIC-POVMs from Stark Units: Dimensions n^2+3=4p, p prime

The existence problem for maximal sets of equiangular lines (or SICs) in complex Hilbert space of dimension $d$ remains largely open. In a previous publication (arXiv:2112.05552) we gave a conjectural algorithm for how to construct a SIC if $d = n^2+3 = p$, a prime number. Perhaps the most surprising number-theoretical aspect of that algorithm is the appearance of Stark units in a key role: a single Stark unit from a ray class field extension of a real quadratic field serves as a seed from which the SIC is constructed. The algorithm can be modified to apply to all dimensions $d = n^2+3$. Here we focus on the case when $d= n^2+3 = 4p$, $p$ prime, for two reasons. First, special measures have to be taken on the Hilbert space side of the problem when the dimension is even. Second, the degrees of the relevant ray class fields are `smooth' in a sense that facilitates exact calculations. As a result the algorithm becomes easier to explain. We give solutions for seventeen different dimensions of this form, reaching $d = 39604$. Several improvements relative to our previous publication are reported, but we cannot offer a proof that the algorithm works for any dimensions where it has not been tested.

quant-ph↗

arXiv2023

Codes for entanglement-assisted classical communication

Entanglement-assisted classical communication (EACC) aims to enhance communication systems using entanglement as an additional resource. However, there is a scarcity of explicit protocols designed for finite transmission scenarios, which presents a challenge for real-world implementation. In response we introduce a new EACC scheme capable of correcting a fixed number of erasures/errors. It can be adjusted to the available amount of entanglement and sends classical information over a quantum channel. We establish a general framework to accomplish such a task by reducing it to a classical problem. Comparing with specific bounds we identify optimal parameter ranges. The scheme requires only the implementation of super-dense coding which has been demonstrated successfully in experiments. Furthermore, our results shows that an adaptable entanglement use confers a communication advantage. Overall, our work sheds light on how entanglement can elevate various finite-length communication protocols, opening new avenues for exploration in the field.

quant-ph↗

arXiv2022

New Quantum Codes from CSS Codes

We present a new propagation rule for CSS codes. Starting with a CSS code $[\![n,k,d]\!]_q$, we construct a CSS code with parameters $[\![n-2,k,d-1]\!]_q$. In general, one would only obtain a code with parameters $[\![n-2,k,d-2]\!]_q$. The construction applies to asymmetric quantum codes from the CSS construction as well.

quant-ph↗

arXiv2022

The Subfield Metric and its Application to Quantum Error Correction

We introduce a new weight and corresponding metric over finite extension fields for asymmetric error correction. The weight distinguishes between elements from the base field and the ones outside of it, which is motivated by asymmetric quantum codes. We set up the theoretic framework for this weight and metric, including upper and lower bounds, asymptotic behavior of random codes, and we show the existence of an optimal family of codes achieving the Singleton-type upper bound.

cs.IT↗

arXiv2022

Quantum variational learning for quantum error-correcting codes

Quantum error correction is believed to be a necessity for large-scale fault-tolerant quantum computation. In the past two decades, various constructions of quantum error-correcting codes (QECCs) have been developed, leading to many good code families. However, the majority of these codes are not suitable for near-term quantum devices. Here we present VarQEC, a noise-resilient variational quantum algorithm to search for quantum codes with a hardware-efficient encoding circuit. The cost functions are inspired by the most general and fundamental requirements of a QECC, the Knill-Laflamme conditions. Given the target noise channel (or the target code parameters) and the hardware connectivity graph, we optimize a shallow variational quantum circuit to prepare the basis states of an eligible code. In principle, VarQEC can find quantum codes for any error model, whether additive or non-additive, degenerate or non-degenerate, pure or impure. We have verified its effectiveness by (re)discovering some symmetric and asymmetric codes, e.g., $((n,2^{n-6},3))_2$ for $n$ from 7 to 14. We also found new $((6,2,3))_2$ and $((7,2,3))_2$ codes that are not equivalent to any stabilizer code, and extensive numerical evidence with VarQEC suggests that a $((7,3,3))_2$ code does not exist. Furthermore, we found many new channel-adaptive codes for error models involving nearest-neighbor correlated errors. Our work sheds new light on the understanding of QECC in general, which may also help to enhance near-term device performance with channel-adaptive error-correcting codes.

quant-ph↗

arXiv2022

SIC-POVMs from Stark units: Prime dimensions n^2+3

We propose a recipe for constructing a SIC fiducial vector in complex Hilbert space of dimension of the form $d=n^2+3$, focussing on prime dimensions $d=p$. Such structures are shown to exist in thirteen prime dimensions of this kind, the highest being $p=19603$. The real quadratic base field $K$ (in the standard SIC terminology) attached to such dimensions has fundamental units $u_K$ of norm $-1$. Let $\mathbb{Z}_K$ denote the ring of integers of $K$, then $p\mathbb{Z}_K$ splits into two ideals $\mathfrak{p}$ and $\mathfrak{p}'$. The initial entry of the fiducial is the square $ξ^2$ of a geometric scaling factor $ξ$, which lies in one of the fields $K(\sqrt{u_K})$. Strikingly, the other $p-1$ entries of the fiducial vector are each the product of $ξ$ and the square root of a Stark unit. These Stark units are obtained via the Stark conjectures from the value at $s=0$ of the first derivatives of partial $L$ functions attached to the characters of the ray class group of $\mathbb{Z}_K$ with modulus $\mathfrak{p}\infty_1$, where $\infty_1$ is one of the real places of $K$.

quant-ph↗

arXiv2022

How Much Entanglement Does a Quantum Code Need?

In the setting of entanglement-assisted quantum error-correcting codes (EAQECCs), the sender and the receiver have access to pre-shared entanglement. Such codes promise better information rates or improved error handling properties. Entanglement incurs costs and must be judiciously calibrated in designing quantum codes with good performance, relative to their deployment parameters. Revisiting known constructions, we devise tools from classical coding theory to better understand how the amount of entanglement can be varied. We present three new propagation rules and discuss how each of them affects the error handling. Tables listing the parameters of the best performing qubit and qutrit EAQECCs that we can explicitly construct are supplied for reference and comparison.

quant-ph↗

arXiv2022

Entropic proofs of Singleton bounds for quantum error-correcting codes

We show that a relatively simple reasoning using von Neumann entropy inequalities yields a robust proof of the quantum Singleton bound for quantum error-correcting codes (QECC). For entanglement-assisted quantum error-correcting codes (EAQECC) and catalytic codes (CQECC), a type of generalized quantum Singleton bound [Brun et al., IEEE Trans. Inf. Theory 60(6):3073--3089 (2014)] was believed to hold for many years until recently one of us found a counterexample [MG, Phys. Rev. A 103, 020601 (2021)]. Here, we rectify this state of affairs by proving the correct generalized quantum Singleton bound, extending the above-mentioned proof method for QECC; we also prove information-theoretically tight bounds on the entanglement-communication tradeoff for EAQECC. All of the bounds relate block length $n$ and code length $k$ for given minimum distance $d$ and we show that they are robust, in the sense that they hold with small perturbations for codes which only correct most of the erasure errors of less than $d$ letters. In contrast to the classical case, the bounds take on qualitatively different forms depending on whether the minimum distance is smaller or larger than half the block length. We also provide a propagation rule: any pure QECC yields an EAQECC with the same distance and dimension, but of shorter block length.

quant-ph↗

arXiv2021

Quantumness Beyond Entanglement: The Case of Symmetric States

It is nowadays accepted that truly quantum correlations can exist even in the absence of entanglement. For the case of symmetric states, a physically trivial unitary transformation can alter a quantum state from entangled to separable and vice versa. We propose to certify the presence of quantumness via an average over all physically relevant modal decompositions. We investigate extremal states for such a measure: SU(2)-coherent states possess the least quantumness whereas the opposite extreme is inhabited by states with maximally spread Majorana constellations.

quant-ph↗

arXiv2020

Extremal quantum states

The striking differences between quantum and classical systems predicate disruptive quantum technologies. We peruse quantumness from a variety of viewpoints, concentrating on phase-space formulations because they can be applied beyond particular symmetry groups. The symmetry-transcending properties of the Husimi $Q$ function make it our basic tool. In terms of the latter, we examine quantities such as the Wehrl entropy, inverse participation ratio, cumulative multipolar distribution, and metrological power, which are linked to intrinsic properties of any quantum state. We use these quantities to formulate extremal principles and determine in this way which states are the most and least "quantum;" the corresponding properties and potential usefulness of each extremal principle are explored in detail. While the extrema largely coincide for continuous-variable systems, our analysis of spin systems shows that care must be taken when applying an extremal principle to new contexts.

quant-ph↗

arXiv2020

Algebraic Quantum Codes: Linking Quantum Mechanics and Discrete Mathematics

We present a general framework of quantum error-correcting codes (QECCs) as a subspace of a complex Hilbert space and the corresponding error models. Then we illustrate how QECCs can be constructed using techniques from algebraic coding theory. Additionally, we discuss secondary constructions for QECCs, leading to propagation rules for the parameters of QECCs.

cs.IT↗