Please use this identifier to cite or link to this item:
|Title:||Hardness of classically simulating the one-clean-qubit model|
|Source:||Morimae, T., Fujii, K., Fitzsimons, J.F. (2014-04-02). Hardness of classically simulating the one-clean-qubit model. Physical Review Letters 112 (13) : -. ScholarBank@NUS Repository. https://doi.org/10.1103/PhysRevLett.112.130502|
|Abstract:||Deterministic quantum computation with one quantum bit (DQC1) [E. Knill and R. Laflamme, Phys. Rev. Lett. 81, 5672 (1998)] is a model of quantum computing where the input is restricted to containing a single qubit in a pure state and has all other qubits in a completely mixed state. Only the single pure qubit is measured at the end of the computation. While it is known that DQC1 can efficiently solve several problems for which no known classical efficient algorithms exist, the question of whether DQC1 is really more powerful than classical computation remains open. In this Letter, we introduce a slightly modified version of DQC1, which we call DQC1k, where k output qubits are measured, and show that DQC1k cannot be classically efficiently simulated for any k≥3 unless the polynomial hierarchy collapses at the third level. © 2014 American Physical Society.|
|Source Title:||Physical Review Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 27, 2018
WEB OF SCIENCETM
checked on Feb 19, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.