Pith. sign in

REVIEW 4 minor 41 references

Multi-controlled qudit gates can be built with O(n²) CINC gates, and special unitaries with O(n), beating the prior O(n^{2+log₂} d) bound.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-10 11:26 UTC pith:HNNZZP26

load-bearing objection Solid constructive advance: O(n^{2}) CINC for multi-controlled qudit unitaries and O(n) for special unitaries, with usable isometry/channel compilers and a clean lower bound.

arxiv 2607.08200 v1 pith:HNNZZP26 submitted 2026-07-09 quant-ph

Efficient High-Dimensional Quantum Circuit Synthesis: From Multi-Controlled Gates to Isometries and Quantum Channels

Gui-Long Jiang This is my paper
classification quant-ph
keywords qudit circuit synthesismulti-controlled gatesCINCSUM gatesisometriesquantum channelsgate complexityspecial unitaries
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

This paper shows how to synthesize multi-controlled single-qudit gates with far fewer elementary two-qudit gates than previous constructions allowed. For any (n−1)-controlled unitary on n qudits the controlled-increment (CINC) count drops to O(n²); when the target is special unitary the count falls further to O(n). The same toolkit yields explicit circuits for isometries and quantum channels from n to m qudits, and, when the local dimension d is prime, every CINC-based circuit can be rewritten with SUM gates at the same asymptotic cost. A matching-style lower bound of roughly half the free parameters of U(d^{n}) is also proved for any universal circuit built from SUM or CINC gates. The practical payoff is smaller circuit size for high-dimensional quantum algorithms and hardware, together with the first SUM-only route for prime d.

Core claim

Any (n−1)-controlled single-qudit unitary can be synthesized with at most O(n²) CINC gates (explicit closed-form N_U(d,n)), and any (n−1)-controlled special unitary with O(n) CINC gates (N_SU(d,n) linear in n). The improvement over the previous O(n^{2+log_{2} d}) CINC bound is obtained by a recursive decomposition that reduces the multi-controlled case to multi-controlled pseudo-increment gates whose CINC cost scales linearly.

What carries the argument

The multi-controlled pseudo-increment gate ĘX_d (det = 1) together with the linear-cost circuit of Lemma IV.3 that realises an m-controlled ĘX_d (m ≤ ⌈n/2⌉) up to cancelling multi-controlled phase factors P_d; recursive application of the two-controlled special-unitary identity (Fig. 6) then yields the O(n) and O(n^{2}) bounds.

Load-bearing premise

The linear special-unitary count rests on the claim that the multi-controlled phase factors introduced by the pseudo-increment circuit cancel in pairs inside the recursive decomposition; if that cancellation fails for some control patterns or dimensions, the O(n) bound collapses.

What would settle it

Explicitly expand the recursive circuit of Theorem IV.6 for a concrete small n (say n=7) and odd or even d, count the surviving multi-controlled P_d gates after all claimed cancellations, and check whether the residual operator is exactly the target special unitary.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • GCX counts for multi-controlled unitaries fall from O(n^{3}) to O(n^{2}) because each CINC expands into d−1 GCX gates.
  • Isometries and channels from n to m qudits inherit explicit CINC (or SUM) upper bounds that scale as O(d^{n+m}) (or O(d^{n+m+⌈log_d K⌉}) for channels of Choi rank K).
  • When d is prime every CINC-based construction converts into a SUM-based circuit of identical asymptotic size.
  • Any universal n-qudit circuit of SUM or CINC gates needs at least ⌈(1/(2d(d−1)))(d^{2n}−n(d^{2}−1)−1)⌉ gates, matching the known qubit lower bound when d=2.

