Searcharxiv⌕ Search

arXiv subjects

Marin Girard

Publications and source records attributed to Marin Girard.

3 recordsLinked to original sources

Random encoders and expurgation improve 1,873 entries of the Grassl qubit code tables

I report 192 explicit binary stabilizer codes $[[n,k,d]]$ with $53\le n\le 254$ and $5\le d\le 13$ whose minimum distance exceeds the lower bound listed in Grassl's code tables at the same $(n,k)$: 161 codes by one and 31 by two. Through the standard propagation rules they raise 1,873 entries of the table. For 190 of the codes, a random Clifford encoder is followed by expurgation: every logical operator of weight below the target distance is enumerated, and a few logical operators are promoted to stabilizers so that each low-weight one anticommutes with at least one of them. The other two are obtained by puncturing a code from the table and repairing it in the same way. All 192 distances are exact: the lower bound is certified by exhaustive meet-in-the-middle enumeration of up to $4\times10^{13}$ Pauli operators, and the upper bound by an explicit logical operator of weight $d$. A first-moment count explains the results. Expurgated random codes have about eight more logical qubits than a typical random code of the same length and distance, so they beat the table wherever its best known codes are no better than random. The largest gains, up to nine logical qubits, are at $d\ge9$ and $n\gtrsim170$, where the table often gives a lower bound without an explicit code. The same count predicts improvements at 619 further pairs $(n,d)$. The search was run by AI agents. The codes, their certificates and an independent checker are public.

quant-ph↗

Demystifying Objectivity with Operator Algebra Quantum Error Correction

Quantum Darwinism extends the decoherence formalism to explain how objectivity emerges from quantum mechanics. However, existing approaches often capture only partial aspects of objectivity. By connecting quantum Darwinism to operator algebra quantum error correction, we show that the emergence of objectivity can be identified with the algebraic local recoverability of quantum codes. Applying this algebraic framework to stabilizer codes, we show that it yields a far more precise characterization of classicality and redundancy, unifies the traditional measures of objectivity, enables efficient classification via coding-theoretic tools, and supports large-scale Clifford simulations of decoherence dynamics.

quant-ph↗

Wave packets from the spectrum

The freedom to change Fock basis seems to ensure a minimum amount of locality in lattice theories in the following sense: If $\lbrace (\hat a_i^\dagger\,,\,\hat a_i)\rbrace$ for $i=1,\dots,n$ is a lattice of creation and annihilation operators and if a given Hamiltonian $\hat H$ induces highly non-local dynamics on that lattice, then it will usually be possible to change to a new set of operators $\lbrace (\hat b_i^\dagger\,,\,\hat b_i)\rbrace$ in terms of which the dynamics appear less non-local. We demonstrate this by turning a highly non-local random matrix model into a local, 1D lattice theory where particles can propagate in localized wave packets. More generally, we show that any Hamiltonian can be made to look like such a theory, with the lattice dispersion relation and the non-integrability of the theory depending on the spectrum of $\hat H$. We argue that our results are a step towards quantum mereology for fields.

quant-ph↗