Pith. sign in

REVIEW 3 major objections 6 minor 49 references

Second-order boundary value problems become quantum circuits when discrete differential operators are written as local star updates instead of assembled matrices.

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-14 05:46 UTC pith:4OI5AVGT

load-bearing objection Solid DEC-to-circuit packaging for regular meshes; the reusable architecture is real but the demos and unstructured-mesh claims are thinner than the abstract suggests. the 3 major comments →

arxiv 2607.11410 v1 pith:4OI5AVGT submitted 2026-07-13 quant-ph

Quantum algorithms for second-order boundary value problems

Lauri Kettunen , Tejas Shinde This is my paper
classification quant-ph
keywords quantum algorithmsquantum circuitsquantum PDEsstar-oraclesLaplace–de Rham operatorexterior calculuscell complexesboundary value problems
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 claims that matrix-based discretizations hide the local geometric structure that quantum circuits can exploit. Starting from the exterior derivative, its adjoint, and the Hodge operator on primal–dual cell complexes, the authors build finite-dimensional second-order operators as star-local relaxation updates: each unknown is updated using only the bounding-chain data of its cell star. Those updates compile into a single reusable circuit architecture—star-oracles that generate incidence from cell indices, block encoding of scalar weights, and interference for local sums—demonstrated for both div–grad and curl–curl. A sympathetic reader cares because the approach supplies a systematic geometric route from continuous PDEs to quantum algorithms, rather than treating a sparse matrix as the primary object.

Core claim

Finite-dimensional counterparts of continuous second-order operators built from the exterior derivative, its adjoint, and Hodge-type maps act as star-local updates whose support is the star of the cell carrying the degree of freedom. These updates compile, via explicit star-oracles rather than stored incidence matrices, into simple uniform quantum circuits that implement one relaxation step; the same architecture covers div–grad and curl–curl on regularly indexed complexes and thereby gives a systematic route from continuous boundary value problems to quantum circuits.

What carries the argument

The star-local update rule (equation 12) together with the star-oracle S that maps a cell index to the signed bounding-chain Star₁ of its star. The star replaces the virtual neighbourhood of continuous differentiation; the oracle generates that data on the fly so the circuit never accesses a globally assembled matrix DᵀHD.

Load-bearing premise

The simple closed-form star-oracles and uniform scalable circuits require regularly indexed meshes with cyclic coordinate symmetry and padded dummy indices; without that regularity the local operator still exists but needs stored incidence data.

What would settle it

Run the claimed one-step curl–curl or div–grad circuit in state-vector simulation on a regularly indexed complex, read the designated output subspace after applying known normalization and interference factors, and check whether the resulting cochain matches the classical star-local update (equation 12) entrywise to numerical precision; a systematic mismatch falsifies the compilation claim.

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

If this is right

  • One circuit architecture implements a relaxation step for both div–grad and curl–curl by changing only the star-oracle and cochain degree.
  • Index-register cost grows only logarithmically with the number of indexed degrees of freedom on regularly padded complexes.
  • Any second-order operator that can be written as a star-local update from exterior calculus can reuse the same oracle–block-encoding–interference template.
  • Combinatorial incidence data and metric/material Hodge weights stay separate, so material variation enters only through block-encoded coefficients.
  • The same geometric viewpoint points toward quantum algorithms for covariant exterior derivatives and continuum-mechanics problems.

Where Pith is reading between the lines

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

  • If closed-form oracles can be built for a wider family of structured meshes, many multiphysics solvers could avoid matrix assembly while keeping the same circuit skeleton.
  • The encode–evolve–measure–reinitialise loop is likely to dominate cost before oracle depth does, so practical impact hinges on state preparation and sign-safe readout as much as on star design.
  • Separating fixed combinatorial stars from variable Hodge weights suggests hybrid schemes that deform geometry classically while reusing one quantum oracle.
  • Classical lattice methods already use similar local updates; the exterior-calculus framing may unify those methods with quantum PDE algorithms more tightly than matrix-based linear-system approaches.

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

3 major / 6 minor

