Document Open Access Logo

Branch Sequentialization in Quantum Polytime

Authors Emmanuel Hainry , Romain Péchoux , Mário Silva

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSCD.2025.22.pdf
  • Filesize: 6.06 MB
  • 22 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum complexity theory
Keywords
  • Quantum Programs
  • Implicit Computational Complexity
  • Quantum Circuits

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Quantum algorithms leverage the use of quantumly-controlled data in order to achieve computational advantage. This implies that the programs use constructs depending on quantum data and not just classical data such as measurement outcomes. Current compilation strategies for quantum control flow involve compiling the branches of a quantum conditional, either in-depth or in-width, which in general leads to circuits of exponential size. This problem is coined as the branch sequentialization problem. We introduce and study a compilation technique for avoiding branch sequentialization on a language that is sound and complete for quantum polynomial time, thus, improving on existing polynomial-size-preserving compilation techniques.

Cite As Get BibTex

Emmanuel Hainry, Romain Péchoux, and Mário Silva. Branch Sequentialization in Quantum Polytime. In 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 337, pp. 22:1-22:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.FSCD.2025.22

Author Details

Emmanuel Hainry
  • Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France
Romain Péchoux
  • Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France
Mário Silva
  • Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France

Funding

This work is supported by the the Plan France 2030 through the PEPR integrated project EPiQ ANR-22- PETQ-0007 and the HQI platform ANR-22-PNCQ-0002; and by the European projects NEASQC and HPCQS.

Acknowledgements

The authors would like to thank Alexandre Guernut for his work on the compiler implementation and the anonymous reviewers for their constructive and useful comments.

