Quantum Computational Complexity Of The N-Representability Problem: Qma Complete
PHYSICAL REVIEW LETTERS(2007)
摘要
We study the computational complexity of the N-representability problem in quantum chemistry. We show that this problem is quantum Merlin-Arthur complete, which is the quantum generalization of nondeterministic polynomial time complete. Our proof uses a simple mapping from spin systems to fermionic systems, as well as a convex optimization technique that reduces the problem of finding ground states to N representability.
更多查看译文
关键词
computational complexity,quantum chemistry,ground state,convex optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要