Where Pith is reading between the lines

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

  • The same cancellation technique that yields linear special-unitary circuits may also simplify multi-controlled Clifford+T or other restricted gate sets on qudits.
  • For non-prime d the missing SUM-only single-controlled decomposition remains the main obstacle to a fully SUM-based synthesis library; closing that gap would unify the elementary-gate models.
  • Hardware platforms whose native two-qudit interaction is closer to SUM than to CINC can now import the whole family of multi-controlled, isometry and channel constructions at the same asymptotic cost once d is prime.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper gives constructive circuit decompositions for multi-controlled single-qudit gates over arbitrary d≥2. Using a two-CINC identity for single-controlled unitaries (Lemma III.1) and a multi-controlled pseudo-INC construction (Lemma IV.3), it proves that any (n-1)-controlled special unitary can be realized with O(n) CINC gates (Theorem IV.6, closed-form N_SU(d,n)) and any (n-1)-controlled unitary with O(n^{2}) CINC gates (Theorem IV.7, closed-form N_U(d,n)). These improve the prior O(n^{2+log_{2} d}) CINC and O(n^{3}) GCX bounds. When d is prime a SUM-based single-controlled decomposition (Lemma III.2) converts all CINC circuits into SUM circuits of the same asymptotic cost. The multi-controlled blocks are then used to synthesize n-to-m isometries (Theorem V.2) and quantum channels (Theorems V.5–V.6), and a standard real-parameter counting argument yields a matching-style lower bound on SUM/CINC count for universal n-qudit circuits (Theorem V.4).

Significance. The work closes a long-standing gap between qubit and qudit multi-controlled synthesis: the O(n^{2})/O(n) CINC upper bounds match the asymptotic qubit state of the art and are strictly better than the previous qudit literature. Explicit closed-form counts, the first SUM-based single-controlled construction for prime d, and the isometry/channel applications make the results immediately usable for high-dimensional circuit design. The lower bound (Appendix A) is obtained by a clean dimension-counting argument that recovers the known qubit bound when d=2, giving a solid theoretical complement to the constructive upper bounds.

minor comments (4)
  1. In the abstract and introduction the GCX reduction is stated as O(n^{2}) after noting that each CINC decomposes into d-1 GCX gates; a short parenthetical remark that the constant therefore carries a factor of (d-1) would avoid any ambiguity about the precise GCX count.
  2. Lemma IV.3 and the subsequent cancellation argument in the proof of Theorem IV.6 are correct, but a one-sentence reminder that P_d is Hermitian and diagonal (so inverse pairs cancel for every control pattern) would make the O(n) claim easier to verify on a first reading.
  3. Figure 11 compares N_SU and the recursive count only for small d; adding a short asymptotic remark or a larger-n panel would strengthen the visual claim that the linear construction dominates for large n.
  4. Typographical consistency: the arXiv identifier appears as 2607.08200 while the text uses both “qudit” and “d-level”; a uniform style check would improve polish.

Circularity Check

0 steps flagged

No significant circularity: O(n) / O(n^{2}) CINC bounds and lower bound arise from explicit constructive decompositions and independent parameter counting, not from self-definitional fits or load-bearing self-citations.

full rationale

The paper’s central claims are upper bounds obtained by writing down explicit quantum circuits (Lemmas III.1–IV.5, Theorems IV.6–IV.7) and counting the CINC (or SUM) gates that appear after cancellations that are verified on computational-basis states. The linear special-unitary count N_SU(d,n) follows from applying the multi-controlled pseudo-INC construction of Lemma IV.3 inside the recursive skeleton of Fig. 6; the multi-controlled P_d factors that remain after each application of Lemma IV.3 appear in inverse pairs and therefore cancel exactly, which is an algebraic identity rather than a fitted or self-referential assumption. The quadratic general-unitary count N_U(d,n) is simply the sum of those linear pieces plus a constant number of single-controlled gates. The lower bound of Theorem V.4 is the standard real-parameter comparison dim_R U(d^n) versus the maximum number of free parameters introducible by one SUM (or CINC) gate; it does not rely on any quantity derived earlier in the paper. Self-citations (e.g., the author’s related bipartite-optimization work) appear only as background and are not used to justify the multi-controlled asymptotics or the lower bound. Consequently the derivation chain is self-contained and non-circular.

Axiom & Free-Parameter Ledger

0 free parameters · 5 axioms · 1 invented entities

The paper is constructive circuit theory. It inherits the standard unitary/isometry/channel formalism and the usual elementary-gate cost model (two-qudit CINC or SUM costly; single-qudit free). No numerical free parameters are fitted. The only paper-specific device is the pseudo-INC gate eX_d used to remove parity dependence of det(X_d); it is a defined unitary, not a new physical entity. Background lemmas from cited works (state preparation, GCX decomposition of CINC, qubit multi-controlled tricks) are used as domain assumptions.

axioms (5)
  • domain assumption CINC (or SUM when d prime) plus arbitrary single-qudit unitaries form a universal elementary gate set for n-qudit circuits; cost is measured by two-qudit gate count.
    Stated throughout §§II–V and used for all upper and lower bounds; standard in the qudit circuit-synthesis literature the paper cites.
  • domain assumption A CINC gate decomposes into d−1 GCX gates (Di–Wei).
    Invoked to translate O(n²) CINC into O(n²) GCX; not re-proved here.
  • standard math Spectral decomposition of unitaries, QR-style Givens factorization of U(d), and Stinespring dilation of channels with Choi rank K.
    Used in Lemmas III.1, V.1, Theorems V.2/V.5 and Appendices A–B.
  • standard math Real-parameter dimension of U(d^n) is d^{2n}; smooth maps from fewer parameters cannot cover U(d^n) (Sard).
    Appendix A lower-bound argument for Theorem V.4.
  • standard math When d is prime, the cyclic shifts of a diagonal special unitary B multiply to det(B)I over a full set of nonzero residues.
    Core of Lemma III.2 SUM product identity; uses primality for the residue-class covering argument.
invented entities (1)
  • Pseudo-increment gate eX_d (X_d if d odd; e^{iπ/d} X_d if d even) no independent evidence
    purpose: Force det(eX_d)=1 so 2-controlled and multi-controlled pseudo-INC blocks use the special-unitary (fewer-CINC) synthesis independent of parity of d.
    Defined in Eq. (23) and used in Lemmas IV.1–IV.3 and Theorem IV.6; a defined unitary gadget, not a new physical degree of freedom. independent_evidence false because it is a circuit-design choice, not an external prediction.

pith-pipeline@v1.1.0-grok45 · 26920 in / 3254 out tokens · 43481 ms · 2026-07-10T11:26:13.439511+00:00 · methodology

0 comments
read the original abstract

Circuit synthesis of multi-controlled gates is crucial for qudit ($d$-level) quantum computing. This paper presents efficient synthesis schemes that reduce the elementary gate count for multi-controlled single-qudit gates. For synthesizing general $(n-1)$-controlled unitaries on $n$ qudits, we reduce the controlled-increment (CINC) and generalized controlled-$X$ (GCX) gate counts to $O(n^2)$, improving upon existing $O(n^{2+\log_2 d})$ CINC and $O(n^3)$ GCX bounds. For $(n-1)$-controlled special unitaries, this complexity is further reduced to $O(n)$. By utilizing the proposed circuit, we present qudit-based circuit constructions for isometries and quantum channels from $n$ to $m$ qudits. When specialized to general $n$-qudit unitaries, our construction requires fewer CINC gates than previous results. Moreover, for the first time, we present a circuit synthesis scheme for single-controlled gates using SUM gates and single-qudit gates when $d$ is prime. This enables all CINC-based circuits for various quantum operations to be converted into SUM-gate circuits while preserving the same asymptotic complexity. Finally, we establish a theoretical lower bound on the number of SUM and CINC gates required to synthesize general $n$-qudit unitaries.

Figures

Figures reproduced from arXiv: 2607.08200 by Gui-Long Jiang.

Figure 2
Figure 2. Figure 2: FIG. 2. (a) Relation between C [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 1
Figure 1. Figure 1: FIG. 1. (a) Circuit representation of Eq. ( [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Equivalent quantum circuit for the controlled [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Equivalent quantum circuit for the controlled [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Equivalent quantum circuit for the 2-controlled [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Equivalent quantum circuit for the ( [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. Quantum circuit symbol for the gate that applies [PITH_FULL_IMAGE:figures/full_fig_p007_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. Equivalent quantum circuit for C [PITH_FULL_IMAGE:figures/full_fig_p008_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: FIG. 9. Illustration of gate cancellation, where [PITH_FULL_IMAGE:figures/full_fig_p008_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: FIG. 10. Equivalent 3-qutrit circuit based on Lemma 1 of [PITH_FULL_IMAGE:figures/full_fig_p008_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: FIG. 11. Comparison of the upper bounds on the number [PITH_FULL_IMAGE:figures/full_fig_p008_11.png] view at source ↗
Figure 13
Figure 13. Figure 13: FIG. 13. Quantum circuit model for an isometry. We use [PITH_FULL_IMAGE:figures/full_fig_p010_13.png] view at source ↗
Figure 12
Figure 12. Figure 12: FIG. 12. Equivalent quantum circuit for C [PITH_FULL_IMAGE:figures/full_fig_p010_12.png] view at source ↗
Figure 14
Figure 14. Figure 14: FIG. 14. (a) Quantum circuit for the isometry [PITH_FULL_IMAGE:figures/full_fig_p015_14.png] view at source ↗

discussion (0)

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

Reference graph

Works this paper leans on

41 extracted references · 41 canonical work pages · 4 internal anchors

  1. [1]

    has received less attention. Several generalizations of the CNOT gate to the qudit case have been pro- posed, including SUM gates [24] (also known as general- ized XOR gates [25]), controlled-increment (CINC) gates [26], and generalized controlled-X(GCX) gates [27]. In 2006, Brennenet al.[28] generalized the method in Ref. [3] to qudits and proposed a qua...

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  2. [2]

    (21) Substituting Eqs

    = C3 2,3(B0) † = C3 2,3(Xd)·I d2 ⊗B·C 3 2,3(X † d)·I d2 ⊗B †. (21) Substituting Eqs. (20) and (21) into the middle circuit in Fig. 5, and using the relation C3 2,3(X † d)·C 3 1,3(Xd)·C 3 2,3(Xd) = C3 1,3(Xd),(22) yields the right circuit in Fig. 5 that exactly simulates C3 (1,2),3(U). Finally, from Lemma III.1, the gate C 3 1,2(C) in Fig. 5 can be omitted...

    work page

  3. [3]

    Let eTij = Tij 0 0I dl+m−1−dn ! ,(B6) so that eR=   eT11 eT12 · · · eT1d eT21 eT22 · · · eT2d ... ... ... ... eTd1 eTd2 · · · eTdd   ∈U(H ⊗(l+m) d ).(B7) Let eV=Q eR. It is evident that V|ψ⟩= eV(|0⟩ ⊗(l+m−n) ⊗ |ψ⟩),(B8) for every|ψ⟩ ∈ S(H ⊗n d ). Thus, a quantum circuit for Vcan be obtained by constructing a circuit for eVand preparing the fir...

    work page

  4. [4]

    M. A. Nielsen and I. L. Chuang,Quantum Computation and Quantum Information(Cambridge University Press, Cambridge, 2000)

    work page 2000

  5. [5]

    C. M. Dawson and M. A. Nielsen, The Solovay-Kitaev algorithm, Quantum Inf. Comput.5, 328 (2005)

    work page 2005

  6. [6]

    Barenco, C

    A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Elementary gates for quantum computation, Phys. Rev. A52, 3457 (1995)

    work page 1995

  7. [7]

    J. L. Brylinski and R. Brylinski, Universal Quantum Gates, arXiv:quant-ph/0108062 (2001)

    work page internal anchor Pith review Pith/arXiv arXiv 2001

  8. [8]

    Khaneja and S

    N. Khaneja and S. Glaser, Cartan decomposition of SU(2n) and control of spin systems, Chem. Phys.267, 11 (2001)

    work page 2001

  9. [9]

    J. J. Vartiainen, M. M¨ ott¨ onen, and M. M. Salomaa, Effi- cient Decomposition of Quantum Gates, Phys. Rev. Lett. 92, 177902 (2004)

    work page 2004

  10. [10]

    M¨ ott¨ onen, J

    M. M¨ ott¨ onen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, Quantum Circuits for General Multiqubit Gates, Phys. Rev. Lett.93, 130502 (2004)

    work page 2004

  11. [11]

    V. V. Shende, S. S. Bullock, and I. L. Markov, Synthesis of quantum-logic circuits, IEEE Trans. Comput. Aided Design Integr. Circuits Syst.25, 1000 (2006)

    work page 2006

  12. [12]

    M. B. Mansky, S. L. Castillo, V. R. Puigvert, and C. Linnhoff-Popien, Near-optimal quantum circuit construc- tion via Cartan decomposition, Phys. Rev. A108, 052607 (2023)

    work page 2023

  13. [13]

    X. Sun, G. Tian, Saunders Yang, P. Yuan, and S. Zhang, Asymptotically Optimal Circuit Depth for Quan- tum State Preparation and General Unitary Synthesis, IEEE Trans. Comput. Aided Design Integr. Circuits Syst. 42, 3301 (2023)

    work page 2023

  14. [14]

    A. M. Krol and Z. Al-Ars, Beyond quantum Shannon de- composition: Circuit construction forn-qubit gates based on block-ZXZdecomposition, Phys. Rev. Applied22, 034019 (2024)

    work page 2024

  15. [15]

    Chen and L

    L. Chen and L. Yu, Decomposition of bipartite and mul- tipartite unitary gates into the product of controlled uni- tary gates, Phys. Rev. A91, 032308 (2015)

    work page 2015

  16. [16]

    S. S. Bullock, D. P. O’Leary, and G. K. Brennen, Asymp- totically Optimal Quantum Circuits ford-Level Systems, Phys. Rev. Lett.94, 230502 (2005)

    work page 2005

  17. [17]

    W. D. Li, Y. J. Gu, K. Liu, Y. H. Lee, and Y. Z. Zhang, Efficient universal quantum computation with auxiliary Hilbert space, Phys. Rev. A88, 034303 (2013)

    work page 2013

  18. [18]

    J. M. Martyn, Z. M. Rossi, A. K. Tan, and I. L. Chuang, Grand unification of quantum algorithms, PRX Quan- tum2, 040203 (2021)

    work page 2021

  19. [19]

    Bocharov, M

    A. Bocharov, M. Roetteler, and K. M. Svore, Factor- ing with qutrits: Shor’s algorithm on ternary and meta- plectic quantum architectures, Phys. Rev. A96, 012306 (2017)

    work page 2017

  20. [20]

    A. Saha, R. Majumdar, D. Saha, A. Chakrabarti, and S. Sur-Kolay, Asymptotically improved circuit for ad-ary Grover’s algorithm with advanced decomposition of the n-qudit Toffoli gate, Phys. Rev. A105, 062453 (2022)

    work page 2022

  21. [21]

    R. Iten, R. Colbeck, I. Kukuljan, J. Home, and M. Chris- tandl, Quantum circuits for isometries, Phys. Rev. A93, 032318 (2016)

    work page 2016

  22. [22]

    R. Vale, T. M. D. Azevedo, I. C. S. Ara´ ujo, I. F. Araujo, and A. J. de Silva, Circuit Decomposition of Multicon- trolled Special Unitary Single-Qubit Gates, IEEE Trans. Comput. Aided Design Integr. Circuits Syst.43, 802 (2024)

    work page 2024

  23. [23]

    J. D. S. Silva, T. M. D. Azevedo, I. F. Araujo, and A. J. de Silva, Linear Decomposition of Approximate Mul- ticontrolled Single Qubit Gates, IEEE Trans. Comput. Aided Design Integr. Circuits Syst.44, 1304 (2025)

    work page 2025

  24. [24]

    Saeedi and M

    M. Saeedi and M. Pedram, Linear-depth quantum cir- cuits forn-qubit Toffoli gates with no ancilla, Phys. Rev. A87, 062318 (2013)

    work page 2013

  25. [25]

    A. J. de Silva and D. K. Park, Linear-depth quantum cir- cuits for multiqubit controlled gates, Phys. Rev. A106, 042602 (2022)

    work page 2022

  26. [26]

    Claudon, J

    B. Claudon, J. Zylberman, C. Feniou, F. Debbasch, A. Peruzzo, and J. P. Piquemal, Polylogarithmic-depth controlled-NOT gates without ancilla qubits, Nat. Com- mun.15, 5886 (2024)

    work page 2024

  27. [27]

    Gottesman, A

    D. Gottesman, A. Kitaev, and J. Preskill, Encoding a qubit in an oscillator, Phys. Rev. A64, 012310 (2001)

    work page 2001

  28. [28]

    Generalized quantum XOR-gate for quantum teleportation and state purification in arbitrary dimensional Hilbert spaces

    G. Alber, A. Delgado, N. Gisin, and I. Jex, General- ized quantum XOR-gate for quantum teleportation and state purification in arbitrary dimensional Hilbert spaces, arXiv:quant-ph/0008022 (2000). 15 (a) (b) FIG. 14. (a) Quantum circuit for the isometryV∈U(H ⊗n d ,H ⊗(l+m) d ) withn < m. The unfilled square on the wire denotes that the gate is controlled b...

    work page internal anchor Pith review Pith/arXiv arXiv 2000

  29. [29]

    G. K. Brennen, D. P. O’Leary, and S. S. Bullock, Criteria for exact qudit universality, Phys. Rev. A71, 052318 (2005)

    work page 2005

  30. [30]

    Y. M. Di and H. R. Wei, Synthesis of multivalued quan- tum logic circuits by elementary gates, Phys. Rev. A87, 012325 (2013)

    work page 2013

  31. [31]

    G. K. Brennen, S. S. Bullock, and D. P. O’Leary, Effi- cient circuits for exact-universal computations with qu- dits, Quantum Inf. Comput.6, 436 (2006)

    work page 2006

  32. [32]

    W. Zi, Q. Li, and X. Sun, Optimal Synthesis of Multi- Controlled Qudit Gates, in 2023 60th ACM/IEEE Design Automation Conference (DAC) (2023), pp. 1–6

    work page 2023

  33. [33]

    R. Iten, R. Colbeck, I. Kukuljan, and M. Christandl, Quantum circuits for quantum channels, Phys. Rev. A 95, 052316 (2017)

    work page 2017

  34. [34]

    V. V. Shende, I. L. Markov, and S. S. Bullock, Minimal universal two-qubit controlled-NOT-based circuits, Phys. Rev. A69, 062321 (2004)

    work page 2004

  35. [35]

    Gottesman, Fault-tolerant quantum computation with higher-dimensional systems, Chaos Solitons Frac- tals10, 1711 (1999)

    D. Gottesman, Fault-tolerant quantum computation with higher-dimensional systems, Chaos Solitons Frac- tals10, 1711 (1999)

    work page 1999

  36. [36]

    G. L. Jiang and H. R. Wei, Quantum circuit optimization for arbitrary high-dimensional bipartite quantum compu- tation, New J. Phys.28, 044502 (2026)

    work page 2026

  37. [37]

    Yeh and J

    L. Yeh and J. van de Wetering, Constructing all qutrit controlled clifford+t gates in clifford+t, in Reversible Computation - 14th International Conference (2022), pp. 28–50

    work page 2022

  38. [38]

    Approximation by Quantum Circuits

    E. Knill, Approximation by Quantum Circuits, arXiv:quant-ph/9508006 (1995)

    work page internal anchor Pith review Pith/arXiv arXiv 1995

  39. [39]

    M. Reck, A. Zeilinger, H. J. Bernstein, and P. Bertani, Experimental realization of any discrete unitary opera- tor, Phys. Rev. Lett.73, 58 (1994)

    work page 1994

  40. [40]

    W. R. Clements, P. C. Humphreys, B. J. Metcalf, W. S. Kolthammer, and I. A. Walmsley, Optimal design for uni- versal multiport interferometers, Optica3, 1460 (2016)

    work page 2016

  41. [41]

    J. M. Lee,Introduction to Smooth Manifolds, 2nd ed. (Springer, New York, 2013)

    work page 2013