Distributed Quantum Computing: From Algorithms to Applications

October 15, 2026

8:30 – 9:00

Welcome coffee

30′

9:00 – 9:55

AQADOC presentation

55′

9:00 – 9:10

AQADOC Introduction
Ioannis Lavdas, Welinq

Abstract

Slides

9:10 – 9:30

Distributed Quantum Algorithms: PDE and MIS Problems
Riccardo Mengoni, Welinq

Abstract

Pending

Slides

9:30 – 9:55

Scaling Quantum Execution with Automated Circuit Cutting: Applications to Belenos
Mattia Chiurco, Quandela

Abstract

The execution of complex quantum algorithms on today’s processors is constrained by limited hardware resources, connectivity, and available operations. This talk presents an automated circuit cutting framework for Quandela’s hardware stack. By dividing circuits into smaller fragments, circuit cutting reduces the resources required for each execution, at the cost of additional experiments and classical processing.

The central challenge is to find partitions that satisfy hardware constraints while keeping this overhead manageable. I will describe how the framework combines wire and gate cutting with a circuit representation designed for cut selection and automated hypergraph partitioning. The emphasis is on the practical choices needed to turn cutting protocols into an executable workflow.

I will then present its application to QLOQ (qubit logic on qudits) optimization circuits, including the sampling requirements of CVaR (Conditional Value-at-Risk)-based training. Simulation results for MaxCut and maximum independent set problems illustrate the workflow’s performance and limitations. I will also describe how the framework is being used in ongoing benchmarking of Quandela’s Belenos chip.

Slides

9:55 – 10:45

Distributed architectures

1h 20′

9:55 – 10:20

Pasqal in HPC Centers: Lessons from Qaptiva and QRMI Deployments, and the Road to Hybrid Workload Optimization
Aurélien Nober, Pasqal

Abstract

Neutral-atom quantum processors are now being installed in supercomputing centers and have to run within each center’s existing operations. This talk presents Pasqal’s experience integrating its technology into production HPC environments through different ecosystems. We discuss lessons learned from the deployments at TGCC and JSC, which use Bull’s Qaptiva platform, and at CINECA, which uses the Quantum Resource Management Interface (QRMI). We also touch on the QDMI approach, deployed in other centers, to show how these routes differ in scope.

We then turn in particular to QRMI, an open-source, vendor-agnostic middleware that exposes quantum resources as schedulable entities. We review how it is supported across workload managers (Slurm, PBS, LSF, Grid Engine and Kubernetes) and the patterns and scheduler-specific considerations that emerged. We also we outline the resource optimization problem for hybrid workloads and potential solutions.

Slides

10:20 – 10:45

Distributed Quantum Computing at CESGA
Iago Fernández Llovo, CESGA

Abstract

This talk gives an overview of CESGA’s work on distributed quantum computing (DQC), including a benchmarking framework for DQC emulators and a router-assisted protocol that distributes collective operations in a single communication round, lowering ebit cost. The talk then introduces CUNQA, CESGA’s in-house DQC emulator to instantiate virtual QPUs on our HPC platform, as part of a broader effort to integrate future DQC systems into the datacenter. It closes with CESGA’s collaboration with the University of Innsbruck towards experimental DQC on trapped ions.

Slides

10:45 – 11:15

Coffee break

30′

11:15 – 12:05

Algorithms

1h 15′

11:15 – 11:40

Loss-tolerant distributed lattice surgery using fusion networks
Félix Burt, DQC APP (Imperial College)

Abstract

A promising route to scale fault-tolerant quantum computers to practically relevant sizes is through a network of distributed matter-based quantum processing units (QPUs) connected by photonic links. While the matter qubits inside each QPU experience predominantly Pauli-type errors that are well handled by circuit-based quantum error correction (CBQC), the inter-node channel is dominated by photon loss and probabilistic linear-optical operations, which are better handled using measurement-based quantum computing (MBQC) and fusion-based quantum computing (FBQC). Yet MBQC and FBQC are usually treated as alternatives to CBQC, rather than as components that can be combined with it. Recent work uses the ZX-calculus to explicitly translate syndrome extraction circuits and their associated checks between CBQC, MBQC and FBQC, opening the door to protocols that mix paradigms within a single error-correcting code. In this work, we introduce hybrid error correction protocols for distributed quantum computing systems that combine CBQC with MBQC and FBQC. We show that a variety of protocols using linear-optical fusions for distributed lattice surgery attain a 50% threshold for loss-induced erasure at the interface, and that hybrid protocols built from linear resource states double the effective erasure distance at the interface on the observable measured in the merge while preserving it on the perpendicular joint observable – in contrast with standard approaches using Bell pairs or Bell state measurements for which the interface preserves only one of the two observables with no effective distance increase. We numerically evaluate the performance of these protocols under heterogeneous noise models that include local depolarising noise, loss, fusion failure, and resource state errors, verifying all predicted erasure thresholds are achievable and demonstrating that the augmented interface distance for hybrid lattice surgery leads to lower logical error rates under high loss rates.

Slides

11:40 – 12:05

Towards Parallel Quantum Computing for Industrially Relevant PDE Test Cases
Kyrylo Kazymyrenko, EDF

Abstract

