Related papers: Group Order is in QCMA
New features of a previously introduced Group Approach to Quantization are presented. We show that the construction of the symmetry group associated with the system to be quantized (the "quantizing group") does not require, in general, the…
We tackle the long-standing question of the computational complexity of determining homology groups of simplicial complexes, a fundamental task in computational topology, posed by Kaibel and Pfetsch 20 years ago. We show that this decision…
It has been proved recently by Moreto and Craven that the order of a finite group is bounded in terms of the largest multiplicity of its irreducible character degrees. A conjugacy class version of this result was proved for solvable groups…
We classify certain categories of partitions of finite sets subject to specific rules on the colorization of points and the sizes of blocks. More precisely, we consider pair partitions such that each block contains exactly one white and one…
We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…
We describe the main questions connected to torsion subgroups in the unit group of integral group rings of finite groups and algorithmic methods to attack these questions. We then prove the Zassenhaus Conjecture for Amitsur groups and prove…
An important endeavor in computer science is to understand the expressive power of logical formalisms over discrete structures, such as words. Naturally, "understanding" is not a mathematical notion. This investigation requires therefore a…
Testing efficiently whether a finite set with a binary operation over it, given as an oracle, is a group is a well-known open problem in the field of property testing. Recently, Friedl, Ivanyos and Santha have made a significant step in the…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…
Group theory is extremely successful in characterizing the symmetries in quantum systems, which greatly simplifies and unifies our treatments of quantum systems. Here we introduce the concept of the symmetry for a quantum Boltzmann machine…
Let X and Y be CW-complexes, U be an abelian group, and f:[X,Y]->U be a map (a homotopy invariant). We say that f has order at most r if the characteristic function of the r'th Cartesian power of the graph of a continuous map a:X->Y…
Easy quantum groups have been studied intensively since the time they were introduced by Banica and Speicher in 2009. They arise as a subclass of ($C^*$-algebraic) compact matrix quantum groups in the sense of Woronowicz. Due to some…
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discrete-time model of quantum computation, it also holds for continuous-time (or…
We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time…
Let $G$ be a finite group. We show that the order of the subgroup generated by coprime $\gamma_k$-commutators (respectively $\delta_k$-commutators) is bounded in terms of the size of the set of coprime $\gamma_k$-commutators (respectively…
QMA and QCMA are possible quantum analogues of the complexity class NP. In QCMA the verifier is a quantum program and the proof is classical. In contrast, in QMA the proof is also a quantum state. We show that two known QMA-complete…
We give an explicit bound on orders of finite subgroups of Cremona group of rank three over $\mathbb{Q}$.
The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, \textit{Complexity of finite semigroups}, Annals of Mathematics (2) \textbf{88} (1968), 128--160, motivated by the…
In unitary property testing a quantum algorithm, also known as a tester, is given query access to a black-box unitary and has to decide whether it satisfies some property. We propose a new technique for proving lower bounds on the quantum…