Related papers: Testing Quasiperiodicity
Superconducting circuits are an extremely versatile platform to realize quantum information hardware and to emulate topological materials. We here show how a simple arrangement of capacitors and conventional…
The notion of graph cover, also known as locally bijective homomorphism, is a discretization of covering spaces known from general topology. It is a pair of incidence-preserving vertex- and edge-mappings between two graphs, the…
Research into the automatic acquisition of lexical information from corpora is starting to produce large-scale computational lexicons containing data on the relative frequencies of subcategorisation alternatives for individual verbal…
A covering code is a subset $\mathcal{C} \subseteq \{0,1\}^n$ with the property that any $z \in \{0,1\}^n$ is close to some $c \in \mathcal{C}$ in Hamming distance. For every $\epsilon,\delta>0$, we show a construction of a family of codes…
In this work, we study the problem of detecting periodic trends in strings. While detecting exact periodicity has been studied extensively, real-world data is often noisy, where small deviations or mismatches occur between repetitions. This…
A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…
We propose an operational quasiprobability function for qudits, enabling a comparison between quantum and hidden-variable theories. We show that the quasiprobability function becomes positive semidefinite if consecutive measurement results…
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we refer as QMA proofs of proximity (QMAPs). These are quantum query algorithms that receive explicit access to a sublinear-size untrusted proof…
It is known that for every $s\in]1,2[$ there is a copula whose support is a self-similar fractal set with Hausdorff -- and box-counting -- dimension $s$. In this paper we provide similar results for (proper) quasi-copulas, in both the…
A coverage function f over a ground set [m] is associated with a universe U of weighted elements and m subsets A_1,..., A_m of U, and for any subset T of [m], f(T) is defined as the total weight of the elements in the union $\cup_{j\in T}…
The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null…
Since masking of quantum information was introduced by Modi et al. in [PRL 120, 230501 (2018)], many discussions on this topic have been published. In this paper, we consider relationship between quantum multipartite maskers (QMMs) and…
In this paper, we introduce the concept of quasi-semi hyperbolic pseudo-orbits and prove that quasi-semi hyperbolicity implies quasi hyperbolicity provided the error magnitude are sufficiently small. We also have successively demonstrated…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…
A technique using a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introduced in earlier work from the computation of the edit-distance between two…
Recently, a test for a sign-changing gap function in a candidate multiband unconventional superconductor involving quasiparticle interference data was proposed. The test was based on the antisymmetric, Fourier transformed conductance maps…
Bootstrapping is often applied to get confidence limits for semiparametric inference of a target parameter in the presence of nuisance parameters. Bootstrapping with replacement can be computationally expensive and problematic when…
We consider the problem of querying a string (or, a database) of length $N$ bits to determine all the locations where a substring (query) of length $M$ appears either exactly or is within a Hamming distance of $K$ from the query. We assume…
Given a bridgeless graph $G$, the Cycle Double Cover Conjecture posits that there is a list of cycles of $G$, such that every edge appears in exactly two cycles on the list. This conjecture was originally posed independently in 1973 by…
A new method for finding electronic structure and wavefunctions of electrons in quasiperiodic potential is introduced. To obtain results it uses slightly modified Schrodinger equation in spaces of dimensionality higher than physical space.…