The numerical solution of partial differential equations (PDEs) is a key component in the design, monitoring, and safety assessment of large-scale industrial infrastructures. Many simulation workflows ultimately rely on the solution of large sparse linear systems Ax=b, making them natural candidates for acceleration using quantum algorithms. In this talk, we present practical benchmarks on industrially relevant test cases based on stationary heat diffusion (Poisson equation) and linear elasticity (Navier-Cauchy equations).
We first address the challenge of encoding finite-element stiffness matrices, including more realistic geometries and boundary conditions, into quantum representations. We then investigate the solution of the resulting linear systems using variational quantum algorithms (VQAs). To mitigate barren plateau phenomena and improve scalability, we introduce a quantum counterpart of classical progressive remeshing techniques, enabling a hierarchical optimization strategy adapted to discretized PDE problems.
Looking beyond single-device implementations, we discuss how these approaches could be extended to future quantum computing infrastructures composed of multiple quantum processing units (QPUs) interconnected through Bell-pair distribution. We examine possible strategies for distributing PDE workloads across such architectures and explore the relationship between the entanglement structure of the resulting quantum states, quantified through entanglement negativity, and mathematical properties of the computed solutions. These results provide initial insights into the opportunities and challenges of parallel quantum computing for scientifically and industrially relevant numerical simulations.

Slides

12:05-13:35

Lunch break

1h30′

13:35-14:20

End users

45′

13:35 – 13:50

Overview of efforts we have been pursuing for making security in delegated quantum computation more hardware friendly
Harold Olivier, INRIA

Abstract

Building trust along the quantum value chain is crucial to
make sure end-users can access reliable and secure computing services.
Verification of quantum computers has been solved from a theoretical
standpoint since 2008. However, the proposed protocols were suffering
two main problems: their large overhead, and their absence of robustness
to noise. I will report on recent advances in making harware
efficient security proofs, or how we moved from thought experiments to
experimental proof of concepts to designing the future architectures for secured quantum computing.

13:50 – 14:05

A global picture of the software and hardware infrastructure needed to support classic-quantum hybrid applications
Joel Penhoat, Orange

Abstract

“Quantum computing is currently in the Noisy intermediate-scale quantum (NISQ) era, characterized by quantum processors containing up to thousands qubits. Scalable fault-tolerant quantum computers are scheduled for 2030, and utility-scale quantum computing for 2040. Applications executed on quantum computers consist of interwoven classical programs and quantum tasks: (i) pre-processing tasks are implemented by classical programs, executed on classical computers, and include generating state preparation circuits based on input data to initialize the register of the quantum computer when executing the quantum programs; (ii) quantum tasks are executed on a quantum computer, first preparing the required state in the register depending on the generated state preparation circuit. Afterwards, the unitary transformation specified by the proper quantum algorithm is performed, and finally the output is measured; (iii) post-processing tasks, executed on a classical computer, interpret the measurement results and mitigate readout-errors in the result distribution by applying an unfolding technique to retrieve a less disturbed distribution from the measured distribution.

We bring out a global picture of the software and hardware infrastructure needed to support these applications: (i) the classic-quantum hybrid software lifecycle; (ii) the classic-quantum hybrid application workflow model; (iii) the classic-quantum hybrid application workflow model archive; (iv) the Classic-quantum hybrid application workflow model execution; (v) the classic-quantum hybrid application workflow model architecture; (vi) the cloud-style virtualization and partitioning system; (vii) the quantum information network; (viii) the quantum connectivity and the quantum hardware”

Slides

14:05 – 14:20

Thales
Rami Kassab, Thales

Abstract

“THALES is developing quantum-computing methodologies for advanced engineering simulation and numerical analysis, with a particular focus on the efficient solution of high-dimensional partial differential equations (PDEs). The research exploits the intrinsic structure of PDE operators through spectral and Fourier representations, Quantum Block Encoding (QBE) and reversible quantum arithmetic, providing a structure-aware alternative to generic QSVT-based quantum linear-system solvers.

In computational electromagnetics, the work extends finite-element methods (FEM) for Maxwell’s equations into the quantum domain. Quantum adaptive mesh refinement employs block-encoded error estimators, while quantum domain-decomposition preconditioning explores two-level Additive Schwarz and BPX methods to improve the conditioning of FEM systems.

Together, these developments transfer established high-performance computing techniques—including spectral methods, FEM, adaptivity and preconditioning—into quantum computing, establishing a transition towards physics-aware, structure-exploiting quantum numerical methods. The longer-term objective is a coherent quantum-engineering framework spanning PDEs, electromagnetics, wave propagation and nonlinear multiphysics simulation.

Complementary radar applications demonstrate other engineering-driven approach: quantum annealing for phase-coded waveform optimisation, formulating ISLR minimisation as a QUBO problem, and quantum probabilistic inference for radar anomaly detection, using quantum estimation of the partition function of a Markov Random Field. Together, these studies illustrate the potential of quantum computing for both optimisation and qualification for radar design and validation.”

Slides

14:20 – 14:50

Coffee break

30′

15:40-16:40

End users (continued)

1h

15:40-16:40

End-User Needs and Expectations for the Development of Distributed Quantum Algorithms
Round table

Abstract