pith. sign in

arxiv: 2504.13532 · v1 · submitted 2025-04-18 · 🪐 quant-ph · cs.CV· q-fin.PR

Quantum Walks-Based Adaptive Distribution Generation with Efficient CUDA-Q Acceleration

Yen-Jui Chang , Wei-Ting Wang , Chen-Yu Liu , Yun-Yuan Wang , Ching-Ray Chang This is my paper

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

classification 🪐 quant-ph cs.CVq-fin.PR
keywords quantum walksdistribution generationvariational quantum circuitssplit-step quantum walksentangled quantum walksCUDA-Q accelerationprobability distributionsquantum simulation
0
0 comments X

The pith

Quantum walks generate target probability distributions by variationally tuning coin parameters in split-step and entangled walks.

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

The paper introduces an adaptive generator that combines discrete-time quantum walks with variational quantum circuits to produce specific probability distributions. Split-step quantum walks and their entangled extensions serve as the base evolution, while coin parameters are tuned dynamically to steer the quantum state toward a chosen target. Demonstrations cover one-dimensional distributions for financial simulations and two-dimensional patterns such as handwritten digits from 0 to 9. The entire method is implemented inside the CUDA-Q framework to exploit GPU acceleration for faster execution and better scaling than classical approaches. The central result is that this tuning process reaches high fidelity between the generated and desired distributions.

Core claim

By integrating variational quantum circuits with split-step quantum walks and their entangled extensions, coin parameters can be tuned to direct quantum-state evolution toward arbitrary target probability distributions, yielding accurate one-dimensional and two-dimensional outputs that are accelerated on GPUs via the CUDA-Q framework.

What carries the argument

Variational tuning of coin parameters inside split-step and entangled discrete-time quantum walks, which steers the quantum state evolution to reproduce chosen target probability distributions.

If this is right

  • One-dimensional distributions can be generated for financial simulation tasks with high fidelity.
  • Two-dimensional structured patterns, including digit representations from 0 to 9, can be produced accurately.
  • Computational overhead drops and scalability improves relative to conventional classical methods through CUDA-Q GPU acceleration.
  • The same variational-walk framework can be applied to other probability-modeling problems that require precise sampling.

Where Pith is reading between the lines

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

  • The method may extend to higher-dimensional distributions if the walk lattice and coin operators are generalized accordingly.
  • Hybrid use with other quantum simulators could further reduce the number of variational iterations needed for convergence.
  • The fidelity achieved on digit patterns suggests possible applications in quantum-assisted generative modeling for image data.

Load-bearing premise

Variational tuning of coin parameters in split-step and entangled quantum walks can reliably drive quantum-state evolution to match arbitrary target distributions with high precision across the tested 1D and 2D cases.

What would settle it

Execute the generator on a known target distribution such as a standard normal in 1D or a digit image in 2D and check whether the output probabilities deviate from the target by more than a small threshold, for example 0.01 in total variation distance.

read the original abstract

We present a novel Adaptive Distribution Generator that leverages a quantum walks-based approach to generate high precision and efficiency of target probability distributions. Our method integrates variational quantum circuits with discrete-time quantum walks, specifically, split-step quantum walks and their entangled extensions, to dynamically tune coin parameters and drive the evolution of quantum states towards desired distributions. This enables accurate one-dimensional probability modeling for applications such as financial simulation and structured two-dimensional pattern generation exemplified by digit representations(0~9). Implemented within the CUDA-Q framework, our approach exploits GPU acceleration to significantly reduce computational overhead and improve scalability relative to conventional methods. Extensive benchmarks demonstrate that our Quantum Walks-Based Adaptive Distribution Generator achieves high simulation fidelity and bridges the gap between theoretical quantum algorithms and practical high-performance computation.

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

