Related papers: Group Order is in QCMA
It is a long-standing open question in quantum complexity theory whether the definition of $\textit{non-deterministic}$ quantum computation requires quantum witnesses $(\textsf{QMA})$ or if classical witnesses suffice $(\textsf{QCMA})$. We…
We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be difficult to solve, even with a quantum computer, but have the…
Quantum metric learning enhances machine learning by mapping classical data to a quantum Hilbert space with maximal separation between classes. However, on current NISQ hardware, this mapping process itself is prone to errors and could be…
[PLEASE SEE COMMENT] We consider the isomorphism problem for finite abelian groups and finite meta-cyclic groups. We prove that for a dense set of positive integers $n$, isomorphism testing for abelian groups of black-box type of order $n$…
We present a constructive recognition algorithm to decide whether a given black-box group is isomorphic to an alternating or a symmetric group without prior knowledge of the degree. This eliminates the major gap in known algorithms, as they…
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it is natural to apply a different notion of complexity, namely…
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a "quantum…
It is well known that there are many 2-torsion elements in the classical knot concordance group. On the other hand, it is not known if there is any torsion element in the rational knot concordance group $\mathcal{C}_\mathbb{Q}$. Cha defined…
The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups that are needed. Determining an algorithm to compute complexity…
Easy quantum groups are compact matrix quantum groups, whose intertwiner spaces are given by the combinatorics of categories of partitions. This class contains the symmetric group and the orthogonal group as well as Wang's quantum…
We give a decomposition of the equivariant Kasparov category for discrete quantum group with torsions. As an outcome, we show that the crossed product by a discrete quantum group in a certain class preserves the UCT. We then show that…
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…
The order sequence of a finite group $G$ is a non-decreasing finite sequence formed of the element orders of $G$. Several properties of order sequences were studied by P. J. Cameron and H. K. Dey in a recent paper that concludes with a list…
Learning an unknown quantum process is a central task for validation of the functioning of near-term devices. The task is generally hard, requiring exponentially many measurements if no prior assumptions are made on the process. However, an…
We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…
We show that several problems that figure prominently in quantum computing, including Hidden Coset, Hidden Shift, and Orbit Coset, are equivalent or reducible to Hidden Subgroup for a large variety of groups. We also show that, over…
Mathematical core of quantum mechanics is the theory of unitary representations of symmetries of physical systems. We argue that quantum behavior is a natural result of extraction of "observable" information about systems containing…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…