Related papers: Trustless unknown-order groups
Symmetry plays a crucial role in the design and analysis of quantum protocols. This result shows a canonical circuit decomposition of a $(G \times H)$-invariant quantum comb for compact groups $G$ and $H$ using the corresponding…
Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The…
We study a class of orbit recovery problems in which we observe independent copies of an unknown element of $\mathbb{R}^p$, each linearly acted upon by a random element of some group (such as $\mathbb{Z}/p$ or $\mathrm{SO}(3)$) and then…
The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new…
The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quantum 1-out-of-2 Oblivious Transfer and quantum Bit Commitment…
In the classical non-adaptive group testing setup, pools of items are tested together, and the main goal of a recovery algorithm is to identify the "complete defective set" given the outcomes of different group tests. In contrast, the main…
We propose and analyze a new family of nonconforming finite elements for the three-dimensional quad-curl problem. The proposed finite element spaces are subspaces of $\pmb{H}(\mathrm{curl})$, but not of…
We initiate the study of computational problems on elliptic curve isogeny graphs defined over RSA moduli. We conjecture that several variants of the neighbor-search problem over these graphs are hard, and provide a comprehensive list of…
Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one often resorts to $t$-designs. Unitary…
This thesis discusses the young fields of quantum pseudo-randomness and quantum learning algorithms. We present techniques for derandomising algorithms to decrease randomness resource requirements and improve efficiency. One key object in…
Given a unitary representation of a finite group on a finite-dimensional Hilbert space, we show how to find a state whose translates under the group are distinguishable with the highest probability. We apply this to several quantum oracle…
Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing…
Trust region and cubic regularization methods have demonstrated good performance in small scale non-convex optimization, showing the ability to escape from saddle points. Each iteration of these methods involves computation of gradient,…
Codes are crucial in many areas of applications. Different types of codes are designed to meet specific needs, which makes them more effective and useful. Linear codes are extensively used in data storage systems. Identifying codes are…
The fundamental task of group testing is to recover a small distinguished subset of items from a large population while efficiently reducing the total number of tests (measurements). The key contribution of this paper is in adopting a new…
We prove the first known nontrivial bounds on the sizes of the 2-torsion subgroups of the class groups of cubic and higher degree number fields $K$ (the trivial bound being $O_{\epsilon}(|{\rm Disc}(K)|^{1/2+\epsilon})$ by Brauer--Siegel).…
We construct a family of infinitely many new candidate non-Abelian self-correcting topological quantum memories in $D\geq 5+1$ spacetime dimensions without particle excitations using local commuting non-Pauli stabilizer lattice models and…
We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…
The purpose of this note is to classify unital cubic maps from the cyclic group of order $3$ into an arbitrary non-abelian group. We show that the universal group admitting a unital cubic map from the cyclic group of order $3$ is infinite,…