Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates

Yasuhiro Takahashi, Takeshi Yamazaki, Kazuyuki Tanaka

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

We study the classical simulatability of constant-depth polynomial-size quantum circuits followed by only one single-qubit measurement, where the circuits consist of universal gates on at most two qubits and additional gates on an unbounded number of qubits. First, we consider unbounded Toffoli gates as additional gates and deal with the weak simulation, i.e., sampling the output probability distribution. We show that there exists a constant-depth quantum circuit with only one unbounded Toffoli gate that is not weakly simulatable, unless BQP ⊆ PostBPP ∩ AM. Then, we consider unbounded fan-out gates as additional gates and deal with the strong simulation, i.e., computing the output probability. We show that there exists a constant-depth quantum circuit with only two unbounded fan-out gates that is not strongly simulatable, unless P = PP. These results are in contrast to the fact that any constant-depth quantum circuit without additional gates on an unbounded number of qubits is strongly and weakly simulatable.

Original languageEnglish
Pages (from-to)1149-1164
Number of pages16
JournalQuantum Information and Computation
Volume14
Issue number13-14
Publication statusPublished - 2014 Oct 1

Keywords

  • Classical simulation
  • Constant-depth quantum circuit
  • Unbounded Toffoli gate
  • Unbounded fan-out gate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistical and Nonlinear Physics
  • Nuclear and High Energy Physics
  • Mathematical Physics
  • Physics and Astronomy(all)
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates'. Together they form a unique fingerprint.

Cite this