Pith. sign in

REVIEW 3 major objections 3 minor 45 references

Quantum-Circuit-Based Visual Fractal Image Generation in Qiskit and Analytics

T0 review · 3 major / 3 minor · reviewed 2026-08-05 · deepseek-v4-flash

Pith's one-line read Measurement probabilities from a four-qubit circuit seed Julia-set parameters, generating 1000 fractal images that cluster into three visual families.

desk verdict A visually nice pipeline whose central claim—quantum randomness driving the fractals—is unverifiable as written, because the mapping from circuit outputs to Julia parameters is never given. read the letter →

arxiv 2508.18835 v1 pith:4V6LJYTI submitted 2025-08-26 quant-ph cs.CV

classification quant-phcs.CV
keywords quantumcircuitsJuliasetsfractalimagegenerationrandomnesssuperpositionandentanglementsyntheticdatasetunsupervisedclusteringanalytics
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

Quantum randomness, as realized by measuring a four-qubit circuit many times, is used as the seed for generating Julia-set fractal images. The paper generates 1000 images this way, stores their parameters and computed features in metadata, and shows that unsupervised clustering splits them into three groups that differ mainly in lacunarity and rendering power rather than in fractal dimension. The point of the exercise is to demonstrate that a quantum circuit can serve as a controllable source of variation for synthetic image datasets and generative art, and that the resulting dataset has recoverable structure.

What carries the argument

The load-bearing object is the randomized four-qubit measurement circuit: its shot statistics supply quantum randomness that is fed into the Julia-set parameters. The paper uses a superposition-and-entanglement circuit over four qubits, measured with 2048 simulator shots; the resulting probability distribution is the seed that perturbs the complex constant c in the Julia iteration z_{n+1}=z_n^2+c. Escape-time iteration with smoothing (via 'nu' and normalization) turns each parameter choice into a smoothly colored fractal image, and the same pipeline is extended to GHZ-, Grover-like, and Shor-like circuits on 10 qubits.

What would settle it

A concrete test: take the exact four-qubit circuit, replace its measured probabilities with draws from a classical pseudorandom generator matched to the same marginal distributions, and regenerate the 1000 images; if the resulting dataset and its three clusters are statistically indistinguishable from the quantum-seeded one, then quantum randomness is not load-bearing. Alternatively, locating the missing mapping in the code: if the shot-to-parameter function is not defined, the pipeline cannot be reproduced and there is no quantum-specific content to test.

Watch

Extended reading notes

Core claim

The paper's central claim is that a randomized four-qubit quantum circuit, built from Hadamard, rotation, and CNOT gates, can drive Julia-set image generation: the 2048-shot measurement probabilities from the circuit are taken to 'gently disturb' the complex constant c (and related parameters) that controls the Julia iteration zn+1 = zn^2 + c. From 1000 such images, with escape-time rendering and smooth gradients, the pipeline extracts two fractal features—fractal dimension and lacunarity—and, after PCA, applies K-means clustering. The result is a three-cluster structure: dense, low-lacunarity images dominate; sparse dendritic images are rare; intermediate structures are rarest. The analysis

Load-bearing premise

Load-bearing premise: the mapping from circuit measurement probabilities to the Julia parameters (c_real, c_imag, power, depth) exists and is what makes the generated images 'quantum'; if that mapping is arbitrary, undisclosed, or equivalent to a classical random seed, the paper's central novelty collapses.

Editorial extensions

If this is right

  • A quantum circuit can act as a practical generator for a large synthetic image dataset, complete with metadata, without requiring a physical quantum device.
  • Unsupervised analytics on such datasets is viable: K-means on PCA-reduced fractal features recovers three interpretable clusters, so quantum-seeded fractals are not noise-like but have latent structure.
  • Because fractal dimension is nearly constant across clusters while lacunarity and power separate them, the visual diversity of the quantum-generated images is carried by texture, gaps, and rendering intensity rather than by overall space-filling dimension.
  • The extension to GHZ-, Grover-like, and Shor-like circuits indicates that different circuit families imprint different visual landscapes—periodic, stable-basin, and chaotic-like—suggesting circuit design itself is a tunable artistic parameter.
  • The approach positions simulation-shot randomness as a candidate ingredient for quantum generative art and for synthetic data pipelines in image-oriented machine-learning tasks.

