Uploaded October 2026 | Updated November 2026, 3 days ago
VisualizingLQCD.jl: Visualization of quantum vacuum by Akio Tomiya
PreTalx: pretalx.com/juliacon-2026/talk/T9CVPT
flyer-T9CVPT: pretalx.com/media/juliacon-2026/submissions/T9CVPT/resources/T9CVPT_FGth3zf.png
Inside atomic nuclei, "empty space" is not empty: the strong force comes from a gluon field that fluctuates and binds quarks into protons and neutrons. Lattice QCD computes this by simulating QCD on a grid in space and time, usually on supercomputers. VisualizingQCD.jl, a JuliaQCD package, turns your own configuration files into 3D movies of local observables, so Julia users can see, debug, and share the quantum vacuum.
Quantum chromodynamics (QCD) is the theory of the strong force that holds atomic nuclei together. It predicts that the "vacuum" is a fluctuating gluon field, so even empty space has structure, and those fluctuations shape protons and neutrons. Lattice QCD makes this computable by simulating QCD on a 4D grid and generating many snapshots of the gluon field, typically on supercomputers. Because the output is a large 4D dataset, visualization is a practical way to build intuition, compare runs, and explain results.
Previous QCD outreach movies showed how compelling vacuum visualization can be, but they are fixed examples. When you develop algorithms or tune parameters, you want to visualize your own configurations from your own simulations. VisualizingQCD.jl, part of the JuliaQCD project, provides an open-source pipeline that reads ILDG configuration files, computes a 3D scalar field on each time slice, and renders iso-surfaces into MP4 videos with Makie. The workflow is plain Julia code, so it is reproducible and easy to extend.
In this short talk I will demo the pipeline end to end, starting from an ILDG file and producing a movie in a few lines. Next I will explain what can be visualized, focusing on local observables such as plaquette-based activity (the smallest loop on the grid), action density after gradient flow (a standard smoothing procedure), a common probe of vacuum structure. I will close with performance notes and pointers for adding new observables within the JuliaQCD ecosystem.
VisualizingLQCD.jl: Visualization of quantum vacuum by Akio Tomiya
PreTalx: pretalx.com/juliacon-2026/talk/T9CVPT
flyer-T9CVPT: pretalx.com/media/juliacon-2026/submissions/T9CVPT/resources/T9CVPT_FGth3zf.png
Inside atomic nuclei, "empty space" is not empty: the strong force comes from a gluon field that fluctuates and binds quarks into protons and neutrons. Lattice QCD computes this by simulating QCD on a grid in space and time, usually on supercomputers. VisualizingQCD.jl, a JuliaQCD package, turns your own configuration files into 3D movies of local observables, so Julia users can see, debug, and share the quantum vacuum.
Quantum chromodynamics (QCD) is the theory of the strong force that holds atomic nuclei together. It predicts that the "vacuum" is a fluctuating gluon field, so even empty space has structure, and those fluctuations shape protons and neutrons. Lattice QCD makes this computable by simulating QCD on a 4D grid and generating many snapshots of the gluon field, typically on supercomputers. Because the output is a large 4D dataset, visualization is a practical way to build intuition, compare runs, and explain results.
Previous QCD outreach movies showed how compelling vacuum visualization can be, but they are fixed examples. When you develop algorithms or tune parameters, you want to visualize your own configurations from your own simulations. VisualizingQCD.jl, part of the JuliaQCD project, provides an open-source pipeline that reads ILDG configuration files, computes a 3D scalar field on each time slice, and renders iso-surfaces into MP4 videos with Makie. The workflow is plain Julia code, so it is reproducible and easy to extend.
In this short talk I will demo the pipeline end to end, starting from an ILDG file and producing a movie in a few lines. Next I will explain what can be visualized, focusing on local observables such as plaquette-based activity (the smallest loop on the grid), action density after gradient flow (a standard smoothing procedure), a common probe of vacuum structure. I will close with performance notes and pointers for adding new observables within the JuliaQCD ecosystem.
.
For structured systems with many variables, such as minimal problems in computer vision, the resulting Vandermonde-like interpolation matrices become prohibitively large, leading to expensive nullspace computations and numerical instability. We address this by exploiting equivariance of minimal problems with respect to matrix Lie group actions. The interpolation space of bounded-degree polynomials decomposes into isotypic components as a representation of the Lie symmetry group, allowing a substantial reduction of the problem size. This representation-theoretic decomposition is implemented in the Julia package [DecomposingGroupRepresentations.jl](https://github.com/MultivariatePolynomialSystems/DecomposingGroupRepresentations.jl). Together, these tools provide a scalable Julia-based framework that integrates monodromy and computational representation theory to recover closed-form symmetries of polynomial systems. Using monodromy and representation theory to recover symmetries of polynomial systems | Korotynskiy](https://i.ytimg.com/vi/sQnEwwvZYoA/mqdefault.jpg)
. This work provides the framework for identifying optimal algorithms for refinement of protein structures.
Protein structures are determined experimentally by X‑ray crystallography, electron microscopy, or NMR, or they are predicted with AlphaFold or RoseTTAFold [1,2]. Either way, the resulting protein models often contain missing atoms, distorted bond lengths, or unrealistic side chain orientations generating severe steric clashes and steep energy gradients. Energy minimization is thus essential to achieve physically realistic conformations. While classical minimizers (e.g., conjugate gradient, quasi-Newton) are standard, we demonstrate how machine learning (ML) optimizers can be effectively adapted to this domain.
We introduce a novel mini-batching strategy for ML-based minimization (e.g., SGD, ADAM), implemented in BiochemicalAlgorithms.jl, our library for molecular analysis and simulation [3]. The library provides molecular mechanic functionalities to evaluate energy gradients and corresponding forces, which are essential for energy minimization. Our mini-batching strategy partitions the force‑field contributions by atom‑pair groups, allowing the energy and gradient calculations to be performed on small batches corresponding to random selected portions of the molecule.
Furthermore, a major contribution of this work is a systematic assessment of different optimization algorithms by leveraging the unified Optimization.jl ecosystem—an interface that connects to more than 25 optimization libraries [4].
Our approach supports the possibility of interchanging solvers including SGD and ADAM or alternative ML solvers for energy minimization of proteins without custom code per algorithm.
Using a representative set of proteins from each of the five top‑level SCOP classes, we compared runtime and convergence precision across the solvers. The results highlight which algorithms deliver the best trade‑off between speed and final energy for different structural families.
Overall, the talk will demonstrate how the proposed mini‑batching scheme opens a path towards ML‑augmented protein‑structure refinement and how a single, extensible optimization interface can streamline the evaluation of diverse minimization strategies for protein structure relaxation.
[1] J. Jumper et al., “Highly accurate protein structure prediction with AlphaFold,” Nature, vol. 596, pp. 583‑589, 2021, doi: 10.1038/s41586‑021‑03819‑2.
[2] M. Baek et al., “Accurate prediction of protein structures and interactions using a three‑track neural network,” Science, vol. 373, pp. 871‑876, 2021, doi: 10.1126/science.abj8754.
[3] J. Leclaire et al., “Structure‑based bioinformatics with BiochemicalAlgorithms.jl,” in Proceedings of the JuliaCon Conferences, vol. 7, no. 78, p. 188, 2025, doi: 10.21105/jcon.00188.
[4] V. K. Dixit and C. Rackauckas, “Optimization.jl: A unified optimization package (version v3.12.1),” Zenodo, Mar. 2024. [Online]. Available: https://doi.org/10.5281/zenodo.7738525.
[5] N. K. Fox, S. E. Brenner, and J. M. Chandonia, “SCOPe: Structural classification of proteins—extended, integrating SCOP and ASTRAL data and classification of new structures,” Nucleic Acids Res., vol. 42, no. D1, pp. D304‑D309, 2014, doi: 10.1093/nar/gkt1240. Effects of stochasticity on molecular minimization | Leclaire | JuliaCon Global 2026](https://i.ytimg.com/vi/sbtZq2jgngw/mqdefault.jpg)







![Radiomics.jl: a Library for High-Performance Radiomic Features Extraction from Medical Images
Radiomics.jl: a Library for High-Performance Radiomic Features Extraction from Medical Images by ALDO GIULIANI
PreTalx: https://pretalx.com/juliacon-2026/talk/WGZ9ZA/
flyer-WGZ9ZA: https://pretalx.com/media/juliacon-2026/submissions/WGZ9ZA/resources/WGZ9ZA_qhy68HO.png
Radiomic features extracted from medical images are fundamental for computer-aided diagnosis and treatment planning.
Radiomics.jl is a new, pure-Julia open-source library for high-performance extraction of quantitative imaging biomarkers.
Developed across multiple international institutions, it provides an efficient and scalable workflow by leveraging Julia’s speed.
The library ensures seamless integration with machine learning pipelines for advanced clinical research and precision medicine.
**_Introduction_**
Radiomics has emerged as a fundamental approach in precision medicine, enabling the extraction of high-throughput quantitative features from medical images for computer-aided diagnosis and personalized treatment planning [1].
In this work, Radiomics.jl [2], a new and open-source Julia library designed to extract radiomic features, is presented.
**_Materials and Methods_**
Radiomics.jl implements a complete set of radiomic features (106 in total) extraction capabilities, encompassing first-order and 2D/3D shape-based features, as well as sophisticated texture descriptors. These advanced texture features include the Gray-Level Co-occurrence Matrix (GLCM), Gray-Level Dependence Matrix (GLDM), Gray-Level Run-Length Matrix (GLRLM), Gray-Level Size-Zone Matrix (GLSZM), and Neighborhood Gray-Tone Difference Matrix (NGTDM).
The tool is designed for convenience and user-friendliness, and it takes advantage of a multi-threading workflow, which allows efficient feature extraction from multiple tissues or organs concurrently.
**_Results_**
A Computed Tomography (CT) scan of a patient with a lung tumor [3,4] was selected for benchmarking. The CT volume dimensions were 500 x 500 x 319 voxels, with the tumor segmentation comprising 38226 voxels (38.226 cm3). Excluding the initial JIT compilation overhead, which accounted for 12.47 s (single-thread) and 5.60 s (multi-thread), the mean execution time over 14 repetitions was 4.07 s (SD=0.10 s) for single-thread and 3.00 s (SD=0.29 s) for multi-thread. Multi-threading yielded a 25% reduction in computational time (Wilcoxon rank-sum test revealed statistically significant difference between the two distributions).
**_Discussion and Conclusions_**
Radiomics.jl offers a high-performance, efficient, and user-friendly solution for quantitative medical image analysis entirely within the Julia ecosystem.
Designed for fast and user-friendly feature extraction from medical images, its goal is to support and advance the field of personalized medicine.
**_References_**
[1] https://pmc.ncbi.nlm.nih.gov/articles/PMC4734157/
[2] https://github.com/pzaffino/Radiomics.jl
[3] Aerts HJWL, et al. Nat Commun. 2014;5:4006. https://doi.org/10.1038/ncomms5006
[4] Aerts HJWL, et al. NSCLC-Radiomics [Data set]. TCIA, 2014. https://doi.org/10.7937/K9/TCIA.2015.PF0M9REI Radiomics.jl: a Library for High-Performance Radiomic Features Extraction from Medical Images](https://i.ytimg.com/vi/viQKDYMDDNU/mqdefault.jpg)
