相关论文: A Sparse $Z_2$ Chain Complex Without a Sparse Lift
A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is…
Recently sparse coding have been highly successful in image classification mainly due to its capability of incorporating the sparsity of image representation. In this paper, we propose an improved sparse coding model based on linear spatial…
Uncorrelated random scale-free networks are useful null models to check the accuracy an the analytical solutions of dynamical processes defined on complex networks. We propose and analyze a model capable to generate random uncorrelated…
We construct a universal set of high fidelity quantum gates to be used on a sparse bipartite lattice with always-on Ising couplings. The gates are based on dynamical decoupling sequences using shaped pulses, they protect against…
We describe a quantum cryptography protocol with up to twenty four-dimensional ($\mathcal{D} =4$) states generated by a polarization-, phase- and time-encoding transmitter. This protocol can be experimentally realized with existing…
We study the $S=\frac{1}{2}$ quantum spin system on the $d$-dimensional hypercubic lattice with $d\ge2$ with uniform nearest-neighbor interaction of the XY or XYZ type and arbitrary uniform magnetic field. By extending the method recently…
We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global…
{\tt AbstractSimplicialComplexes.m2} is a computer algebra package written for the computer algebra system {\tt Macaulay2} \cite{M2}. It provides new infrastructure to work with abstract simplicial complexes and related homological…
Quantum states are usually fragile which makes quantum computation being not as stable as classical computation. Quantum correction codes can protect quantum states but need a large number of physical qubits to code a single logic qubit.…
In this paper, necessary and sufficient conditions for a cyclic code of arbitrary length over the non-chain rings $Z_{4}+\nu Z_{4}$ for $\nu^{2} \in \{0,1,\nu,2\nu,3\nu,2+\nu,2+3\nu,3+2\nu\}$ to be a reversible cyclic code have been…
Answering an open question raised by Cooper, we show that there exist $\Delta^0_2$ sets $D$ and $E$ such that the singleton degree of $E$ is a minimal cover of the singleton degree of $D$. This shows that the $\Sigma^{0}_{2}$ singleton…
Two-dimensional (2D) semiconductor structures of materials without inversion center (e.g. zinc-blende ${\rm A^{III}B^V}$) possess the zero-field conduction band spin-splitting (Dresselhaus term), which is linear and cubic in wavevector $k$,…
We construct a non-Archimedean real closed field of transcendence degree two with no non-trivial automorphisms
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free…
Quantum ladder models, consisting of coupled chains, form intriguing systems bridging one and two dimensions and have been well studied in the context of quantum magnets and fermionic systems. Here we consider ladder systems made of more…
Suppose you have an uncomputable set $X$ and you want to find a set $A$, all of whose infinite subsets compute $X$. There are several ways to do this, but all of them seem to produce a set $A$ which is fairly sparse. We show that this is…
We study stochastic processes that generate non-growing complex networks without self-loops and multiple edges (simple graphs). The work concentrates on understanding and formulation of constraints which keep the rewiring stochastic…
We study the open and closed embedding dimensions of a convex 3-sparse code $\mathcal{FP}$, which records the intersection pattern of lines in the Fano plane. We show that the closed embedding dimension of $\mathcal{FP}$ is three, and the…
Z-complementary code set (ZCCS), an extension of perfect complementary codes (CCs), refers to a set of two-dimensional matrices having zero correlation zone properties. ZCCS can be used in various multi-channel systems to support, for…
Strongly interacting models often possess "dualities" subtler than a one-to-one mapping of energy levels. The maps can be non-invertible, as apparent in the canonical example of Kramers and Wannier. We analyse an algebraic structure common…