48,348 research outputs found
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
Why Philosophers Should Care About Computational Complexity
One might think that, once we know something is computable, how efficiently
it can be computed is a practical question with little further philosophical
importance. In this essay, I offer a detailed case that one would be wrong. In
particular, I argue that computational complexity theory---the field that
studies the resources (such as time, space, and randomness) needed to solve
computational problems---leads to new perspectives on the nature of
mathematical knowledge, the strong AI debate, computationalism, the problem of
logical omniscience, Hume's problem of induction, Goodman's grue riddle, the
foundations of quantum mechanics, economic rationality, closed timelike curves,
and several other topics of philosophical interest. I end by discussing aspects
of complexity theory itself that could benefit from philosophical analysis.Comment: 58 pages, to appear in "Computability: G\"odel, Turing, Church, and
beyond," MIT Press, 2012. Some minor clarifications and corrections; new
references adde
Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
One of the central problems in quantum mechanics is to determine the ground
state properties of a system of electrons interacting via the Coulomb
potential. Since its introduction by Hohenberg, Kohn, and Sham, Density
Functional Theory (DFT) has become the most widely used and successful method
for simulating systems of interacting electrons, making their original work one
of the most cited in physics. In this letter, we show that the field of
computational complexity imposes fundamental limitations on DFT, as an
efficient description of the associated universal functional would allow to
solve any problem in the class QMA (the quantum version of NP) and thus
particularly any problem in NP in polynomial time. This follows from the fact
that finding the ground state energy of the Hubbard model in an external
magnetic field is a hard problem even for a quantum computer, while given the
universal functional it can be computed efficiently using DFT. This provides a
clear illustration how the field of quantum computing is useful even if quantum
computers would never be built.Comment: 8 pages, 3 figures. v2: Version accepted at Nature Physics; differs
significantly from v1 (including new title). Includes an extra appendix (not
contained in the journal version) on the NP-completeness of Hartree-Fock,
which is taken from v
- ā¦