Uploaded November 2026 | Updated November 2026, 3 hours ago
Julia For Quantum Software: Lessons from PauliPropagation.jl by Zoë Holmes, Manuel Rudolph
PreTalx: pretalx.com/juliacon-2026/talk/YRYY9T
Quantum computing progress depends as much on software as on hardware. In this keynote, we’ll start with a practical view of how high-quality code supports the development and use of quantum devices—through simulation, compilation, verification, benchmarking, and control. We'll also stress the value of state of the art classical methods to delineate where a quantum computer is genuinely required, versus where well-designed classical software is the right (and often faster) choice. We will then zoom in on PauliPropagation.jl, a Julia package we have been developing for efficiently simulating quantum circuits. We will outline the core abstractions and implementation details in the package, and what problems it is meant to make easy. A central thread will be "why Julia". Beyond performance, Julia lets us offer a fully extensible package with custom gates, data structures, and evolving types. We’ll end with an honest account of building Julia tools as a scientist: what has worked well, what has been surprisingly hard, and what we have learned about presenting research software to a community that often defaults to Python expectations.
Quantum computing progress depends as much on software as on hardware. In this keynote, we’ll start with a practical view of how high-quality code supports the development and use of quantum devices—through simulation, compilation, verification, benchmarking, and control. We'll also stress the value of state of the art classical methods to delineate where a quantum computer is genuinely required, versus where well-designed classical software is the right (and often faster) choice. We will then zoom in on PauliPropagation.jl, a Julia package we have been developing for efficiently simulating quantum circuits. We will outline the core abstractions and implementation details in the package, and what problems it is meant to make easy. A central thread will be "why Julia". Beyond performance, Julia lets us offer a fully extensible package with custom gates, data structures, and evolving types. We’ll end with an honest account of building Julia tools as a scientist: what has worked well, what has been surprisingly hard, and what we have learned about presenting research software to a community that often defaults to Python expectations.
Julia For Quantum Software: Lessons from PauliPropagation.jl by Zoë Holmes, Manuel Rudolph
PreTalx: pretalx.com/juliacon-2026/talk/YRYY9T
Quantum computing progress depends as much on software as on hardware. In this keynote, we’ll start with a practical view of how high-quality code supports the development and use of quantum devices—through simulation, compilation, verification, benchmarking, and control. We'll also stress the value of state of the art classical methods to delineate where a quantum computer is genuinely required, versus where well-designed classical software is the right (and often faster) choice. We will then zoom in on PauliPropagation.jl, a Julia package we have been developing for efficiently simulating quantum circuits. We will outline the core abstractions and implementation details in the package, and what problems it is meant to make easy. A central thread will be "why Julia". Beyond performance, Julia lets us offer a fully extensible package with custom gates, data structures, and evolving types. We’ll end with an honest account of building Julia tools as a scientist: what has worked well, what has been surprisingly hard, and what we have learned about presenting research software to a community that often defaults to Python expectations.
Quantum computing progress depends as much on software as on hardware. In this keynote, we’ll start with a practical view of how high-quality code supports the development and use of quantum devices—through simulation, compilation, verification, benchmarking, and control. We'll also stress the value of state of the art classical methods to delineate where a quantum computer is genuinely required, versus where well-designed classical software is the right (and often faster) choice. We will then zoom in on PauliPropagation.jl, a Julia package we have been developing for efficiently simulating quantum circuits. We will outline the core abstractions and implementation details in the package, and what problems it is meant to make easy. A central thread will be "why Julia". Beyond performance, Julia lets us offer a fully extensible package with custom gates, data structures, and evolving types. We’ll end with an honest account of building Julia tools as a scientist: what has worked well, what has been surprisingly hard, and what we have learned about presenting research software to a community that often defaults to Python expectations.





, built on byte-precise lowering and abstract interpretation. This year, we focus on the core design behind it: loading parts of user code to reuse Julias macro handling and compiler type inference. We compare this runtime-integrated approach with the overhauled LanguageServer.jl/JuliaWorkspaces.jl stack and demo its progress on real-world code.
At JuliaCon 2025, we introduced [JETLS.jl](https://github.com/aviatesk/JETLS.jl), then an early-alpha Julia language server built on [JET.jl](https://github.com/aviatesk/JET.jl)s abstract interpretation and [JuliaLowering.jl](https://github.com/JuliaLang/julia/tree/master/JuliaLowering)s byte-precise, provenance-tracking lowering. One year later, this talk goes beyond a progress report to examine the core design that makes this compiler-grounded analysis possible.
JETLS selectively loads parts of the target program into its analysis process. This runtime integration enables JuliaLowering to execute the program’s actual macros while preserving byte-precise source provenance, and JET to reuse Julia’s compiler inference to derive type information for source-level developer tooling.
We compare this design in depth with the [LanguageServer.jl](https://github.com/julia-vscode/LanguageServer.jl)/[JuliaWorkspaces.jl](https://github.com/julia-vscode/JuliaWorkspaces.jl) stack, which has undergone a major overhaul over the past year. Rather than presenting JETLS simply as a replacement, we place the two approaches on a spectrum of runtime integration: JETLS aims to provide precise information about macro expansion and lowering, together with compiler-inferred types, while the largely static approach prioritizes responsiveness and safety and benefits from greater production maturity.
These architectural differences become concrete in a live demo using real-world code from CSV.jl and JuliaFormatter.jl. We show how JETLSs runtime-integrated design translates into practical editor features, most of which were either early prototypes at last years talk or did not yet exist.
Finally, we summarize JETLSs current feature coverage, installation and environment isolation, and editor setup. We also briefly show how the same analysis is exposed through a CLI for CI and AI-agent workflows, showcasing agentic bugfixes drawn from a [Julia Base audit with JETLS](https://github.com/JuliaLang/julia/issues/62526).
Time permitting, we share performance measurements before outlining future work. JETLS: Bringing Julia’s runtime into language-server analysis | Kadowaki, Pfitzner](https://i.ytimg.com/vi/m-K5Wij8Q38/mqdefault.jpg)




