A pioneering treatise presenting how the new mathematical techniques of holographic duality unify seemingly unrelated fields of physics. This innovative development morphs quantum field theory, general relativity and the renormalisation group into a single computational framework and this book is the first to bring together a wide range of research in this rapidly developing field. Set within the context of condensed matter physics and using boxes highlighting the specific techniques required, it examines the holographic description of thermal properties of matter, Fermi liquids and superconductors, and hitherto unknown forms of macroscopically entangled quantum matter in terms of general relativity, stars and black holes. Showing that holographic duality can succeed where classic mathematical approaches fail, this text provides a thorough overview of this major breakthrough at the heart of modern physics. The inclusion of extensive introductory material using non-technical language and online Mathematica notebooks ensures the appeal to students and researchers alike.
What does it mean for the physically motivated computational complexity class
BQP and the logically motivated class
NP to be incomparable, from a physical perspective? Although it is unlikely that quantum computers can solve
NP-complete problems in polynomial time, yet it may be instructive to see how a physical theory (denoted
Θ(NP) or
Θ(PSPACE)) for which
NP or even
PSPACE, respectively, constitutes an efficient model of computation, would compare with quantum theory. The present work explores this question, after briefly reviewing some complexity results indicative of the incomparability of
BQP and
NP. We argue that theories
Θ(NP) or
Θ(PSPACE) effectively feature degrees of nonlinearity. Thus, the linearity of quantum theory prevents complete problems in these complexity classes to be efficiently solvable on a quantum computer. On the other hand, the exponentiality of quantum theory endows quantum computers with a certain strength going beyond
NP or even
PH. Thus the contrasting roles of the empowerment provided by quantum mechanical exponentiality and the limitation imposed by quantum mechanical linearity seem to be at the heart of the incomparability of the classes
BQP and
NP. Quanta 2025; 14: 38–47.
In theoretical computer science, researchers usually distinguish between feasible problems (that can be solved in polynomial time) and problems that require more computation time. A natural question is: can we use new physical processes, processes that have not been used in modern computers, to make computations drastically faster – e.g., to make intractable problems feasible? Such a possibility would occur if a physical process provides a super-polynomial ( = faster than polynomial) speed-up. In this direction, the most active research is undertaken in quantum computing. It is well known that quantum processes can drastically speed up computations; however, there are proven super-polynomial quantum speedups of the overall computation time. Parallelization is another potential source of speedup. In Euclidean space, parallelization only leads to a polynomial speedup. We show that in quantum space-time, parallelization could potentially lead to (provably) super-polynomial speedup of computations. c⃝2012 World Academic Press, UK. All rights reserved.