Reading between the lines

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

  • The paper never specifies the function that maps shot counts or probabilities to c_real, c_imag, power, and depth; until that mapping is published, the 'quantum' step is not distinguishable from a classical pseudorandom seed. My inference: a control experiment rerunning the pipeline with a classical RNG is the direct test of the novelty claim.
  • The reported perfect anti-correlation between c_real and c_imag and the near-constant fractal dimension suggest the generative pipeline actually samples a low-dimensional slice of parameter space; the '1000 images' may therefore represent a smaller family of distinct fractals than the count suggests.
  • Since clustering separates on lacunarity and power, a natural next step is to check whether raw-pixel classifiers or multifractal spectra recover the same three classes, or whether the cluster structure is an artifact of the rendering process rather than the quantum parameters.
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 / 3 minor

Summary. The paper claims a novel pipeline: Qiskit quantum circuits (four qubits, 2048 simulator shots) are used to produce 'quantum randomness' that seeds parameters of Julia-set fractal generation (c_real, c_imag, power, depth). One thousand images and a metadata CSV are generated; fractal dimension and lacunarity are extracted, followed by PCA and K-means clustering, yielding three clusters. The stated contribution is quantum-circuit-based generation of a synthetic fractal image dataset with classifiable structure. The manuscript contains a workflow diagram, sample circuit/density-matrix/Bloch-sphere visualizations, example images, and descriptive analytics, but it does not ship code, data, or a precise generative mapping.

Significance. If the missing mapping were supplied and validated, the pipeline would be a modest but legitimate demonstration of quantum measurement randomness seeding a synthetic image dataset, with potential interest for quantum generative art. The paper deserves credit for presenting an end-to-end visual pipeline (Figs. 1-16) and for using standard Julia iteration (Eq. 1) with PCA/K-means analytics. However, the quantum component is currently indistinguishable from a classical random seed, no reproducibility artifacts are provided, and the reported parameter relationships contain unexplained artifacts. The significance is therefore prospective, not established.

major comments (3)
  1. [Section III, Figs. 2-3] The central generation step is never specified. The text states only that 2048-shot quantum probabilities 'gently disturb' the Julia shape determined by c, but no equation or algorithm maps the 16 measurement-count outcomes (or the seed/probs_sha1 columns shown in Table I) to c_real, c_imag, power, and depth. Without this mapping, the paper cannot support the central claim that circuit randomness rather than a classical pseudo-random generator produced the images, and the work is not reproducible from the manuscript. This gap is load-bearing: every image and every downstream cluster depends on the unspecified function.
  2. [Fig. 8 and Table I] The reported exactly -1 correlation between c_real and c_imag is unexplained and is a red flag for the 'quantum randomness' claim. A measure-zero coincidence for 1000 independent draws would require exact linear dependence; the authors' parenthetical 'perhaps as a result of standardization or dataset design' admits as much, but no standardization or construction is described. Table I adds further confusion: power_x values are ~10^10 while power_y is always 2; the PCA columns (PC1/PC2 vs pca1/pca2) are duplicated; and the row 'Cluster' (2,1,2) contradicts the row 'cluster_label' (2,1,0). These inconsistencies make the parameter semantics unclear.
  3. [Section III.A, Figs. 14-16] The K-means clustering is purely descriptive: there is no silhouette/gap/validity measure, no statement of preprocessing/standardization, and no connection of cluster membership back to the quantum circuit parameters. The claim that 'dense, low-lacunarity structures are favored' and that 'the parameter space for intermediate structures is small' is an interpretation of the same data used to build the clusters, not an independent finding. The cluster labels in Table I/II also do not align with the reported visual characterizations (e.g., Cluster 0 and Cluster 2 have nearly identical fractal dimension).
