Pith. sign in

REVIEW 5 major objections 6 minor 1 cited by

Encoding of Probability Distributions for Quantum Monte Carlo Using Tensor Networks

T0 review · 5 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read This paper claims that probability distributions can be loaded into quantum circuits with linear circuit depth using tensor-train cross approximation, avoiding the exponential scaling of standard state preparation.

desk verdict A solid incremental benchmark for TT-cross loading of financial distributions, with a genuinely new interleaving ordering, but the accuracy-at-scale claim breaks down around 16 qubits and the paper does not mitigate it. read the letter →

arxiv 2411.11660 v1 pith:PTBA2BCG submitted 2024-11-18 quant-ph

Antonio Pereira , Alba Villarino , Aser Cortines , Samuel Mugel , Roman Orus , Victor Leme Beltran , J.V.S. Scursulim , Samurai Brito This is my paper · ORCID
classification quant-ph MSC 81P68 PACS 03.67.Ac
keywords tensornetworkstensor-traincrossapproximationquantumMonteCarloprobabilityloadingstatepreparationfinancelog-normaldistributioncircuitdepth
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

The paper tackles the probability-loading bottleneck of Quantum Monte Carlo: converting a classical distribution into a quantum state without a classically intractable precomputation. It argues that the tensor-train cross approximation (TT-cross) can do this efficiently for financial log-normal distributions, mapping the resulting tensor train into a quantum circuit with guaranteed convergence and scalable gate count. The central quantitative claim is that circuit depth grows linearly with the number of qubits and training time grows logarithmically with the number of discretization points, while the built-in Grover-Rudolph method grows exponentially. If correct, this gives near-term quantum hardware a practical path for QMC-based financial pricing and risk analysis.

What carries the argument

The tensor-train cross approximation (TT-cross) generalizes matrix cross approximation to high-order tensors by sampling nested index sets and building TT cores with small bond dimensions. A quantization scheme—sequential, mirroring, or interleaving—maps the discretized distribution onto a binary-indexed tensor, and each TT core is then SVD-factorized into a unitary acting on a growing set of qubits, giving a circuit whose depth can be further reduced by merging gates. The interleaving scheme is reported as the most effective for multivariate distributions.

What would settle it

For a distribution with a known high tensor-train rank, such as a sharply multimodal or oscillatory density, measure the minimal bond dimension needed to reach a fixed Kolmogorov-Smirnov error as the number of qubits grows; if that bond dimension grows exponentially, the linear circuit-depth scaling and logarithmic training cost cease to hold for that input class.

Watch

Extended reading notes

Core claim

Using a tensor-train (matrix product state) representation of the discretized probability vector, the TT-cross algorithm finds a low-rank approximation whose cores are converted one by one into unitary gates via singular value decomposition, with a subsequent gate-merging step reducing depth. On univariate log-normal distributions calibrated to real market data the method reaches a Kolmogorov-Smirnov distance of $7.2\times10^{-5}$ at 16 qubits, and on multivariate distributions up to five dimensions the Kullback-Leibler divergence stays near $10^{-2}$ while using up to $2^{50}$ discretization points. The paper's key numerical finding is the scaling gap: circuit depth is linear in qubits versus exponential for the built-in comparison method, and training complexity is logarithmic in the number of points versus linear.

Load-bearing premise

The target distribution must be well approximated by a tensor train with small bond dimensions (roughly 2 to 8); if it is not low-rank, the TT-cross method's accuracy and its linear-depth advantage collapse.

Editorial extensions

If this is right

  • Quantum Monte Carlo on near-term hardware gains a data-loading routine for log-normal and similarly low-rank financial distributions with linear-depth circuits.
  • Larger discretization grids become reachable: up to $2^{50}$ points for five-dimensional distributions were encoded in simulation at training times that scale logarithmically.
  • The interleaving quantization order keeps relative entropy around $10^{-2}$ for up to five dimensions, indicating practical accuracy for multi-asset pricing.
  • A 5-qubit hardware run on a superconducting processor preserves the overall distribution shape, suggesting the encoded states are not immediately destroyed by device noise.

Reading between the lines

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

  • The method's advantage depends on the target distribution having small TT-rank; distributions with long-range correlations or sharp oscillations would require larger bond dimensions, which the paper already observes leads to convergence issues beyond 15 qubits.
  • The same TT-cross pipeline could be applied to other QMC loading tasks—stochastic volatility, credit risk, or physics sampling—provided the quantized tensor is approximately low-rank, a condition the paper tests only for log-normal data.
  • Because the choice of quantization ordering is distribution-dependent, a data-driven heuristic for selecting sequential, mirroring, or interleaving would make the method robust beyond the reported cases.
  • An analytical error bound for the TT-cross truncation and the SVD mapping would let users predict the observed degradation past 15 qubits instead of discovering it empirically.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

5 major / 6 minor

Summary. The paper proposes to solve the probability-loading problem for Quantum Monte Carlo by first approximating a target distribution in tensor-train (TT) form with the TT-cross algorithm, then mapping the resulting TT cores to a quantum circuit using an SVD-based construction. The method is benchmarked on log-normal distributions calibrated to financial data from Itaú Unibanco, for univariate and multivariate cases up to five dimensions. The reported results compare the TT-cross circuit depth and training time with Qiskit's built-in Grover-Rudolph implementation, and include a 5-qubit hardware demonstration on IBM Eagle. The main claims are that the TT-cross approach achieves logarithmic training complexity in the number of discretization points, linear circuit-depth scaling in the number of qubits, and high accuracy for financial distributions.

Significance. If the scaling claims hold, the proposed encoding is a useful state-preparation subroutine for QMC, since it provides a classical, systematically improvable route from a probability distribution to a shallow quantum circuit. The core SVD-based mapping in Section 3 is mathematically standard and appears correct, and the comparison against Qiskit on realistic financial distributions is a practical strength. The use of real market-calibrated data and the hardware experiment are also positive features. However, the accuracy of the encoding saturates and then degrades with increasing qubit count, and the empirical evidence currently lacks statistical error bars and reproducibility details; as a result, the "scalable accuracy" part of the central claim is not yet established.

major comments (5)
  1. [Section 4, Figures 4, 8, 9, 10] The paper's own results show that the KS distance for the univariate log-normal distribution reaches a minimum of 7.2e-5 at 16 qubits and then increases for larger qubit numbers, and that bond dimensions larger than 8 lead to convergence issues beyond about 15 qubits. This is load-bearing for the QMC motivation: in QMC, state-preparation error contributes directly to the bias of the estimated expectation value, so if a QMC discretization error target requires more than roughly 16 qubits, the TT-cross encoding error can grow instead of shrink. The manuscript acknowledges the effect but proposes no mitigation and no error bound, so the claim of high accuracy at scale is unsupported. Please provide an analysis of when the optimal-qubit regime is sufficient for QMC tolerances, or an error-aware rank/truncation strategy that prevents this degradation.
  2. [Section 4, Figures 4, 8, 9, 10] The KS and KL plots and the training-time plots report "average" values without error bars, confidence intervals, number of independent runs, or random seeds. Since TT-cross relies on heuristic index selection and the plots are the main evidence for the logarithmic and linear scaling claims, this missing statistical information makes it impossible to assess run-to-run variability or to determine whether the flat and then increasing KS region is robust. Please include error bars, the number of repetitions, and the exact experimental settings for each curve.
  3. [Section 4] The numerical results are not reproducible as reported. The paper does not give the parameters (mu, sigma) of the log-normal distributions, the domain range, the discretization grid, the TT-cross termination criteria, the truncation tolerance, or the maximum number of sweeps; nor is code or detailed pseudocode for the TT-cross implementation provided. These details are needed to verify the central accuracy and scaling claims, because the observed behavior depends sensitively on these choices. Please add a table of distribution parameters and algorithmic settings, and make the implementation available or provide a complete algorithmic specification.
  4. [Section 2.2 and Section 4] The quantization ordering (sequential, mirroring, interleaving) is selected after observing the results on the same benchmark distributions: the text says mirroring "led to better outcomes" and interleaving "yielded the best outcome." Because the same data are used to choose the ordering and to report the accuracy, the reported KL values are subject to selection bias, and the statement that interleaving is the most effective method is not validated on independent data. Please provide a principled criterion for choosing the ordering, or evaluate the method on held-out distribution families, to support the general claim.
  5. [Section 4 and Section 5] Although the abstract and conclusion frame the contribution as a pathway for Quantum Monte Carlo, no end-to-end QMC experiment is performed. The paper measures encoding fidelity and circuit depth, but does not estimate a financial expectation value with quantum amplitude estimation or another QMC scheme, so the impact of the encoding bias and circuit depth on the final QMC error is not quantified. A concrete QMC example (for example, an expected payoff under the encoded log-normal distribution) would substantiate the claim that the method provides an efficient pathway for QMC.
minor comments (6)
  1. [Section 2.2, Eqs. (2.4), (2.6), (2.8)] The encoding formulas for the multivariate cases write f(x_j, y_l) as amplitudes, whereas Eq. (2.2) uses sqrt(p(x_i)). Please clarify whether f denotes a probability value or an amplitude and adjust the notation consistently.
  2. [Section 3, Algorithm 1] The pseudocode calls "truncate(Sigma)" without specifying the truncation criterion or tolerance. Please define the truncation rule, since it directly controls the bond dimension and the approximation error.
  3. [Section 3, Eq. (3.4) and surrounding text] The notation "2 ^ n1" is nonstandard and hard to parse; please write it as min(2, n1) or use explicit powers of two throughout.
  4. [Section 4, Figures 6 and 7] The hardware experiment is presented only visually. Please report quantitative fidelity measures (for example, KS or KL distance between the measured histogram and the target) for both optimization levels, rather than relying on a qualitative comparison.
  5. [Section 5] The conclusion says "circuit and operation complexity scaling logarithmically with system size," but the results show circuit depth scaling linearly with qubit count and training time scaling logarithmically with the number of discretization points. Please clarify which quantity is meant by "system size" to avoid conflating qubits with grid points.
  6. [Throughout] There are several typographical errors, including "dimesnion" in the Figure 5 caption and "Simrnov" in the KS definition. A careful proofreading pass is needed.

Circularity Check

0 steps flagged · score 2.0 of 10

TT-cross circuit construction is self-contained; minor background self-citations and benchmark-based hyperparameter choice do not constitute circularity.

full rationale

The paper's central derivation is the SVD-based algorithm that maps a tensor-train (TT) representation to a quantum circuit (Eqs. 3.1-3.4, Algorithm 1). This is a constructive equivalence: the unitaries W_k are built from the TT cores via SVD, so the circuit reproduces the TT amplitudes by construction. That is not circular, because the TT is obtained independently by TT-cross approximation (Section 2.1) from the target log-normal distributions, and the accuracy KPIs (KS distance, KL divergence) compare the circuit's output to the original target distribution, not to the TT used in the construction. The complexity claims (logarithmic training time, linear circuit depth vs qubits) are empirical comparisons against Qiskit's Grover-Rudolph implementation (Figures 4, 5, 8-10), not derived by assuming the conclusion. The paper explicitly acknowledges a limitation: 'beyond this point, the precision of the approximation decreases, even when increasing the bond dimension beyond 8' (Figure 4, Section 4), and later states that 'conducting tests on actual quantum hardware would not yield meaningful results' for multivariate cases. These are correctness or hardware limitations, not circularity. Hyperparameters (bond dimension, quantization ordering) are selected after seeing benchmark results, which is a mild selection bias, but the reported losses are not fitted per data point in a way that forces the central claim. The only self-citations are background references [11] (R. Orus) and [13] (Orus et al.) for tensor-network formalism; they are not load-bearing. The TT-to-circuit mapping depends on independent work [15] (Ran) and [16] (Rudolph et al.), and TT-cross on [12] (Oseledets & Tyrtyshnikov). Therefore no specific reduction of a claim to its inputs by definition or self-citation chain was found; score 2 reflects minor non-load-bearing self-citations.

Assumptions & free parameters 4 free parameters · 3 assumptions · 0 invented entities

The paper introduces no new physical or mathematical entities. It combines existing algorithms (TT-cross, MPS-to-circuit) and adds a new quantization ordering (interleaving) for multivariate distributions. The main unstated cost is the low-rank assumption on the target distributions and the undisclosed implementation details.

free parameters (4)
  • Bond dimension = 2, 4, 8, 16, capped at 8 for the main benchmarks
    Chosen by hand per experiment; accuracy and circuit depth depend on it. The paper notes convergence issues above 8 for more than 15 qubits.
  • Number of qubits per dimension = up to 10 per dimension; 5 for the hardware experiment
    Discretization precision, chosen by the authors. It directly affects both approximation accuracy and circuit depth.
  • TT-cross truncation tolerance = not reported
    The algorithm truncates singular values, but the threshold is not given, preventing exact reproduction of the results.
  • Log-normal parameters (mu, sigma) = not disclosed; calibrated from Itaú real market data
    Data inputs rather than method parameters, but they determine the target distribution and are undisclosed, so the accuracy results cannot be independently reproduced.
assumptions (3)
  • domain assumption The target financial distributions admit low-rank tensor-train (MPS) representations with bond dimensions at most 8.
    The scalability and accuracy results depend on log-normal distributions being well approximated at low rank. The paper reports precision degradation beyond 15 qubits, indicating the assumption is fragile.
  • domain assumption TT-cross converges to a good approximation of the full tensor for these distributions.
    TT-cross has no general convergence guarantee for arbitrary tensors; the paper relies on its empirical success on the log-normal benchmark.
  • standard math The MPS-to-quantum-circuit mapping of Ran [15] and Rudolph et al. [16] is correct and implemented faithfully.
    Algorithm 1 is built on these prior constructions without reproving them. The paper inherits their correctness assumptions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Encoding of Probability Distributions for Quantum Monte Carlo Using Tensor Networks." pith.science (2026). https://pith.science/paper/PTBA2BCG

@misc{pith2026241111660,
  author       = {Pith},
  title        = {Pith review of: Encoding of Probability Distributions for Quantum Monte Carlo Using Tensor Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PTBA2BCG}},
  note         = {Machine review of arXiv:2411.11660}
}
read the original abstract

The application of Tensor Networks (TN) in quantum computing has shown promise, particularly for data loading. However, the assumption that data is readily available often renders the integration of TN techniques into Quantum Monte Carlo (QMC) inefficient, as complete probability distributions would have to be calculated classically. In this paper the tensor-train cross approximation (TT-cross) algorithm is evaluated as a means to address the probability loading problem. We demonstrate the effectiveness of this method on financial distributions, showcasing the TT-cross approach's scalability and accuracy. Our results indicate that the TT-cross method significantly improves circuit depth scalability compared to traditional methods, offering a more efficient pathway for implementing QMC on near-term quantum hardware. The approach also shows high accuracy and scalability in handling high-dimensional financial data, making it a promising solution for quantum finance applications.

Figures

Figures reproduced from arXiv: 2411.11660 by the authors.

Figure 1
Figure 1. Linear algebra objects as Tensor Network diagrams. [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Equivalence between a TT and a quantum circuit. The circuit illustrates the [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. “Merging” unitary operations to reduce the depth of the quantum circuit. The [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: Metrics obtained for approximating a univariate Log-Normal distribution: on [PITH_FULL_IMAGE:figures/full_fig_p013_4.png]
Figure 5
Figure 5. Figure 5: The left-hand plot illustrates circuit depth as a function of the number of qubits, [PITH_FULL_IMAGE:figures/full_fig_p013_5.png]
Figure 6
Figure 6. Figure 6: Empirical distribution of the log-normal distribution encoded using the TT-cross [PITH_FULL_IMAGE:figures/full_fig_p014_6.png]
Figure 7
Figure 7. Figure 7: Empirical results of encoding a log-normal distribution in 5 qubits using the TT [PITH_FULL_IMAGE:figures/full_fig_p015_7.png]
Figure 8
Figure 8. Figure 8: Metrics obtained for approximating a bivariate Log-Normal distribution. The [PITH_FULL_IMAGE:figures/full_fig_p016_8.png]
Figure 9
Figure 9. Figure 9: KPIs for approximating multivariate log-normal distributions up to 5 dimen [PITH_FULL_IMAGE:figures/full_fig_p016_9.png]
Figure 10
Figure 10. Figure 10: Circuit depth as a function of the number of qubits per dimension, comparing [PITH_FULL_IMAGE:figures/full_fig_p017_10.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Structure-Aware Variational State Preparation for Quantum Basket Option Pricing

    quant-ph 2026-07 conditional novelty 6.0 of 10

    A basket-CDF-based variational loader cuts quantum state-preparation depth from exponential to linear for basket option pricing, at few-percent simulated pricing error.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages · cited by 1 Pith paper

  1. [1]

    Abbas et al

    A. Abbas et al. Quantum optimization: Potential, challenges, and the path forward, 2023

    work page 2023

  2. [2]

    Alcazar, A

    J. Alcazar, A. Cadarso, A. Katabarwa, M. Mauri, B. Peropadre, G. Wang, and Y. Cao. Quantum algorithm for credit valuation ad- justments. New Journal of Physics , 24(2):023036, Feb. 2022

    work page 2022

  3. [3]

    Bigoni, A

    D. Bigoni, A. P. Engsig-Karup, and Y. M. Marzouk. Spectral tensor-train decomposition. SIAM Journal on Scientific Computing , 38(4):A2405–A2439, 2016

    work page 2016

  4. [4]

    Brassard, P

    G. Brassard, P. Hyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation, 2002

    work page 2002

  5. [5]

    Gorodetsky, S

    A. Gorodetsky, S. Karaman, and Y. Marzouk. A continuous analogue of the tensor-train decomposition. Computer Methods in Applied Me- chanics and Engineering , 347:59–84, 2019

    work page 2019

  6. [6]

    A. A. Gorodetsky and J. D. Jakeman. Gradient-based optimization for regression in the functional tensor-train format. Journal of Computa- tional Physics , 374:1219–1238, 2018

    work page 2018

  7. [7]

    Grover and T

    L. Grover and T. Rudolph. Creating superpositions that correspond to efficiently integrable probability distributions, 2002

    work page 2002

  8. [8]

    S. Herbert. No quantum speedup with grover-rudolph state preparation for quantum monte carlo integration. Physical Review E , 103(6), June 2021

    work page 2021

Show all 20 references
  1. [9]

    Ibm unveils breakthrough 127-qubit quantum processor, Novem- ber 2021

    IBM. Ibm unveils breakthrough 127-qubit quantum processor, Novem- ber 2021. 19

    2021

  2. [10]

    Novikov, D

    A. Novikov, D. Podoprikhin, A. Osokin, and D. Vetrov. Tensorizing neural networks, 2015

    2015

  3. [11]

    R. Ors. A practical introduction to tensor networks: Matrix prod- uct states and projected entangled pair states. Annals of Physics , 349:117158, Oct. 2014

    2014

  4. [12]

    Oseledets and E

    I. Oseledets and E. Tyrtyshnikov. TT-cross approximation for multi- dimensional arrays. Linear Algebra and its Applications , 432(1):70–88, 2010

    2010

  5. [13]

    Patra, S

    S. Patra, S. S. Jahromi, S. Singh, and R. Orus. Efficient tensor network simulation of ibm’s largest quantum processors, 2024

    2024

  6. [14]

    R. Pracht. Quantum binomial tree, an effective method for probability distribution loading for derivative pricing. npj Quantum Information , 2022

    2022

  7. [15]

    S.-J. Ran. Encoding of matrix product states into quantum circuits of one- and two-qubit gates. Physical Review A , 101(3), Mar. 2020

    2020

  8. [16]

    M. S. Rudolph, J. Chen, J. Miller, A. Acharya, and A. Perdomo-Ortiz. Decomposition of matrix product states into shallow quantum circuits, 2022

    2022

  9. [17]

    Sakaue, H

    K. Sakaue, H. Shinaoka, and R. Sakurai. Learning tensor trains from noisy functions with application to quantum simulation, 2024

    2024

  10. [18]

    T. L. Scholten, C. J. Williams, D. Moody, M. Mosca, W. Hurley, W. J. Zeng, M. Troyer, and J. M. Gambetta. Assessing the benefits and risks of quantum computers, 2024

    2024

  11. [19]

    Woerner and D

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

    2019

  12. [20]

    Zoufal, A

    C. Zoufal, A. Lucchi, and S. Woerner. Quantum generative adversarial networks for learning and loading random distributions. npj Quantum Information, 5(1), Nov. 2019. 20

    2019

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.