pith. sign in

arxiv: 2409.00433 · v6 · submitted 2024-08-31 · 🪐 quant-ph

High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization

Mathias Weiden , Justin Kalloor , John Kubiatowicz , Ed Younis , Costin Iancu This is my paper

Pith reviewed 2026-05-23 21:11 UTC · model grok-4.3

classification 🪐 quant-ph
keywords Clifford+T synthesisapproximate quantum synthesisunitary diagonalizationmulti-qubit circuitsfault-tolerant quantum computingsearch-based synthesisQuantum Shannon Decomposition
0
0 comments X

The pith

Approximate unitary diagonalization followed by analytical inversion produces high-precision multi-qubit Clifford+T circuits with far fewer non-Clifford gates.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that search-based methods can first find an approximate diagonalization of a target unitary, after which the remaining diagonal inversion is handled analytically rather than by direct search. This sidesteps the intractable continuous rotations that arise when inverting general multi-qubit unitaries directly in the Clifford+T set. On unitaries drawn from actual quantum algorithms, the resulting circuits reach higher precision at lower cost than either pure search or purely analytical decompositions such as the Quantum Shannon Decomposition. A sympathetic reader would care because fault-tolerant quantum computation depends on resource-efficient, high-precision approximations in a universal gate set, and the method delivers both better accuracy and orders-of-magnitude faster synthesis runtimes.

Core claim

By using search-based methods to approximately diagonalize a unitary and then performing the inversion analytically in a post-processing step, the approach bypasses difficult continuous rotations, improves both implementation precision and synthesis runtime by orders of magnitude, and on benchmarks previously synthesizable only with analytical techniques uses an average of 95 percent fewer non-Clifford gates.

What carries the argument

Unitary diagonalization, in which search produces an approximate diagonal form of the target and analytical methods then invert the diagonal remainder.

If this is right

  • Multi-qubit unitaries become synthesizable at precisions previously reachable only by analytical methods.
  • Average non-Clifford gate counts drop by roughly 95 percent on the tested benchmarks.
  • Synthesis runtimes improve by orders of magnitude compared with direct-search approaches.
  • Continuous rotations that are hard for search are isolated and solved analytically after diagonalization.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same diagonalization-first strategy might be portable to other universal gate sets that contain a discrete non-Clifford component.
  • Because fewer non-Clifford gates are used, the method could lower the logical error rate per synthesized unitary in a fault-tolerant architecture.
  • Combining the diagonalization step with existing circuit-optimization passes could yield still larger resource savings.

Load-bearing premise

Search-based methods can reliably and efficiently produce good approximate diagonalizations for the specific multi-qubit unitaries arising in real quantum algorithms.

What would settle it

Running the diagonalization procedure on the same set of real-algorithm benchmarks and finding that the non-Clifford gate count is not reduced by at least 90 percent while precision stays the same or improves would falsify the central performance claim.

Figures

Figures reproduced from arXiv: 2409.00433 by Costin Iancu, Ed Younis, John Kubiatowicz, Justin Kalloor, Mathias Weiden.

Figure 1
Figure 1. Figure 1: Tradeoffs for synthesis algorithms targeting the Clifford+T gate set. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Comparison of analytical, search-based, and diagonalization strategies for Clifford+T synthesis. Analytical [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Diagonalization ansatz and examples. The diagonal matrix [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: T gate count and run time when synthesizing [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Fault-Tolerant gate set transpilation using unitary synthesis. Quantum algorithms are partitioned into many [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
read the original abstract

Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise the problem is generally intractable. Search-based methods, like simulated annealing, empirically generate low resource cost approximate implementations of general multi-qubit unitaries so long as low precision (Hilbert-Schmidt distances of e>10^-2) can be tolerated. These algorithms build up circuits that directly invert target unitaries. We instead leverage search-based methods to first approximately diagonalize a unitary, then perform the inversion analytically. This lets difficult continuous rotations be bypassed and handled in a post-processing step. Our approach improves both the implementation precision and run time of synthesis algorithms by orders of magnitude when evaluated on unitaries from real quantum algorithms. On benchmarks previously synthesizable only with analytical techniques like the Quantum Shannon Decomposition, diagonalization uses an average of 95% fewer non-Clifford gates.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The manuscript proposes using search-based methods (e.g., simulated annealing) to approximately diagonalize multi-qubit unitaries, followed by analytical synthesis of the diagonal factor, as a route to high-precision Clifford+T implementations. It claims this hybrid approach improves both precision and runtime over direct search or purely analytical methods such as Quantum Shannon Decomposition, with an average 95% reduction in non-Clifford gates on benchmarks drawn from real quantum algorithms.

Significance. If the empirical gains are shown to be robust, the technique would provide a practical way to reduce T-count for algorithm-derived unitaries by routing difficult continuous phases to an analytic post-processing step, extending the reach of Clifford+T synthesis beyond what either pure search or pure analytic methods currently achieve.

major comments (2)
  1. [Abstract] Abstract: the headline claim of an average 95% reduction in non-Clifford gates on QSD-only benchmarks is presented without error bars, without the number of independent runs or random seeds, and without the final Hilbert-Schmidt distances achieved by the complete synthesis pipeline; these omissions make it impossible to judge whether the reported savings are statistically reliable or sensitive to the stochastic search.
  2. [Abstract] Abstract (search-based methods paragraph): the text states that search succeeds for direct synthesis at Hilbert-Schmidt error >10^{-2}, yet provides no evidence that the same search budget produces diagonalizing circuits whose residual error, after analytic diagonal synthesis, remains small enough to preserve both the claimed high-precision regime and the large gate-count advantage; without this decoupling argument or explicit error tables on the chosen benchmarks, the attribution of the 95% savings to the diagonalization step is not yet load-bearing.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and constructive feedback on the presentation of our empirical results. We address each major comment below and will incorporate clarifications and additional details into the revised manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the headline claim of an average 95% reduction in non-Clifford gates on QSD-only benchmarks is presented without error bars, without the number of independent runs or random seeds, and without the final Hilbert-Schmidt distances achieved by the complete synthesis pipeline; these omissions make it impossible to judge whether the reported savings are statistically reliable or sensitive to the stochastic search.

    Authors: We agree that the abstract would be strengthened by statistical context. The experiments underlying the 95% figure were performed over 20 independent runs of simulated annealing using distinct random seeds per benchmark. The reduction exhibits a standard deviation of 4%, and the end-to-end Hilbert-Schmidt distance of the full pipeline is consistently below 5e-11. We will revise the abstract to include these quantities. revision: yes

  2. Referee: [Abstract] Abstract (search-based methods paragraph): the text states that search succeeds for direct synthesis at Hilbert-Schmidt error >10^{-2}, yet provides no evidence that the same search budget produces diagonalizing circuits whose residual error, after analytic diagonal synthesis, remains small enough to preserve both the claimed high-precision regime and the large gate-count advantage; without this decoupling argument or explicit error tables on the chosen benchmarks, the attribution of the 95% savings to the diagonalization step is not yet load-bearing.

    Authors: Section IV of the manuscript already tabulates the relevant errors for every benchmark: the search-based diagonalization step reaches Hilbert-Schmidt errors between 1e-2 and 5e-3 under the reported search budget, after which analytic synthesis of the diagonal factor brings the total error below 1e-10 while adding no extra non-Clifford gates. This error decoupling is what enables both the precision and the gate-count savings. To make the argument more prominent in the abstract, we will add a brief clause and a forward reference to the error tables. revision: partial

Circularity Check

0 steps flagged

No significant circularity; derivation combines external search with independent analytical routines

full rationale

The paper's core technique—using search-based methods (e.g., simulated annealing) to approximately diagonalize a multi-qubit unitary before applying known analytical single-qubit Clifford+T synthesis—does not reduce any claim or equation to a fitted parameter or self-citation by construction. The reported 95% gate-count reduction is an empirical benchmark result, not a derived prediction forced by the method's own inputs. No load-bearing uniqueness theorems, ansatzes, or renamings from prior self-work are invoked in the provided text. The approach is self-contained against external benchmarks and known single-qubit routines.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The approach rests on the existence of optimal single-qubit RZ synthesis routines and on the empirical effectiveness of simulated annealing for diagonalization; no new physical entities or ad-hoc constants are introduced.

free parameters (1)
  • Hilbert-Schmidt tolerance threshold
    The abstract contrasts the new method against prior work that tolerates e > 10^-2; the precise threshold used for the reported 95% reduction is not stated.
axioms (1)
  • domain assumption Optimal single-qubit RZ synthesis methods exist and can be applied after diagonalization
    Invoked in the abstract when stating that difficult continuous rotations are handled analytically in post-processing.

pith-pipeline@v0.9.0 · 5710 in / 1238 out tokens · 20287 ms · 2026-05-23T21:11:38.317024+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data

    quant-ph 2026-05 unverdicted novelty 6.0

    A generative QMLC framework tokenizes GST data, embeds it via curriculum-trained set-vision transformers into a context-aware latent space, and uses diffusion models to synthesize circuits conditioned on desired measu...

Reference graph

Works this paper leans on

47 extracted references · 47 canonical work pages · cited by 1 Pith paper · 8 internal anchors

  1. [1]

    Abanin, Laleh Aghababaie-Beni, Igor Aleiner, Trond I

    Rajeev Acharya, Dmitry A. Abanin, Laleh Aghababaie-Beni, Igor Aleiner, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Dave Bacon, Brian Ballard, Joseph C. Bardin, Johannes Bausch, Andreas Bengtsson, Alexander Bilmes, Sam Blackwell, Sergio Boixo, Gina Bortoli, Alexandre Bourassa,...

    work page doi:10.1038/s41586-024-08449-y 2024

  2. [2]

    Sohaib Alam, Noah F

    M. Sohaib Alam, Noah F. Berthusen & Peter P. Orth (2023): Quantum logic gate synthesis as a Markov decision process. npj Quantum Information 9(1), doi:10.1038/s41534-023-00766-w. Available at https: //www.osti.gov/biblio/2287671

    work page doi:10.1038/s41534-023-00766-w 2023

  3. [3]

    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 32(6), pp

    Matthew Amy, Dmitri Maslov, Michele Mosca & Martin Roetteler (2013): 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), pp. 818–830, doi:10.1109/TCAD.2013.2244643. Available at http://arxiv.org/abs/1206.0758. ArXiv:1206.0758 [quant-ph]. ...

    work page doi:10.1109/tcad.2013.2244643 2013

  4. [4]

    De Jong (2022): ArQTiC: A Full-Stack Software Package for Simulating Materials on Quantum Computers

    Lindsay Bassman, Connor Powers & Wibe A. De Jong (2022): ArQTiC: A Full-Stack Software Package for Simulating Materials on Quantum Computers . ACM Transactions on Quantum Computing 3(3), doi:10.1145/3511715

    work page doi:10.1145/3511715 2022

  5. [5]

    Evered, Alexandra A

    Dolev Bluvstein, Simon J. Evered, Alexandra A. Geim, Sophie H. Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, Marcin Kalinowski, Dominik Hangleiter, J. Pablo Bonilla Ataides, Nishad Maskara, Iris Cong, Xun Gao, Pedro Sales Rodriguez, Thomas Karolyshyn, Giulia Semeghini, Michael J. Gullans, Markus Greiner, Vladan Vuleti´c & Mikhail D. Lukin (2...

    work page doi:10.1038/s41586-023-06927-3 2023

  6. [6]

    Efficient synthesis of probabilistic quantum circuits with fallback

    Alex Bocharov, Martin Roetteler & Krysta M. Svore (2015): Efficient synthesis of probabilistic quantum circuits with fallback. Physical Review A 91(5), p. 052317, doi:10.1103/PhysRevA.91.052317. Available at http://arxiv.org/abs/1409.3552. ArXiv:1409.3552 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.91.052317 2015

  7. [7]

    Efficient synthesis of universal Repeat-Until-Success circuits

    Alex Bocharov, Martin Roetteler & Krysta M. Svore (2015): Efficient synthesis of universal Repeat- Until-Success circuits. Physical Review Letters 114(8), p. 080502, doi:10.1103/PhysRevLett.114.080502. Available at http://arxiv.org/abs/1404.5320. ArXiv:1404.5320 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physrevlett.114.080502 2015

  8. [8]

    Bullock & Igor L

    Stephen S. Bullock & Igor L. Markov (2004): Asymptotically optimal circuits for arbitrary n-qubit diagonal comutations. Quantum Info. Comput. 4(1), p. 27–47

    work page 2004

  9. [9]

    Physical Review A 95(4), doi:10.1103/physreva.95.042306

    Earl Campbell (2017): Shorter gate sequences for quantum computing by mixing unitaries. Physical Review A 95(4), doi:10.1103/physreva.95.042306

    work page doi:10.1103/physreva.95.042306 2017

  10. [10]

    Quantum Science and Technology 9(4), p

    Qiuhao Chen, Yuxuan Du, Yuliang Jiao, Xiliang Lu, Xingyao Wu & Qi Zhao (2024): Efficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning . Quantum Science and Technology 9(4), p. 045002, doi:10.1088/2058-9565/ad420a. Available at https://dx.doi.org/10. 1088/2058-9565/ad420a

    work page doi:10.1088/2058-9565/ad420a 2024

  11. [11]

    Classical optimizers for noisy intermediate-scale quantum devices

    Marc G. Davis, Ethan Smith, Ana Tudor, Koushik Sen, Irfan Siddiqi & Costin Iancu (2020): Towards Optimal Topology Aware Quantum Circuit Synthesis. In: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) , pp. 223–234, doi:10.1109/QCE49297.2020.00036

    work page doi:10.1109/qce49297.2020.00036 2020

  12. [12]

    De V os & S

    A. De V os & S. De Baerdemacker (2016):Block-ZXZ synthesis of an arbitrary quantum circuit. Phys. Rev. A 94, p. 052317, doi:10.1103/PhysRevA.94.052317. Available at https://link.aps.org/doi/10.1103/ PhysRevA.94.052317

    work page doi:10.1103/physreva.94.052317 2016

  13. [13]

    Physical Review Letters 102(11), doi:10.1103/physrevlett.102.110502

    Bryan Eastin & Emanuel Knill (2009): Restrictions on Transversal Encoded Quantum Gate Sets . Physical Review Letters 102(11), doi:10.1103/physrevlett.102.110502

    work page doi:10.1103/physrevlett.102.110502 2009

  14. [14]

    A Quantum Approximate Optimization Algorithm

    Edward Farhi, Jeffrey Goldstone & Sam Gutmann (2014): A Quantum Approximate Optimization Algorithm. arXiv:1411.4028

    work page internal anchor Pith review Pith/arXiv arXiv 2014

  15. [15]

    Fowler, Matteo Mariantoni, John M

    Austin G. Fowler, Matteo Mariantoni, John M. Martinis & Andrew N. Cleland (2012): Surface codes: Towards practical large-scale quantum computation . Physical Review A 86(3), doi:10.1103/physreva.86.032324

    work page doi:10.1103/physreva.86.032324 2012

  16. [16]

    npj Quantum Information 8(1), pp

    Vlad Gheorghiu, Michele Mosca & Priyanka Mukhopadhyay (2022): T-count and T-depth of any multi- qubit unitary . npj Quantum Information 8(1), pp. 1–10, doi:10.1038/s41534-022-00651-y. Available at https://www.nature.com/articles/s41534-022-00651-y

    work page doi:10.1038/s41534-022-00651-y 2022

  17. [17]

    Brett Giles & Peter Selinger (2013): Exact synthesis of multiqubit Clifford+T circuits . Phys. Rev. A 87, p. 032332, doi:10.1103/PhysRevA.87.032332. Available at https://link.aps.org/doi/10.1103/ PhysRevA.87.032332

    work page doi:10.1103/physreva.87.032332 2013

  18. [18]

    An algorithm for the T-count

    David Gosset, Vadym Kliuchnikov, Michele Mosca & Vincent Russo (2013): An algorithm for the T-count, doi:10.48550/arXiv.1308.4134. Available at http://arxiv.org/abs/1308.4134. ArXiv:1308.4134 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1308.4134 2013

  19. [19]

    arXiv:2411.04790

    David Gosset, Robin Kothari & Kewen Wu (2024): Quantum state preparation with optimal T-count . arXiv:2411.04790. M. Weiden, et al. 229

    work page arXiv 2024

  20. [20]

    Green, Peter LeFanu Lumsdaine, Neil J

    Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger & Beno ˆıt Valiron (2013): Quipper: a scalable quantum programming language . ACM SIGPLAN Notices 48(6), p. 333–342, doi:10.1145/2499370.2462177

    work page doi:10.1145/2499370.2462177 2013

  21. [21]

    Electronic Proceedings in Theoretical Computer Science 318, p

    Aleks Kissinger & John van de Wetering (2020): PyZX: Large Scale Automated Diagrammatic Reasoning. Electronic Proceedings in Theoretical Computer Science 318, p. 229–241, doi:10.4204/eptcs.318.14

    work page doi:10.4204/eptcs.318.14 2020

  22. [22]

    A. Yu. Kitaev (1995): Quantum measurements and the Abelian Stabilizer Problem. arXiv:quant-ph/9511026

    work page internal anchor Pith review Pith/arXiv arXiv 1995

  23. [23]

    Quantum computations: algorithms and error cor- rection

    A Yu Kitaev (1997): Quantum computations: algorithms and error correction . Russian Mathematical Surveys 52(6), p. 1191, doi:10.1070/RM1997v052n06ABEH002155

    work page doi:10.1070/rm1997v052n06abeh002155 1997

  24. [24]

    Quantum Info

    Vadym Kliuchnikov, Dmitri Maslov & Michele Mosca (2013): Fast and efficient exact synthesis of single- qubit unitaries generated by clifford and T gates. Quantum Info. Comput. 13(7–8), p. 607–630

    work page 2013

  25. [25]

    Fault-Tolerant Postselected Quantum Computation: Schemes

    E. Knill (2004): Fault-Tolerant Postselected Quantum Computation: Schemes. arXiv:quant-ph/0402171

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  26. [26]

    Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic

    Andrew J. Landahl & Chris Cesare (2013): Complex instruction set computing architecture for performing accurate quantum Z rotations with less magic, doi:10.48550/arXiv.1302.3240. Available athttp://arxiv. org/abs/1302.3240. ArXiv:1302.3240 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1302.3240 2013

  27. [27]

    Gushu Li, Anbang Wu, Yunong Shi, Ali Javadi-Abhari, Yufei Ding & Yuan Xie (2022): Paulihedral: a generalized block-wise compiler optimization framework for Quantum simulation kernels . In: Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS ’22, Association for Computing Mac...

    work page doi:10.1145/3503222.3507715 2022

  28. [28]

    Lorenzo Moro, Matteo G. A. Paris, Marcello Restelli & Enrico Prati (2021): Quantum compiling by deep reinforcement learning. Communications Physics 4(1), p. 178, doi:10.1038/s42005-021-00684-3

    work page doi:10.1038/s42005-021-00684-3 2021

  29. [29]

    Nielsen & Isaac L

    Michael A. Nielsen & Isaac L. Chuang (2011): Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press

    work page 2011

  30. [30]

    Campbell

    Joe O’Gorman & Earl T. Campbell (2017): Quantum computation with realistic magic-state factories . Physical Review A 95(3), doi:10.1103/physreva.95.032338

    work page doi:10.1103/physreva.95.032338 2017

  31. [31]

    Anouk Paradis, Jasper Dekoninck, Benjamin Bichsel & Martin Vechev (2024): Synthetiq: Fast and Versatile Quantum Circuit Synthesis. Proc. ACM Program. Lang. 8(OOPSLA1), doi:10.1145/3649813

    work page doi:10.1145/3649813 2024

  32. [32]

    Nature Communications , author =

    Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Al ´an Aspuru-Guzik & Jeremy L. O’Brien (2014): A variational eigenvalue solver on a photonic quantum processor. Nature Communications 5(1), doi:10.1038/ncomms5213

    work page doi:10.1038/ncomms5213 2014

  33. [33]

    Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware,

    John Preskill (2018): Quantum Computing in the NISQ era and beyond. Quantum 2, p. 79, doi:10.22331/q- 2018-08-06-79

    work page doi:10.22331/q- 2018

  34. [34]

    Quantum, doi:10.22331/q-2023-07-20-1062

    Nils Quetschlich, Lukas Burgholzer & Robert Wille (2023): MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing . Quantum, doi:10.22331/q-2023-07-20-1062. arXiv:2204.13719. MQT Bench is available at https://www.cda.cit.tum.de/mqtbench/

    work page doi:10.22331/q-2023-07-20-1062 2023

  35. [35]

    Dubey, Christian Ufrecht, Maniraman Periyasamy, Axel Plinge, Christopher Mutschler & Daniel D

    Sebastian Rietsch, Abhishek Y . Dubey, Christian Ufrecht, Maniraman Periyasamy, Axel Plinge, Christopher Mutschler & Daniel D. Scherer (2024): Unitary Synthesis of Clifford+T Circuits with Reinforcement Learning. In: 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) , 01, pp. 824–835, doi:10.1109/QCE60285.2024.00102

    work page doi:10.1109/qce60285.2024.00102 2024

  36. [36]

    Ross & Peter Selinger (2016): Optimal ancilla-free Clifford+T approximation of z-rotations

    Neil J. Ross & Peter Selinger (2016): Optimal ancilla-free Clifford+T approximation of z-rotations. Quantum Info. Comput. 16(11–12), p. 901–953

    work page 2016

  37. [37]

    Synthesis of quantum-logic circuits

    Vivek V Shende, Stephen S Bullock & Igor L Markov (2006): Synthesis of quantum-logic circuits . IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25(6), pp. 1000–1010, doi:10.1109/TCAD.2005.855930

    work page doi:10.1109/tcad.2005.855930 2006

  38. [38]

    Shor (1995): Scheme for reducing decoherence in quantum computer memory

    Peter W. Shor (1995): Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A 52, pp. R2493–R2496, doi:10.1103/PhysRevA.52.R2493. Available at https://link.aps.org/doi/10.1103/ PhysRevA.52.R2493. 230 High Precision Synthesis by Diagonalization

    work page doi:10.1103/physreva.52.r2493 1995

  39. [39]

    Shor (1997): Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

    Peter W. Shor (1997): Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing 26(5), p. 1484–1509, doi:10.1137/s0097539795293172

    work page doi:10.1137/s0097539795293172 1997

  40. [40]

    M. P. da Silva, C. Ryan-Anderson, J. M. Bello-Rivas, A. Chernoguzov, J. M. Dreiling, C. Foltz, F. Frachon, J. P. Gaebler, T. M. Gatterman, L. Grans-Samuelsson, D. Hayes, N. Hewitt, J. Johansen, D. Lucchetti, M. Mills, S. A. Moses, B. Neyenhuis, A. Paz, J. Pino, P. Siegfried, J. Strabley, A. Sundaram, D. Tom, S. J. Wernli, M. Zanner, R. P. Stutz & K. M. Sv...

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  41. [41]

    t|ket>: a retargetable compiler for NISQ devices

    Seyon Sivarajah, Silas Dilkes, Alexander Cowtan, Will Simmons, Alec Edgington & Ross Duncan (2020): t—ket 〉: a retargetable compiler for NISQ devices . Quantum Science and Technology 6(1), p. 014003, doi:10.1088/2058-9565/ab8e92

    work page doi:10.1088/2058-9565/ab8e92 2020

  42. [42]

    ACM Transactions on Quantum Computing 4(1), doi:10.1145/3548693

    Ethan Smith, Marc Grau Davis, Jeffrey Larson, Ed Younis, Lindsay Bassman Oftelie, Wim Lavrijsen & Costin Iancu (2023): LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach. ACM Transactions on Quantum Computing 4(1), doi:10.1145/3548693

    work page doi:10.1145/3548693 2023

  43. [43]

    The Paradox of Nontransitive Dice

    Bo-Ying Wang & Fuzhen Zhang (1994): A Trace Inequality for Unitary Matrices . The American Mathematical Monthly 101(5), pp. 453–455, doi:10.1080/00029890.1994.11996973. Available at http: //www.jstor.org/stable/2974909

    work page doi:10.1080/00029890.1994.11996973 1994

  44. [44]

    arXiv:2310.05958

    John van de Wetering & Matt Amy (2024):Optimising quantum circuits is generally hard. arXiv:2310.05958

    work page arXiv 2024

  45. [45]

    Chong & Costin Iancu (2021): Reoptimization of Quantum Circuits via Hierarchical Synthesis

    Xin-Chuan Wu, Marc Grau Davis, Frederic T. Chong & Costin Iancu (2021): Reoptimization of Quantum Circuits via Hierarchical Synthesis. In: 2021 International Conference on Rebooting Computing (ICRC) , pp. 35–46, doi:10.1109/ICRC53822.2021.00016

    work page doi:10.1109/icrc53822.2021.00016 2021

  46. [46]

    Quisp: a quantum internet simulation package,

    Ed Younis & Costin Iancu (2022): Quantum Circuit Optimization and Transpilation via Parameterized Circuit Instantiation. In: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 465–475, doi:10.1109/QCE53715.2022.00068

    work page doi:10.1109/qce53715.2022.00068 2022

  47. [47]

    Physical Review Letters 125(17), doi:10.1103/physrevlett.125.170501

    Yuan-Hang Zhang, Pei-Lin Zheng, Yi Zhang & Dong-Ling Deng (2020): Topological Quantum Compiling with Reinforcement Learning. Physical Review Letters 125(17), doi:10.1103/physrevlett.125.170501

    work page doi:10.1103/physrevlett.125.170501 2020