Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.37628

Operational theory for photonic circuits: generalizing linear optics beyond quantum theory

Ismaël Septembre·Matthias Kleinmann·Martin Plávala
View original source ↗Read source document ↗Export metadata ↓

Abstract

We use the analogy between the quadrature operators in quantum optics and the phase-space coordinates in a mechanical harmonic oscillator to generalise the theory of linear optics beyond quantum theory. For this, we introduce a framework for analysing photonic circuits within generalised probabilistic theories based on quadrature operators. Using this framework, we ask whether phenomena like the Hong-Ou-Mandel effect, Mach-Zehnder interferometry are specific to quantum theory or also occur across a broader class of theories. We find the latter: the vanishing photon coincidences at the output of a beam splitter also occur for classical light and for a modified version of quantised light. Similarly, for Mach-Zehnder interferometry we find that there is no qualitative difference between quantum theory and these alternative theories. Our framework can serve as a foundation to study generalised theories of complex photonic set-ups and photonic quantum computers.

Explore related subjects

quant-phphysics.optics

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ismaël Septembre, Matthias Kleinmann, Martin Plávala. 2026-09-29. Operational theory for photonic circuits: generalizing linear optics beyond quantum theory. https://arxiv.org/abs/2609.37628

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Modeling Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits

The Gottesman-Kitaev-Preskill (GKP) code is an exciting route to fault-tolerant quantum computing since Gaussian resources and GKP Pauli-eigenstate preparation are sufficient to achieve universal quantum computing. However, there is a disconnect between the noise model that GKP qubits are in theory designed to correct - uniform random displacement errors - and the conditions that affect GKP qubits in superconducting devices in practice: realistic noise channels, logical gates, and inefficient measurements. In this work we bridge this gap in three ways. First, we approximate the effect loss and dephasing on approximate GKP codestates using a random displacement channel, and show that this approximation matches well with numerics. Second, we analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder following the implementation of each gate can reduce the gate infidelity by multiple orders of magnitude. Finally, we consider the effect of homodyne measurement inefficiencies on logical state read-out and analyze a scheme to improve the measurement efficiency using the theory of quantum trajectories.

quant-ph↗
arXiv2026

Testing nonstabilizerness only with stabilizer states

The stabilizer formalism plays a central role in quantum information processing and quantum computing. Since stabilizer states and operations can be efficiently simulated classically and fault-tolerantly implemented in quantum error-correcting codes, quantum states and operations beyond the stabilizer framework, characterized by nonstabilizerness or magic, naturally emerge as resources for quantum computation. Here, we demonstrate that a quantum-information task involving only stabilizer states can reveal a fundamental limitation of stabilizer operations. Specifically, we construct a set of mutually orthogonal stabilizer states that cannot be perfectly distinguished using stabilizer operations and extend this construction to an arbitrary number of qubits. Our results provide an efficient test of nonstabilizerness without requiring the direct use of resourceful states or operations nor relying on computational-hardness assumptions. This nonstabilizerness test could serve as a resource-efficient benchmark for fault-tolerant quantum computers powered by magic-state injection, by providing quantitative bounds on the robustness of magic. More fundamentally, the resulting asymmetry between the preparation and discrimination of free states parallels "nonlocality without entanglement" in entanglement theory, revealing an unexpected connection between these two distinct quantum resource theories.

quant-ph↗
arXiv2026

Quantum Homotopy Algorithm for Solving Nonlinear PDEs and Flow Problems

Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number $Re_{\textrm{H}}$, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.

quant-ph↗