| Presentation | 2015-09-01 Impossibility of Classically Simulating One-Clean-Qubit Computation Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | 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. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | quantum computation / computational complexity |
| Paper # | COMP2015-17 |
| Date of Issue | 2015-08-25 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2015/9/1(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Koichi Wada(Hosei Univ.) |
| Vice Chair | Toshimitsu Masuzawa(Osaka Univ.) |
| Secretary | Toshimitsu Masuzawa(Hiroshima Univ.) |
| Assistant | |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Impossibility of Classically Simulating One-Clean-Qubit Computation |
| Sub Title (in English) | |
| Keyword(1) | quantum computation |
| Keyword(2) | computational complexity |
| 1st Author's Name | Keisuke Fujii |
| 1st Author's Affiliation | Kyoto University(Kyoto Univ.) |
| 2nd Author's Name | Hirotada Kobayashi |
| 2nd Author's Affiliation | National Institute of Informatics(NII) |
| 3rd Author's Name | Tomoyuki Morimae |
| 3rd Author's Affiliation | Gunma University(Gunma Univ.) |
| 4th Author's Name | Harumichi Nishimura |
| 4th Author's Affiliation | Nagoya University(Nagoya Univ.) |
| 5th Author's Name | Shuhei Tamate |
| 5th Author's Affiliation | National Institute of Informatics(NII) |
| 6th Author's Name | Seiichiro Tani |
| 6th Author's Affiliation | Nippon Telegraph and Telephone Corporation(NTT) |
| Date | 2015-09-01 |
| Paper # | COMP2015-17 |
| Volume (vol) | vol.115 |
| Number (no) | COMP-205 |
| Page | pp.pp.5-12(COMP), |
| #Pages | 8 |
| Date of Issue | 2015-08-25 (COMP) |