Summary. The manuscript proposes a Quantum Walks-Based Adaptive Distribution Generator that integrates variational quantum circuits with discrete-time split-step quantum walks and their entangled extensions. Coin parameters are dynamically tuned to evolve initial quantum states toward target probability distributions, with applications to 1D financial modeling and 2D digit pattern generation (0-9). The approach is implemented in the CUDA-Q framework to leverage GPU acceleration, and the abstract asserts that extensive benchmarks demonstrate high simulation fidelity.

Significance. If the fidelity claims hold under independent validation, the work could provide a practical route to distribution generation that combines quantum-walk dynamics with classical high-performance computing, potentially offering advantages in structured or high-dimensional sampling tasks. No machine-checked proofs or parameter-free derivations are presented, so credit is limited to the reported CUDA-Q implementation and benchmark claims.

major comments (2)
  1. Abstract: the central claim that variational tuning of coin parameters 'dynamically' reaches arbitrary target distributions lacks any reported analysis of the reachable set of probability distributions or optimization convergence rates; the nonlinear dependence of final position probabilities on powers of the walk operator makes this a load-bearing assumption that requires explicit bounds or success-rate statistics.
  2. Abstract: no quantitative fidelity metrics, error bars, baseline comparisons, or exclusion criteria for the 1D and 2D test cases are supplied, preventing verification that the method outperforms or even matches conventional samplers on the claimed financial and digit-generation tasks.
minor comments (1)
  1. Abstract: the phrasing 'digit representations(0~9)' contains a missing space and does not clarify whether the 2D patterns are generated on a grid or via some embedding of the walk.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for their careful reading and constructive comments. We address each major comment below and indicate the changes we will incorporate in the revised manuscript.

read point-by-point responses

  1. Referee: Abstract: the central claim that variational tuning of coin parameters 'dynamically' reaches arbitrary target distributions lacks any reported analysis of the reachable set of probability distributions or optimization convergence rates; the nonlinear dependence of final position probabilities on powers of the walk operator makes this a load-bearing assumption that requires explicit bounds or success-rate statistics.

    Authors: We agree that the abstract does not contain a theoretical analysis of the reachable set or convergence rates. The manuscript instead reports empirical results from variational optimization on concrete 1D and 2D targets. In the revised version we will add observed success rates and convergence statistics from the benchmark runs to the abstract and results section. A complete mathematical characterization of the reachable set under repeated application of the walk operator is not derived in the present work. revision: partial

  2. Referee: Abstract: no quantitative fidelity metrics, error bars, baseline comparisons, or exclusion criteria for the 1D and 2D test cases are supplied, preventing verification that the method outperforms or even matches conventional samplers on the claimed financial and digit-generation tasks.

    Authors: Detailed fidelity values, standard deviations across runs, comparisons against classical samplers, and descriptions of the 1D financial and 2D digit test cases appear in the Results section with accompanying tables and figures. To improve the abstract we will insert the principal quantitative outcomes (average fidelity and baseline comparison summary) while retaining conciseness. revision: yes

standing simulated objections not resolved
  • A rigorous theoretical analysis establishing the reachable set of probability distributions and explicit bounds on convergence for the variational coin-parameter tuning.

Circularity Check

0 steps flagged

No circularity: method is a parameterized simulator validated by benchmarks

full rationale

The paper describes a variational tuning procedure inside split-step and entangled quantum walks to match target distributions, followed by CUDA-Q benchmarks showing high fidelity. No derivation chain is presented in which a claimed first-principles prediction or uniqueness result is shown to reduce, by the paper's own equations, to a fitted parameter or to a self-citation whose content is itself unverified. The central claim is therefore an empirical demonstration of a computational technique rather than a self-referential mathematical identity.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review yields no identifiable free parameters, axioms, or invented entities; the central claim rests on unstated assumptions about the expressivity of quantum-walk coin tuning.