Summary. The paper proposes a structure-first route from continuous second-order boundary-value problems to quantum circuits. Starting from Stokes duality, the exterior derivative, its adjoint, and Hodge-type constitutive maps on primal–dual cell complexes, it derives finite-dimensional second-order operators and rewrites them as star-local relaxation updates (Eqs. 8–12) rather than as assembled matrices DᵀHD. These updates are compiled into a reusable circuit architecture—star-oracle, block encoding of weights, and interference-based summation—illustrated for div–grad on regular triangular complexes and curl–curl on regular hexahedral complexes (Figs. 6–7, Eqs. 14, 16, 18, 32). The outer solver is an encode–evolve–measure–reinitialise loop with classical enforcement of boundary conditions and constraints. The authors present qualitative field plots (Figs. 10–11) and argue that the same star-local compilation principle yields a systematic framework for quantum algorithms for PDEs.

Significance. If the compilation is verified and the scope is stated carefully, the work is a genuine contribution to quantum scientific computing: it organizes circuit locality around the geometric support of discrete exterior-calculus operators rather than around a generic sparse-matrix oracle. The separation of combinatorial star data from metric/Hodge weights, the explicit closed-form oracles for regularly indexed complexes (Appendix A), and the common architecture for node-based and edge-based unknowns are concrete strengths. The approach is complementary to HHL-style and Hamiltonian-simulation PDE methods and to quantum lattice-Boltzmann schemes. It does not claim quantum advantage; its value is architectural and structural. Credit is due for the detailed indexing conventions, boundary-aware star formulas, and the honest discussion of regular-indexing and readout limitations in §4.5 and Appendices B–C.

major comments (3)
  1. [§3.4–3.7, Figs. 6–7, 10–11; Appendix B.1] The load-bearing claim that the circuits implement the star-local update (Eq. 12 / 14 / 16) is not numerically verified. Figs. 10–11 show qualitative field structure after the full encode–evolve–measure–reinitialise loop, but there is no side-by-side check that the designated output subspace of one circuit execution equals the classical star-local update up to the tracked normalization, block-encoding, and Hadamard prefactors (Appendix B.1). Without that equality test—even on a small regularly indexed patch—the compilation remains an architectural sketch rather than a verified implementation of the finite-dimensional operator.
  2. [Abstract; §1; §3.1–3.2; §4.5; Appendix A] The abstract and introduction present “simple, uniform, and scalable” circuits and a principle that “extends across different operators, cell complexes, and manifold dimensions,” yet the closed-form star-oracles and uniform register design require regularly indexed complexes with cyclic coordinate symmetry and padded dummy indices (§3.1–3.2, Appendix A). On unstructured meshes the star-local operator still exists, but the oracle needs stored incidence data (§4.5). The limitation is acknowledged late; the abstract and framing claims should be scoped to regularly indexed complexes, or the paper should supply a concrete oracle construction (or complexity statement) for unstructured incidence data.
  3. [§3.8; §4.5–4.6; Appendix B.5, B.8] Each relaxation step is embedded in a classical encode–evolve–measure–reinitialise loop (§3.8, Appendix B.5). State preparation and readout are left unoptimized and are identified as dominant costs (Appendix B.8), yet the broader claim of a “systematic route to quantum algorithms for PDEs” is not accompanied by even a schematic resource accounting for T iterations (preparation + circuit depth + measurement per step). A short complexity sketch—gate cost of the star-oracle and block-encoding stages versus preparation/readout, and how T scales with mesh size for Jacobi-type relaxation—would make the algorithmic claim proportionate to what is actually constructed.