References

  1. Samson Abramsky. No-cloning in categorical quantum mechanics. Semantic Techniques in Quantum Computation, pages 1-28, 2009. Google Scholar
  2. Leonard M. Adleman, Jonathan DeMarrais, and Ming-Deh A. Huang. Quantum computability. SIAM Journal on Computing, 26(5):1524-1540, 1997. URL: https://doi.org/10.1137/S0097539795293639.
  3. Thorsten Altenkirch and Jonathan Grattage. A functional quantum programming language. In 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pages 249-258, 2005. URL: https://doi.org/10.1109/LICS.2005.1.
  4. John Baez. Quantum quandaries: a category-theoretic perspective. The structural foundations of quantum gravity, pages 240-265, 2006. Google Scholar
  5. Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter. Elementary gates for quantum computation. Phys. Rev. A, 52:3457-3467, November 1995. URL: https://doi.org/10.1103/PhysRevA.52.3457.
  6. Ethan Bernstein and Umesh Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411-1473, 1997. URL: https://doi.org/10.1137/S0097539796300921.
  7. Hans J. Briegel, David E. Browne, Wolfgang Dür, Robert Raussendorf, and Maarten Van den Nest. Measurement-based quantum computation. Nature Physics, 5(1):19-26, 2009. URL: https://doi.org/10.1038/nphys1157.
  8. Andrew M. Childs and Nathan Wiebe. Hamiltonian simulation using linear combinations of unitary operations. Quantum Info. Comput., 12(11–12):901-924, November 2012. URL: https://doi.org/10.26421/QIC12.11-12-1.
  9. Andrea Colledan and Ugo Dal Lago. Circuit width estimation via effect typing and linear dependency. In European Symposium on Programming, pages 3-30. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-57267-8_1.
  10. Andrea Colledan and Ugo Dal Lago. Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages. Proc. ACM Program. Lang., 9(POPL), January 2025. URL: https://doi.org/10.1145/3704883.
  11. Ugo Dal Lago, Andrea Masini, and Margherita Zorzi. Quantum implicit computational complexity. Theoretical Computer Science, 411(2):377-409, 2010. URL: https://doi.org/10.1016/j.tcs.2009.07.045.
  12. Vincent Danos and Elham Kashefi. Determinism in the one-way model. Physical Review A, 74(5):052310, 2006. URL: https://doi.org/10.1103/PhysRevA.74.052310.
  13. Niel de Beaudrap, Xiaoning Bian, and Quanlong Wang. Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities. In 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), pages 11:1-11:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.TQC.2020.11.
  14. Alejandro Díaz-Caro, Mauricio Guillermo, Alexandre Miquel, and Benoît Valiron. Realizability in the unitary sphere. In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-13. IEEE, 2019. URL: https://doi.org/10.1109/LICS.2019.8785834.
  15. Peng Fu, Kohei Kishida, and Peter Selinger. Linear dependent type theory for quantum programming languages: Extended abstract. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '20, pages 440-453, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3373718.3394765.
  16. David Gosset, Robin Kothari, and Kewen Wu. Quantum state preparation with optimal T-count. arXiv preprint arXiv:2411.04790, 2024. URL: https://doi.org/10.48550/arXiv.2411.04790.
  17. Emmanuel Hainry, Romain Péchoux, and Mário Silva. A programming language characterizing quantum polynomial time. In Foundations of Software Science and Computation Structures, pages 156-175. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-30829-1_8.
  18. Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd. Quantum Algorithm for Linear Systems of Equations. Physical Review Letters, 103(15), October 2009. URL: https://doi.org/10.1103/physrevlett.103.150502.
  19. Chris Heunen and Jamie Vicary. Categories for Quantum Theory: an introduction. Oxford University Press, 2019. Google Scholar
  20. Aleks Kissinger and John van de Wetering. Reducing the number of non-Clifford gates in quantum circuits. Phys. Rev. A, 102:022406, August 2020. URL: https://doi.org/10.1103/PhysRevA.102.022406.
  21. Emanuel Knill, Raymond Laflamme, and Gerard J. Milburn. A scheme for efficient quantum computation with linear optics. Nature, 409(6816):46-52, January 2001. URL: https://doi.org/10.1038/35051009.
  22. Gui-Lu Long and Yang Sun. Efficient scheme for initializing a quantum register with an arbitrary superposed state. Phys. Rev. A, 64:014303, June 2001. URL: https://doi.org/10.1103/PhysRevA.64.014303.
  23. Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller, and Camille Negrevergne. Quantum Circuit Simplification and Level Compaction. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27(3):436-444, March 2008. URL: https://doi.org/10.1109/tcad.2007.911334.
  24. Cristopher Moore and Martin Nilsson. Parallel Quantum Computation and Quantum Codes. SIAM Journal on Computing, 31(3):799-815, 2001. URL: https://doi.org/10.1137/S0097539799355053.
  25. Yunseong Nam, Neil J. Ross, Yuan Su, Andrew M. Childs, and Dmitri Maslov. Automated optimization of large quantum circuits with continuous parameters. npj Quantum Information, 4(1):23, May 2018. URL: https://doi.org/10.1038/s41534-018-0072-4.
  26. Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, 2011. Google Scholar
  27. Peter Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527-586, 2004. URL: https://doi.org/10.1017/S0960129504004256.
  28. Xiaoming Sun, Guojing Tian, Shuai Yang, Pei Yuan, and Shengyu Zhang. Asymptotically optimal circuit depth for quantum state preparation and general unitary synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 42(10):3301-3314, 2023. URL: https://doi.org/10.1109/TCAD.2023.3244885.
  29. Tomoyuki Yamakami. A Schematic Definition of Quantum Polynomial Time Computability. J. Symb. Log., 85(4):1546-1587, 2020. URL: https://doi.org/10.1017/jsl.2020.45.
  30. Tomoyuki Yamakami. Expressing Power of Elementary Quantum Recursion Schemes for Quantum Logarithmic-Time Computability. In Agata Ciabattoni, Elaine Pimentel, and Ruy J. G. B. de Queiroz, editors, Logic, Language, Information, and Computation, pages 88-104, Cham, 2022. Springer International Publishing. URL: https://doi.org/10.1007/978-3-031-15298-6_6.
  31. Andrew Chi-Chih Yao. Quantum circuit complexity. In Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pages 352-361, 1993. URL: https://doi.org/10.1109/SFCS.1993.366852.
  32. Charles Yuan and Michael Carbin. Tower: Data Structures in Quantum Superposition. Proceedings of the ACM on Programming Languages, 6(OOPSLA2):259-288, October 2022. URL: https://doi.org/10.1145/3563297.
  33. Charles Yuan, Agnes Villanyi, and Michael Carbin. Quantum control machine: The limits of control flow in quantum programming. Proc. ACM Program. Lang., 8(OOPSLA1), April 2024. URL: https://doi.org/10.1145/3649811.
  34. Xiao-Ming Zhang, Tongyang Li, and Xiao Yuan. Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications. Phys. Rev. Lett., 129:230504, November 2022. URL: https://doi.org/10.1103/PhysRevLett.129.230504.
  35. Zhicheng Zhang and Mingsheng Ying. Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs, 2024. URL: https://doi.org/10.48550/arXiv.2408.10054.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact