Interacting Boson Problems Can Be QMA Hard
نویسندگان
چکیده
منابع مشابه
QMA-complete problems
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date . Such problems are believed to be difficult to solve, even with a quantum computer, but have the property that if a purported solution to the problem is given, a quantum computer would easily be able to verify whether it is correct. An attempt has been ma...
متن کاملProof Verification Can Be Hard!
Keywords: restricted ω-rule, not-semi-decidable, limits of proof verification The generally accepted wisdom in computational circles is that pure proof verification is a solved problem and that the computationally hard elements and fertile areas of study lie in proof discovery. 1 This wisdom presumably does hold for conventional proof systems such as first-order logic with a standard proof calc...
متن کاملCan a strongly interacting Higgs boson rescue SU(5)?
Renormalization group analyses show that the three running gauge coupling constants of the Standard Model do not become equal at any energy scale. These analyses have not included any effects of the Higgs boson's self-interaction. In this paper, I examine whether these effects can modify this conclusion.
متن کاملWhat can we learn from the Interacting Boson Model in the limit of large boson numbers ?
Over the years, studies of collective properties of medium and heavy mass nuclei in the framework of the Interacting Boson Approximation (IBA) model have focused on finite boson numbers, corresponding to valence nucleon pairs in specific nuclei. Attention to large boson numbers has been motivated by the study of shape/phase transitions from one limiting symmetry of IBA to another, which become ...
متن کاملRandom Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful
The aim of this article is to discuss some applications of random processes in searching and reaching consensus on finite graphs. The topics covered are: Why random walks?, Speeding up random walks, Random and deterministic walks, Interacting particles and voting, Searching changing graphs. As an introductory example consider the self-stabilizing mutual exclusion algorithm of Israeli and Jalfon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2010
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.104.040501