Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The power of shallow-depth Toffoli and qudit quantum circuits (2404.18104v1)

Published 28 Apr 2024 in quant-ph and cs.CC

Abstract: The relevance of shallow-depth quantum circuits has recently increased, mainly due to their applicability to near-term devices. In this context, one of the main goals of quantum circuit complexity is to find problems that can be solved by quantum shallow circuits but require more computational resources classically. Our first contribution in this work is to prove new separations between classical and quantum constant-depth circuits. Firstly, we show a separation between constant-depth quantum circuits with quantum advice $\mathsf{QNC}0/\mathsf{qpoly}$, and $\mathsf{AC}0[p]$, which is the class of classical constant-depth circuits with unbounded-fan in and $\pmod{p}$ gates. In addition, we show a separation between $\mathsf{QAC}0$, which additionally has Toffoli gates with unbounded control, and $\mathsf{AC}0[p]$. This establishes the first such separation for a shallow-depth quantum class that does not involve quantum fan-out gates. Secondly, we consider $\mathsf{QNC}0$ circuits with infinite-size gate sets. We show that these circuits, along with (classical or quantum) prime modular gates, can implement threshold gates, showing that $\mathsf{QNC}0[p]=\mathsf{QTC}0$. Finally, we also show that in the infinite-size gateset case, these quantum circuit classes for higher-dimensional Hilbert spaces do not offer any advantage to standard qubit implementations.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. Computational complexity: a modern approach. Cambridge University Press, 2009.
  2. Elementary gates for quantum computation. Phys. Rev. A, 52:3457–3467, Nov 1995.
  3. Adam Bene Watts and Natalie Parham. Unconditional Quantum Advantage for Sampling with Shallow Circuits. arXiv e-prints, page arXiv:2301.00995, January 2023.
  4. Debajyoti Bera. A lower bound method for quantum circuits. Information processing letters, 111(15):723–726, 2011.
  5. Robert Ivan Booth. Measurement-based quantum computation beyond qubits. Theses, Sorbonne Université, February 2022.
  6. Quantum advantage with shallow circuits. Science, 362(6412):308–311, 2018.
  7. Adaptive constant-depth circuits for manipulating non-abelian anyons. arXiv preprint arXiv:2205.01933, 2022.
  8. Constant-cost implementations of clifford operations and multiply-controlled gates using global interactions. Physical Review Letters, 129(23):230501, 2022.
  9. Noisy decoding by shallow circuits with parities: classical and quantum. arXiv preprint arXiv:2302.02870, 2023.
  10. Computational depth complexity of measurement-based quantum computation. In Wim van Dam, Vivien M. Kendon, and Simone Severini, editors, Theory of Quantum Computation, Communication, and Cryptography, pages 35–46, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg.
  11. Generalized flow and determinism in measurement-based quantum computation. New Journal of Physics, 9(8):250, aug 2007.
  12. Trading locality for time: certifiable randomness from low-depth circuits. Communications in mathematical physics, 382:49–86, 2021.
  13. Quantum lower bounds for fanout. Quantum Info. Comput., 6(1):46–57, jan 2006.
  14. Parity, circuits, and the polynomial-time hierarchy. Mathematical systems theory, 17(1):13–27, 1984.
  15. Oded Goldreich. Three xor-lemmas—an exposition. Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation: In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman, pages 248–272, 2011.
  16. Oded Goldreich. On teaching the approximation method for circuit lower bounds. Eletronical Colloquium on Computational Complexity, 2023.
  17. Counting, fanout and the complexity of quantum acc. Quantum Info. Comput., 2(1):35–65, dec 2002.
  18. Interactive shallow clifford circuits: Quantum advantage against nc¹ and beyond. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, page 875–888, New York, NY, USA, 2020. Association for Computing Machinery.
  19. Signal processing techniques for efficient compilation of controlled rotations in trapped ions. New Journal of Physics, 22(6):063006, 2020.
  20. Efficient quantum programming using ease gates on a trapped-ion quantum computer. Quantum, 6:634, 2022.
  21. Quantum fan-out is powerful. Theory of Computing, 1(5):81–103, 2005.
  22. Space complexity of streaming algorithms on universal quantum computers. In Theory and Applications of Models of Computation: 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings 16, pages 275–286. Springer, 2020.
  23. Richard Jozsa. An introduction to measurement based quantum computation. NATO Science Series, III: Computer and Systems Sciences. Quantum Information Processing-From Theory to Experiment, 199:137–158, 2006.
  24. Depth-efficient proofs of quantumness. Quantum, 6:807, September 2022.
  25. Bao Luong. Fourier analysis on finite Abelian groups. Springer Science & Business Media, 2009.
  26. The power of qutrits for non-adaptive measurement-based quantum computing. New Journal of Physics, 25(7):073007, jul 2023.
  27. Use of global interactions in efficient quantum circuit constructions. New Journal of Physics, 20(3):033018, 2018.
  28. Ryuhei Mori. Periodic fourier representation of boolean functions. arXiv preprint arXiv:1803.09947, 2018.
  29. On the Pauli Spectrum of QAC0. arXiv e-prints, page arXiv:2311.09631, November 2023.
  30. Quantum advantage in temporally flat measurement-based quantum computation. Quantum, 8:1312, April 2024.
  31. Depth-2 qac circuits cannot simulate quantum parity. arXiv preprint arXiv:2005.12169, 2020.
  32. Filipa C. R. Peres. The Pauli-based model of quantum computation with higher dimensional systems. arXiv e-prints, page arXiv:2302.13702, February 2023.
  33. John Preskill. Quantum Computing in the NISQ era and beyond. Quantum, 2:79, August 2018.
  34. A one-way quantum computer. Phys. Rev. Lett., 86:5188–5191, May 2001.
  35. Computational model underlying the one-way quantum computer. Quantum Info. Comput., 2(6):443–486, oct 2002.
  36. Experimental realization of any discrete unitary operator. Phys. Rev. Lett., 73:58–61, Jul 1994.
  37. Gregory Rosenthal. Bounds on the q⁢a⁢c0𝑞𝑎superscript𝑐0qac^{0}italic_q italic_a italic_c start_POSTSUPERSCRIPT 0 end_POSTSUPERSCRIPT complexity of approximating parity. arXiv preprint arXiv:2008.07470, 2020.
  38. Complexity theory column 89: The polynomial hierarchy, random oracles, and boolean circuits. SIGACT News, 46(4):50–68, dec 2015.
  39. Quantum Depth in the Random Oracle Model. arXiv e-prints, page arXiv:2210.06454, October 2022.
  40. R. Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC ’87, page 77–82, New York, NY, USA, 1987. Association for Computing Machinery.
  41. Collapse of the hierarchy of constant-depth exact quantum circuits. computational complexity, 25:849–881, 2016.
  42. Universal resources for measurement-based quantum computation. Phys. Rev. Lett., 97:150504, Oct 2006.
  43. Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 515–526, 2019.
Citations (4)

Summary

We haven't generated a summary for this paper yet.