Related papers: Property Testing for Cyclic Groups and Beyond

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

Given an action of a group $\Gamma$ on a measure space $\Omega$, we provide a sufficient criterion under which two sets $A, B\subseteq \Omega$ are measurably equidecomposable, i.e., $A$ can be partitioned into finitely many measurable…

In this work we prove non-trivial impossibility results for perhaps the simplest non-linear estimation problem, that of {\it Group Testing} (GT), via the recently developed Madiman-Tetali inequalities. Group Testing concerns itself with…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Property testing has been a major area of research in computer science in the last three decades. By property testing we refer to an ensemble of problems, results and algorithms which enable to deduce global information about some data by…

We address some usually overlooked issues concerning the use of $*$-algebras in quantum theory and their physical interpretation. If $\mathfrak{A}$ is a $*$-algebra describing a quantum system and $\omega\colon\mathfrak{A}\to\mathbb{C}$ a…

Given a function f as an oracle, the collision problem is to find two distinct inputs i and j such that f(i)=f(j), under the promise that such inputs exist. Since the security of many fundamental cryptographic primitives depends on the…

We consider a generalization of group testing where the potentially contaminated sets are the members of a given hypergraph ${\cal F}=(V,E)$. This generalization finds application in contexts where contaminations can be conditioned by some…

For a hypergroup $(H,\circ)$ we consider $\gamma^{\ast}$, as the smallest equivalence relation on $H$ such that the quotion $(H/\gamma^{\ast},\tiny{\otimes})$ is an abelian group. We study some more properties of $\gamma^{\ast}$. Initially,…

We study the equivalence testing problem where the goal is to determine if the given two unknown distributions on $[n]$ are equal or $\epsilon$-far in the total variation distance in the conditional sampling model (CFGM, SICOMP16; CRS,…

Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian…

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern…

The goal of the group testing problem is to identify a set of defective items within a larger set of items, using suitably-designed tests whose outcomes indicate whether any defective item is present. In this paper, we study how the number…

We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…

Let $G$ be a finite group and let $c(G)$ be the number of cyclic subgroups of $G$. We study the function $\alpha(G) = c(G)/|G|$. We explore its basic properties and we point out a connection with the probability of commutation. For many…

We show that a "mate'' $B$ of a set $A$ in a near-factorization $(A,B)$ of a finite group $G$ is unique. Further, we describe how to compute the mate $B$ very efficiently using an explicit formula for $B$. We use this approach to give an…

The goal of group testing is to efficiently identify a few specific items, called positives, in a large population of items via tests. A test is an action on a subset of items which returns positive if the subset contains at least one…

The group testing problem asks for efficient pooling schemes and algorithms that allow to screen moderately large numbers of samples for rare infections. The goal is to accurately identify the infected samples while conducting the least…

In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly $k$ or $l$ of the $n$ input bits given by an oracle are 1. We find an optimal…

We show that computational problem of testing the behaviour of quantum circuits is hard for the class of problems known as QMA that can be verified efficiently with a quantum computer. This result is a generalization of the techniques…