Related papers: TC^0 circuits for algorithmic problems in nilpoten…
The task of learning a probability distribution from samples is ubiquitous across the natural sciences. The output distributions of local quantum circuits form a particularly interesting class of distributions, of key importance both to…
We extend the results of Riemannian geometry over finite groups and provide a full classification of all linear connections for the minimal noncommutative differential calculus over a finite cyclic group. We solve the torsion-free and…
Cyclic codes have many applications in consumer electronics, communication and data storage systems due to their efficient encoding and decoding algorithms. An efficient approach to constructing cyclic codes is the sequence approach. In…
Consider a set of $n$ simple autonomous mobile robots (asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, non-rigid, deterministic) initially in distinct…
One of the principal obstacles on the way to quantum computers is the lack of distinguished basis in the space of unitary evolutions and thus the lack of the commonly accepted set of basic operations (universal gates). A natural choice,…
We consider the problem of computing succinct encodings of lists of generators for invariant rings for group actions. Mulmuley conjectured that there are always polynomial sized such encodings for invariant rings of…
In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…
We investigate the constant-depth circuit complexity of the Isomorphism Problem, Minimum Generating Set Problem (MGS), and Sub(quasi)group Membership Problem (Membership) for groups and quasigroups (=Latin squares), given as input in terms…
We discuss a generalization of Clifford algebras known as generalized Clifford algebras (in particular, ternary Clifford algebras). In these objects, we have a fixed higher-degree form (in particular, a ternary form) instead of a quadratic…
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…
We present a new method for constructing $C_0$-semigroups for which properties of the resolvent of the generator and continuity properties of the semigroup in the operator-norm topology are controlled simultaneously. It allows us to show…
C*-algebras are rings, sometimes nonunital, obeying certain axioms that ensure a very well-behaved representation theory upon Hilbert space. Moreover, there are some well-known features of the representation theory leading to subtle…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
Let G be a discrete group which acts properly and isometrically on a complete CAT(0)-space X. Consider an integer d with d=1 or d greater or equal to 3 such that the topological dimension of X is bounded by d. We show the existence of a…
We prove the equality $\dTC(\Gamma)=\TC(\Gamma)$ for distributional topological complexity of torsion free hyperbolic and of torsion free nilpotent groups. For the distributional topological complexity of lens spaces we prove the inequality…
The main aim of the paper is to present a~combinatorial algorithm that, applying Littlewood-Richardson tableaux with entries equal to $1$, computes generic extensions of semisimple invariant subspaces of nilpotent linear operators.…
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happens for instance when the constraint matrix is totally…
The Quantum Oracle Classification (QOC) problem is to classify a function, given only quantum black box access, into one of several classes without necessarily determining the entire function. Generally, QOC captures a very wide range of…
Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and…
We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…