.png){kind=icon}
返回
Open Problems Related to Quantum Query Complexity
.png){kind=icon}
OA
AI
DOI：10.1145/3488559.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
I offer a case that quantum query complexity still has loads of enticing and fundamental open problems-from relativized QMA versus QCMA and BQP versus IP, to time/space tradeoffs for collision and element distinctness, to polynomial degree versus quantum query complexity for partial functions, to the Unitary Synthesis Problem and more.
Keyword:
Quantum Query Complexity
期刊
A
IF:
6.8
论文数:
542
被引数:
508
机构
引用论文
.png){kind=icon}
分享收藏Data characterizing compressive properties of Al/Al 2 O 3 syntactic foam core metal matrix sandwich
OAAI
OAAI分享收藏
查看更多内容