Related papers: Group Order is in QCMA

A complete classification is given of finite groups whose elements are partitioned into three orbits by the automorphism groups, solving the long-standing classification problem initiated by G. Higman in 1963. As a consequence, a…

We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as positive cones, torsions, generalised torsions and cofinal elements.

We prove that the quasivariety of groups generated by finite and locally indicable groups does not contain the class of periodic groups. This result is related to (and inspired by) the solvability of equations over groups. The proof uses…

We enumerate the 15768 perfect groups of order up to $2\cdot 10^6$, up to isomorphism, thus also completing the missing cases in the prior classification. The work supplements the by now well-understood computer classifications of solvable…

We give an algorithm to solve the quantum hidden subgroup problem for maximal cyclic non-normal subgroups of the affine group of a finite field (if the field has order $q$ then the group has order $q(q-1)$) with probability $1-\varepsilon$…

This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target…

Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. In [M. Herzog, et. al., Two new criteria for solvability of finite groups, J. Algebra, 2018], the authors put forward the following…

In 1987, Woronowicz gave a definition of compact matrix quantum groups generalizing compact Lie groups in the setting of noncommutative geometry. About twenty years later, Banica and Speicher isolated a class of compact matrix quantum…

We determine the quantum automorphism groups of finite spaces and find they are all compact quantum groups in the sense of Woronowicz. This solves a problem of Connes for finite spaces.

In 1955 George Mackey suggested that there is a fundamental dichotomy in the unitary representation theory of locally compact second countable groups. He felt that there cannnot be a reasonable classification theory for the unitary…

We prove that the stable image of an endomorphism of a virtually free group is computable. For an endomorphism $\varphi$, an element $x\in G$ and a subset $K\subseteq G$, we say that the relative $\varphi$-order of $g$ in $K$,…

This is a draft of a book submitted for publication by the AMS. Its theme is the remarkable interplay, accelerating in the last few decades, between topology and the theory of orderable groups, with applications in both directions. It…

QMA is the class of languages that can be decided by an efficient quantum verifier given a quantum witness, whereas QCMA is the class of such languages where the efficient quantum verifier only is given a classical witness. A challenging…

In quantum causality and quantum information, there is a vast landscape of abstract quantum protocols permitting cyclic or non-acyclic causal structures between operations, including frameworks for indefinite causal order and higher-order…

It is pointed out that quantum states, in general, contain a new kind of orders that cannot be characterized by symmetry. A concept of quantum order is introduced to describe such orders. As two concrete examples, we discussed quantum…

In this article we introduce a new complexity class called PQMA_log(2). Informally, this is the class of languages for which membership has a logarithmic-size quantum proof with perfect completeness and soundness which is polynomially close…

We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order. The simplest example of such a transformation is the classical…

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…

The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…

The problem of how to obtain quasi-classical states for quantum groups is examined. A measure of quantum indeterminacy is proposed, which involves expectation values of some natural quantum group operators. It is shown that within any…