Pith. sign in

REVIEW 3 major objections 6 minor 115 references

Classical Tensor Network and Quantum Fourier Transform Approaches for Large-Scale Carr-Madan Option Pricing

T0 review · 3 major / 6 minor · reviewed 2026-07-31 · grok-4.5

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

Pith's one-line read A compressed tensor-train form of the quantum Fourier transform prices European calls on huge grids without building the full FFT vectors.

desk verdict Solid end-to-end SFFT Carr–Madan with honest FFT/SFFT/QFT scaling numbers on 1D BS; the high-dimensional framing is ahead of the evidence. read the letter →

arxiv 2607.28435 v1 pith:JZLPGTFI submitted 2026-07-30 quant-ph

Sascha Hauck , Ivica Turkalj This is my paper · ORCID
classification quant-ph
keywords OptionpricingCarr–MadanmethodFouriermethodsTensorTrainSuperfastTransformQuantumnetworksEuropeancall
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Classical Carr–Madan Fourier pricing needs a discrete Fourier transform over a strike–frequency grid. As that grid is refined to 2^n points, ordinary FFT memory and work grow exponentially and become the bottleneck. This paper rewrites the same pricing pipeline so every intermediate object lives in Tensor Train form and the transform itself is applied as the Superfast Fourier Transform—a low-rank Tensor Train Operator built from the reduced quantum Fourier circuit. The algorithm never materializes the huge vectors or the dense Fourier matrix. On a Black–Scholes European-call benchmark the method keeps pricing error near machine precision while memory saturates instead of exploding, and the core contraction eventually beats classical FFT. The same structure is run as a true inverse QFT on simulators and IBM hardware, giving a side-by-side classical-versus-quantum comparison of two ways to avoid exponential Fourier storage.

What carries the argument

The Superfast Fourier Transform (SFFT): a low-rank Tensor Train Operator for the reduced QFT circuit (without bit-reversal), applied by TT contraction of cost O(n r_SFFT² r²) to the tensorized Carr–Madan input, together with exact rank-one TT factors for the exponential damping and phase terms.

What would settle it

Re-run the SFFT Carr–Madan pipeline on the same Black–Scholes parameters while forcing the TT rank of ψ or of the SFFT operator to grow with n (or switch to a model whose characteristic function is known to be high-rank under binary encoding); if memory and core runtime then track classical FFT instead of saturating, the claimed subexponential advantage fails.

Watch

Extended reading notes

Core claim

Carr–Madan European call pricing can be executed entirely inside Tensor Trains by applying the Superfast Fourier Transform (a compressed Tensor Train Operator of the reduced QFT) to a TT representation of the damped characteristic-function data, so option prices on grids of size 2^n are obtained without ever storing O(2^n) vectors or operators, while accuracy stays comparable to classical FFT and both the TT method and hardware QFT avoid the exponential scaling of dense Fourier pricing.

Load-bearing premise

The method stays cheap only if the characteristic-function data and the intermediate pricing tensors keep small, saturating Tensor Train ranks as the grid is refined—shown here for one-dimensional Black–Scholes, not yet for the jump, stochastic-volatility, or multi-asset cases that motivate the work.

Editorial extensions

If this is right

  • Large strike–frequency grids that are memory-infeasible for dense FFT become routine once the pricing tensors admit modest TT ranks.
  • The same SFFT operator can be built once offline and reused across many strikes, maturities, or parameter sweeps.
  • Classical tensor-network Fourier pricing and QFT-based quantum pricing become directly comparable inside one Carr–Madan discretization.
  • Hardware QFT wall-clock for the transform alone scales only polynomially in qubits, while classical FFT scales with the full grid size.
  • Future multi-asset or path-dependent Fourier pricers can target the same compressed-transform pattern rather than low-rank structure only in payoffs or Greeks.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If TT ranks stay modest for characteristic functions of Lévy or stochastic-volatility models, the same pipeline would undercut FFT memory for the settings where closed-form densities are unavailable and Fourier methods are most needed.
  • Precomputing a library of SFFT operators at fixed accuracy would remove the main offline bottleneck the authors report, making the core contraction the only online cost.
  • The phase-reconstruction step required by quantum measurement (taking square roots of probabilities) is a structural accuracy ceiling classical SFFT does not face; hybrid workflows may therefore keep the transform classical even when state preparation is quantum.
  • Binary tensorization of the frequency grid is doing the real compression work; other Fourier option methods (COS, PROJ) could be tensorized the same way if their kernels separate under the same encoding.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 6 minor

Summary. The paper reformulates the Carr–Madan Fourier pricing method in Tensor Train format by applying the Superfast Fourier Transform (SFFT), a low-rank TT operator realization of the reduced Quantum Fourier Transform, so that the damped characteristic-function integrand, rank-one damping factors, and inverse DFT are handled without materializing the full 2^n grid. It places this classical TN algorithm alongside a QFT-based Carr–Madan pipeline (following Ewen) and reports memory, runtime, and NRMSE for European calls under Black–Scholes, plus inverse-QFT execution statistics on IBM hardware and accuracy on statevector simulation. For the BS benchmark the TT ranks saturate (max rank ~120 after n≈12), memory plateaus relative to dense FFT, core SFFT runtime crosses FFT near n≈16 (full workflow near n≈23), and NRMSE reaches ~3.1×10^{-13} versus FFT ~4.4×10^{-15}; both SFFT and QFT avoid explicit exponential storage of the Fourier operator.

Significance. If the efficiency story transfers beyond the reported setting, the work would usefully unify classical FFT pricing, tensor-network compression of the Fourier operator itself (rather than only of pricing surfaces), and QFT-based quantum pricing under one Carr–Madan discretization. Strengths that should be credited: a clear, reproducible pipeline (TT-cross for ψ, analytic rank-one dampings, Zip-Up SFFT-TTO); an external analytical BS benchmark rather than self-consistency checks; concrete hardware circuit-depth/CZ/timing data; and an explicit core-vs-preprocessing runtime split that makes the asymptotic claim falsifiable. The main significance is therefore methodological and comparative for large 1D Fourier grids; claims of a scalable route to jump/SV or multi-asset pricing remain aspirational until supported by evidence.

major comments (3)
  1. [Abstract; Introduction; Experimental Evaluation; Conclusion] Abstract, Introduction, and Conclusion frame the method as addressing large-scale / high-dimensional pricing and motivate jumps, stochastic volatility, and multi-asset settings (Heston, Merton, Variance Gamma; cf. Kastoryano–Pancotti). All numerical evidence (Figs. 2–4, NRMSE, rank saturation ~120) is for non-dividend 1D Black–Scholes only. The load-bearing efficiency claim—memory plateau and O(n r_SFFT² r²) core cost—requires that the binary-tensorized ψ and post-SFFT TT keep small, non-growing max rank as n grows. That is demonstrated for BS but not for any CF the introduction cites as motivation. Either add at least one non-BS CF experiment (e.g. Heston or VG) with rank/NRMSE/runtime plots, or substantially narrow the abstract/conclusion language to what is shown (fine 1D Fourier grids under BS).
  2. [QFT-based Option Pricing; Comparison between Classical and Quantum Methods; Fig. 9] The QFT vs SFFT/FFT comparison in “Comparison between Classical and Quantum Methods” and Fig. 9 measures QPU time as post-transpiled inverse-QFT execution only (state preparation, transpilation, queueing excluded), while full SFFT includes construction and FFT is end-to-end. The paper notes this, but the speed-up narrative and abstract claim of a “direct comparison” still risk overstating quantum advantage relative to classical kernels. Please report, side-by-side, (i) inverse-QFT-only vs SFFT-core and (ii) a full pricing workflow estimate including a concrete state-preparation cost model (or explicitly label Fig. 9 as kernel-only and remove workflow-level superiority language).
  3. [QFT-based Option Pricing, Eqs. (16)–(20); Fig. 8] Eqs. (16)–(20): price recovery from computational-basis shots uses e^{iπl} ỹ_l ≈ |ỹ_l|=√p_l. This is stated as accurate when the discretization is good, but residual phase/imaginary error is a second error source beyond sampling. Classical FFT/SFFT reach ~10^{-15}–10^{-13} NRMSE while the statevector floor is higher (~10^{-12}–10^{-9}, Fig. 8). Quantify the phase-approximation error (e.g. max |Im(e^{iπl} ỹ_l)| or price error with exact complex amplitudes vs √p_l) on the same grids so readers can separate discretization, reconstruction, and shot noise—especially before any hardware pricing claims.
minor comments (6)
  1. [Experimental Evaluation; title page] Several figure cross-references are broken or placeholder: “see Appendix??”, “Figure X”, and incomplete author/email fields (“tbf”). Fix before production.
  2. [Experimental Evaluation] Damping is described as “varied over set to a value of α=2.5” (typo/grammar). State the fixed α used for classical runs and how the five α values in the simulator median NRMSE were chosen.
  3. [European Option Pricing…; Experimental Evaluation] Grid definitions: Δk=N^{-1/2} and b=log(S0)-NΔk/2 should be written with clear math formatting; confirm consistency with Δv Δk=π/N from the discretization section.
  4. [Superfast Fourier Transform] SFFT construction via Zip-Up is deferred; a brief complexity/rank bound or pointer to Hauck et al. / Dolgov et al. with the truncation tolerance used in experiments would aid reproducibility.
  5. [Figures 2–4] Fig. 2–4 axis labels appear as Unicode entity strings in the manuscript source; ensure vectorized figures render cleanly.
  6. [Introduction] Related TN Fourier pricing (Glau et al.; Sakurai et al.; Kastoryano–Pancotti) is cited; a short explicit contrast—compressing the DFT operator vs compressing the pricing function/surface—would sharpen the novelty claim.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Carr–Madan/SFFT pricing is benchmarked against closed-form Black–Scholes and classical FFT, not against quantities defined from its own fits.

full rationale

The paper’s load-bearing chain is standard and externally checked. Carr–Madan damping and DFT discretization are classical; the SFFT is a known compressed TT realization of the reduced QFT (Dolgov et al.; Zip-Up), applied to tensorized ψ and rank-one exponential factors without defining prices in terms of the method’s outputs. Accuracy is measured by NRMSE against the analytical Black–Scholes call (Eq. 1 / Eq. 27), and efficiency is compared to dense FFT memory/runtime and to QFT simulator/hardware timings—not to a fitted target recovered as a ‘prediction.’ Damping α and grids are numerical choices, not recovered quantities. Self-citations (e.g. Hauck et al. on SFFT ranks; Ewen on QFT pricing) supply background or prior technique, not a uniqueness theorem that forces the main claim. Rank saturation and crossovers are empirical observations on the BS benchmark, not tautologies. No Eq.-X-equals-Eq.-Y-by-construction loop on the central accuracy or scaling claims.

Assumptions & free parameters 5 free parameters · 5 assumptions · 1 invented entities

The work sits on standard no-arbitrage Fourier pricing plus known TT/SFFT and QFT machinery. Load-bearing modeling choices are BS dynamics for tests, Carr–Madan damping/integrability, low TT rank of the discretized inputs/operators, and the quantum readout phase ansatz. No new physical entities; free knobs are numerical (α, grids, rank truncation, shots).

free parameters (5)
  • Carr–Madan damping α = 2.5
    Fixed at 2.5 for classical runs; must satisfy finite moment E[S_T^{α+1}] and affects integrability and numerical stability of ψ.
  • Fourier/log-strike grid (n, Δk, k0/b) = n varied; Δk=N^{-1/2}
    Discretization N=2^{n-1}, Δk=N^{-1/2}, b=log(S0)-NΔk/2 defines the DFT instance and truncation error; chosen by authors, not derived.
  • TT rank truncation / TT-cross accuracy
    SFFT Zip-Up and TT-cross sampling tolerances control ranks (~saturate at 120) and thus both error floor and claimed complexity; not fully reported as a single tolerance schedule.
  • Quantum shot count S = default 4096 on IBM
    Hardware timing uses S in {1024,4096,8192}; statistical error in bpl scales with S for any full QPU pricing.
  • Moneyness evaluation window = K in [50,150] for S0=100
    NRMSE only on K/S0 in [0.5,1.5], excluding extreme strikes where damping can amplify errors—post-selected evaluation region.
assumptions (5)
  • domain assumption European call value equals discounted risk-neutral expectation; Carr–Madan damped Fourier representation (8)–(5) holds when E[S_T^{α+1}]<∞.
    Foundation of the entire pricing pipeline in the Option Pricing / DFT sections.
  • standard math Discrete unitary DFT (9) with ΔvΔk=π/N approximates the inverse Fourier integral via the chosen rectangular rule (11)–(13).
    Standard CM discretization following Ewen-oriented grid; quadrature error is accepted as outside the DFT realization focus.
  • domain assumption Reduced QFT operator Q_n admits a compact TT operator (SFFT) with small ranks; bit-reversal can be absorbed into index handling.
    Cited via Dolgov et al., Chen et al., García-Ripoll; enables classical compressed apply without full matrix.
  • ad hoc to paper For QFT pricing, e^{iπl} ỹ_l ≈ |ỹ_l|=√p_l when discretization is accurate, so prices can be read from measurement probabilities.
    Phase reconstruction step (18)–(20); discards residual phase and contributes to simulator error floor vs classical FFT/SFFT.
  • domain assumption Black–Scholes closed form is the ground-truth benchmark for NRMSE.
    Experimental Evaluation; validates numerics only inside BS, not jump/SV models emphasized earlier.
invented entities (1)
  • SFFT-based Carr–Madan pricing algorithm (TT pipeline for ψ, rank-1 dampings, SFFT-TTO apply) independent evidence
    purpose: Perform CM Fourier pricing entirely in TT format without materializing 2^n vectors.
    Composition of known SFFT with CM; not a new physical object, but the paper’s named algorithmic entity.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Classical Tensor Network and Quantum Fourier Transform Approaches for Large-Scale Carr-Madan Option Pricing." pith.science (2026). https://pith.science/paper/JZLPGTFI

@misc{pith2026260728435,
  author       = {Pith},
  title        = {Pith review of: Classical Tensor Network and Quantum Fourier Transform Approaches for Large-Scale Carr-Madan Option Pricing},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JZLPGTFI}},
  note         = {Machine review of arXiv:2607.28435}
}
read the original abstract

Fourier-based methods are among the most widely used techniques for pricing European options when the characteristic function of the underlying asset process is available. Their applicability to increasingly fine discretizations, however, is limited by the rapidly growing memory requirements of classical Fourier transforms, which become a computational bottleneck for large-scale pricing problems. In this work, we overcome this limitation by reformulating the Carr-Madan pricing framework using tensor networks. Specifically, we employ the Superfast Fourier Transform (SFFT), a compressed Tensor Train representation of the Quantum Fourier Transform (QFT), and apply it directly to tensorized option pricing without ever explicitly constructing exponentially large vectors or Fourier operators. This formulation also enables a direct comparison between the classical tensor network algorithm and its quantum counterpart through QFT-based option pricing on quantum simulators and quantum hardware. Numerical experiments for European call options demonstrate that the proposed SFFT method maintains pricing accuracy while substantially reducing memory requirements and achieving subexponential computational scaling compared with conventional FFT-based pricing. The accompanying quantum simulations and hardware executions enable a direct comparison between the classical tensor network formulation and its QFT-based quantum counterpart, showing that both approaches avoid the exponential scaling of conventional Fourier implementations and provide complementary perspectives on large-scale option pricing. Together, these results establish a unified framework connecting classical Fourier pricing, tensor network algorithms, and quantum computing approaches, demonstrating how tensorized Fourier methods can provide scalable alternatives for high-dimensional financial computations.

Figures

Figures reproduced from arXiv: 2607.28435 by the authors.

Figure 1
Figure 1. Quantum circuit of the QFT for the case of four qubits. The circuit separates into the actual transform Q4 and reordering circuit R4. Under the sign convention adopted in (9), the option-pricing calculation uses the inverse QFT, obtained by taking the adjoint of the displayed circuit. Adapted from Nielsen and Chuang (2000). that e iπly˜l ≈ |y˜l | = √ pl . (18) Thus, equation (18) amounts to imposing the phase expect… view at source ↗
Figure 3
Figure 3. shows the runtime of the proposed SFFT-based approach in comparison with the classical FFT-based algo￾rithm. Since the construction of the different components required by the SFFT-based approach can contribute signif￾icantly to the overall runtime, the figure additionally reports the execution time of the fundamental operations only, excluding these construction times. This distinction enables a more direct compari… view at source ↗
Figure 4
Figure 4. NRMSE over discretization parameter n for the classical SFFT- and FFT-based option pricing algorithms. We subsequently employ quantum simulators to examine the correctness and approximation quality of the quantum formulation independently of hardware noise. The real-hardware experiments were performed on the IBM-Boston quantum device, which has as an IBM Heron r3 processor with 156 physical qubits. The processor use… view at source ↗
Figures from the paper (4 more)
Figure 5
Figure 5. Figure 5: shows the execution time on quantum hardware as a function of the number of qubits. The reported QPU execution times refer only to the inverse-QFT circuit and exclude the state-preparation step, and therefore do not depent on α. This choice was made deliberately in ord…
Figure 6
Figure 6. Figure 6: The depth of the transpiled circuit executed on the quantum hardware, over the discretization parameter n. The transpilation was performed on optimization level 3. behavior reflects the polynomial growth of the inverse-QFT circuit with the number of qubits rather than …
Figure 8
Figure 8. Figure 8: Median NRMSE over discretization parameter n for the statevector simulation. The median is taken over the five different values for the damping factor α. CZ gates while having a smaller depth if the selected physical layout permits greater parallelization. The circuit-…
Figure 9
Figure 9. Figure 9: Speed-up measure χ comparing the runtime of the FFT-based and SFFT-based option pricing algorithms with the QPU-based implementation. The SFFT Core denotes the runtime of the tensor network algorithm excluding the preprocessing steps. The black dashed line at χ = 1 ind…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

115 extracted references · 1 canonical work pages

  1. [1]

    M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. 2000

    2000

  2. [2]

    Hackbusch

    W. Hackbusch. Hierarchical Matrices: Algorithms and Analysis. 2015

    2015

  3. [3]

    Montangero

    S. Montangero. Introduction to Tensor Network Methods. 2018

    2018

  4. [4]

    Cioranescu and P

    D. Cioranescu and P. Donato. An Introduction to Homogenization. 1999

    1999

  5. [5]

    1976 , publisher =

    Numerical Solution of Partial Differential Equations--III , subtitle =. 1976 , publisher =

    1976

  6. [6]

    M. H. Sadd. Elasticity Theory, Applications and Numerics. 2009

    2009

  7. [7]

    Karau and M

    H. Karau and M. Kimmins. Scaling Python with Dask. 2023

    2023

  8. [8]

    Schwarzenbach

    D. Schwarzenbach. Kristallographie. 2013

    2013

Show all 115 references
  1. [9]

    Bakhvalov and G

    N. Bakhvalov and G. Panasenko. Homogenisation: Averaging Processes in Periodic Media. 1989

    1989

  2. [10]

    Advances in Neural Information Processing Systems (NeurIPS 2022) , year =

    TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s , author =. Advances in Neural Information Processing Systems (NeurIPS 2022) , year =

    2022

  3. [11]

    Salamon and N

    M. Salamon and N. Reims and D. Prjamkov and M. Schmitt and J. Makarov and D. Ak and M. Kronenberger and K. Schladitz and C. Redenbach and S. Grzesiak and C. de Sousa and C. Thiele and M. Pahn. Gulliver - A new kind of industrial CT. 14th Conference on Industrial Computed Tomog...

    2025

  4. [12]

    Frigo and S

    M. Frigo and S. G. Johnson. The Design and Implementation of FFTW3. IEEE. 2005

    2005

  5. [13]

    Okuta and Y

    R. Okuta and Y. Unno and D. Nishino and S. Hido and C. Loomis , title =. NeurIPS 2017 , note =

    2017

  6. [14]

    International Conference on Learning Representations (ICLR) , year =

    Fourier Neural Operator for Parametric Partial Differential Equations , author =. International Conference on Learning Representations (ICLR) , year =

  7. [15]

    Jouppi, N. P. and Kurian, G. and Li, S. and Ma, P. and Nagarajan, R. and Nai, L. and Patil, N. and Subramanian, S. and Swing, A. and Towles, B. and Young, C. and Zhou, X. and Zhou, Z. and Patterson, D. , title =. Proceedings of the 50th Annual International Symposium on Comput...

  8. [16]

    NVIDIA A100 Tensor Core GPU Data Sheet

    NVIDIA Corporation. NVIDIA A100 Tensor Core GPU Data Sheet. 2021

    2021

  9. [17]

    Intel Xeon Gold 6240R Processor Datasheet

    Intel Corporation. Intel Xeon Gold 6240R Processor Datasheet. 2020

    2020

  10. [18]

    cuTensorNet: A High-Performance Library for Tensor Network Computations , year =

  11. [19]

    2018 , note =

    James Bradbury and Roy Frostig and Peter Hawkins and Matthew James Johnson and Chris Leary and Dougal Maclaurin and George Necula and Adam Paszke and Jake Vander. 2018 , note =

    2018

  12. [20]

    2025 , organization =

    2025

  13. [21]

    Williams and A

    S. Williams and A. Waterman and D. Patterson , title =. Commun. ACM , pages =. 2009 , issue_date =

    2009

  14. [22]

    Nature Reviews Physics , volume =

    Neural operators for accelerating scientific simulations and design , author =. Nature Reviews Physics , volume =

  15. [23]

    IEEE Transactions on Parallel and Distributed Systems , volume =

    Efficient Utilization of Multi-Threading Parallelism on Heterogeneous Systems for Sparse Tensor Contraction , author =. IEEE Transactions on Parallel and Distributed Systems , volume =. 2024 , publisher =

    2024

  16. [24]

    2022 IEEE 38th International Conference on Data Engineering (ICDE) , year =

    Exploiting Hierarchical Parallelism and Reusability in Tensor Kernel Processing on Heterogeneous HPC Systems , author =. 2022 IEEE 38th International Conference on Data Engineering (ICDE) , year =

    2022

  17. [25]

    Linear Algebra and its Applications , volume =

    Oseledets, Ivan and Tyrtyshnikov, Eugene , title =. Linear Algebra and its Applications , volume =

  18. [26]

    Learning Feynman Diagrams with Tensor Trains , journal =

    N. Learning Feynman Diagrams with Tensor Trains , journal =. 2022 , publisher =

    2022

  19. [27]

    Engineering Applications of Artificial Intelligence , volume =

    A novel data generation scheme for surrogate modelling with deep operator networks , author =. Engineering Applications of Artificial Intelligence , volume =. 2025 , publisher =

    2025

  20. [28]

    Archives of Computational Methods in Engineering , year =

    Physics-Informed Neural Networks in Materials Modeling and Design: A Review , author =. Archives of Computational Methods in Engineering , year =

  21. [29]

    Computer Methods in Applied Mechanics and Engineering , volume =

    Reliable extrapolation of deep neural operators informed by physics or sparse observations , author =. Computer Methods in Applied Mechanics and Engineering , volume =. 2023 , issn =

    2023

  22. [30]

    Journal of Machine Learning Research , volume =

    Neural Operator: Learning Maps Between Function Spaces with Applications to Partial Differential Equations , author =. Journal of Machine Learning Research , volume =

  23. [31]

    and Millman, K

    Harris, Charles R. and Millman, K. Jarrod and van der Walt, Stéfan J. and others , year =. Array programming with. Nature , volume =

  24. [32]

    Computational Complexity of Projected Entangled Pair States , author =. Phys. Rev. Lett. , volume =

  25. [33]

    and Lewis, Peter A

    Cooley, James W. and Lewis, Peter A. W. and Welch, Peter D. , title =. IEEE Trans. Educ. , year =

  26. [34]

    Li and M

    H. Li and M. Li and Z. S. Khodaei and M. H. F. Aliabadi. A Batch-Processing FFT -based Method for Efficient Homogenisation of Periodic Media Using GPU. J. Phys.: Conf. Ser. 2025

    2025

  27. [35]

    Li and Z

    H. Li and Z. S. Khodaei and M. H. F. Aliabadi. FFT -based multiscale scheme for homogenisation of heterogeneous plates including damage and failure. Comput. Methods Appl. Mech. Eng. 2023

    2023

  28. [36]

    K. C. Nowack and M. Shafiei and M. Laforest and G. E. D. K. Prawiroatmodjo and L. R. Schreiber and C. Reichl and W. Wegscheider and L. M. K. Vandersypen. Single-Shot Correlations and Two-Qubit Gate of Solid-State Spins. Science. 2011

    2011

  29. [37]

    Moulinec and P

    H. Moulinec and P. Suquet. A numerical method for computing the overall response of nonlinear composites with complex microstructure. Comput. Methods Appl. Mech. Eng. 1998

    1998

  30. [38]

    arXiv preprint arXiv:2203.02804 , year=

    A Highly Efficient Tensor Network Algorithm for Multi-Asset Fourier Options Pricing , author=. arXiv preprint arXiv:2203.02804 , year=

    arXiv

  31. [39]

    Mathematics , volume=

    Learning Parameter Dependence for Fourier-Based Option Pricing with Tensor Trains , author=. Mathematics , volume=. 2025 , publisher=

    2025

  32. [40]

    arXiv preprint arXiv:2507.08482 , year=

    Tensor Train Representations of Greeks for Fourier-Based Pricing of Multi-Asset Options , author=. arXiv preprint arXiv:2507.08482 , year=

    arXiv

  33. [41]

    arXiv preprint arXiv:2601.00009 , year=

    Full Grid Solution for Multi-Asset Options Pricing with Tensor Networks , author=. arXiv preprint arXiv:2601.00009 , year=

  34. [42]

    SIAM Journal on Financial Mathematics , volume=

    Low-Rank Tensor Approximation for Chebyshev Interpolation in Parametric Option Pricing , author=. SIAM Journal on Financial Mathematics , volume=

  35. [43]

    I. V. Oseledets. Tensor-Train Decomposition. SIAM J. Sci. Comput. 2011

    2011

  36. [44]

    F. Willot. Fourier-based schemes for computing the mechanical response of composites with accurate local fields. C. R. Mecanique. 2015

    2015

  37. [45]

    Grimm-Strele and M

    H. Grimm-Strele and M. Kabel. FFT -based homogenization with mixed uniform boundary conditions. Int. J. Numer. Methods Eng. 2021

    2021

  38. [46]

    S. V. Dolgov and D. V. Savostyanov. Alternating minimal energy methods for linear systems in higher dimensions. Part II: Faster algorithm and application to nonsymmetric systems. SIAM J. Sci. Comput. 2014

    2014

  39. [47]

    Kressner and B

    D. Kressner and B. Vandereycken and R. Voorhaar. Streaming Tensor Train Approximation. SIAM J. Sci. Comput. 2023

    2023

  40. [48]

    Kazeev and B.N

    V.A. Kazeev and B.N. Khoromskij. Low-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse. SIAM J. Matrix Anal. Appl. 2012

    2012

  41. [49]

    Kulkarni and F

    A. Kulkarni and F. Franchetti and J. Kova c evi\' c. Large-Scale Algorithm Design for Parallel FFT -based Simulations on GPUs. IEEE GlobalSIP. 2018

    2018

  42. [50]

    IRE Journals , year =

    A Survey Comparing Specialized Hardware and Evolution in CPU, GPU and TPU for Neural Network , author =. IRE Journals , year =

  43. [51]

    Blühdorn and N

    J. Blühdorn and N. R. Gauger and M. Kabel. AutoMat: automatic differentiation for generalized standard materials on GPUs. Computational Mechanics. 2022

    2022

  44. [52]

    Chen and E

    J. Chen and E. M. Stoudenmire and S. R. White. Quantum Fourier Transform Has Small Entanglement. PRX Quantum. 2023

    2023

  45. [53]

    S. R. White. Density-matrix algorithms for quantum renormalization groups. Phys. Rev. B. 1993

    1993

  46. [54]

    Fannes and B

    M. Fannes and B. Nachtergaele and R. F. Werner. Finitely correlated states on quantum spin chains. Commun. Math. Phys. 1992

    1992

  47. [55]

    Tensor network states and geometry

    G Evenbly and G Vidal. Tensor network states and geometry. J. Stat. Phys. 2011

    2011

  48. [56]

    Holtz and T

    S. Holtz and T. Rohwedder and R. Schneider. The alternating linear scheme for tensor optimization in the tensor train format. SIAM J. Sci. Comput. 2012

    2012

  49. [57]

    E. M. Stoudenmire and S. R. White. Minimally entangled typical thermal state algorithms. New J. Phys. 2010

    2010

  50. [58]

    J. J. García-Ripoll. Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations. Quantum. 2021

    2021

  51. [59]

    Dolgov and B

    S. Dolgov and B. Khoromskij and D. Savostyanov. Superfast Fourier Transform Using QTT Approximation. J. Fourier Anal. Appl. 2012

    2012

  52. [60]

    P. D. Jablonski and J. A. Hawk. Homogenizing Advanced Alloys: Thermodynamic and Kinetic Simulations Followed by Experimental Results. JMEPEG. 2016

    2016

  53. [61]

    Wang and L

    Y. Wang and L. Hou and H. Su and Q. Tian and K. Yu and D. Eskin and L. Katgerman and L. Zhuang. Tuning homogenization of high-strength aluminum alloys through thermodynamic alloying approach. Mater. Des. 2022

    2022

  54. [62]

    Leuschner and F

    M. Leuschner and F. Fritzen. Fourier-accelerated nodal solvers (FANS) for homogenization problems. Comput. Mech. 2018

    2018

  55. [63]

    Oseledets and E

    I. Oseledets and E. Tyrtyshnikov. TT -cross approximation for multidimensional arrays. Linear Algebra Its Appl. 2010

    2010

  56. [64]

    Ganahl and J

    M. Ganahl and J. Beall and M. Hauru and A. G.M. Lewis and T. Wojno and J. H. Yoo and Y. Zou and G. Vidal. Density Matrix Renormalization Group with Tensor Processing Units. PRX QUANTUM. 2023

    2023

  57. [65]

    Pan and H

    F. Pan and H. Gu and L. Kuang and B. Liu and P. Zhang. Efficient Quantum Circuit Simulation by Tensor Network Methods on Modern GPUs. ACM TQC. 2024

    2024

  58. [66]

    Hackbusch and S

    W. Hackbusch and S. Kühn. A New Scheme for the Tensor Representation. JFFA. 2009

    2009

  59. [67]

    R. Orús. A practical introduction to tensor networks: Matrix product states and projected entangled pair states. Annals of Physics. 2014

    2014

  60. [68]

    Toulemonde and R

    C. Toulemonde and R. Masson and J. El Gharib. Modeling the effective elastic behavior of composites: a mixed Finite Element and homogenisation approach. Comptes Rendus Mechanique. 2008

    2008

  61. [69]

    Schneider and D

    M. Schneider and D. Merkert and M. Kabel. FFT -based homogenization for microstructures discretized by linear hexahedral elements. Int. J. Numer. Methods Eng. 2017

    2017

  62. [70]

    Schneider

    M. Schneider. A review of nonlinear FFT -based computational homogenization methods. Acta Mechanica. 2021

    2021

  63. [71]

    C. C. Mei and J.-L. Auriault and C.-O. Ng. Some Applications of the Homogenization Theory. Adv. Appl. Mech. 1996

    1996

  64. [72]

    Brisard and L

    S. Brisard and L. Dormieux. FFT -based methods for the mechanics of composites: a general variational framework. Comp. Mat. Science. 2010

    2010

  65. [73]

    Risthaus and M

    L. Risthaus and M. Schneider. Imposing different boundary conditions for thermal computational homogenization problems with FFT - and tensor-train-based Green's operator methods. Int J Numer Methods Eng. 2024

    2024

  66. [74]

    Risthaus and M

    L. Risthaus and M. Schneider. FFT -based computational micromechanics with Dirichlet boundary conditions on the rotated staggered grid. Int J Numer Methods Eng. 2024

    2024

  67. [75]

    Vondrejc and D

    J. Vondrejc and D. Liu and M. Ladecky and H. G. Matthies. FFT -based homogenisation accelerated by low-rank tensor approximations. Comput. Methods Appl. Mech. Eng. 2020

    2020

  68. [76]

    Liu and M

    B. Liu and M. Oritz and F. Cirak. Towards quantum computational mechanics. Comput. Methods Appl. Mech. Eng. 2024

    2024

  69. [77]

    Lu and Y.-F

    T. Lu and Y.-F. Chen and B. Hechtman and T. Wang and J. Anderson. Large-Scale Discrete Fourier Transform on TPUs. IEEE Access , year=

  70. [78]

    A. Y. Romanov and A. L. Stempkovsky and I. V. Lariushkin and G. E. Novoselov and R. A. Solovyev and V. A. Starykh and D. V. Telpukhov and I. I. Romanova and A. A. Mkrtchan. Analysis of Posit and Bfloat Arithmetic of Real Numbers for Machine Learning. IEEE Access. 2021

    2021

  71. [79]

    Halko and P

    N. Halko and P. G. Martinsson and J. A. Tropp. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions. SIAM Review. 2011

    2011

  72. [80]

    Östlund and S

    S. Östlund and S. Rommer. Thermodynamic Limit of Density Matrix Renormalization. Phys. Rev. Lett. 1995

    1995

  73. [81]

    Shi and L.-M

    Y.-Y. Shi and L.-M. Duan and G. Vidal. Classical simulation of quantum many-body systems with a tree tensor network. Phys. Rev. A. 2006

    2006

  74. [82]

    Huang and J

    Y. Huang and J. Wang and M. Li and G. Wang and L. Dong and S. N. Atluri. 3D computational grains with embedded fibers for the direct micromechanical modeling of fiber composites. Acta Mech. Sin. 2023

    2023

  75. [83]

    Zhang and H

    Y. Zhang and H. Yu and Q. Qin and C. Qu and J. Wang. Theoretical modeling of the mechanical properties of biological fibers and bundles with hierarchical chiral structures. Acta Mech. Sin. 2023

    2023

  76. [84]

    Liu and X

    Y. Liu and X. Li and Y. Chen and B. Ding. Machine learning-encoded multiscale modelling and Bayesian optimization framework to design programmable metamaterials. Acta Mech. Sin. 2025

    2025

  77. [85]

    Duan and J

    H. Duan and J. Wang and Z. Huang. Micromechanics of composites with interface effects. Acta Mech. Sin. 2022

    2022

  78. [86]

    Wang and Y

    W. Wang and Y. Zhao and Y. Li. Ensemble machine learning for predicting the homogenized elastic properties of unidirectional composites: A SHAP -based interpretability analysis. Acta Mech. Sin. 2023

    2023

  79. [87]

    Gao and J

    Y. Gao and J. He and J. Jiang and J. Zuo. Homogenizing interfacial shear stress in brick-and-mortar structured composites via gradient modulus for enhanced mechanical properties. Acta Mech. Sin. 2024

    2024

  80. [88]

    G. Vidal. Entanglement renormalization. Phys. Rev. Lett. 2007

    2007

  81. [89]

    Liu and C

    Z. Liu and C. T. Wu and M. Koishi. A deep material network for multiscale topology learning and accelerated nonlinear modeling of heterogeneous materials. Comput. Methods Appl. Mech. Eng. 2019

    2019

  82. [90]

    Hauck, S. H. and Kabel, M. and Ali, M. and Gauger, N. R. , title =. Acta Mech. Sin. , year =

  83. [91]

    Gajek and M

    S. Gajek and M. Schneider and T. Böhlke. On the micromechanics of deep material networks. J. Mech. Phys. Solids. 2020

    2020

  84. [92]

    Magino and J

    N. Magino and J. Köbler and H. Andrä and F. Welschinger and R. Müller and M. Schneider. A multiscale high-cycle fatigue-damage model for the stiffness degradation of fiber-reinforced materials based on a mixed variational framework. Comput. Methods Appl. Mech. Eng. 2022

    2022

  85. [93]

    Alkhimenkov

    Y. Alkhimenkov. Digital rock physics: Calculation of effective elastic properties of heterogeneous materials using graphical processing units ( GPU s). Comput. Geosci. 2025

    2025

  86. [94]

    Givois and M

    F. Givois and M. Kabel and N. Gauger. QFT -based Homogenization. 2022

    2022

  87. [95]

    J. A. Cortese and T. M. Braje. Loading Classical Data into a Quantum Computer. 2018

    2018

  88. [96]

    Kornev and S

    E. Kornev and S. Dolgov and K. Pinto and M. Pflitsch and M. Perelshtein and A. Melnikov. Numerical solution of the incompressible Navier-Stokes equations for chemical mixers via quantum inspired Tensor Train Finite Element Method. 2023

    2023

  89. [97]

    Biamonte and V

    J. Biamonte and V. Bergholm. Quantum Tensor Networks in a Nutshell. 2023

    2023

  90. [98]

    Sato and Y

    Y. Sato and Y. L. Terashima and R. Kondo. Efficient computational homogenization via tensor train format. 2024

    2024

  91. [99]

    J. Eisert. Entanglement and tensor network states. 2013

    2013

  92. [100]

    1996 , isbn =

    Baxter, Martin and Rennie, Andrew , title =. 1996 , isbn =

    1996

  93. [101]

    , title =

    Shreve, Steven E. , title =. 2004 , isbn =

    2004

  94. [102]

    Journal of Political Economy , volume =

    Black, Fischer and Scholes, Myron , title =. Journal of Political Economy , volume =. 1973 , doi =

    1973

  95. [103]

    , title =

    Merton, Robert C. , title =. The Bell Journal of Economics and Management Science , volume =. 1973 , doi =

    1973

  96. [104]

    , title =

    Boyle, Phelim P. , title =. Journal of Financial Economics , volume =. 1977 , doi =

    1977

  97. [105]

    , title =

    Merton, Robert C. , title =. Journal of Financial Economics , volume =. 1976 , doi =

    1976

  98. [106]

    , title =

    Heston, Steven L. , title =. The Review of Financial Studies , volume =. 1993 , doi =

    1993

  99. [107]

    , title =

    Carr, Peter and Madan, Dilip B. , title =. Journal of Computational Finance , volume =. 1999 , doi =

    1999

  100. [108]

    , title =

    Lee, Roger W. , title =. Journal of Computational Finance , volume =. 2004 , doi =

    2004

  101. [109]

    , title =

    Fang, Fang and Oosterlee, Cornelis W. , title =. SIAM Journal on Scientific Computing , volume =. 2008 , doi =

    2008

  102. [110]

    and Sun, Yue and Zoufal, Christa and Iten, Raban and Shen, Ning and Woerner, Stefan , title =

    Stamatopoulos, Nikitas and Egger, Daniel J. and Sun, Yue and Zoufal, Christa and Iten, Raban and Shen, Ning and Woerner, Stefan , title =. Quantum , volume =. 2020 , doi =

    2020

  103. [111]

    , title =

    Chakrabarti, Shouvanik and Krishnakumar, Rajiv and Mazzola, Guglielmo and Stamatopoulos, Nikitas and Woerner, Stefan and Zeng, William J. , title =. Quantum , volume =. 2021 , doi =

    2021

  104. [112]

    2024 , eprint =

    Ewen, Tom , title =. 2024 , eprint =. doi:10.48550/arXiv.2404.14115 , note =

    2024 doi arXiv

  105. [113]

    and Seneta, Eugene , title =

    Madan, Dilip B. and Seneta, Eugene , title =. The Journal of Business , volume =. 1990 , doi =

    1990

  106. [114]

    and Milne, Frank , title =

    Madan, Dilip B. and Milne, Frank , title =. Mathematical Finance , volume =. 1991 , doi =

    1991

  107. [115]

    and Carr, Peter P

    Madan, Dilip B. and Carr, Peter P. and Chang, Eric C. , title =. European Finance Review , volume =. 1998 , doi =

    1998

Pith tools

Reviewed July 31, 2026 · model on record in the stance chip above.