minor comments (3)
  1. [Table I] Formatting and column semantics need cleanup: duplicate pca columns, inconsistent cluster labels, and illegible large exponents should be resolved. A caption should define every column, especially power_x vs power_y and probs_sha1.
  2. [Section V, Fig. 17] The GHZ/Grover-like/Shor-like extension is presented without any methodology, circuit definitions, or quantitative analysis; the Conclusion itself uses 'prima facie.' Either remove or substantiate with actual experiments and metrics.
  3. [Throughout] The manuscript has numerous grammar and typographical issues (e.g., 'the root where lies to the using', 'C_real and C_imag indicates', 'The' alone on a line). Reference [17] appears to be mis-cited for the Penrose impossible-figures work. A careful language and reference pass is needed regardless of the technical revisions.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity found; the main gap is an unspecified parameter mapping, a reproducibility/novelty issue rather than a circular derivation.

full rationale

The paper's derivation chain is descriptive rather than inferential. The only mathematical equation is the standard Julia iteration Zn+1 = Zn^2 + c (Eq. 1), and no parameter is fitted to a target or used to predict a held-out quantity. The claimed novelty is that Qiskit circuit measurement probabilities and shots influence the Julia parameters (c_real, c_imag, power, depth), but the exact mapping from the 2048-shot outcome distribution to these parameters is never specified. This is an under-specified, unreproducible generative scheme, not a circular reduction: the generated images are outputs of the procedure, not inputs used to define the procedure. Similarly, the K-means/PCA clustering is applied to features extracted from the already-generated images, and the resulting clusters are descriptive summaries of the same dataset; the paper does not claim that these clusters validate the quantum generation method against an external benchmark. There are no load-bearing self-citations, no imported uniqueness theorems, and no fitted parameter renamed as a prediction. The observed exact c_real/c_imag correlation of -1 and the unusual power values suggest possible construction constraints, but that concerns data-generation validity rather than circularity. Overall, the central claim may be weak or incomplete, but it does not reduce to its own inputs by construction.

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

The pipeline's scientific content rests on hand-chosen parameter ranges and an unstated mapping from circuit probabilities to Julia parameters. The only background mathematics is the standard Julia iteration; the 'quantum' contribution is a simulator-based random seed, not a new physical mechanism.

free parameters (3)
  • Julia constant c ranges = c_real ~ -0.73 to -0.67, c_imag ~ 0.24 to 0.30 (from Table I sample)
    Hand-picked to make visually appealing Julia sets; the quantum circuit is not shown to determine these ranges.
  • Qiskit shots = 2048
    Chosen for the measurement step; no justification given for this sample count.
  • power and depth = power ~1e10, depth 2-4
    Smoothing and iteration parameters in the fractal renderer; values are stated in Table I but their selection rule is not given.
assumptions (3)
  • standard math The Julia set iteration Z_{n+1}=Z_n^2+c with escape-time criterion generates valid fractals.
    Used in Section II, Eq. (1); standard complex dynamics.
  • domain assumption Qiskit simulator measurement outcomes are treated as a source of quantum randomness.
    Section III uses 2048 shots of a simulated circuit; a simulator is classical, so the 'quantum' character of the randomness is assumed, not demonstrated.
  • ad hoc to paper Entanglement visible in the density matrix (Fig. 5) materially influences the generated fractal patterns.
    The paper infers entanglement from off-diagonal density matrix elements but provides no controlled comparison showing that entanglement changes the output images.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum-Circuit-Based Visual Fractal Image Generation in Qiskit and Analytics." pith.science (2026). https://pith.science/paper/4V6LJYTI

@misc{pith2026250818835,
  author       = {Pith},
  title        = {Pith review of: Quantum-Circuit-Based Visual Fractal Image Generation in Qiskit and Analytics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4V6LJYTI}},
  note         = {Machine review of arXiv:2508.18835}
}
read the original abstract