minor comments (6)
  1. [Fig. 6; §3.7] Figure 6 is dense and stacked; a single end-to-end schematic with qubit counts and which subspace holds Λ^{s+1} would help readers verify the interference stage against Eq. (16).
  2. [§3.2, Eq. (20)] The packed iterate Λ^s = [A_x, A_y, A_z, J_z, J_y, J_x]^T and the reversed source ordering (§3.2) are bookkeeping-heavy; a short table mapping selector/label basis states to physical components would reduce ambiguity.
  3. [§2.1.1] Eq. (14) notes coincidence with classical Lattice Boltzmann; a one-sentence clarification of what is shared (local averaging stencil) versus what is new (exterior-calculus derivation and quantum compilation) would prevent over-reading that remark.
  4. [Appendix C] Appendix C on metric variation is useful but ends without a circuit-level demonstration; either mark it clearly as outlook or add a minimal coefficient-oracle sketch consistent with Fig. 6.
  5. [§3.1; Appendix D] Minor notation consistency: Star_1(e) vs Star1(e), and mixed use of φ/ϕ for the scalar potential in the div–grad sections and appendices.
  6. [§1; §4.4] References to related quantum PDE and quantum-walk literature are adequate; a brief pointer to other DEC-based classical solvers beyond the authors’ geometric electromagnetism line would situate the finite-dimensional construction more broadly.

Circularity Check

0 steps flagged

No load-bearing circularity: the star-local update and circuit architecture are constructed explicitly from exterior-calculus incidence and Hodge data, not recovered by fitting or self-definitional renaming of the target claim.

full rationale

The derivation chain is constructive and self-contained. Continuous second-order operators are introduced via Stokes duality and the pair (d, igstar) (Eqs. 1–2); finite-dimensional counterparts are obtained from incidence matrices D on primal–dual complexes and the diagonal Hodge H (Eqs. 6–9), then rewritten by isolating the self-term to produce the star-local relaxation (Eq. 12). The quantum architecture (star-oracle generating Star1(e) by closed-form index shifts, block encoding of the scalar weights, interference summation) is defined to implement precisely those local contributions (Sec. 3, Eqs. 17–18, 32). No free parameters are fitted to data and then re-presented as predictions; no uniqueness theorem is imported from prior author work to forbid alternatives; the regular-indexing restriction is acknowledged as a scope limitation (Sec. 4.5) rather than hidden. Self-citations (Bossavit–Kettunen discrete exterior calculus, related lattice-Boltzmann circuits) supply standard background tools that the paper re-derives or re-uses, but the central claim—that the same star-local compilation yields reusable circuits for div–grad and curl–curl—does not reduce by construction to those citations. Qualitative demos (Figs. 10–11) illustrate the outer encode–evolve–measure loop; they do not constitute circular “predictions.” Residual ordinary reuse of the authors’ geometric toolkit warrants at most a score of 1, not higher.

Axiom & Free-Parameter Ledger

3 free parameters · 5 axioms · 2 invented entities

The central construction rests on standard exterior calculus and discrete incidence geometry, plus modeling choices that make oracles closed-form (regular indexing, diagonal generalized finite-difference Hodge, iterative relaxation with free β). No new physical particles or forces are postulated; the main invented computational objects are the star-oracle map and the packed multi-component register layout.

free parameters (3)
  • relaxation parameter β = 0 < β < 1 (hand-chosen)
    Chosen in (0,1) to form the iterative update (Eq. 12); not derived from first principles and affects convergence of the outer loop.
  • padding size / dummy-index count to next power of two
    Physical edge counts are embedded in n=2^m address spaces for qubit indexing; padding is a circuit-design choice that changes register size and dummy handling.
  • directional constant offsets for non-negative encoding
    Appendix B chooses offsets large enough that encoded cochain values are non-negative for measurement; values depend on the iterate and are set by hand for readout convenience.
axioms (5)
  • standard math Stokes duality identifies the exterior derivative with the boundary operator on chains; discrete d is incidence D.
    Section 2, Eqs. 1–7; classical chain–cochain theory.
  • domain assumption Hodge-type constitutive law may be realized by a diagonal generalized finite-difference map between paired primal and dual cells (Eq. 6).
    One of several possible discrete Hodge realizations; chosen for brevity and used throughout the updates.
  • domain assumption For trivial topology, closed forms are exact so f=dΛ; nontrivial topology needs extra homology constraints.
    Stated in Section 2; demos assume this simplification.
  • ad hoc to paper Regularly indexed simplicial/hexahedral complexes with cyclic coordinate symmetry admit closed-form star-oracles via shifts and phases.
    Sections 3.1–3.2 and Appendix A; required for the simple scalable circuits as implemented.
  • domain assumption One quantum circuit execution implements one classical-style relaxation step inside an encode–evolve–measure–reinitialize loop with classical BC/gauge handling.
    Sections 3.8 and 4.5; defines the algorithmic model of computation used for the solver.