pith-pipeline@v0.9.0 · 5666 in / 1030 out tokens · 53673 ms · 2026-05-22T19:25:50.667416+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

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

  1. [1]

    International Journal of The- oretical Physics 21(6/7), 467–488 (1982) https://doi.org/10.1007/BF02650179

    Feynman, R.: Simulating physics with computers. International Journal of The- oretical Physics 21(6/7), 467–488 (1982) https://doi.org/10.1007/BF02650179

    work page doi:10.1007/bf02650179 1982

  2. [2]

    Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A 48, 1687–1690 (1993) https://doi.org/10.1103/PhysRevA.48.1687

    work page doi:10.1103/physreva.48.1687 1993

  3. [3]

    Cambridge University Press, Cambridge, UK (2000)

    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK (2000). https://doi.org/10.1017/ CBO9780511976667

    work page 2000

  4. [4]

    Childs, A.M.: Universal computation by quantum walk. Phys. Rev. Lett. 102, 180501 (2009) https://doi.org/10.1103/PhysRevLett.102.180501 14

    work page doi:10.1103/physrevlett.102.180501 2009

  5. [5]

    A Quantum Approximate Optimization Algorithm

    Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algo- rithm. arXiv preprint arXiv:1411.4028 (2014) https://doi.org/10.48550/arXiv. 1411.4028

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv 2014

  6. [6]

    Universal quantum simulators

    Lloyd, S.: Universal quantum simulators. Science 273, 1073–1078 (1996) https: //doi.org/10.1126/science.273.5278.1073

    work page doi:10.1126/science.273.5278.1073 1996

  7. [7]

    Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58, 915–928 (1998) https://doi.org/10.1103/PhysRevA.58.915

    work page doi:10.1103/physreva.58.915 1998

  8. [8]

    Theoretical Computer Science 560, 7–11 (2014) https://doi.org/10

    Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. Theoretical Computer Science 560, 7–11 (2014) https://doi.org/10. 1016/j.tcs.2014.05.025

    work page 2014

  9. [9]

    Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factor- ing. Proc. 35th Annual Symposium on Foundations of Computer Science, 124–134 (1994) https://doi.org/10.1109/SFCS.1994.365700

    work page doi:10.1109/sfcs.1994.365700 1994

  10. [10]

    Quantum Sci

    Benedetti, M., Lloyd, E., Sack, S., Fiorentini, M.: Parameterized quantum circuits as machine learning models. Quantum Sci. Technol. 4, 043001 (2019) https://doi. org/10.1088/2058-9565/ab4eb5

    work page doi:10.1088/2058-9565/ab4eb5 2019

  11. [11]

    Quantum Inf

    Venegas-Andraca, S.E.: Quantum walks: a comprehensive review. Quantum Inf. Process. 11, 1015–1106 (2012) https://doi.org/10.1007/s11128-012-0432-5

    work page doi:10.1007/s11128-012-0432-5 2012

  12. [12]

    IEEE Access 8, 141007–141024 (2020) https://doi.org/10.1109/ACCESS.2020.3010470

    Chen, S.Y.C., Yang, C.H.H., Qi, J., Chen, P.Y., Ma, X., Goan, H.S.: Variational quantum circuits for deep reinforcement learning. IEEE Access 8, 141007–141024 (2020) https://doi.org/10.1109/ACCESS.2020.3010470

    work page doi:10.1109/access.2020.3010470 2020

  13. [13]

    In: Advanced Intelligent Computing Technology and Applications

    Chen, K.C., Xu, X., Makhanov, H., Chung, H.H., Liu, C.Y.: Quantum-enhanced support vector machine for large-scale multi-class stellar classification. In: Advanced Intelligent Computing Technology and Applications. ICIC 2024. Lec- ture Notes in Computer Science, vol. 14871, pp. 155–168. Springer, Tianjin, China, (2024). https://doi.org/10.1007/978-981-97-5609-4 12

    work page doi:10.1007/978-981-97-5609-4 2024

  14. [14]

    Quantum Machine Intelligence 6(1), 2 (2024) https://doi.org/10.1007/s42484-023-00137-w

    Chen, H.-Y., Chang, Y.-J., Liao, S.-W., Chang, C.-R.: Deep q-learning with hybrid quantum neural network on solving maze problems. Quantum Machine Intelligence 6(1), 2 (2024) https://doi.org/10.1007/s42484-023-00137-w

    work page doi:10.1007/s42484-023-00137-w 2024

  15. [15]

    Dubey, Christian Ufrecht, Maniraman Periyasamy, Axel Plinge, Christopher Mutschler & Daniel D

    Liu, C.Y., Kuo, E.J., Lin, C.H.A., Chen, S., Young, J.G., Chang, Y.J., Hsieh, M.H.: Training classical neural networks by quantum machine learning. In: Proc. IEEE Int. Conf. Quantum Computing and Engineering (QCE), p. 18 (2024). https://doi.org/10.1109/QCE60285.2024.10248

    work page doi:10.1109/qce60285.2024.10248 2024

  16. [16]

    Creating superpositions that correspond to efficiently integrable probability distributions

    Grover, L., Rudolph, T.: Creating superpositions that correspond to efficiently integrable probability distributions. arXiv preprint quant-ph/0208112 (2002) https://doi.org/10.48550/arXiv.quant-ph/0208112 15

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.quant-ph/0208112 2002

  17. [18]

    npj Quantum Information 4, 28 (2018) https:// doi.org/10.1038/s41534-018-0077-z

    Rocchetto, A., Grant, E., Strelchuk, S.e.a.: Learning hard quantum distributions with variational autoencoders. npj Quantum Information 4, 28 (2018) https:// doi.org/10.1038/s41534-018-0077-z

    work page doi:10.1038/s41534-018-0077-z 2018

  18. [19]

    npj Quantum Information 5, 103 (2019) https://doi.org/10.1038/s41534-019-0224-2

    Zoufal, C., Lucchi, A., Woerner, S.: Quantum generative adversarial networks for learning and loading random distributions. npj Quantum Information 5, 103 (2019) https://doi.org/10.1038/s41534-019-0224-2

    work page doi:10.1038/s41534-019-0224-2 2019

  19. [20]

    Zhang, X.-M., Li, T., Yuan, X.: Quantum state preparation with optimal circuit depth: Implementations and applications. Phys. Rev. Lett. 129, 230504 (2022) https://doi.org/10.1103/PhysRevLett.129.230504

    work page doi:10.1103/physrevlett.129.230504 2022

  20. [21]

    npj Quantum Information 10, 15 (2024) https://doi.org/10.1038/s41534-024-00805-0

    Iaconis, J., Johri, S., Zhu, E.Y.: Quantum state preparation of normal distri- butions using matrix product states. npj Quantum Information 10, 15 (2024) https://doi.org/10.1038/s41534-024-00805-0

    work page doi:10.1038/s41534-024-00805-0 2024

  21. [22]

    : Variational quantum algo- rithms

    Cerezo, M., Arrasmith, A., Babbush, R., et al. : Variational quantum algo- rithms. Nature Reviews Physics 3, 625–644 (2021) https://doi.org/10.1038/ s42254-021-00348-9

    work page 2021

  22. [23]

    Quantum Inf

    Matsuzawa, Y.: An index theorem for split-step quantum walks. Quantum Inf. Process. 19, 227 (2020) https://doi.org/10.1007/s11128-020-02720-7

    work page doi:10.1007/s11128-020-02720-7 2020

  23. [24]

    Quantum Mach

    Chang, Y.-J., Wang, W.-T., Chen, H.-Y., Liao, S.-W., Chang, C.-R.: A novel approach for quantum financial simulation and quantum state preparation. Quantum Mach. Intell. 6, 24 (2024) https://doi.org/10.1007/s42484-024-00160-5

    work page doi:10.1007/s42484-024-00160-5 2024

  24. [25]

    Primer: Fast private transformer inference on encrypted data

    Kim, J.-S., McCaskey, A., Heim, B., Modani, M., Stanwyck, S., Costa, T.: CUDA quantum: The platform for integrated quantum-classical computing. In: Proc. 60th ACM/IEEE Design Autom. Conf. (DAC), pp. 1–4 (2023). https://doi.org/ 10.1109/DAC56929.2023.10247886

    work page doi:10.1109/dac56929.2023.10247886 2023

  25. [26]

    Quantum Sci

    Parl, P.e.a.: Quantum state preparation via variational solvers. Quantum Sci. Technol. 6, 045008 (2021) https://doi.org/10.1088/2058-9565/abcc68

    work page doi:10.1088/2058-9565/abcc68 2021

  26. [27]

    Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits

    Yuan, P., Sheng, Y.: Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits. Quantum 7, 956 (2023) https://doi.org/10.22331/q-2023-03-20-956

    work page doi:10.22331/q-2023-03-20-956 2023

  27. [28]

    Dubey, Christian Ufrecht, Maniraman Periyasamy, Axel Plinge, Christopher Mutschler & Daniel D

    Chang, Y.-J., Chen, H.-Y., Lu, Y.C., Yu, L.-P., Fu, C.-M., Chang, C.-R.: Quantum-inspired acceleration for image reconstruction on ising machines. In: Proceedings of the 2024 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 2, pp. 547–548. IEEE, Montreal, Canada (2024). 16 https://doi.org/10.1109/QCE60285.2024.10398

    work page doi:10.1109/qce60285.2024.10398 2024

  28. [29]

    Almudever, and Sebastian Feld

    Bayraktar, H., Charara, A., Clark, D., Cohen, S., Costa, T., Fang, Y.-L.L., Gao, Y., Guan, J., Gunnels, J., Haidar, A., Hehn, A., Hohnerbach, M., Jones, M., Lubowe, T., Lyakh, D., Morino, S., Springer, P., Stanwyck, S., Terentyev, I., Varadhan, S., Wong, J., Yamaguchi, T.: cuquantum sdk: A high-performance library for accelerating quantum science. In: 202...

    work page doi:10.1109/qce57702.2023.00119 2023

  29. [30]

    Chandrashekar, C.M.: Two-dimensional quantum walks: Hitting times and topological phases. Phys. Rev. A 83, 022320 (2011) https://doi.org/10.1103/ PhysRevA.83.022320

    work page 2011

  30. [31]

    Scientific Reports 6, 25779 (2016) https://doi.org/10.1038/srep25779

    Mallick, A., Chandrashekar, C.M.: Dirac cellular automaton from split-step quan- tum walk. Scientific Reports 6, 25779 (2016) https://doi.org/10.1038/srep25779

    work page doi:10.1038/srep25779 2016

  31. [32]

    & Scholes, M

    Black, F., Scholes, M.: The pricing of options and corporate liabilities. Journal of Political Economy 81(3), 637–654 (1973) https://doi.org/10.1086/260062

    work page doi:10.1086/260062 1973

  32. [33]

    American Mathematical Society (2002)

    Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. American Mathematical Society (2002). https://doi.org/10.1090/ conm/305/05215

    work page 2002

  33. [34]

    Rebentrost, P., Gupt, B., Bromley, T.R.: Quantum computational finance: Monte carlo pricing of financial derivatives. Phys. Rev. A 98(2), 022321 (2018) https: //doi.org/10.1103/PhysRevA.98.022321

    work page doi:10.1103/physreva.98.022321 2018

  34. [35]

    Quantum 4, 291 (2020) https:// doi.org/10.22331/q-2020-07-06-291 17

    Stamatopoulos, N., Egger, D., Sun, Y., Zoufal, C., Iten, R., Shen, N., Woerner, S.: Option pricing using quantum computers. Quantum 4, 291 (2020) https:// doi.org/10.22331/q-2020-07-06-291 17

    work page doi:10.22331/q-2020-07-06-291 2020