Hardness of classically sampling one clean qubit model with constant total variation distance error
Hardness of classically sampling one clean qubit model with constant total variation distance error
复制标题
具有恒定总变分距离误差的经典采样一个干净量子位模型的难度
DOI:
10.1103/physreva.96.040302
复制
发表时间:
2017
影响因子:
2.9
通讯作者:
Morimae
中科院分区:
文献类型:
--
作者:
Hitomi J;Katayama T;Eguchi Y;Kudo T;Taniguchi M;Koyama Y;Manabe T;Yamagishi S;Bando Y;Imaizumi K;Tsujimoto Y;Tohyama M.;Morimae
The one-clean-qubit model (or the DQC1 model) is a restricted model of quantum computing where only a single input qubit is pure and all other input qubits are maximally mixed. In spite of the severe restriction, the model can solve several problems (such as calculating Jones polynomials) whose classical efficient solutions are not known. Furthermore, it was shown that if the output probability distribution of the one-clean-qubit model can be classically efficiently sampled with a constant multiplicative error, then the polynomial hierarchy collapses to the second level. Is it possible to improve the multiplicative error hardness result to a constant total variation distance error one like other subuniversal quantum computing models such as the IQP (Instantaneous Quantum Polynomial time) model, the boson sampling model, and the Fourier sampling model? In this paper we show that it is indeed possible if we accept a modified version of the average case hardness conjecture. Interestingly, the anticoncentration lemma can be easily shown by using the special property of the one-clean-qubit model that each output probability is so small that no concentration occurs.
登录
查看更多内容
影响因子:
8.6
作者:
Tomoyuki Morimae;Keisuke Fujii;Joe Fitzsimons
通讯作者:
Joe Fitzsimons
DOI:
10.26421/qic9.3-4-6
发表时间:
2008
期刊:
Quantum Inf. Comput.
影响因子:
--
作者:
S. Jordan;P. Wocjan
通讯作者:
P. Wocjan
DOI:
10.26421/qic8.8-9-1
发表时间:
2007
期刊:
Quantum Inf. Comput.
影响因子:
--
作者:
P. Shor;S. Jordan
通讯作者:
S. Jordan
影响因子:
8.6
作者:
G. Passante;O. Moussa;C. Ryan;R. Laflamme;R. Laflamme
通讯作者:
R. Laflamme