invented entities (2)
  • star-oracle S: e ↦ Star₁(e) no independent evidence
    purpose: Replace stored incidence-matrix rows by a coherent function that returns signed neighboring cochain indices for the local update.
    Defined in Section 3.1 and Appendix A as the central quantum-facing combinatorial primitive; computational construction rather than a new physical object.
  • packed iterate vector Λˢ = [Aₓ, Aᵧ, A_z, J_z, J_y, J_x]ᵀ with cyclic π action no independent evidence
    purpose: Exploit cyclic symmetry so one star rule transfers across edge directions and aligns source branches in the circuit.
    Section 3.2 bookkeeping invention for uniform registers; no external evidence required beyond circuit correctness.

pith-pipeline@v1.1.0-grok45 · 37253 in / 3495 out tokens · 40015 ms · 2026-07-14T05:46:06.633724+00:00 · methodology

0 comments
read the original abstract

Second-order boundary value problems are central to computational science, yet standard matrix-based numerical formulations can obscure the local geometric structure that quantum circuits may exploit. Here we introduce a framework for explicitly constructing finite-dimensional counterparts of continuous differential operators in a form compatible with quantum computation. Starting from the exterior derivative, its adjoint, and the Hodge operator, we derive discrete realizations of second-order operators on primal--dual cell complexes and reformulate them as star-local update rules expressed through explicit functions that return the relevant bounding chains rather than through matrix representations. This yields simple, uniform, and scalable quantum circuits. We demonstrate the construction for div--grad and curl--curl operators, showing that the same star-local compilation principle extends across different operators, cell complexes, and manifold dimensions within a common framework. More generally, the framework provides a systematic route to quantum algorithms for partial differential equations.

Figures

Figures reproduced from arXiv: 2607.11410 by Lauri Kettunen, Tejas Shinde.

