Related papers: Two Problems on Quantum Computing in Finite Abelia…
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. We consider three query models. In the first model ("OR queries"), the oracle returns whether a given subset of the vertices contains any…
Exactly solvable models of topologically ordered phases with non-abelian anyons typically require complicated many-body interactions which do not naturally appear in nature. This motivates the "inverse problem" of quantum many-body physics:…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
A common situation in quantum many-body physics is that the underlying theories are known but too complicated to solve efficiently. In such cases one usually builds simpler effective theories as low-energy or large-scale alternatives to the…
The well known and oft-quoted Feynman's expression, entered the title, leading at a loss and even being objectionable, has not yet a clear explanation. The hidden parameters problem in quantum mechanics is considered here on the base of…
Finite-sum optimization has wide applications in machine learning, covering important problems such as support vector machines, regression, etc. In this paper, we initiate the study of solving finite-sum optimization problems by quantum…
We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and…
We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_{\phi}\Z_{p^2}$, where $p$ is any odd prime number and $r$ is any integer such that $r>4$. We also…
The first quantum algorithm to offer an exponential speedup (in the query complexity setting) over classical algorithms was Simon's algorithm for identifying a hidden exclusive-or mask. Here we observe how part of Simon's algorithm can be…
We conjecture that one of the main obstacles to creating new non-abelian quantum hidden subgroup algorithms is the correct choice of a transversal.
We show how classical and quantum dualities, as well as duality relations that appear only in a sector of certain theories ("emergent dualities"), can be unveiled, and systematically established. Our method relies on the use of morphisms of…
It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\log |G|$) number of calls to the oracle function, the states corresponding to…
Although quantum computing hardware has evolved significantly in recent years, spurred by increasing industrial and government interest, the size limitation of current generation quantum computers remains an obstacle when applying these…
We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability (Q2SAT) problem, which is a generalization of 2-satisfiability (2SAT) problem. For a Q2SAT problem, we construct the Hamiltonian which is similar to that of a…
We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…
Geometric phases accompanying adiabatic processes in quantum systems can be utilized as unitary gates for quantum computation. Optimization of control of the adiabatic process naturally leads to the isoholonomic problem. The isoholonomic…
Image processing is popular in our daily life because of the need to extract essential information from our 3D world, including a variety of applications in widely separated fields like bio-medicine, economics, entertainment, and industry.…
Quantum information processing requires a high degree of isolation from the detrimental effects of the environment as well as an extremely precise level of control on the way quantum dynamics unfolds in the information-processing system. In…
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…
We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…