3,435 research outputs found
A Full Characterization of Quantum Advice
We prove the following surprising result: given any quantum state rho on n
qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of
two-qubit interactions), such that any ground state of H can be used to
simulate rho on all quantum circuits of fixed polynomial size. In terms of
complexity classes, this implies that BQP/qpoly is contained in QMA/poly, which
supersedes the previous result of Aaronson that BQP/qpoly is contained in
PP/poly. Indeed, we can exactly characterize quantum advice, as equivalent in
power to untrusted quantum advice combined with trusted classical advice.
Proving our main result requires combining a large number of previous tools --
including a result of Alon et al. on learning of real-valued concept classes, a
result of Aaronson on the learnability of quantum states, and a result of
Aharonov and Regev on "QMA+ super-verifiers" -- and also creating some new
ones. The main new tool is a so-called majority-certificates lemma, which is
closely related to boosting in machine learning, and which seems likely to find
independent applications. In its simplest version, this lemma says the
following. Given any set S of Boolean functions on n variables, any function f
in S can be expressed as the pointwise majority of m=O(n) functions f1,...,fm
in S, such that each fi is the unique function in S compatible with O(log|S|)
input/output constraints.Comment: We fixed two significant issues: 1. The definition of YQP machines
needed to be changed to preserve our results. The revised definition is more
natural and has the same intuitive interpretation. 2. We needed properties of
Local Hamiltonian reductions going beyond those proved in previous works
(whose results we'd misstated). We now prove the needed properties. See p. 6
for more on both point
General framework for quantum search algorithms
Grover's quantum search algorithm drives a quantum computer from a prepared
initial state to a desired final state by using selective transformations of
these states. Here, we analyze a framework when one of the selective
trasformations is replaced by a more general unitary transformation. Our
framework encapsulates several previous generalizations of the Grover's
algorithm. We show that the general quantum search algorithm can be improved by
controlling the transformations through an ancilla qubit. As a special case of
this improvement, we get a faster quantum algorithm for the two-dimensional
spatial search.Comment: revised versio
Unbounded-error One-way Classical and Quantum Communication Complexity
This paper studies the gap between quantum one-way communication complexity
and its classical counterpart , under the {\em unbounded-error}
setting, i.e., it is enough that the success probability is strictly greater
than 1/2. It is proved that for {\em any} (total or partial) Boolean function
, , i.e., the former is always exactly one half
as large as the latter. The result has an application to obtaining (again an
exact) bound for the existence of -QRAC which is the -qubit random
access coding that can recover any one of original bits with success
probability . We can prove that -QRAC exists if and only if
. Previously, only the construction of QRAC using one qubit,
the existence of -RAC, and the non-existence of
-QRAC were known.Comment: 9 pages. To appear in Proc. ICALP 200
Computation with narrow CTCs
We examine some variants of computation with closed timelike curves (CTCs),
where various restrictions are imposed on the memory of the computer, and the
information carrying capacity and range of the CTC. We give full
characterizations of the classes of languages recognized by polynomial time
probabilistic and quantum computers that can send a single classical bit to
their own past. Such narrow CTCs are demonstrated to add the power of limited
nondeterminism to deterministic computers, and lead to exponential speedup in
constant-space probabilistic and quantum computation. We show that, given a
time machine with constant negative delay, one can implement CTC-based
computations without the need to know about the runtime beforehand.Comment: 16 pages. A few typo was correcte
Can closed timelike curves or nonlinear quantum mechanics improve quantum state discrimination or help solve hard problems?
We study the power of closed timelike curves (CTCs) and other nonlinear
extensions of quantum mechanics for distinguishing nonorthogonal states and
speeding up hard computations. If a CTC-assisted computer is presented with a
labeled mixture of states to be distinguished--the most natural formulation--we
show that the CTC is of no use. The apparent contradiction with recent claims
that CTC-assisted computers can perfectly distinguish nonorthogonal states is
resolved by noting that CTC-assisted evolution is nonlinear, so the output of
such a computer on a mixture of inputs is not a convex combination of its
output on the mixture's pure components. Similarly, it is not clear that CTC
assistance or nonlinear evolution help solve hard problems if computation is
defined as we recommend, as correctly evaluating a function on a labeled
mixture of orthogonal inputs.Comment: 4 pages, 3 figures. Final version. Added several references, updated
discussion and introduction. Figure 1(b) very much enhance
Decoherence in Quantum Walks on the Hypercube
We study a natural notion of decoherence on quantum random walks over the
hypercube. We prove that in this model there is a decoherence threshold beneath
which the essential properties of the hypercubic quantum walk, such as linear
mixing times, are preserved. Beyond the threshold, we prove that the walks
behave like their classical counterparts.Comment: 7 pages, 3 figures; v2:corrected typos in references; v3:clarified
section 2.1; v4:added references, expanded introduction; v5: final journal
versio
Quantum Commuting Circuits and Complexity of Ising Partition Functions
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum
computation consisting only of commuting two-qubit gates and is not universal
in the sense of standard quantum computation. Nevertheless, it has been shown
that if there is a classical algorithm that can simulate IQP efficiently, the
polynomial hierarchy (PH) collapses at the third level, which is highly
implausible. However, the origin of the classical intractability is still less
understood. Here we establish a relationship between IQP and computational
complexity of the partition functions of Ising models. We apply the established
relationship in two opposite directions. One direction is to find subclasses of
IQP that are classically efficiently simulatable in the strong sense, by using
exact solvability of certain types of Ising models. Another direction is
applying quantum computational complexity of IQP to investigate (im)possibility
of efficient classical approximations of Ising models with imaginary coupling
constants. Specifically, we show that there is no fully polynomial randomized
approximation scheme (FPRAS) for Ising models with almost all imaginary
coupling constants even on a planar graph of a bounded degree, unless the PH
collapses at the third level. Furthermore, we also show a multiplicative
approximation of such a class of Ising partition functions is at least as hard
as a multiplicative approximation for the output distribution of an arbitrary
quantum circuit.Comment: 36 pages, 5 figure
Geometries for universal quantum computation with matchgates
Matchgates are a group of two-qubit gates associated with free fermions. They
are classically simulatable if restricted to act between nearest neighbors on a
one-dimensional chain, but become universal for quantum computation with
longer-range interactions. We describe various alternative geometries with
nearest-neighbor interactions that result in universal quantum computation with
matchgates only, including subtle departures from the chain. Our results pave
the way for new quantum computer architectures that rely solely on the simple
interactions associated with matchgates.Comment: 6 pages, 4 figures. Updated version includes an appendix extending
one of the result
On Hausdorff dimension of the set of closed orbits for a cylindrical transformation
We deal with Besicovitch's problem of existence of discrete orbits for
transitive cylindrical transformations
where is an
irrational rotation on the circle \T and \varphi:\T\to\R is continuous,
i.e.\ we try to estimate how big can be the set
D(\alpha,\varphi):=\{x\in\T:|\varphi^{(n)}(x)|\to+\infty\text{as}|n|\to+\infty\}.
We show that for almost every there exists such that the
Hausdorff dimension of is at least . We also provide a
Diophantine condition on that guarantees the existence of
such that the dimension of is positive. Finally, for some
multidimensional rotations on \T^d, , we construct smooth
so that the Hausdorff dimension of is positive.Comment: 32 pages, 1 figur
Approximate locality for quantum systems on graphs
In this Letter we make progress on a longstanding open problem of Aaronson
and Ambainis [Theory of Computing 1, 47 (2005)]: we show that if A is the
adjacency matrix of a sufficiently sparse low-dimensional graph then the
unitary operator e^{itA} can be approximated by a unitary operator U(t) whose
sparsity pattern is exactly that of a low-dimensional graph which gets more
dense as |t| increases. Secondly, we show that if U is a sparse unitary
operator with a gap \Delta in its spectrum, then there exists an approximate
logarithm H of U which is also sparse. The sparsity pattern of H gets more
dense as 1/\Delta increases. These two results can be interpreted as a way to
convert between local continuous-time and local discrete-time processes. As an
example we show that the discrete-time coined quantum walk can be realised as
an approximately local continuous-time quantum walk. Finally, we use our
construction to provide a definition for a fractional quantum fourier
transform.Comment: 5 pages, 2 figures, corrected typ
- …