Impossibility of Classically Simulating One-Clean-Qubit Computation
Abstract
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input state is the completely mixed state except for a single clean qubit, and only a single output qubit is measured at the end of the computing. It is proved that the restriction of quantum computation to the DQC1 model does not change the complexity classes NQP and SBQP. As a main consequence, it follows that the DQC1 model cannot be efficiently simulated by classical computers unless the polynomial-time hierarchy collapses to the second level (more precisely, to AM), which answers the long-standing open problem posed by Knill and Laflamme under the very plausible complexity assumption. The argument developed in this paper also weakens the complexity assumption necessary for the existing impossibility results on classical simulation of various sub-universal quantum computing models, such as the IQP model and the Boson sampling.
Cite
@article{arxiv.1409.6777,
title = {Impossibility of Classically Simulating One-Clean-Qubit Computation},
author = {Keisuke Fujii and Hirotada Kobayashi and Tomoyuki Morimae and Harumichi Nishimura and Shuhei Tamate and Seiichiro Tani},
journal= {arXiv preprint arXiv:1409.6777},
year = {2018}
}
Comments
13 pages, 1 figure. New results and new authors have been added. (DQC1_2 is improved to DQC1_1, and collapse of PH is improved from 3rd to 2nd level.) Title is also changed