pith. sign in

arxiv: 2511.11494 · v3 · submitted 2025-11-14 · 🧮 math.NA · cs.NA· quant-ph

A Quantum Spectral Method for Non-Periodic Boundary Value Problems

Eky Febrianto , Yiren Wang , Burigede Liu , Michael Ortiz , Fehmi Cirak This is my paper

Pith reviewed 2026-05-17 22:05 UTC · model grok-4.3

classification 🧮 math.NA cs.NAquant-ph
keywords quantum spectral methodnon-periodic boundary value problemsDirichlet boundary conditionsquantum Fourier transformquantum sine transformpolylogarithmic complexityfractional stochastic PDE
0
0 comments X

The pith

A quantum spectral method solves non-periodic boundary value problems with polylogarithmic complexity using Fourier and sine transforms.

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

This paper introduces a quantum algorithm for solving boundary value problems on non-periodic domains with fixed boundaries. It extends periodic Fourier spectral methods by reflecting the domain antisymmetrically to enforce Dirichlet conditions via a quantum sine transform. The solution operator in Fourier space is approximated by a polynomial that can be encoded efficiently on quantum circuits. This approach allows handling arbitrary Dirichlet boundaries by decomposing the solution into boundary and homogeneous parts. If the complexity remains polylogarithmic, it opens the door to quantum speedups for large-scale PDEs in mechanics and stochastic modeling.

Core claim

We propose a quantum spectral method with polylogarithmic complexity for solving non-periodic boundary value problems with arbitrary Dirichlet boundary conditions. The method approximates the diagonal solution operator with a polynomial in Fourier space, encodes it quantumly, uses the quantum Fourier transform for space mappings, and defines the quantum sine transform through domain reflection for zero boundaries, with decomposition for non-zero cases. Numerical evidence on a Dirichlet-Poisson problem and a fractional stochastic PDE confirms the approach.

What carries the argument

The quantum sine transform obtained by pre- and post-multiplying the quantum Fourier transform with the reflection matrix to impose zero Dirichlet boundary conditions, combined with polynomial approximation of the solution operator.

If this is right

  • The method achieves polylogarithmic computational complexity for non-periodic problems similar to periodic ones.
  • It applies to both simple Poisson equations and more complex fractional stochastic PDEs for spatial random fields.
  • The circuit implementation allows quantum encoding of the polynomial approximation while maintaining accuracy.
  • Domain reflection enables exact enforcement of Dirichlet conditions without additional overhead in the quantum setting.

Where Pith is reading between the lines

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

  • If extended, the reflection technique could adapt to Neumann or mixed boundary conditions by choosing appropriate symmetries.
  • Such methods might integrate with other quantum linear system solvers to tackle even broader classes of PDEs.
  • Testing on real quantum hardware for moderate sizes could reveal practical overheads not seen in simulations.

Load-bearing premise

A low-degree polynomial approximation to the diagonal solution operator in Fourier space can be quantum-encoded with gate cost that remains polylogarithmic while preserving the accuracy needed for the target PDE.

What would settle it

Implementing the quantum circuit for the Dirichlet-Poisson problem and measuring the number of gates required as the grid size N increases to verify scaling as O((log N)^c) rather than polynomial in N.

Figures

Figures reproduced from arXiv: 2511.11494 by Burigede Liu, Eky Febrianto, Fehmi Cirak, Michael Ortiz, Yiren Wang.

Figure 1
Figure 1. Figure 1: The extended domain ΩE = (0, 2L) and its discretisation with N = 8 cells and N = 8 grid points. The original problem domain is Ω = (0, L). A sample reflected source term fE(x) is depicted in blue, and the components of the respective force vector f are depicted as circles. The extended domain problem is 2L periodic. so that u h E (x) = 1 √ N X N−1 k=0 uˆE,ke iξk x , f h E (x) = 1 √ N X N−1 k=0 ˆfE,ke iξk x… view at source ↗
Figure 2
Figure 2. Figure 2: Quantum circuit for QFT. An input vector [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Quantum circuit for the reflection unitary [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Two alternative quantum circuits for the forward shift unitary [PITH_FULL_IMAGE:figures/full_fig_p011_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Total number of universal gates for (a) the shift unitary [PITH_FULL_IMAGE:figures/full_fig_p011_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Quantum circuit for the unitary UP evaluating the function d˜(k) = α0 + α1k + α2k 2 for k ∈ {0, 1, 2, 3}, where k = k02 1 + k12 0 and k0, k1 ∈ {0, 1}. The circuit is composed of four unitaries with each unitary implementing a rotation in a plane defined by the vectors |k⟩ |0⟩ and |k⟩ |1⟩, equivalently |k0k1⟩ |0⟩ and |k0k1⟩ |1⟩. with each unitary implementing a 2D rotation in a specific plane given by the v… view at source ↗
Figure 7
Figure 7. Figure 7: Quantum circuit for solving a one-dimensional Dirichlet boundary value problem. The extended domain [PITH_FULL_IMAGE:figures/full_fig_p014_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Quantum circuit for solving a two-dimensional Dirichlet boundary value problem. The extended domain [PITH_FULL_IMAGE:figures/full_fig_p015_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: One-dimensional homogenous Poisson-Dirichlet problem. [PITH_FULL_IMAGE:figures/full_fig_p016_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: One-dimensional homogenous Poisson-Dirichlet problem. [PITH_FULL_IMAGE:figures/full_fig_p016_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: One-dimensional inhomogeneous Poisson-Dirichlet problem. [PITH_FULL_IMAGE:figures/full_fig_p017_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: One-dimensional fractional stochastic di [PITH_FULL_IMAGE:figures/full_fig_p018_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: One-dimensional fractional stochastic di [PITH_FULL_IMAGE:figures/full_fig_p019_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: One-dimensional fractional stochastic di [PITH_FULL_IMAGE:figures/full_fig_p019_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: Two-dimensional inhomogeneous Poisson-Dirichlet problem. In (a), the spectral solution function and its approximation with polyno [PITH_FULL_IMAGE:figures/full_fig_p020_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: Two-dimensional inhomogeneous Poisson-Dirichlet problem. [PITH_FULL_IMAGE:figures/full_fig_p021_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: Two-dimensional fractional stochastic partial di [PITH_FULL_IMAGE:figures/full_fig_p022_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: Two-dimensional fractional stochastic partial di [PITH_FULL_IMAGE:figures/full_fig_p022_18.png] view at source ↗
read the original abstract

Quantum computing holds the promise of solving computational mechanics problems in polylogarithmic time, meaning computational time scales as $\mathscr{O}((\log N)^c)$, where $N$ is the problem size and $c$ a constant. We propose a quantum spectral method with polylogarithmic complexity for solving non-periodic boundary value problems with arbitrary Dirichlet boundary conditions. Our method extends the recently proposed approach by Liu et al. (2025), in which periodic problems are discretised using truncated Fourier series. In such spectral methods, the discretisation of boundary value problems with constant coefficients leads to a set of algebraic equations in the Fourier space. We implement the respective diagonal solution operator by first approximating it with a polynomial and then quantum encoding the polynomial. The mapping between the physical and Fourier spaces is accomplished using the quantum Fourier transform (QFT). To impose zero Dirichlet boundary conditions, we double the domain size and reflect all physical fields antisymmetrically. The respective reflection matrix defines the quantum sine transform (QST) by pre- and post-multiplying with the QFT. For non-zero Dirichlet boundary conditions, the solution is decomposed into a boundary-conforming and a homogeneous part. The homogenous part is determined by solving a problem with a suitably modified forcing vector. We illustrate the basic approach with a Dirichlet-Poisson problem and demonstrate its generality by applying it to a fractional stochastic PDE for modelling spatial random fields. We discuss the circuit implementation of the proposed approach and provide numerical evidence confirming its polylogarithmic complexity.

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 / 2 minor

Summary. The manuscript proposes a quantum spectral method for non-periodic boundary value problems with arbitrary Dirichlet conditions. It extends the periodic Fourier spectral solver of Liu et al. by doubling the domain and using antisymmetric reflection to construct a quantum sine transform (QST) for zero boundary conditions, and by decomposing the solution into a boundary-conforming part plus a homogeneous problem with modified forcing for nonzero boundaries. The diagonal solution operator in Fourier space is approximated by a polynomial that is then quantum-encoded and applied via QFT/QST mappings. Numerical results for a Dirichlet-Poisson problem and a fractional stochastic PDE are presented as evidence of polylogarithmic complexity.

Significance. If the polylogarithmic scaling can be placed on a rigorous footing with explicit degree bounds and end-to-end gate counts, the extension from periodic to non-periodic domains would be a useful incremental advance for quantum PDE solvers. The numerical demonstration on both a standard Poisson problem and a fractional SPDE is a concrete strength that shows the method is not limited to the simplest case.

major comments (2)
  1. [Abstract / circuit implementation discussion] Abstract and circuit-implementation discussion: the headline claim of polylogarithmic complexity rests on the polynomial approximation to the diagonal Fourier multiplier (e.g., multiplication by 1/|k|^2 or fractional powers) having degree d that remains polylog(N,1/ε) after accounting for the antisymmetric reflection matrix, the QST construction, and the modified forcing in the nonzero-BC decomposition. No explicit degree bounds, approximation-error analysis, or circuit-depth theorem that incorporates these additional operators is supplied; numerical evidence alone does not establish the asymptotic regime.
  2. [Method description] Method description: the condition number of the composite operator (reflection + polynomial encoding + boundary decomposition) is not analyzed, yet any N-dependent growth would immediately destroy the claimed polylog scaling. This quantity is load-bearing for the central complexity statement.
minor comments (2)
  1. The manuscript would benefit from an explicit statement of the smoothness assumptions required on the solution and forcing to guarantee that the polynomial degree remains controlled.
  2. A direct comparison table against a classical spectral solver (or at least against the periodic baseline of Liu et al.) on the same test problems would clarify the practical overhead introduced by the quantum encoding and reflection steps.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive report and for recognizing the concrete numerical demonstrations on both the Poisson problem and the fractional SPDE. We address the two major comments point by point below, indicating the revisions we intend to incorporate.

read point-by-point responses

  1. Referee: Abstract and circuit-implementation discussion: the headline claim of polylogarithmic complexity rests on the polynomial approximation to the diagonal Fourier multiplier (e.g., multiplication by 1/|k|^2 or fractional powers) having degree d that remains polylog(N,1/ε) after accounting for the antisymmetric reflection matrix, the QST construction, and the modified forcing in the nonzero-BC decomposition. No explicit degree bounds, approximation-error analysis, or circuit-depth theorem that incorporates these additional operators is supplied; numerical evidence alone does not establish the asymptotic regime.

    Authors: We agree that the current manuscript does not contain explicit degree bounds or a complete error-propagation analysis that folds the reflection matrix and QST into the polynomial approximation. The polylogarithmic claim is based on the fact that the core building blocks (QFT, QST constructed from QFT, and quantum polynomial evaluation) each admit polylog-depth implementations, while the multiplier (1/|k|^2 or fractional powers) admits a polynomial approximation of degree polylog(N,1/ε) by standard approximation theory for analytic functions on the discrete spectrum. The additional operators are unitary or isometric and therefore do not asymptotically increase the required degree. Nevertheless, a self-contained theorem combining all pieces is absent. We will revise the abstract to state that the method exhibits numerically observed polylogarithmic scaling and expand the circuit-implementation section with a sketch of degree selection and error accumulation. revision: partial

  2. Referee: Method description: the condition number of the composite operator (reflection + polynomial encoding + boundary decomposition) is not analyzed, yet any N-dependent growth would immediately destroy the claimed polylog scaling. This quantity is load-bearing for the central complexity statement.

    Authors: The antisymmetric reflection is an isometry on the doubled domain, the QST is unitary by construction, and the polynomial approximates the inverse Fourier multiplier whose eigenvalues remain bounded away from zero independently of N (after removal of the zero mode for the Poisson problem). The nonzero-boundary decomposition modifies only the right-hand side and leaves the linear operator unchanged. Hence the composite operator inherits a condition number that is independent of N or grows at most polylogarithmically. We did not, however, supply a dedicated paragraph deriving this bound. In the revised manuscript we will add a short remark in the method section that extracts the condition-number bound directly from the spectral properties of the multiplier and the unitarity of the transforms. revision: yes

Circularity Check

0 steps flagged

No significant circularity; independent constructions for non-periodic extensions

full rationale

The paper extends the periodic solver from the cited Liu et al. (2025) work by adding an antisymmetric reflection matrix to obtain the quantum sine transform (QST) and a solution decomposition into boundary-conforming plus homogeneous parts for arbitrary Dirichlet conditions. These steps are explicitly constructed from standard Fourier techniques and do not reduce by definition or fitting to the target PDE solution or to quantities computed inside the present paper. The polynomial approximation to the diagonal Fourier-space operator is introduced as a standard enabling step for quantum encoding, without any indication that its coefficients or degree are derived from or fitted to the output of the method itself. The overall polylogarithmic complexity claim therefore rests on the properties of QFT/QST mappings and the approximation error bounds rather than on any self-referential loop.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The approach rests on standard properties of the quantum Fourier transform and on the existence of an efficient polynomial approximation to the Fourier-space solution operator; no new physical entities or ad-hoc fitted constants are introduced in the abstract.

axioms (2)
  • standard math Quantum Fourier transform implements the discrete Fourier transform with polylog gate cost
    Invoked when mapping between physical and Fourier spaces
  • domain assumption A low-degree polynomial can approximate the diagonal solution operator to sufficient accuracy
    Central to quantum encoding the solve step

pith-pipeline@v0.9.0 · 5590 in / 1480 out tokens · 40961 ms · 2026-05-17T22:05:04.902299+00:00 · methodology

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

47 extracted references · 47 canonical work pages · 2 internal anchors

  1. [1]

    B. Liu, M. Ortiz, F. Cirak, Towards quantum computational mechanics, Computer Methods in Applied Mechanics and Engineering 432 (2024) 117403:1–117403:29

    work page 2024

  2. [2]

    D. E. Deutsch, Quantum computational networks, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences 425 (1989) 73–90

    work page 1989

  3. [3]

    Barenco, C

    A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, H. Weinfurter, Elementary gates for quantum computation, Physical Review A 52 (1995) 3457–3467

    work page 1995

  4. [4]

    M ¨ott¨onen, J

    M. M ¨ott¨onen, J. J. Vartiainen, V . Bergholm, M. M. Salomaa, Transformation of quantum states using uniformly controlled rotations, Quantum Information & Computation 5 (2005) 467–473

    work page 2005

  5. [5]

    X. Sun, G. Tian, S. Yang, P. Yuan, S. Zhang, Asymptotically optimal circuit depth for quantum state preparation and general unitary synthesis, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 42 (2023) 3301–3314

    work page 2023

  6. [6]

    Rosenkranz, E

    M. Rosenkranz, E. Brunner, G. Marin-Sanchez, N. Fitzpatrick, S. Dilkes, Y . Tang, Y . Kikuchi, M. Benedetti, Quantum state preparation for multivariate functions, Quantum 9 (2025) 1703

    work page 2025

  7. [7]

    J. M. Martyn, Z. M. Rossi, A. K. Tan, I. L. Chuang, Grand unification of quantum algorithms, PRX Quantum 2 (4) (2021) 040203:1– 040203:40

    work page 2021

  8. [8]

    A. W. Harrow, A. Hassidim, S. Lloyd, Quantum algorithm for linear systems of equations, Physical Review Letters 103 (2009) 150502

    work page 2009

  9. [9]

    M. E. S. Morales, L. Pira, P. Schleich, K. Koor, P. C. S. Costa, D. An, A. Aspuru-Guzik, L. Lin, P. Rebentrost, D. W. Berry, Quantum linear system solvers: A survey of algorithms and applications, arXiv preprint arXiv:2411.02522 (2024)

    work page arXiv 2024

  10. [10]

    Camps, R

    D. Camps, R. Van Beeumen, FABLE: Fast approximate quantum circuits for block-encodings, in: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), 104–113, 2022

    work page 2022

  11. [11]

    Camps, L

    D. Camps, L. Lin, R. Van Beeumen, C. Yang, Explicit quantum circuits for block encodings of certain sparse matrices, SIAM Journal on Matrix Analysis and Applications 45 (2024) 801–827

    work page 2024

  12. [12]

    Lapworth, Evaluation of block encoding for sparse matrix inversion using QSVT, arXiv preprint arXiv:2402.17529 (2024)

    L. Lapworth, Evaluation of block encoding for sparse matrix inversion using QSVT, arXiv preprint arXiv:2402.17529 (2024)

    work page arXiv 2024

  13. [13]

    S ¨underhauf, E

    C. S ¨underhauf, E. Campbell, J. Camps, Block-encoding structured matrices for data input in quantum computing, Quantum 8 (2024) 1226

    work page 2024

  14. [14]

    L. N. Trefethen, Spectral methods in MATLAB, SIAM, 2000

    work page 2000

  15. [15]

    Canuto, M

    C. Canuto, M. Y . Hussaini, A. Quarteroni, T. A. Zang, Spectral Methods: Fundamentals in Single Domains, Springer, 2007

    work page 2007

  16. [16]

    Moulinec, P

    H. Moulinec, P. Suquet, A numerical method for computing the overall response of nonlinear composites with complex microstructure, Computer Methods in Applied Mechanics and Engineering 157 (1998) 69–94

    work page 1998

  17. [17]

    Schneider, A review of nonlinear FFT-based computational homogenization methods, Acta Mechanica 232 (2021) 2051–2100

    M. Schneider, A review of nonlinear FFT-based computational homogenization methods, Acta Mechanica 232 (2021) 2051–2100

    work page 2021

  18. [18]

    Gierden, J

    C. Gierden, J. Kochmann, J. Waimann, B. Svendsen, S. Reese, A review of FE-FFT-based two-scale methods for computational modeling of microstructure evolution and macroscopic material behavior, Archives of Computational Methods in Engineering 29 (2022) 4115–4135

    work page 2022

  19. [19]

    Wright, C

    L. Wright, C. Mc Keever, J. T. First, R. Johnston, J. Tillay, S. Chaney, M. Rosenkranz, M. Lubasch, Noisy intermediate-scale quantum simulation of the one-dimensional wave equation, Physical Review Research 6 (4) (2024) 043169:1–043169:10

    work page 2024

  20. [20]

    Y . Cao, A. Papageorgiou, I. Petras, J. Traub, S. Kais, Quantum algorithm and circuit design solving the Poisson equation, New Journal of Physics 15 (2013) 013021:1–013021:30

    work page 2013

  21. [21]

    Lubasch, Y

    M. Lubasch, Y . Kikuchi, L. Wright, C. M. Keever, Quantum circuits for partial differential equations in Fourier space, arXiv preprint arXiv:2505.16895 (2025)

    work page arXiv 2025

  22. [22]

    A. M. Childs, J.-P. Liu, A. Ostrander, High-precision quantum algorithms for partial differential equations, Quantum 5 (2021) 574

    work page 2021

  23. [23]

    H.-Y . Wu, A. E. Paine, E. Philip, A. A. Gentile, O. Kyriienko, Quantum algorithm for solving nonlinear differential equations based on physics-informed effective Hamiltonians, arXiv preprint arXiv:2504.13174 (2025)

    work page arXiv 2025

  24. [24]

    Strang, Introduction to Applied Mathematics, 1986

    G. Strang, Introduction to Applied Mathematics, 1986

    work page 1986

  25. [25]

    Lindgren, H

    F. Lindgren, H. Rue, J. Lindstr ¨om, An explicit link between Gaussian fields and Gaussian Markov random fields: the stochastic partial differential equation approach, Journal of the Royal Statistical Society: Series B (Statistical Methodology) 73 (2011) 423–498

    work page 2011

  26. [26]

    Lindgren, D

    F. Lindgren, D. Bolin, H. Rue, The SPDE approach for Gaussian and non-Gaussian fields: 10 years and still running, Spatial Statistics (2022) 100599

    work page 2022

  27. [27]

    K. J. Koh, F. Cirak, Stochastic PDE representation of random fields for large-scale Gaussian process regression and statistical finite element analysis, Computer Methods in Applied Mechanics and Engineering 417 (2023) 116358:1–116358:41

    work page 2023

  28. [28]

    Ben-Yelun, A

    I. Ben-Yelun, A. O. Yuksel, F. Cirak, Robust topology optimisation of lattice structures with spatially correlated uncertainties, Structural and Multidisciplinary Optimization 67 (2024) 16:1–16:19

    work page 2024

  29. [29]

    Woerner, D

    S. Woerner, D. J. Egger, Quantum risk analysis, npj Quantum Information 5 (2019) 1–15

    work page 2019

  30. [30]

    M. V . Wickerhauser, Adapted wavelet analysis: from theory to software, IEEE Press, 1994

    work page 1994

  31. [31]

    Strang, The discrete cosine transform, SIAM Review 41 (1999) 135–147

    G. Strang, The discrete cosine transform, SIAM Review 41 (1999) 135–147

    work page 1999

  32. [32]

    Klappenecker, M

    A. Klappenecker, M. Rotteler, Discrete cosine transforms on quantum computers, in: ISPA 2001, 464–468, 2001

    work page 2001

  33. [33]

    S. Wang, X. Li, W. J. B. Lee, S. Deb, E. Lim, A. Chattopadhyay, A comprehensive study of quantum arithmetic circuits, Philosophical Transactions A 383 (2025) 20230392:1–20230392:37

    work page 2025

  34. [34]

    M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 10th anniversary edn., 2010

    work page 2010

  35. [35]

    P. Kaye, R. Laflamme, M. Mosca, An Introduction to Quantum Computing, Oxford University Press, 2006

    work page 2006

  36. [36]

    E. G. Rieffel, W. H. Polak, Quantum Computing: A Gentle Introduction, MIT Press, 2011

    work page 2011

  37. [37]

    T. G. Draper, Addition on a quantum computer, arXiv preprint quant-ph/0008033 (2000)

    work page internal anchor Pith review Pith/arXiv arXiv 2000

  38. [38]

    M. A. Schalkers, M. M ¨oller, Efficient and fail-safe quantum algorithm for the transport equation, Journal of Computational Physics 502 (2024) 112816:1–112816:25

    work page 2024

  39. [39]

    Quantum computing with Qiskit

    A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, J. M. Gambetta, Quantum computing with Qiskit, arXiv preprint arXiv:2405.08810 (2024). 27

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  40. [40]

    Sivarajah, S

    S. Sivarajah, S. Dilkes, A. Cowtan, W. Simmons, A. Edgington, R. Duncan,t|ket⟩: A Retargetable Compiler for NISQ Devices, arXiv preprint arXiv:2003.10611 (2020)

    work page arXiv 2003

  41. [41]

    Y . Nam, Y . Su, D. Maslov, Approximate quantum Fourier transform with O (n log (n)) T gates, NPJ Quantum Information 6 (2020) 26

    work page 2020

  42. [42]

    Huang, R

    H.-Y . Huang, R. Kueng, J. Preskill, Predicting many properties of a quantum system from very few measurements, Nature Physics 16 (2020) 1050–1057

    work page 2020

  43. [43]

    C. A. Williams, S. Scali, A. A. Gentile, D. Berger, O. Kyriienko, Addressing the readout problem in quantum differential equation algorithms with quantum scientific machine learning, arXiv preprint arXiv:2411.14259 (2024)

    work page arXiv 2024

  44. [44]

    Morin, J

    L. Morin, J. Paux, A fast numerical method for the conductivity of heterogeneous media with Dirichlet boundary conditions based on discrete sine–cosine transforms, Computer Methods in Applied Mechanics and Engineering 421 (2024) 116772:1–116772:18

    work page 2024

  45. [45]

    Risthaus, M

    L. Risthaus, M. Schneider, FFT-based computational micromechanics with Dirichlet boundary conditions on the rotated staggered grid, International Journal for Numerical Methods in Engineering 125 (2024) e7569:1–e7569:31

    work page 2024

  46. [46]

    J. Paux, L. Morin, L. G ´el´ebart, A. M. A. Sanoko, A discrete sine–cosine based method for the elasticity of heterogeneous materials with arbitrary boundary conditions, Computer Methods in Applied Mechanics and Engineering 433 (2025) 117488:1–117488:22

    work page 2025

  47. [47]

    Deiml, D

    M. Deiml, D. Peterseim, Quantum Sampling and Moment Estimation for Transformed Gaussian Random Fields, arXiv preprint arXiv:2508.13879 (2025). 28

    work page arXiv 2025