- Physical Review Journals
All JournalsPhysics Magazine
Access Provided by Xinjiang University

Physical Review A

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access
  • Access by Xinjiang University

Phase-space tableau simulation for quantum computation

Selman Ipek1, Atak Talay Yucel2, Farzad Shahi1, Cagdas Ozdemir3, and Cihan Okay1,*

  • *Contact author: cihan.okay@bilkent.edu.tr
PDF

Phys. Rev. A 113, 032409 – Published 5 March, 2026

DOI: https://doi.org/10.1103/11f2-nqht

Abstract

We introduce a novel tableau-based classical simulation method for quantum computation, formulated within the phase-space framework of the extended stabilizer theory of closed noncontextual operators. This method enables the efficient classical simulation of a broader class of quantum circuits beyond the stabilizer formalism. We identify additional families of input states that are efficiently simulatable within this framework, going beyond stabilizer states, and implement the simulator and benchmark its performance on basic quantum algorithms, including the hidden shift and Deutsch–Jozsa algorithms.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (52)

  1. S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, in Proceedings of the 32nd Computational Complexity Conference, CCC '17 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, DEU, 2017).
  2. D. Gottesman, The Heisenberg Representation of Quantum Computers, in Group22: Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics: Hobart, July 1317, 1998, edited by S. P. Corney, R. Delbourgo, and P. D. Jarvis (International Press, Cambridge, MA, 1999), pp. 32–43.
  3. S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70, 052328 (2004).
  4. S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Phys. Rev. A 71, 022316 (2005).
  5. S. Bravyi, G. Smith, and J. A. Smolin, Trading classical and quantum computational resources, Phys. Rev. X 6, 021043 (2016).
  6. S. Bravyi and D. Gosset, Improved classical simulation of quantum circuits dominated by Clifford gates, Phys. Rev. Lett. 116, 250501 (2016).
  7. S. Bravyi, D. Browne, P. Calpin, E. Campbell, D. Gosset, and M. Howard, Simulation of quantum circuits by low-rank stabilizer decompositions, Quantum 3, 181 (2019).
  8. V. Veitch, C. Ferrie, D. Gross, and J. Emerson, Negative quasi-probability as a resource for quantum computation, New J. Phys. 14, 113011 (2012).
  9. N. Delfosse, P. Allard Guerin, J. Bian, and R. Raussendorf, Wigner function negativity and contextuality in quantum computation on rebits, Phys. Rev. X 5, 021003 (2015).
  10. R. Raussendorf, D. E. Browne, N. Delfosse, C. Okay, and J. Bermejo-Vega, Contextuality and Wigner-function negativity in qubit quantum computation, Phys. Rev. A 95, 052334 (2017).
  11. R. Raussendorf, J. Bermejo-Vega, E. Tyhurst, C. Okay, and M. Zurel, Phase-space-simulation method for quantum computation with magic states on qubits, Phys. Rev. A 101, 012350 (2020).
  12. D. Gross, Hudson’s theorem for finite-dimensional quantum systems, J. Math. Phys. 47, 122107 (2006).
  13. N. D. Mermin, Hidden variables and the two theorems of John Bell, Rev. Mod. Phys. 65, 803 (1993).
  14. W. M. Kirby and P. J. Love, Contextuality test of the nonclassicality of variational quantum eigensolvers, Phys. Rev. Lett. 123, 200501 (2019).
  15. W. M. Kirby and P. J. Love, Classical simulation of noncontextual Pauli Hamiltonians, Phys. Rev. A 102, 032418 (2020).
  16. W. M. Kirby, A. Tranter, and P. J. Love, Contextual subspace variational quantum eigensolver, Quantum 5, 456 (2021).
  17. H. Pashayan, J. J. Wallman, and S. D. Bartlett, Estimating outcome probabilities of quantum circuits using quasiprobabilities, Phys. Rev. Lett. 115, 070501 (2015).
  18. M. Howard and E. Campbell, Application of a resource theory for magic states to fault-tolerant quantum computing, Phys. Rev. Lett. 118, 090501 (2017).
  19. C. Hindlycke and J.-Å. Larsson, Efficient contextual ontological model of n-qubit stabilizer quantum mechanics, Phys. Rev. Lett. 129, 130401 (2022).
  20. A. Karanjai, J. J. Wallman, and S. D. Bartlett, Contextuality bounds the efficiency of classical simulation of quantum processes, arXiv:1802.07744.
  21. BilQCT, CNCSim, https://github.com/BilQCT/CNCSim, accessed: 2025-02-28.
  22. Our row product operation corresponds to the rowsum operation of AG [3].
  23. C. Gidney, Python CHP stabilizer simulator, https://github.com/Strilanc/python-chp-stabilizer-simulator, accessed: 2025-03-21.
  24. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, Cambridge, 2010).
  25. C. Okay, S. Roberts, S. D. Bartlett, and R. Raussendorf, Topological proofs of contextuality in qunatum mechanics, Quantum Inf. Comput. 17, 1135 (2017).
  26. M. Zurel, C. Okay, and R. Raussendorf, Hidden variable model for universal quantum computation with magic states on qubits, Phys. Rev. Lett. 125, 260404 (2020).
  27. M. Heinrich and D. Gross, Robustness of magic and symmetries of the stabiliser polytope, Quantum 3, 132 (2019).
  28. L. G. Valiant, Quantum circuits that can be simulated classically in polynomial time, SIAM J. Comput. 31, 1229 (2002).
  29. B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A 65, 032325 (2002).
  30. R. Jozsa and A. Miyake, Matchgates and classical simulation of quantum circuits, Proc. R. Soc. London Ser. A 464, 3089 (2008).
  31. C. Okay, M. Zurel, and R. Raussendorf, On the extremal points of the Λ-polytopes and classical simulation of quantum computation with magic states, Quantum Inf. Comput. 21, 1091 (2021).
  32. T. Weaving, A. Ralli, W. M. Kirby, A. Tranter, P. J. Love, and P. V. Coveney, A stabilizer framework for the contextual subspace variational quantum eigensolver and the noncontextual projection ansatz, J. Chem. Theory Comput. 19, 808 (2023).
  33. R. Sarkar and E. van den Berg, On sets of maximally commuting and anticommuting Pauli operators, Res. Math. Sci. 8, 14 (2021).
  34. A. Cannas da Silva, Lectures on Symplectic Geometry, Lecture Notes in Mathematics, Vol. 1764 (Springer, Berlin, Heidelberg, 2001).
  35. R. Koenig and J. A. Smolin, How to efficiently select an arbitrary Clifford group element, J. Math. Phys. 55, 122202 (2014).
  36. To see this, notice that there is a local Clifford V∈Cl1 such that V(X)=X, V(Y)=−Y, V(Z)=Z, and if we apply it to the nth qubit of the {Tâi}i=12m+1, it only flips the phase of the Tâ2m+1. Combining V with Uα gives the desired result.
  37. M. Zurel, Hidden variable models and classical simulation algorithms for quantum computation with magic states on qubits, Master's thesis, University of British Columbia, 2020.
  38. If we measure −Tb we flip the outcomes 0↔1.
  39. J. Watrous, The Theory of Quantum Information (Cambridge University Press, 2018).
  40. J. R. Seddon and E. T. Campbell, Quantifying magic for multi-qubit operations, Proc. R. Soc. London Ser. A 475, 20190251 (2019).
  41. We do not consider the most general notion of a completely stabilizer-preserving channel. An extensive study of completely stabilizer-preserving operations and their related monotones was performed in Ref. [40].
  42. R. Jozsa and M. Van Den Nest, Classical simulation complexity of extended Clifford circuits, Quantum Info. Comput. 14, 633 (2014).
  43. H. Pashayan, S. D. Bartlett, and D. Gross, From estimation of quantum probabilities to simulation of quantum circuits, Quantum 4, 223 (2020).
  44. It was shown by Jozsa and Van den Nest [42] that computing exact Born rule probabilities (i.e., strong simulation) of adaptive stabilizer circuits is in the complexity class—and thus unlikely to be efficient in general.
  45. W. Hoeffding, Probability inequalities for sums of bounded random variables, in The Collected Works of Wassily Hoeffding, edited by N. I. Fisher and P. K. Sen, Springer Series in Statistics (Springer, New York, 1994), pp. 409–426
  46. M. Rötteler, Quantum algorithms for highly non-linear Boolean functions, in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, 2010), pp. 448–457.
  47. D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proc. R. Soc. London Ser. A 439, 553 (1992).
  48. H. Pashayan, O. Reardon-Smith, K. Korzekwa, and S. D. Bartlett, Fast estimation of outcome probabilities for quantum circuits, PRX Quantum 3, 020361 (2022).
  49. A. Kissinger and J. van de Wetering, Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions, Quantum Sci. Technol. 7, 044001 (2022).
  50. M. Zurel, L. Z. Cohen, and R. Raussendorf, Simulation of quantum computation with magic states via Jordan-Wigner transformations, Phys. Rev. A 112, 042602 (2025).
  51. R. Raussendorf and H. J. Briegel, A one-way quantum computer, Phys. Rev. Lett. 86, 5188 (2001).
  52. C. Okay, A. T. Yucel, and S. Ipek, Classical simulation of universal measurement-based quantum computation using multipartite Bell scenarios, arXiv:2410.23734.

Outline

Information

Phys. Rev. A 113, 032409– Published 5 March, 2026
  • Received 28 October 2025
  • Accepted 22 January 2026
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation