69 citations · 261 across the 33 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
quant-ph2014★ 1 cited
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable
Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki +1
We study the classical simulatability of commuting quantum circuits with n input qubits and O(log n) output qubits, where a quantum circuit is classically simulatable if its output…
quant-ph2014★ 62 cited
Impossibility of Classically Simulating One-Clean-Qubit Computation
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae +3
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 cle…