{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:20:46Z","timestamp":1781194846281,"version":"3.54.1"},"reference-count":36,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>Parametrised quantum circuits contain phase gates whose phase is determined by a classical algorithm prior to running the circuit on a quantum device. Such circuits are used in variational algorithms like QAOA and VQE. In order for these algorithms to be as efficient as possible it is important that we use the fewest number of parameters. We show that, while the general problem of minimising the number of parameters is NP-hard, when we restrict to circuits that are Clifford apart from parametrised phase gates and where each parameter is used just once, we <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>c<\/mml:mi><mml:mi>a<\/mml:mi><mml:mi>n<\/mml:mi><\/mml:math> efficiently find the optimal parameter count. We show that when parameter transformations are required to be sufficiently well-behaved, the only rewrites that reduce parameters correspond to simple `fusions'. Using this we find that a previous circuit optimisation strategy by some of the authors [Kissinger, van de Wetering. PRA (2019)] finds the optimal number of parameters. Our proof uses the ZX-calculus. We also prove that the standard rewrite rules of the ZX-calculus suffice to prove any equality between parametrised Clifford circuits.<\/jats:p>","DOI":"10.22331\/q-2025-08-27-1828","type":"journal-article","created":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T10:04:51Z","timestamp":1756289091000},"page":"1828","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":7,"title":["Optimal compilation of parametrised quantum circuits"],"prefix":"10.22331","volume":"9","author":[{"given":"John van de","family":"Wetering","sequence":"first","affiliation":[{"name":"University of Amsterdam"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richie","family":"Yeung","sequence":"additional","affiliation":[{"name":"University of Oxford"},{"name":"Quantinuum"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tuomas","family":"Laakkonen","sequence":"additional","affiliation":[{"name":"Quantinuum"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aleks","family":"Kissinger","sequence":"additional","affiliation":[{"name":"University of Oxford"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"9598","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"M. Amy, D. Maslov, M. Mosca, and M. Roetteler. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32 (6): 818\u2013830, 6 2013. ISSN 0278-0070. 10.1109\/TCAD.2013.2244643.","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Matthew Amy. Towards large-scale functional verification of universal quantum circuits. In Peter Selinger and Giulio Chiribella, editors, Proceedings of the 15th International Conference on Quantum Physics and Logic, Halifax, Canada, 3-7th June 2018, volume 287 of Electronic Proceedings in Theoretical Computer Science, pages 1\u201321. Open Publishing Association, 2019. 10.4204\/EPTCS.287.1.","DOI":"10.4204\/EPTCS.287.1"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Matthew Amy and Michele Mosca. T-count optimization and Reed-Muller codes. Transactions on Information Theory, 2019. 10.1109\/TIT.2019.2906374. URL https:\/\/ieeexplore.ieee.org\/document\/8672175.","DOI":"10.1109\/TIT.2019.2906374"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Miriam Backens. The ZX-calculus is complete for stabilizer quantum mechanics. New Journal of Physics, 16 (9): 093021, 2014. 10.1088\/1367-2630\/16\/9\/093021.","DOI":"10.1088\/1367-2630\/16\/9\/093021"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Miriam Backens and Aleks Kissinger. ZH: A complete graphical calculus for quantum computations involving classical non-linearity. In Peter Selinger and Giulio Chiribella, editors, Proceedings of the 15th International Conference on Quantum Physics and Logic, Halifax, Canada, 3-7th June 2018, volume 287 of Electronic Proceedings in Theoretical Computer Science, pages 18\u201334. Open Publishing Association, 2019. 10.4204\/EPTCS.287.2.","DOI":"10.4204\/EPTCS.287.2"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Miriam Backens, Hector Miller-Bakewell, Giovanni de Felice, Leo Lobski, and John van de Wetering. There and back again: A circuit extraction tale. Quantum, 5: 421, 3 2021. ISSN 2521-327X. 10.22331\/q-2021-03-25-421.","DOI":"10.22331\/q-2021-03-25-421"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell, John van de Wetering, and Sal Wolffs. Completeness of the ZH-calculus. Compositionality, 5, 7 2023. ISSN 2631-4444. 10.32408\/compositionality-5-5.","DOI":"10.32408\/compositionality-5-5"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Daniel E. Browne, Elham Kashefi, Mehdi Mhalla, and Simon Perdrix. Generalized flow and determinism in measurement-based quantum computation. New Journal of Physics, 9 (8): 250, 2007. 10.1088\/1367-2630\/9\/8\/250.","DOI":"10.1088\/1367-2630\/9\/8\/250"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Bob Coecke and Ross Duncan. Interacting quantum observables. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, 2008. 10.1007\/978-3-540-70583-3_25.","DOI":"10.1007\/978-3-540-70583-3_25"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Bob Coecke and Ross Duncan. Interacting quantum observables: categorical algebra and diagrammatics. New Journal of Physics, 13: 043016, 2011. 10.1088\/1367-2630\/13\/4\/043016.","DOI":"10.1088\/1367-2630\/13\/4\/043016"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Ross Duncan and Simon Perdrix. Rewriting Measurement-Based Quantum Computations with Generalised Flow. In Proceedings of ICALP, Lecture Notes in Computer Science, pages 285\u2013296. Springer, 2010. 10.1007\/978-3-642-14162-1_24.","DOI":"10.1007\/978-3-642-14162-1_24"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Ross Duncan, Aleks Kissinger, Simon Perdrix, and John van de Wetering. Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus. Quantum, 4: 279, 6 2020. ISSN 2521-327X. 10.22331\/q-2020-06-04-279.","DOI":"10.22331\/q-2020-06-04-279"},{"key":"12","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028, 2014. URL https:\/\/arxiv.org\/abs\/1411.4028."},{"key":"13","doi-asserted-by":"publisher","unstructured":"Vojt\u011bch Havl\u00ed\u010dek, Antonio D C\u00f3rcoles, Kristan Temme, Aram W Harrow, Abhinav Kandala, Jerry M Chow, and Jay M Gambetta. Supervised learning with quantum-enhanced feature spaces. Nature, 567 (7747): 209\u2013212, 2019. 10.1038\/s41586-019-0980-2.","DOI":"10.1038\/s41586-019-0980-2"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Luke E Heyfron and Earl T Campbell. An efficient quantum compiler that reduces T count. Quantum Science and Technology, 4 (015004), 2018. 10.1088\/2058-9565\/aad604.","DOI":"10.1088\/2058-9565\/aad604"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart. Diagrammatic Reasoning Beyond Clifford+T Quantum Mechanics. In Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS &apos;18, pages 569\u2013578, New York, NY, USA, 2018a. ACM. ISBN 978-1-4503-5583-4. 10.1145\/3209108.3209139.","DOI":"10.1145\/3209108.3209139"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart. A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics. In Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS &apos;18, pages 559\u2013568, New York, NY, USA, 2018b. ACM. ISBN 978-1-4503-5583-4. 10.1145\/3209108.3209131.","DOI":"10.1145\/3209108.3209131"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Aleks Kissinger and John van de Wetering. Reducing the number of non-Clifford gates in quantum circuits. Physical Review A, 102: 022406, 8 2020. 10.1103\/PhysRevA.102.022406.","DOI":"10.1103\/PhysRevA.102.022406"},{"key":"18","unstructured":"Stach Kuijpers, John van de Wetering, and Aleks Kissinger. Graphical Fourier theory and the cost of quantum addition. arXiv preprint arXiv:1904.07551, 2019. URL https:\/\/arxiv.org\/abs\/1904.07551."},{"key":"19","doi-asserted-by":"publisher","unstructured":"Tommy McElvanney and Miriam Backens. Complete flow-preserving rewrite rules for MBQC patterns with Pauli measurements. In Stefano Gogioso and Matty Hoban, editors, Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022, volume 394 of Electronic Proceedings in Theoretical Computer Science, pages 66\u201382. Open Publishing Association, 2023. 10.4204\/EPTCS.394.5.","DOI":"10.4204\/EPTCS.394.5"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Hector Miller-Bakewell. Finite Verification of Infinite Families of Diagram Equations. In Bob Coecke and Matthew Leifer, editors, Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019, volume 318 of Electronic Proceedings in Theoretical Computer Science, pages 27\u201352. Open Publishing Association, 2020. 10.4204\/EPTCS.318.3.","DOI":"10.4204\/EPTCS.318.3"},{"key":"21","doi-asserted-by":"publisher","unstructured":"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, 2018. 10.1038\/s41534-018-0072-4.","DOI":"10.1038\/s41534-018-0072-4"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Simon Perdrix and Quanlong Wang. Supplementarity is necessary for quantum diagram reasoning. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 76:1\u201376:14, Krakow, Poland, 2016. 10.4230\/LIPIcs.MFCS.2016.76.","DOI":"10.4230\/LIPIcs.MFCS.2016.76"},{"key":"23","doi-asserted-by":"publisher","unstructured":"Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Al\u00e1n Aspuru-Guzik, and Jeremy L O\u2019brien. A variational eigenvalue solver on a photonic quantum processor. Nature communications, 5: 4213, 2014. 10.1038\/ncomms5213.","DOI":"10.1038\/ncomms5213"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Boldizs\u00e1r Po\u00f3r, Robert I. Booth, Titouan Carette, John van de Wetering, and Lia Yeh. The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification. In Shane Mansfield, Benoit Val\u0131\u0302ron, and Vladimir Zamdzhiev, editors, Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023, volume 384 of Electronic Proceedings in Theoretical Computer Science, pages 220\u2013264. Open Publishing Association, 2023. 10.4204\/EPTCS.384.13.","DOI":"10.4204\/EPTCS.384.13"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Robert Raussendorf and Hans J. Briegel. A One-Way Quantum Computer. Physical Review Letters, 86: 5188\u20135191, 5 2001. 10.1103\/PhysRevLett.86.5188.","DOI":"10.1103\/PhysRevLett.86.5188"},{"key":"26","doi-asserted-by":"publisher","unstructured":"Robert Raussendorf, Dan E. Browne, and Hans J. Briegel. Measurement-based quantum computation on cluster states. Physical Review A, 68 (2): 22312, 2003. ISSN 1094-1622. 10.1103\/PhysRevA.68.022312.","DOI":"10.1103\/PhysRevA.68.022312"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Maria Schuld, Ville Bergholm, Christian Gogolin, Josh Izaac, and Nathan Killoran. Evaluating analytic gradients on quantum hardware. Physical Review A, 99 (3): 032331, 2019. 10.1103\/PhysRevA.99.032331.","DOI":"10.1103\/PhysRevA.99.032331"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Sukin Sim, Peter D Johnson, and Al\u00e1n Aspuru-Guzik. Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms. Advanced Quantum Technologies, 2 (12): 1900070, 2019. 10.1002\/qute.201900070.","DOI":"10.1002\/qute.201900070"},{"key":"29","doi-asserted-by":"publisher","unstructured":"Will Simmons. Relating Measurement Patterns to Circuits via Pauli Flow. In Chris Heunen and Miriam Backens, editors, Proceedings 18th International Conference on Quantum Physics and Logic, Gdansk, Poland, and online, 7-11 June 2021, volume 343 of Electronic Proceedings in Theoretical Computer Science, pages 50\u2013101. Open Publishing Association, 2021. 10.4204\/EPTCS.343.4.","DOI":"10.4204\/EPTCS.343.4"},{"key":"30","unstructured":"John van de Wetering. ZX-calculus for the working quantum computer scientist. arXiv preprint arXiv:2012.13966, 2020. URL https:\/\/arxiv.org\/abs\/2012.13966."},{"key":"31","unstructured":"John van de Wetering and Matt Amy. Optimising quantum circuits is generally hard. arXiv preprint arXiv:2310.05958, 2023. URL https:\/\/arxiv.org\/abs\/2310.05958."},{"key":"32","doi-asserted-by":"publisher","unstructured":"Maarten Van Den Nest. Classical simulation of quantum computation, the gottesman-knill theorem, and slightly beyond. Quantum Info. Comput., 10 (3): 258\u2013271, 2010. ISSN 1533-7146. 10.5555\/2011350.2011356.","DOI":"10.5555\/2011350.2011356"},{"key":"33","unstructured":"Vivien Vandaele, Simon Perdrix, and Christophe Vuillot. Optimal number of parametrized rotations and hadamard gates in parametrized clifford circuits with non-repeated parameters. arXiv preprint arXiv:2407.07846, 2024. URL https:\/\/arxiv.org\/abs\/2407.07846."},{"key":"34","doi-asserted-by":"publisher","unstructured":"Renaud Vilmart. A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics. In 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pages 1\u201310, 2019. 10.1109\/LICS.2019.8785765.","DOI":"10.1109\/LICS.2019.8785765"},{"key":"35","unstructured":"Fang Zhang and Jianxin Chen. Optimizing T gates in Clifford+T circuit as $\\pi\/4$ rotations around Paulis. arXiv preprint arXiv:1903.12456, 2019. URL https:\/\/arxiv.org\/abs\/1903.12456."}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-08-27-1828\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T10:45:34Z","timestamp":1756291534000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-08-27-1828\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"references-count":36,"URL":"https:\/\/doi.org\/10.22331\/q-2025-08-27-1828","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,27]]},"article-number":"1828"}}