Related papers: On the MacWilliams Identity for Classical and Quan…
The Weak Gravity Conjecture is typically stated as a bound on the mass-to-charge ratio of a particle in the theory. Alternatively, it has been proposed that its natural formulation is in terms of the existence of a particle which is…
A standard method to obtain information on a quantum state is to measure marginal distributions along many different axes in phase space, which forms a basis of quantum state tomography. We theoretically propose and experimentally…
We derive an explicit formula for the intrinsic MacWilliams transform for permutation-invariant qudit codes. Such codes naturally live in symmetric power representations, where the relevant error sectors are determined by the irreducible…
While investigating the Doi-Naganuma lift, Zagier defined integral weight cusp forms $f_D$ which are naturally defined in terms of binary quadratic forms of discriminant $D$. It was later determined by Kohnen and Zagier that the generating…
Hodges' formula expresses the tree-level all-multiplicity Einstein gravity MHV amplitude as a matrix determinant. In this work, we prove that Hodges' determinant is generated by an $Lw_{1+\infty}$ Ward identity on the celestial sphere. The…
The Weak Gravity Conjecture has recently been re-formulated in terms of a particle with non-negative self-binding energy. Because of the dual conformal field theory (CFT) formulation in the anti-de Sitter space the conformal dimension…
This paper introduces an efficient algorithm based on the Parity-Consistent Decomposition (PCD) method to determine the WD of pre-transformed polar codes. First, to address the bit dependencies introduced by the pre-transformation matrix,…
We study the properties of the discrete Wigner distribution for two qubits introduced by Wotters. In particular, we analyze the entanglement properties within the Wigner distribution picture by considering the negativity of the Wigner…
Weighted belief propagation (WBP) for the decoding of linear block codes is considered. In WBP, the Tanner graph of the code is unrolled with respect to the iterations of the belief propagation decoder. Then, weights are assigned to the…
With the recent advances in machine learning for quantum chemistry, it is now possible to predict the chemical properties of compounds and to generate novel molecules. Existing generative models mostly use a string- or graph-based…
We develop a comprehensive framework for constructing quantum error correcting codes (QECCs) from Abelian lattice gauge theories (LGTs) using quantum reference frames (QRFs) as a unifying formalism. We consider LGTs with arbitrary compact…
The Minimum Weight Dominating Set (MWDS) problem is an important generalization of the Minimum Dominating Set (MDS) problem with extensive applications. This paper proposes a new local search algorithm for the MWDS problem, which is based…
Performing active quantum error correction to protect fragile quantum states highly depends on the correctness of error information--error syndromes. To obtain reliable error syndromes using imperfect physical circuits, we propose the idea…
We propose a general framework for decoding quantum error-correcting codes with generative modeling. The model utilizes autoregressive neural networks, specifically Transformers, to learn the joint probability of logical operators and…
A robust, user-friendly, and automated method to determine quantum conductance in disordered quasi-one-dimensional systems is presented. The scheme relies upon an initial density- functional theory calculation in a specific geometry after…
The Weak Gravity Conjecture (WGC) in anti-de Sitter spacetime (AdS) asserts the existence of an operator in the boundary conformal field theory (CFT) whose scaling dimension-to-charge ratio satisfies a certain upper bound. This bound is…
We propose a method to determine the critical noise level for decoding Gallager type low density parity check error correcting codes. The method is based on the magnetization enumerator ($\cM$), rather than on the weight enumerator ($\cW$)…
Maximally localized Wannier functions (MLWFs) are conventionally constructed by iteratively minimizing a spread functional over a high-dimensional gauge landscape. In this work, we present a non-variational constructive algorithm that…
We introduce a novel weighted convolution operator that enhances traditional convolutional neural networks (CNNs) by integrating a spatial density function into the convolution operator. This extension enables the network to differentially…
The Constrained Minimum Determinant Factor Analysis (CMDFA) setting was motivated by Wyner's common information problem where we seek a latent representation of a given Gaussian vector distribution with the minimum mutual information under…