16,335 research outputs found
Quantum algorithms for hidden nonlinear structures
Attempts to find new quantum algorithms that outperform classical computation
have focused primarily on the nonabelian hidden subgroup problem, which
generalizes the central problem solved by Shor's factoring algorithm. We
suggest an alternative generalization, namely to problems of finding hidden
nonlinear structures over finite fields. We give examples of two such problems
that can be solved efficiently by a quantum computer, but not by a classical
computer. We also give some positive results on the quantum query complexity of
finding hidden nonlinear structures.Comment: 13 page
Quantum algorithms for highly non-linear Boolean functions
Attempts to separate the power of classical and quantum models of computation
have a long history. The ultimate goal is to find exponential separations for
computational problems. However, such separations do not come a dime a dozen:
while there were some early successes in the form of hidden subgroup problems
for abelian groups--which generalize Shor's factoring algorithm perhaps most
faithfully--only for a handful of non-abelian groups efficient quantum
algorithms were found. Recently, problems have gotten increased attention that
seek to identify hidden sub-structures of other combinatorial and algebraic
objects besides groups. In this paper we provide new examples for exponential
separations by considering hidden shift problems that are defined for several
classes of highly non-linear Boolean functions. These so-called bent functions
arise in cryptography, where their property of having perfectly flat Fourier
spectra on the Boolean hypercube gives them resilience against certain types of
attack. We present new quantum algorithms that solve the hidden shift problems
for several well-known classes of bent functions in polynomial time and with a
constant number of queries, while the classical query complexity is shown to be
exponential. Our approach uses a technique that exploits the duality between
bent functions and their Fourier transforms.Comment: 15 pages, 1 figure, to appear in Proceedings of the 21st Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA'10). This updated version of
the paper contains a new exponential separation between classical and quantum
query complexit
Quantum Algorithms for Weighing Matrices and Quadratic Residues
In this article we investigate how we can employ the structure of
combinatorial objects like Hadamard matrices and weighing matrices to device
new quantum algorithms. We show how the properties of a weighing matrix can be
used to construct a problem for which the quantum query complexity is
ignificantly lower than the classical one. It is pointed out that this scheme
captures both Bernstein & Vazirani's inner-product protocol, as well as
Grover's search algorithm.
In the second part of the article we consider Paley's construction of
Hadamard matrices, which relies on the properties of quadratic characters over
finite fields. We design a query problem that uses the Legendre symbol chi
(which indicates if an element of a finite field F_q is a quadratic residue or
not). It is shown how for a shifted Legendre function f_s(i)=chi(i+s), the
unknown s in F_q can be obtained exactly with only two quantum calls to f_s.
This is in sharp contrast with the observation that any classical,
probabilistic procedure requires more than log(q) + log((1-e)/2) queries to
solve the same problem.Comment: 18 pages, no figures, LaTeX2e, uses packages {amssymb,amsmath};
classical upper bounds added, presentation improve
Quantum Separability and Entanglement Detection via Entanglement-Witness Search and Global Optimization
We focus on determining the separability of an unknown bipartite quantum
state by invoking a sufficiently large subset of all possible
entanglement witnesses given the expected value of each element of a set of
mutually orthogonal observables. We review the concept of an entanglement
witness from the geometrical point of view and use this geometry to show that
the set of separable states is not a polytope and to characterize the class of
entanglement witnesses (observables) that detect entangled states on opposite
sides of the set of separable states. All this serves to motivate a classical
algorithm which, given the expected values of a subset of an orthogonal basis
of observables of an otherwise unknown quantum state, searches for an
entanglement witness in the span of the subset of observables. The idea of such
an algorithm, which is an efficient reduction of the quantum separability
problem to a global optimization problem, was introduced in PRA 70 060303(R),
where it was shown to be an improvement on the naive approach for the quantum
separability problem (exhaustive search for a decomposition of the given state
into a convex combination of separable states). The last section of the paper
discusses in more generality such algorithms, which, in our case, assume a
subroutine that computes the global maximum of a real function of several
variables. Despite this, we anticipate that such algorithms will perform
sufficiently well on small instances that they will render a feasible test for
separability in some cases of interest (e.g. in 3-by-3 dimensional systems)
Quantum algorithm for a generalized hidden shift problem
Consider the following generalized hidden shift problem:
given a function f on {0,...,M − 1} × ZN promised to be
injective for fixed b and satisfying f(b, x) = f(b + 1, x + s)
for b = 0, 1,...,M − 2, find the unknown shift s ∈ ZN.
For M = N, this problem is an instance of the abelian
hidden subgroup problem, which can be solved efficiently on
a quantum computer, whereas for M = 2, it is equivalent
to the dihedral hidden subgroup problem, for which no
efficient algorithm is known. For any fixed positive �, we give
an efficient (i.e., poly(logN)) quantum algorithm for this
problem provided M ≥ N^∈. The algorithm is based on the
“pretty good measurement” and uses H. Lenstra’s (classical)
algorithm for integer programming as a subroutine
On the Hidden Shifted Power Problem
We consider the problem of recovering a hidden element of a finite field
\F_q of elements from queries to an oracle that for a given x\in \F_q
returns for a given divisor . We use some techniques from
additive combinatorics and analytic number theory that lead to more efficient
algorithms than the naive interpolation algorithm, for example, they use
substantially fewer queries to the oracle.Comment: Moubariz Garaev (who has now become a co-author) has introduced some
new ideas that have led to stronger results. Several imprecision of the
previous version have been corrected to
- …