Hardness of approximation for quantum problems
IF 0.7
4区 物理与天体物理
Q3 COMPUTER SCIENCE, THEORY & METHODS
引用次数: 0
Abstract
The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are...量子问题的近似硬度
多项式层次在经典复杂性理论中起着核心作用。在这里，我们定义了多项式层次的量子泛化，并开始了它的研究。我们表明，不仅……
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文
求助全文
来源期刊
Quantum Information & Computation
物理-计算机：理论方法
CiteScore
1.70
自引率
0.00%
发文量
42
审稿时长
3.3 months
期刊介绍：
Quantum Information & Computation provides a forum for distribution of information in all areas of quantum information processing. Original articles, survey articles, reviews, tutorials, perspectives, and correspondences are all welcome. Computer science, physics and mathematics are covered. Both theory and experiments are included. Illustrative subjects include quantum algorithms, quantum information theory, quantum complexity theory, quantum cryptology, quantum communication and measurements, proposals and experiments on the implementation of quantum computation, communications, and entanglement in all areas of science including ion traps, cavity QED, photons, nuclear magnetic resonance, and solid-state proposals.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