Figure 1
Figure 1. Figure 1: Illustrations of Stokes’ theorem in different dimensions. The domain is shown in blue and [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Examples of primal–dual mesh pairs in dimension [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: A simplicial complex illustrating bounding cycles at different scales. If [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The local neighbourhood, or star, of node [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The star of edge ω 1 1 in a regular hexahedral complex, together with the dual facet ˜ω 1 2 paired with ω 1 1 . If needed, the uniqueness of a—that is, the so-called gauge condition—can be imposed with the spanning tree extraction method [33, 27]. Again, the update is supported only on the star of the edge. The role of the finite-dimensional construction is therefore to replace the virtual neighbourhoods o… view at source ↗
Figure 6
Figure 6. Figure 6: Overview of one curl–curl relaxation step. Top: state preparation, register routing and cyclic [PITH_FULL_IMAGE:figures/full_fig_p011_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Overview of the div–grad relaxation-step circuit on a regular simplicial complex. The circuit [PITH_FULL_IMAGE:figures/full_fig_p012_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Quantum circuits for R and L shift operators. Controls are as specified in fig. 6 gy P ctrls = |gy⟩n−1 Z Z ctrls [PITH_FULL_IMAGE:figures/full_fig_p012_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: P operator creating negative amplitudes for terms in eq. 18 12 [PITH_FULL_IMAGE:figures/full_fig_p012_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Div–grad demonstration. (a) Reference solution of the Laplace problem showing equipoten [PITH_FULL_IMAGE:figures/full_fig_p014_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Curl–curl demonstration solved with the star-local quantum iterative construction. (a) Mag [PITH_FULL_IMAGE:figures/full_fig_p014_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Indexing and orientation of 0-, 1-, and 2-cells in a complex of regular hexahedra whose edges [PITH_FULL_IMAGE:figures/full_fig_p018_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Decomposition of the dual contribution associated with a primal facet shared by two hexahe [PITH_FULL_IMAGE:figures/full_fig_p023_13.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

49 extracted references · 5 linked inside Pith

  1. [1]

    Ciarlet P G 1978 The Finite Element Method for Elliptic Problems (Amsterdam: North-Holland)

    1978

  2. [2]

    Yee K 1966 IEEE Transactions on Antennas and Propagation14302–307

    1966

  3. [3]

    Generalized finite differences

    Bossavit A 2001 “Generalized finite differences” in computational electromagnetics Progress in Electromagnetics Research, PIER vol 32 ed Teixeira F L (Cambridge, MA: EMW) pp 45–64

    2001

  4. [4]

    Montanaro A 2016 npj Quantum Information215023

    2016

  5. [5]

    Harrow A W, Hassidim A and Lloyd S 2009 Physical Review Letters103150502

    2009

  6. [6]

    Clader B D, Jacobs B C and Sprouse C R 2013 Physical Review Letters110250504

    2013

  7. [7]

    Childs A M, Kothari R and Somma R D 2017 SIAM Journal on Computing461920–1950

    2017

  8. [8]

    Childs A M, Liu J P and Ostrander A 2021 Quantum5574

    2021

  9. [9]

    Morales M E S, Pira L, Schleich P, Koor K, Costa P C S, An D, Aspuru-Guzik A, Lin L, Rebentrost P and Berry D W 2023 Quantum linear systems algorithms: a survey of algorithms and applications (Preprint2305.01199)

    Pith/arXiv arXiv 2023

  10. [10]

    Budinski L 2021 Quantum Information Processing2057 26

    2021

  11. [11]

    2026 Quantum algorithm for the lattice boltzmann method with applications on real quantum devices (Preprint2603.02127)

    Bastida-Zamora A, Budinski L, Kerppo O, Lahtinen V, Niemim¨ aki O, Steadman W, Zamora-Zamora R, Sagaut P, Bohun V, Koch-Janusz M et al. 2026 Quantum algorithm for the lattice boltzmann method with applications on real quantum devices (Preprint2603.02127)

    arXiv 2026

  12. [12]

    Bossavit A 1998 Journal of Japan Society of Applied Electromagnetism and Mechanics6114–123

    1998

  13. [13]

    Flanders H 1989 Differential Forms with Applications to the Physical Sciences revised edition ed (New York: Dover Publications)

    1989

  14. [14]

    Baez J C and Muniain J P 1994 Gauge Fields, Knots and Gravity (Series on Knots and Everything vol 4) (Singapore: World Scientific)

    1994

  15. [15]

    Frankel T 2012 The Geometry of Physics: An Introduction 3rd ed (Cambridge: Cambridge Univer- sity Press)

    2012

  16. [16]

    Tarhasaari T, Kettunen L and Bossavit A 1999 IEEE Transactions on Magnetics351494–1497

    1999

  17. [17]

    Bossavit A and Kettunen L 1999 International Journal of Numerical Modelling: Electronic Networks, Devices and Fields12129–142

    1999

  18. [18]

    Munkres J R 1984 Elements of Algebraic Topology (Menlo Park, CA: Addison-Wesley)

    1984

  19. [19]

    Kettunen L, Kurz S, Tarhasaari T, R¨ ais¨ anen V, Stenvall A and Suuriniemi S 2014IEEE Transactions on Magnetics501–10

  20. [20]

    Whitney H 1957 Geometric Integration Theory (Princeton, NJ: Princeton University Press)

    1957

  21. [21]

    Hodge W V D 1934 Proceedings of the London Mathematical Society36257–303

    1934

  22. [22]

    Hodge W V D 1941 The Theory and Applications of Harmonic Integrals (Cambridge: Cambridge University Press)

    1941

  23. [23]

    Weiland T 1984 Particle Accelerator15245–292

    1984

  24. [24]

    Bossavit A 1997 Computational Electromagnetism: Variational Formulations, Complementarity, Edge Elements (San Diego: Academic Press)

    1997

  25. [25]

    thesis California Institute of Technology Pasadena, CA

    Hirani A N 2003 Discrete exterior calculus Ph.D. thesis California Institute of Technology Pasadena, CA

    2003

  26. [26]

    Bossavit A 1988 IEE Proceedings A135179–187

    1988

  27. [27]

    Suuriniemi S, Tarhasaari T and Kettunen L 2002 IEEE Transactions on Magnetics38525–528

    2002

  28. [28]

    thesis Tampere University of Technology, Department of Electrical Engineering Tampere, Finland

    Suuriniemi S 2004 Homological Computations in Electromagnetic Modeling Ph.d. thesis Tampere University of Technology, Department of Electrical Engineering Tampere, Finland

    2004

  29. [29]

    Pellikka M, Suuriniemi S and Kettunen L 2010 Boundary Value Problems2010381953

    2010

  30. [30]

    Pellikka M, Suuriniemi S, Kettunen L and Geuzaine C 2013 SIAM Journal on Scientific Computing 351195–1214

    2013

  31. [31]

    Krueger T, Kusumaatmaja H, Kuzmin A, Shardt O, Silva G and Viggen E 2016 The Lattice Boltzmann Method: Principles and Practice Graduate Texts in Physics (Cham: Springer)

    2016

  32. [32]

    Mohamad A A 2019 Lattice Boltzmann Method: Fundamentals and Engineering Applications with Computer Codes (London: Springer)

    2019

  33. [33]

    Albanese R and Rubinacci G 1988 IEE Proceedings A (Physical Science, Measurement and Instrumentation)135457–463

    1988

  34. [34]

    Venegas-Andraca S E 2012 Quantum Information Processing111015–1106

    2012

  35. [35]

    Shakeel A 2020 Quantum Information Processing19

    2020

  36. [36]

    Budinski L, Niemim¨ aki O, Zamora-Zamora R and Lahtinen V 2023 Quantum Science and Technology8045031 27

    2023

  37. [37]

    Shende V V, Bullock S S and Markov I L 2006 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems251000–1010

    2006

  38. [38]

    Iten R, Colbeck R, Kukuljan I, Home J and Christandl M 2016 Physical Review A93032318

    2016

  39. [39]

    Camps D and Van Beeumen R 2022 FABLE: Fast approximate quantum circuits for block-encodings (Preprint2205.00081)

    Pith/arXiv arXiv 2022

  40. [40]

    Camps D, Lin L, Van Beeumen R and Yang C 2024 SIAM Journal on Matrix Analysis and Applications45801–827 (Preprint2203.10236)

    Pith/arXiv arXiv 2024

  41. [41]

    Poutala A, Tarhasaari T and Kettunen L 2016 International Journal for Numerical Methods in Engineering105723–746

    2016

  42. [42]

    thesis Uni- versit´ e Paris-Saclay

    de Brugi` ere T G 2020Methods for optimizing the synthesis of quantum circuits Ph.D. thesis Uni- versit´ e Paris-Saclay

  43. [43]

    Kerppo O, Steadman W, Niemim¨ aki O and Lahtinen V 2025 Minimizing entanglement entropy for enhanced quantum state preparation (Preprint2507.22562)

    Pith/arXiv arXiv 2025

  44. [44]

    Yang C, Li Z, Yao H, Fan Z, Zhang G and Liu J 2025 Quantum91805

    2025

  45. [45]

    S¨ underhauf C, Campbell E and Camps J 2024 Quantum81226

    2024

  46. [46]

    Karuppasamy K, Puram V, Johnson S and Thomas J P 2025 Quantum Reports7

    2025

  47. [47]

    Duncan R, Kissinger A, Perdrix S and van de Wetering J 2020 Quantum4279

    2020

  48. [48]

    Iten R, Moyard R, Metger T, Sutter D and Woerner S 2022 ACM Transactions on Quantum Computing3

    2022

  49. [49]

    Vale R, Azevedo T M D, Ara´ ujo I, Araujo I F and Silva A J 2023 Decomposition of multi-controlled special unitary single-qubit gates (Preprint2302.06377) 28

    Pith/arXiv arXiv 2023