BLOG / ARTICLE

Feedforward Operations: A Critical Milestone for Photonic Quantum Computing

Feedforward operations in Perceval

While we have just introduced feedforward capabilities in Perceval 0.12, our open-source framework for photonic quantum computing, this new feature represents a significant milestone in our development roadmap, enabling users to simulate and experiment with adaptive quantum circuits while we work on implementing these capabilities in hardware. As the quantum computing community moves toward more sophisticated quantum protocols and fault-tolerant architectures, the ability to perform operations conditioned on measurement results becomes increasingly crucial. While implementing feedforward operations in photonic hardware presents unique challenges, having this capability in simulation allows developers to:

  • Design and validate adaptive quantum protocols;
  • Prototype error correction schemes;
  • Prepare for future hardware capabilities;
  • Explore the enhanced computational power enabled by feedforward control.

In this blog post, we’ll explain what feedforward operations are, why it matters for quantum computing, and how this new feature in Perceval helps bridge the gap between current capabilities and future photonic quantum computers.

What is a feedforward Operation?

In quantum computing, feedforward operations refer to the ability to use classical measurement results to determine subsequent quantum operations in real-time. So feedforward influences future operations in the quantum circuit.

Consider a simple example: in a quantum circuit, we measure a qubit and based on whether we get a |0⟩ or |1⟩ result, we apply different operations to other qubits later in the circuit. This real-time decision making based on measurement outcomes is a feedforward control. Feedforward is also at the basis of the quantum teleportation protocol.

Comparison with Other Platforms

This capability is related to what other quantum computing platforms call “mid-circuit measurements” or “dynamic circuits”. For instance, superconducting quantum computers can measure qubits mid-circuit and use results to condition later gates.

The Photonic Challenge

Implementing feedforward in photonic systems presents unique challenges. Time management is critical across all quantum computing platforms, but manifests differently:

  1. Time Management Across Platforms:In superconducting systems, qubits remain stationary but face decoherence over time.In photonic systems, qubits are constantly in motion at the speed of light, requiring precise spatial and temporal control.Both platforms face a race against time, but for different reasons: decoherence vs. photon loss and synchronization
  2. Synchronization Requirements:We need to keep multiple photons alive and synchronized while:
    • Detecting some photons
    • Processing measurement results
    • Reconfiguring optical elements This typically requires long optical delay lines or quantum memories
  3. Hardware Constraints:The implementation of feedforward operations in photonic systems requires several critical hardware components, each pushing the boundaries of current technology:
    • Fast optical switching (nanosecond scale)
    • Low-loss delay lines
    • Precise timing control across all components
    • Minimal latency in classical processing and control

Why Feedforward Matters

Feedforward operation is fundamental to several key quantum computing capabilities:

  1. Measurement-Based Quantum Computing: protocols where computation is performed on a resource state via single-qubit operation and – crucially – feedforward from the previous outcome results. This is the native route to quantum universality for photonic systems.
  2. Error Correction: In some quantum error correction scheme – notably in photonics – adaptive protocols are crucial for minimizing resource requirements.

As we can see, feedforward is crucial for implementing universal and error corrected quantum operations, especially in photonics. For instance, in our Spin-Optical Quantum Computing (SPOQC) architecture, introduced in “A Spin-Optical Quantum Computing Architecture” and refined here, feedforward operation plays a crucial role in:

  1. Adaptive Error Correction: applying appropriate operations based on measurement outcomes;
  2. Repeat-Until-Success operation: stopping the gate operation as soon as it has succeeded.

Even in the NISQ era, feedforward significantly expands the capabilities of photonic quantum computers. Recent works in photonic quantum computing show that feedforward enables computational capabilities beyond what static linear optics can achieve alone, as demonstrated in “Quantum machine learning with adaptive linear optics” and in “Towards quantum advantage with photonic state injection“.

Hardware Implementation

The implementation of feedforward in Perceval represents a key milestone in our roadmap toward SPOQC. Our hardware development plan includes:

  1. Integration of fast optical switches with low latency
  2. Development of real-time classical processing systems
  3. Implementation of the complete feedback loop from measurement to control

This follows our published roadmap to SPOQC, with feedforward capability being a crucial stepping stone toward full fault-tolerant operation.

Getting Started

