相关论文: NP-complete Problems and Physical Reality
Rapid ongoing progress in quantum information science makes this an apt time for a Solvay Conference focused on The Physics of Quantum Information. Here I review four intertwined themes encompassed by this topic: Quantum computer science,…
Since its inception at the beginning of the twentieth century, quantum mechanics has challenged our conceptions of how the universe ought to work; however, the equations of quantum mechanics can be too computationally difficult to solve…
Over the past two decades quantum engineering has made significant advances in our ability to create genuine quantum many-body systems using ultracold atoms. In particular, some prototypical exactly solvable Yang-Baxter systems have been…
The feasibility of computationally superior quantum computers is one of the most exciting and clear-cut scientific questions of our time. The question touches on fundamental issues regarding probability, physics, and computability, as well…
In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
Quantum fluid (or hydrodynamic) models provide an attractive alternative for the modeling and simulation of the electron dynamics in nano-scale objects. Compared to more standard approaches, such as density functional theory or phase-space…
Perfect fluid spheres, both Newtonian and relativistic, have attracted considerable attention as the first step in developing realistic stellar models (or models for fluid planets). Whereas there have been some early hints on how one might…
In these lectures we review the constraints on particle physics models arising from cosmic defects. This includes constraints on theories where stable cosmic string loops, or vortons result. These can arise in supersymmetric theories. We…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…
Our understanding of the physics of biological molecules, such as proteins and DNA, is limited because the approximations we usually apply to model inert materials are not in general applicable to soft, chemically inhomogeneous systems. The…
Astrophysical Challenges which demand the solution of the one million (or more) gravitating body problem are briefly discussed for the fields of cosmology, galactic nuclei and globular star clusters. Results from the classical three-body…
The problem of time evolution in quantum cosmology is studied in the context of a dust-filled, spatially flat Friedmann-Robertson-Walker universe. In this model, two versions of the commonly-adopted notion of internal time can be…
Parallel Quantum Annealing is a technique to solve multiple optimization problems simultaneously. Parallel quantum annealing aims to optimize the utilization of available qubits on a quantum topology by addressing multiple independent…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
While quantum computing proposes promising solutions to computational problems not accessible with classical approaches, due to current hardware constraints, most quantum algorithms are not yet capable of computing systems of practical…
Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice. We investigate…
Recent years have seen significant advances, both theoretical and experimental, in our understanding of quantum many-body dynamics. Given this problem's high complexity, it is surprising that a substantial amount of this progress can be…
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a…
In connection with the contribution "Quantum Condensates in Nuclear Matter" some problems are given to become more familiar with the techniques of many-particle physics.