As nature is ascribed as quantum, the fractals also pose some intriguing appearance which is found in many micro and macro observable entities or phenomena. Fractals show self-similarity across sizes; structures that resemble the entire are revealed when zoomed in. In Quantum systems, the probability density or wavefunction may exhibit recurring interference patterns at various energy or length scales. Fractals are produced by basic iterative rules (such as Mandelbrot or Julia sets), and they provide limitless complexity. Despite its simplicity, the Schr\"odinger equation in quantum mechanics produces incredibly intricate patterns of interference and entanglement, particularly in chaotic quantum systems. Quantum computing, the root where lies to the using the principles of quantum-mechanical phenomenon, when applied in fractal image generation, what outcomes are expected? The paper outlines the generation of a Julia set dataset using an approach coupled with building quantum circuit, highlighting the concepts of superposition, randomness, and entanglement as foundational elements to manipulate the generated dataset patterns. As Quantum computing is finding many application areas, the possibility of using quantum circuits for fractal Julia image generation posits a unique direction of future research where it can be applied to quantum generative arts across various ecosystems with a customised approach, such as producing an exciting landscape based on a quantum art theme.

Figures

Figures reproduced from arXiv: 2508.18835 by the authors.

Figure 1
Figure 1. A sample quantum Julia randomness-derived imageset with a different colormap [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Flow chart of a quantum circuit-based Julia random image generation algorithm II. BACKGROUND Researchers and artists are already using quantum computation as an analytical tool or a creative tool [10]. Similarly, AI and quantum experiments were used in data-driven installations such as Refik Anadol's Quantum Memories (NGV Triennial 2020). Refik Anadol created a massive immersive video sculpture by using a neural net… view at source ↗
Figure 3
Figure 3. Four-qubit system quantum circuit with different H, Rx, Ry, Rz, and CNOT gates [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (14 more)
Figure 4
Figure 4. Figure 4: Four-qubit quantum sample circuit based multti-vector plot [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: State city map of a sample quantum circuit of four qubits [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]
Figure 6
Figure 6. Figure 6: Bloch vector of the quantum circuit Plot_bloch_vector() in Qiskit is used to visualize this Bloch sphere, which is the final state of a single qubit following the application of the quantum circuit. The XY-plane position resulted from the last entanglement and rotation…
Figure 7
Figure 7. Figure 7: Sample three generated images from the dataset with different qubit systems and fractal rendering [PITH_FULL_IMAGE:figures/full_fig_p007_7.png]
Figure 8
Figure 8. Figure 8: Correlation heatmap matrix of parameters and fractal features of the generated dataset [PITH_FULL_IMAGE:figures/full_fig_p008_8.png]
Figure 9
Figure 9. Figure 9: Fractal dimension and lacunarity plot fo the generated dataset [PITH_FULL_IMAGE:figures/full_fig_p008_9.png]
Figure 10
Figure 10. Figure 10: 3D scatter plot of fractal dimension, lacunarity, and power [PITH_FULL_IMAGE:figures/full_fig_p009_10.png]
Figure 11
Figure 11. Figure 11: Fractal features and power pairplot of the generated dataset The [PITH_FULL_IMAGE:figures/full_fig_p009_11.png]
Figure 12
Figure 12. Figure 12: Distribution plot of fractal dimension and lacunarity [PITH_FULL_IMAGE:figures/full_fig_p009_12.png]
Figure 13
Figure 13. Figure 13: KDE plot of fractal dimension and lacunarity The [PITH_FULL_IMAGE:figures/full_fig_p010_13.png]
Figure 14
Figure 14. Figure 14: K-means clustering based on PCA of the multivariate dataset The extracted features from the generated dataset are further applied through principal component analysis (PCA) for the first two PC. It was then put through the K-Means clustering technique, which yields 3 …
Figure 15
Figure 15. Figure 15: 3D clustering scatter plot of the three clusters TABLE I. SAMPLE 3 ROWS OF THE UPDATED METADATA DATAFRAME WITH EXTRACTED FEATURES AND CLUSTER LABELS 612 468 355 filename quantum_julia_613.png quantum_julia_469.png quantum_julia_356.png fractal_di m 1.944661 1.943113 1…
Figure 16
Figure 16. Figure 16: Bar chart of cluster-based generated dataset Dominance of Cluster 1 is depicted by the majority of created Julia sets have a homogeneous, dense structure (high power, low lacunarity), which is consistent with Cluster 1's traits. This implies that the fractals produced…
Figure 17
Figure 17. Figure 17: Using the concept GHZ-Groverlike-Shorlike circuits, Julia generated with 10 qubits [PITH_FULL_IMAGE:figures/full_fig_p013_17.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

45 extracted references · 38 canonical work pages

  1. [1]

    Here, we use quantum probabilities to gently disturb the Julia fractal's shape, which is determined by the constant c

    Quantum Randomness for Julia Parameters This step ensures that every fractal created is distinct and impacted by quantum randomness, transforming the image from a deterministic Julia set into a work of art inspired by quantum mechanics. Here, we use quantum probabilities to gently disturb the Julia fractal's shape, which is determined by the constant c. T...

  2. [2]

    use smoothing (via nu and normalization) instead of blocky iterations to create a high-quality, gradient-colored fractal

    Fractal Computation (Julia Set) It uses the escape -time algorithm, a well -known method for creating fractals. use smoothing (via nu and normalization) instead of blocky iterations to create a high-quality, gradient-colored fractal. Fractal art galleries frequently employ this to provide visual smoothness. Fig. 3. Four-qubit system quantum circuit with d...

  3. [3]

    Schrödinger, Physique quantique et représentation du monde

    E. Schrödinger, Physique quantique et représentation du monde . Éditions du Seuil, 1992

  4. [4]

    Entangled? Frieder Nake’s Probabilities Versus Quantum Computing Artistic Research

    G. Robillard and A. Lioret, “Entangled? Frieder Nake’s Probabilities Versus Quantum Computing Artistic Research”

  5. [5]

    Simulating Physics with Computers,

    R. P. Feynman, “Simulating Physics with Computers,” vol. 21, pp. 467–488, 1982

  6. [6]

    Quantum music, quantum arts and their perception,

    V. Putz and K. Svozil, “Quantum music, quantum arts and their perception,” in Quantum Computing in the Arts and Humanities: An Introduction to Core Concepts, Theory and Applications , Springer, 2022, pp. 179–191

  7. [7]

    Quantum art,

    A. Lioret, “Quantum art,” Expressive 2016; Proc. Jt. Symp. Comput. Aesthet. Sketch Based Interfaces Model. Non - Photorealistic Animat. Render. , pp. 135 –139, 2016, doi: 10.2312/exp.20161072

  8. [8]

    Artistic Creation of Cultural Sustainability and Interactive Creativity through Three-Dimensional Animation,

    Z. JIE, S. Dalal, M. S. Bin Abu Bakar, and W. A. Wan Yahaya, “Artistic Creation of Cultural Sustainability and Interactive Creativity through Three-Dimensional Animation,” J. Creat. Arts, vol. 1, no. 1, pp. 130–144, 2024, doi: 10.24191/jca.v1i1.1475

Show all 45 references
  1. [9]

    20, 2025

    IBM Qiskit, “UGate.” Accessed: Apr. 20, 2025. [Online]. Available: https://docs.quantum.ibm.com/api/qiskit/qiskit.circuit.library.UG ate

  2. [10]

    Metaphors for Abstract Concepts: Visual Art and Quantum Mechanics,

    L. Stone, “Metaphors for Abstract Concepts: Visual Art and Quantum Mechanics,” Stud. Res., vol. 1, no. 2, pp. 14–29, 2014

  3. [11]

    Re-Visioning Reality: Quantum Superposition in Visual Art,

    L. Stone, “Re-Visioning Reality: Quantum Superposition in Visual Art,” vol. 51, no. 2, pp. 111–117, 2018, doi: 10.1162/LEON

  4. [12]

    Art by Quantum Entanglement

    Russell Huffman, “Art by Quantum Entanglement.” [Online]. Available: https://medium.com/@jrussellhuffman/art -by- quantum-entanglement-5c3bbafb2400

  5. [13]

    Quantum computing inspired paintings: reinterpreting classical masterpieces,

    A. Crippa, Y. Chai, O. C. Hamido, P. Itaborai, and K. Jansen, “Quantum computing inspired paintings: reinterpreting classical masterpieces,” pp. 1 –10, 2024, [Online]. Available: http://arxiv.org/abs/2411.09549

  6. [14]

    REFIK ANADOL Quantum Memories

    “REFIK ANADOL Quantum Memories.” [Online]. Available: https://www.ngv.vic.gov.au/refik-anadol-quantum- memories/#:~:text=PROJECT Commissioned by the NGV%2C,work uses the data to

  7. [15]

    a new set of affordances

    that the fundamental characteristics of QC (superposition, entanglement, and interference) provide "a new set of affordances" for art, making quantum media as different from traditional digital art as photography is from painting. Quantum physicist-turned-artist Libby Heaney u...

  8. [16]

    Quantum image processing and its application to edge detection: Theory and experiment,

    X. W. Yao et al., “Quantum image processing and its application to edge detection: Theory and experiment,” Phys. Rev. X, vol. 7, no. 3, pp. 1–14, 2017, doi: 10.1103/PhysRevX.7.031041

  9. [17]

    Quantum Generative Art

    Dongyang Li, “Quantum Generative Art.” [Online]. Available: https://iqparc.northwestern.edu/quantum-generative- art/#:~:text=Utilizing a quantum computer and,Blender and Unreal Engine 5

  10. [18]

    There’s A Burgeoning Quantum Art Scene

    Russell Huffman, “There’s A Burgeoning Quantum Art Scene.” [Online]. Available: https://medium.com/qiskit/theres -a- burgeoning-quantum-art-scene-76119cca7144

  11. [19]

    The Interview | Libby Heaney,

    L. Heaney, “The Interview | Libby Heaney,” 2025. [Online]. Available: https://www.rightclicksave.com/article/the -interview- libby-heaney#:~:text=In 2021%2C I used one,augmented

  12. [20]

    On the cohomology of Impossible Figures,

    R. Penrose, “On the cohomology of Impossible Figures,” Adv. Math. (N. Y). , vol. 454, pp. 11 –16, 2024, doi: 10.1016/j.aim.2024.109868

  13. [21]

    Impossible object - Wikipedia

    “Impossible object - Wikipedia.” Accessed: Jul. 20, 2025. [Online]. Available: https://en.wikipedia.org/wiki/Impossible_object

  14. [22]

    Art makes quantum intuitive,

    G. Cattan, K. Duś, S. Kusmia, and T. Stopa, “Art makes quantum intuitive,” Front. Quantum Sci. Technol., vol. 3, no. May, pp. 1–4, 2024, doi: 10.3389/frqst.2024.1397130

  15. [23]

    E. R. Miranda, Quantum Computing in the Arts and Humanities: An Introduction to Core Concepts, Theory and Applications. 2022. doi: 10.1007/978-3-030-95538-0

  16. [24]

    Jie; and E

    Z. Jie; and E. Al, Interaction & Interference: Meditation on Interactive Animation and Media Spectacle in Digital Being , vol

  17. [25]

    doi: 10.1007/978-3-031-84636-6

  18. [26]

    Fractal Beings,

    P. A. Lioret and J. Bouizem, “Fractal Beings,” XX Gener. Art Conf. GA2017, 2017, [Online]. Available: http://www.stochastic.fr/

  19. [27]

    Reimagining reality through decolonial and quantum lenses in abstract animation,

    M. Chavez and I. Conradi, “Reimagining reality through decolonial and quantum lenses in abstract animation,” Animat. Pract. Process & Prod. , vol. 12, no. Decolonizing Animation, pp. 137 –160, 2023, doi: https://doi.org/10.1386/ap3_00047_1

  20. [28]

    B. B. Mandelbrot, The fractal geometry of nature /Revised and enlarged edition/ . AA(IBM New York), 1983. [Online]. Available: https://ui.adsabs.harvard.edu/abs/1983whf..book.....M

  21. [29]

    B. B. Mandelbrot, C. J. G. Evertsz, and M. C. Gutzwiller, Fractals and chaos: the Mandelbrot set and beyond, vol. 3. Springer, 2004

  22. [30]

    ULIA Mémoire sur l’itération des fonctions rationnelles,

    GASTON JULIA, “ULIA Mémoire sur l’itération des fonctions rationnelles,” vol. 1, pp. 47–245, 1918

  23. [31]

    Étude dynamique des polynômes complexes,

    J. H. Hubbard and A. Douady, “Étude dynamique des polynômes complexes,” p. 180, 2007

  24. [32]

    Universal quantum computation using fractal symmetry -protected cluster phases,

    T. Devakul and D. J. Williamson, “Universal quantum computation using fractal symmetry -protected cluster phases,” Phys. Rev. A , vol. 98, no. 2, 2018, doi: 10.1103/PhysRevA.98.022332

  25. [33]

    Learning Image Fractals Using Chaotic Differentiable Point Splatting,

    A. Djeacoumar, F. Mujkanovic, H. P. Seidel, and T. Leimkühler, “Learning Image Fractals Using Chaotic Differentiable Point Splatting,” Comput. Graph. Forum , vol. 44, no. 2, 2025, doi: 10.1111/cgf.70084

  26. [34]

    Quantum fractals. Geometric modeling of quantum jumps with conformal maps,

    A. Jadczyk, “Quantum fractals. Geometric modeling of quantum jumps with conformal maps,” Adv. Appl. Clifford Algebr., vol. 18, no. 3–4, pp. 737–754, 2008, doi: 10.1007/s00006-008-0099-2

  27. [35]

    Quantum -accelerated fractal image compression: An interdisciplinary approach,

    S. Du, Y. Yan, and Y. Ma, “Quantum -accelerated fractal image compression: An interdisciplinary approach,” IEEE Signal Process. Lett. , vol. 22, no. 4, pp. 499 –503, 2015, doi: 10.1109/LSP.2014.2363689

  28. [36]

    Top 5 applications of fractals | Mathematics | University of Waterloo

    “Top 5 applications of fractals | Mathematics | University of Waterloo.” Accessed: Aug. 24, 2025. [Online]. Available: https://uwaterloo.ca/math/news/top-5-applications-fractals

  29. [37]

    Quantum Computational Networks,

    D. . . Deutsch, “Quantum Computational Networks,” Proc. R. Soc. London . Ser. A , Math. Phys. Publ. by R. Soc. Stable , vol. 425, no. 1868, pp. 73–90, 1989

  30. [38]

    Quantum computation,

    D. Aharonov, “Quantum computation,” pp. 1–78, 2024

  31. [39]

    A fast quantum mechanical algorithm for database search,

    L. K. Grover, “A fast quantum mechanical algorithm for database search,” Proc. Annu. ACM Symp. Theory Comput. , vol. Part F1294, pp. 212–219, 1996, doi: 10.1145/237814.237866

  32. [40]

    Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,

    P. W. Shor, “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,” vol. 41, no. 2, pp. 303–332, 1999

  33. [41]

    Rapid solution of problems by quantum computation,

    D. Deutsch and R. Jozsa, “Rapid solution of problems by quantum computation,” Proc. R. Soc. London. Ser. A Math. Phys. Sci., vol. 439, no. 1907, pp. 553–558, 1992

  34. [42]

    Quantum Complexity general,

    U. Bernstein, Ethan;, Vazirani, “Quantum Complexity general,” 1993, doi: 10.1145/167088.167097

  35. [43]

    M. A. Nielsen and I. H. . Chuang, Quantum Computation and Quantum Information, 2010th ed. Cambridge University Press

  36. [44]

    O. C. Hamido and P. V. Itabora, OSC-Qasm: Interfacing Music Software with Quantum Computing . 2023. doi: 10.1007/978 -3- 031-29956-8

  37. [45]

    Extending the Visual Arts Experience: Sonifying Paintings with AI BT - Artificial Intelligence in Music, Sound, Art and Design,

    T. Fink and A. A. Akdag Salah, “Extending the Visual Arts Experience: Sonifying Paintings with AI BT - Artificial Intelligence in Music, Sound, Art and Design,” C. Johnson, N. Rodríguez-Fernández, and S. M. Rebelo, Eds., Cham: Springer Nature Switzerland, 2023, pp. 100–116

Pith tools

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