Perceval now provides comprehensive support for experimenting with feedforward operations. Here’s a practical example implementing quantum teleportation:

import perceval as pcvl

# Create a processor with feedforward capability
p = pcvl.Processor("SLOS", 6)

# Configure X-gate feedforward
ff_X = pcvl.FFCircuitProvider(2, 0, pcvl.Circuit(2))
ff_X.add_configuration([0, 1], pcvl.PERM([1, 0]))

# Configure Z-gate feedforward
phi = pcvl.P("phi")
ff_Z = pcvl.FFConfigurator(2, 3, pcvl.PS(phi), {"phi": 0})
ff_Z.add_configuration([0, 1], {"phi": np.pi})

The complete example is available in our documentation.

Looking Forward

With feedforward support now available in Perceval, we open new possibilities for:

  1. Application Development: Creating and testing adaptive quantum algorithms
  2. Protocol Implementation: Experimenting with sophisticated quantum protocols
  3. Architecture Research: Developing and validating components of fault-tolerant architectures

We invite the quantum computing community to explore these new capabilities and develop novel applications leveraging feedforward operations. This feature provides the foundation for implementing more sophisticated quantum protocols and advancing toward fault-tolerant quantum computation.

Technical Resources

Latest from the blog

Can quantum computers help predict how materials break? We introduce a quantum algorithm for fracture mechanics that encodes elastic systems efficiently and retrieves local crack information with few measurements [1]. By combining variational methods with remeshing-inspired warm starts, we show how to scale beyond typical optimization limits.

Introduction

Imagine crack forming in a dam. At first, it’s barely visible. A microscopic defect in the material. But under stress, it begins to grow. Slowly at first, then faster, branching, propagating… until the dam breaks. Or not.

This is exactly what engineers need to predict: will the crack propagate?

In this work, we show how a quantum algorithm can tackle this problem.

Approach

We consider the equations of linear elastic fracture mechanics:

$$
\mathrm{grad}(\mathrm{div}\,\mathbf{u}) + (1 – 2\nu)\,\Delta \mathbf{u} = 0
$$

and reformulate the problem using its energetic formulation: the physical solution is the displacement field that minimizes the elastic energy.

This naturally leads to a variational quantum algorithm:

  • A parametrized quantum state encodes the displacement field,
  • Measurements estimate the elastic energy,
  • And a classical optimizer updates the parameters.

Results

A key challenge is efficient encoding. The displacement field lives on a very large mesh, and naive approaches would require too many qubits.

We address this by constructing an encoding where the full system is stored in quantum amplitudes and thus the number of qubits scales only polylogarithmically with the system size.  This enables us to represent large elastic systems compactly on a quantum processor. Finally, instead of reconstructing the full solution, we directly measure local physical quantities relevant to fracture, such as indicators of crack propagation, which can be extracted with a small number of measurements.

The variational formulation successfully recovers the physical solution through energy minimization.

However, a central challenge of variational algorithms is the presence of barren plateaus, where optimization becomes ineffective [2].

To address this, we introduce a quantum remeshing strategy inspired by classical methods:

  • solve the problem on a coarse mesh,
  • refine the mesh,
  • and warm start the new optimization using the previous solution.

By cascading this process, each optimization begins close to the solution, significantly improving convergence and avoiding the typical pitfalls of barren plateaus.

Why it matters

Fracture mechanics is a demanding test case: it involves large systems, evolving geometries, and highly localized effects. Our results show that quantum algorithms can: encode large physical systems efficiently, access only the information that matters and can avoid common difficulties on optimization.

This idea extends beyond fracture mechanics to many areas of scientific computing, where problems are multiscale, adaptive, and inherently dynamic.

In these settings, good quantum algorithms may be those that, unlike the physics they simulate, don’t start from scratch.

References

[1] Remond, U., Emeriau, P. E., Lysaght, L., Ruel, J., Mikael, J., & Kazymyrenko, K. (2025). Quantum remeshing and efficient encoding for fracture mechanics. arXiv preprint arXiv:2510.14746.

[2] Larocca, M., Thanasilp, S., Wang, S., Sharma, K., Biamonte, J., Coles, P. J., … & Cerezo, M. (2025). Barren plateaus in variational quantum computing. Nature Reviews Physics7(4), 174-189.