Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates

DOI10.1007/978-3-642-40313-2_70zbMath1400.68077OpenAlexW2252155077MaRDI QIDQ2849963

Kazuyuki Tanaka, Takeshi Yamazaki, Yasuhiro Takahashi

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_70

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

This page was built for publication: Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates