In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...
We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and ...
Aiichiro Nakano, Rajiv K. Kalia, Ken-ichi Nomura, ...