540 research outputs found
Quantum Computational Complexity in the Presence of Closed Timelike Curves
Quantum computation with quantum data that can traverse closed timelike
curves represents a new physical model of computation. We argue that a model of
quantum computation in the presence of closed timelike curves can be formulated
which represents a valid quantification of resources given the ability to
construct compact regions of closed timelike curves. The notion of
self-consistent evolution for quantum computers whose components follow closed
timelike curves, as pointed out by Deutsch [Phys. Rev. D {\bf 44}, 3197
(1991)], implies that the evolution of the chronology respecting components
which interact with the closed timelike curve components is nonlinear. We
demonstrate that this nonlinearity can be used to efficiently solve
computational problems which are generally thought to be intractable. In
particular we demonstrate that a quantum computer which has access to closed
timelike curve qubits can solve NP-complete problems with only a polynomial
number of quantum gates.Comment: 8 pages, 2 figures. Minor changes and typos fixed. Reference adde
Quantum dynamics as a physical resource
How useful is a quantum dynamical operation for quantum information
processing? Motivated by this question we investigate several strength measures
quantifying the resources intrinsic to a quantum operation. We develop a
general theory of such strength measures, based on axiomatic considerations
independent of state-based resources. The power of this theory is demonstrated
with applications to quantum communication complexity, quantum computational
complexity, and entanglement generation by unitary operations.Comment: 19 pages, shortened by 3 pages, mainly cosmetic change
Complexity, action, and black holes
Our earlier paper "Complexity Equals Action" conjectured that the quantum
computational complexity of a holographic state is given by the classical
action of a region in the bulk (the "Wheeler-DeWitt" patch). We provide
calculations for the results quoted in that paper, explain how it fits into a
broader (tensor) network of ideas, and elaborate on the hypothesis that black
holes are the fastest computers in nature.Comment: 55+14 pages, many figures. v2: (so many) typos fixed, references
adde
On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants
It is shown that the canonical problem of classical statistical
thermodynamics, the computation of the partition function, is in the case of
+/-J Ising spin glasses a particular instance of certain simple sums known as
quadratically signed weight enumerators (QWGTs). On the other hand it is known
that quantum computing is polynomially equivalent to classical probabilistic
computing with an oracle for estimating QWGTs. This suggests a connection
between the partition function estimation problem for spin glasses and quantum
computation. This connection extends to knots and graph theory via the
equivalence of the Kauffman polynomial and the partition function for the Potts
model.Comment: 8 pages, incl. 2 figures. v2: Substantially rewritte
Quantum Hopfield neural network
Quantum computing allows for the potential of significant advancements in
both the speed and the capacity of widely used machine learning techniques.
Here we employ quantum algorithms for the Hopfield network, which can be used
for pattern recognition, reconstruction, and optimization as a realization of a
content-addressable memory system. We show that an exponentially large network
can be stored in a polynomial number of quantum bits by encoding the network
into the amplitudes of quantum states. By introducing a classical technique for
operating the Hopfield network, we can leverage quantum algorithms to obtain a
quantum computational complexity that is logarithmic in the dimension of the
data. We also present an application of our method as a genetic sequence
recognizer.Comment: 13 pages, 3 figures, final versio
The Quantum PCP Conjecture
The classical PCP theorem is arguably the most important achievement of
classical complexity theory in the past quarter century. In recent years,
researchers in quantum computational complexity have tried to identify
approaches and develop tools that address the question: does a quantum version
of the PCP theorem hold? The story of this study starts with classical
complexity and takes unexpected turns providing fascinating vistas on the
foundations of quantum mechanics, the global nature of entanglement and its
topological properties, quantum error correction, information theory, and much
more; it raises questions that touch upon some of the most fundamental issues
at the heart of our understanding of quantum mechanics. At this point, the jury
is still out as to whether or not such a theorem holds. This survey aims to
provide a snapshot of the status in this ongoing story, tailored to a general
theory-of-CS audience.Comment: 45 pages, 4 figures, an enhanced version of the SIGACT guest column
from Volume 44 Issue 2, June 201
- …