Abstract
We study the classical simulatability of constant-depth quantum circuits followed by only one single-qubit measurement, where they 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 is strongly and weakly simulatable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aaronson, S.: BQP and the polynomial hierarchy. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC, pp. 141–150 (2010)
Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC, pp. 333–342 (2011)
Arora, S., Barak, M.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)
Bera, D., Fenner, S., Green, F., Homer, S.: Efficient universal quantum circuits. Quantum Information and Computation 10(1&2), 16–27 (2010)
Bremner, M.J., Jozsa, R., Shepherd, D.J.: Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. Proceedings of the Royal Society A 467, 459–472 (2011)
Dawson, C.M., Hines, A.P., Mortimer, D., Haselgrove, H.L., Nielsen, M.A., Osborne, T.J.: Quantum computing and polynomial equations over the finite field ℤ2. Quantum Information and Computation 5(2), 102–112 (2005)
Fenner, S., Green, F., Homer, S., Zhang, Y.: Bounds on the power of constant-depth quantum circuits. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 44–55. Springer, Heidelberg (2005)
Han, Y., Hemaspaandra, L.A., Thierauf, T.: Threshold computation and cryptographic security. SIAM Journal on Computing 26(1), 59–78 (1997)
van den Nest, M.: Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond. Quantum Information and Computation 10(3&4), 258–271 (2010)
van den Nest, M.: Simulating quantum computers with probabilistic methods. Quantum Information and Computation 11(9&10), 784–812 (2011)
Ni, X., van den Nest, M.: Commuting quantum circuits: efficient classical simulations versus hardness results. Quantum Information and Computation 13(1&2), 54–72 (2013)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)
Takahashi, Y., Tani, S.: Collapse of the hierarchy of constant-depth exact quantum circuits. In: Proceedings of the 28th IEEE Conference on Computational Complexity, CCC, pp. 168–178 (2013)
Terhal, B.M., DiVincenzo, D.P.: Adaptive quantum computation, constant-depth quantum circuits and Arthur-Merlin games. Quantum Information and Computation 4(2), 134–145 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takahashi, Y., Yamazaki, T., Tanaka, K. (2013). Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates. In: Chatterjee, K., Sgall, J. (eds) Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science, vol 8087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_70
Download citation
DOI: https://doi.org/10.1007/978-3-642-40313-2_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40312-5
Online ISBN: 978-3-642-40313-2
eBook Packages: Computer ScienceComputer Science (R0)