Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.37746

Optical Fourier Architecture for Universal Nonlinear Functions

Martin F. X. Mauser, Joshua Morris, Sara Galatro, Philip Walther, Borivoje Dakic

physics.opticsquant-phSubmitted Sep 29, 2026• Announced Sep 30, 2026• 1 citation
arXivHTMLPDF

Abstract

We introduce an exact algebraic architecture that evaluates an arbitrary finite Fourier series using a two-mode ($2 \times 2$) linear optical circuit, with the only tunable components being single-mode phase shifters encoding the function argument. We prove that such a circuit must exist for every Fourier series and derive an analytical method for its construction based on spectral factorisation. The resulting optical system exhibits an $\mathcal{O}(N)$ depth for an $N$-harmonic expansion, executing function evaluations in the passive optical time-of-flight. Finally, we validate our claims numerically, demonstrating that even for sequences with thousands of Fourier terms, our proposed circuit construction correctly synthesises continuous and discontinuous nonlinear functions. Our architecture thus provides a universal, deterministic foundation for single-variable nonlinear optical computing on integrated photonic platforms.

AI Summary

The paper addresses how to synthesize a prescribed single-variable nonlinear function using a two-mode linear optical circuit, with the argument encoded in phase shifters rather than input amplitudes. It represents the target by a finite Fourier series $\hat f(x)=\sum_{n=-N}^{N}a_ne^{in\pi x/\tau}$ and constructs fixed two-mode unitaries interleaved with repeated argument-dependent phase shifts. The nonlinearity is with respect to the encoded parameter; optical amplitude evolution remains linear. For any such series and input power $C>\max_x|\hat f(x)|^2$, the Fejér–Riesz theorem guarantees a complementary polynomial $g$ satisfying $|\hat f|^2+|g|^2=C$. Constant norm implies orthogonality of the endpoint coefficient vectors, enabling recursive removal of harmonics and synthesis using at most $2N$ phase-shifter/unitary stages. This establishes exact realization of the truncated series in ideal arithmetic. Spectral factorization is implemented using finite-section banded Toeplitz Cholesky decomposition, with root-pairing and FFT-based cepstral alternatives benchmarked numerically. Simulations cover smooth and staircase functions with thousands of Fourier terms. Reported spectral-factorization residuals remain near $10^{-15}$ for smooth targets and below $10^{-6}$ for discontinuous targets using Cholesky or cepstral methods. Measured factorization runtime scales approximately as $K^{2.09}$ and $K^{1.07}$, respectively. The construction is univariate; the same spectral-factorization guarantee does not extend to multiple variables. Discontinuous targets retain Fourier-truncation and Gibbs effects. Evaluation latency includes circuit propagation and phase programming, while composing functions generally requires optical-to-electrical conversion to program subsequent stages. No experimental implementation is reported.

Some signs of AI-generated textOverclaimsUnclear noveltyMissing comparisonPossible error

Error found: The physical circuit produces z^N f(z), so recovering the target complex amplitude relative to an external reference requires accounting for the known argument-dependent common phase. The finite-section Cholesky implementation has additional numerical factorisation error, contrary to the unqualified statement that compilation adds no error beyond Fourier truncation. The claimed O(N) classical construction complexity is unsupported by the displayed quadratic-work layer reduction and the adopted factorisation's reported approximately quadratic scaling. The universal finite-truncation error statement omits periodicity and convergence qualifications, and almost-everywhere L² convergence does not provide a uniform finite-cutoff error guarantee. Normalised output intensity yields |f(z)|²/C rather than the signed or complex target function, contradicting the appendix's stated recovery rule.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
10 pages, 3 figures

Related papers

Programmable nonlinear function synthesis on a photonic processor with quantum signal processing

Elaheh Karooby, Masoud Hakimi Heris, Yuan Liu +1 more

Programmable photonic integrated circuits are emerging as increasingly large and versatile interferometric processors operating at room temperature. However, their native operations are linear, while many computational tasks require nonlinear input-output transformations that typically rely on nonlinear optical materials or resonant devices. Here, we establish a direct mapping between quantum signal processing (QSP) and the native two-mode operations of programmable interferometric photonic integrated circuits, showing that the $SU(2)$ structure required by QSP can be realized through programmable phase control and mode mixing. We experimentally demonstrate this correspondence using dual-rail single-photon encoding on a 24-mode programmable photonic integrated circuit, realizing QSP sequences up to depth $L=11$ and synthesizing STEP, ReLU and SELU functions through programmable phase control. The optical transformation remains linear, while repeated encoding of the input variable and coherent interference produce a nonlinear dependence of the output probabilities on the encoded variable. Across all accessible circuit depths, the measured responses follow the programmed QSP transformations, with hardware-induced mean squared errors between $10^{-3}$ and $10^{-2}$, all remaining below the intrinsic finite-depth approximation error. These results establish an algorithm-to-hardware mapping of QSP on programmable photonic processors. They also demonstrate an algorithmic route to programmable nonlinear functions of encoded variables on linear photonic hardware.

quant-pharXiv:2609.14153•Sep 15, 2026•2 citations

Extensible universal photonic quantum computing with nonlinearity

Shang Yu, Jinzhao Sun, Kuan-Cheng Chen +17 more

Universal quantum computing requires an architecture that supports both linear circuits and, crucially, strong nonlinear resources. For quantum photonic systems, integrating such nonlinearities with scalable linear circuitry has been a major bottleneck, leaving most optical experiments without nonlinear operations and, consequently, incapable of achieving universality. Here, we report an extensible photonic computer that supports a universal gate set by seamlessly combining fully programmable, scalable linear optical networks with integrated nonlinear modules. This platform enables a broad range of quantum computing and simulation tasks. We demonstrate the quasi-deterministic generation of optical Gottesman-Kitaev-Preskill states, which are essential resources for bosonic error correction, yet had previously been realized only probabilistically. Furthermore, we simulate complex many-body quantum dynamics, exemplified by the Bose-Hubbard model. Such quantum simulation tasks have long been considered beyond the reach of photonic hardware limited to linear operations. These capabilities, enabled by our extensible architecture, establish a viable route towards photonic quantum simulation and fault-tolerant quantum computing.

quant-pharXiv:2602.06544•Nature Photonics•Feb 9, 2026•8 citations

An algebraic approach to linear-optical schemes for deterministic quantum computing

Paolo Aniello, Ruben Coen-Cagli

Linear-optical passive (LOP) devices and photon counters are sufficient to implement universal quantum computation with single photons, and particular schemes have already been proposed. In this paper we discuss the link between the algebraic structure of LOP transformations and quantum computing. We first show how to decompose the Fock space of N optical modes in finite-dimensional subspaces that are suitable for encoding strings of qubits and invariant under LOP transformations (these subspaces are related to the spaces of irreducible unitary representations of U ( N ). Next we show how to design in algorithmic fashion LOP circuits which implement any quantum circuit deterministically. We also present some simple examples, such as the circuits implementing a cNOT gate and a Bell state generator/analyser.

arXiv:quant-ph/0504108•Journal of Optics B Quantum and Semiclassical Optics•Nov 22, 2005•14 citations

Universality of Layered Programmable Decompositions by Fourier Absorption

Javier Álvarez-Vizoso, David Barral

Decomposing arbitrary unitary transformations into physically realizable operations is fundamental to quantum information, quantum control, and linear optics. Layered programmable architectures implement such transformations by alternating tunable phase masks with fixed mode mixers. However, establishing their universality at fixed depth remains challenging: we show that neither a sufficient parameter count nor successful synthesis of sampled targets guarantees global coverage. We prove that an architecture is universal exactly when every reachable transformation can absorb a diagnostic input Fourier multiport by reprogramming its phase masks. The associated Fourier absorption residual (FAR) requires no external target ensemble, vanishes exactly for universal architectures, and bounds worst-target synthesis error. For four-mode Fourier architectures, a permutation obstruction rules out universality with five masks, even under small unitary mixer perturbations, whereas a constructive factorization establishes universality with seven. Beyond exact universality, comparison with a universal reference of the same depth yields certified uniform approximation bounds in terms of unitary mixer errors. Finally, numerical simulations using a geodesic phase optimizer illustrate the distinction between Fourier absorption and direct target synthesis.

quant-pharXiv:2510.19397•Oct 23, 2025•5 citations

Modular and Looping Quantum Photonic Processing Unit for Quantum Computing

Denis Stanev, Nicolò Spagnolo, Fabio Sciarrino

Photonic processors are emerging as promising platforms in the race towards the realization of practical universal quantum computers. Several architectures with universal capabilities have been proposed for their implementation via a photonic platform, each with their own set of benefits and drawbacks. In this work we propose an architecture for a universal photonic quantum computer. The proposed architecture is modular, allowing for a high degree of flexibility and scalability, and relies on a loop-based structure, significantly reducing the number of physical components required to implement it experimentally. We prove that our architecture is universal, deterministic, and compatible with the quantum circuital model, as well as reprogrammable and capable of adaptive measurements. Furthermore, we showcase its functioning via numerical simulation on specific examples, by using machine learning techniques on a set of fundamental linear and nonlinear optical components to obtain some of the building blocks used in the architecture. The obtained results can be used to highlight the benefits and the drawbacks of the proposed architecture, as well as the route for future developments towards its physical implementation.

arXiv:2611.12126•Nov 9, 2026•0 citations

A dataflow programming framework for linear optical distributed quantum computing

Giovanni de Felice, Boldizsár Poór, Cole Comfort +4 more

Photonic systems offer a promising platform for interconnecting quantum processors and enabling scalable, networked architectures. Designing and verifying such architectures requires a unified formalism that integrates linear algebraic reasoning with probabilistic and control-flow structures. In this work, we introduce a graphical framework for distributed quantum computing that brings together linear optics, the ZX-calculus, and dataflow programming. Our language supports the formal analysis and optimization of distributed protocols involving both qubits and photonic modes, with explicit interfaces for classical control and feedforward, all expressed within a synchronous dataflow model with discrete-time dynamics. Within this setting, we classify entangling photonic fusion measurements, show how their induced Pauli errors can be corrected via a novel flow structure for fusion networks, and establish correctness proofs for new repeat-until-success protocols enabling arbitrary fusions. Layer by layer, we construct qubit architectures incorporating practical optical components such as beam splitters, switches, and photon sources, with graphical proofs that they are deterministic and support universal quantum computation. Together, these results establish a foundation for verifiable compilation and automated optimization in networked quantum computing.

quant-pharXiv:2601.08389•Quantum•Jan 14, 2026•6 citations
We introduce an exact algebraic architecture that evaluates an arbitrary finite Fourier series using a two-mode (2×22 \times 22×2) linear optical circuit, with the only tunable components being single-mode phase shifters encoding the function argument. We prove that such a circuit must exist for every Fourier series and derive an analytical method for its construction based on spectral factorisation. The resulting optical system exhibits an O(N)\mathcal{O}(N)O(N) depth for an NNN-harmonic expansion, executing function evaluations in the passive optical time-of-flight. Finally, we validate our claims numerically, demonstrating that even for sequences with thousands of Fourier terms, our proposed circuit construction correctly synthesises continuous and discontinuous nonlinear functions. Our architecture thus provides a universal, deterministic foundation for single-variable nonlinear optical computing on integrated photonic platforms.
The paper addresses how to synthesize a prescribed single-variable nonlinear function using a two-mode linear optical circuit, with the argument encoded in phase shifters rather than input amplitudes. It represents the target by a finite Fourier series f^(x)=∑n=−NNaneinπx/τ\hat f(x)=\sum_{n=-N}^{N}a_ne^{in\pi x/\tau}f^​(x)=∑n=−NN​an​einπx/τ and constructs fixed two-mode unitaries interleaved with repeated argument-dependent phase shifts. The nonlinearity is with respect to the encoded parameter; optical amplitude evolution remains linear.
For any such series and input power C>max⁡x∣f^(x)∣2C>\max_x|\hat f(x)|^2C>maxx​∣f^​(x)∣2, the Fejér–Riesz theorem guarantees a complementary polynomial ggg satisfying ∣f^∣2+∣g∣2=C|\hat f|^2+|g|^2=C∣f^​∣2+∣g∣2=C. Constant norm implies orthogonality of the endpoint coefficient vectors, enabling recursive removal of harmonics and synthesis using at most 2N2N2N phase-shifter/unitary stages. This establishes exact realization of the truncated series in ideal arithmetic. Spectral factorization is implemented using finite-section banded Toeplitz Cholesky decomposition, with root-pairing and FFT-based cepstral alternatives benchmarked numerically.
Simulations cover smooth and staircase functions with thousands of Fourier terms. Reported spectral-factorization residuals remain near 10−1510^{-15}10−15 for smooth targets and below 10−610^{-6}10−6 for discontinuous targets using Cholesky or cepstral methods. Measured factorization runtime scales approximately as K2.09K^{2.09}K2.09 and K1.07K^{1.07}K1.07, respectively.
The construction is univariate; the same spectral-factorization guarantee does not extend to multiple variables. Discontinuous targets retain Fourier-truncation and Gibbs effects. Evaluation latency includes circuit propagation and phase programming, while composing functions generally requires optical-to-electrical conversion to program subsequent stages. No experimental implementation is reported.
Programmable photonic integrated circuits are emerging as increasingly large and versatile interferometric processors operating at room temperature. However, their native operations are linear, while many computational tasks require nonlinear input-output transformations that typically rely on nonlinear optical materials or resonant devices. Here, we establish a direct mapping between quantum signal processing (QSP) and the native two-mode operations of programmable interferometric photonic integrated circuits, showing that the SU(2)SU(2)SU(2) structure required by QSP can be realized through programmable phase control and mode mixing. We experimentally demonstrate this correspondence using dual-rail single-photon encoding on a 24-mode programmable photonic integrated circuit, realizing QSP sequences up to depth L=11L=11L=11 and synthesizing STEP, ReLU and SELU functions through programmable phase control. The optical transformation remains linear, while repeated encoding of the input variable and coherent interference produce a nonlinear dependence of the output probabilities on the encoded variable. Across all accessible circuit depths, the measured responses follow the programmed QSP transformations, with hardware-induced mean squared errors between 10−310^{-3}10−3 and 10−210^{-2}10−2, all remaining below the intrinsic finite-depth approximation error. These results establish an algorithm-to-hardware mapping of QSP on programmable photonic processors. They also demonstrate an algorithmic route to programmable nonlinear functions of encoded variables on linear photonic hardware.
Universal quantum computing requires an architecture that supports both linear circuits and, crucially, strong nonlinear resources. For quantum photonic systems, integrating such nonlinearities with scalable linear circuitry has been a major bottleneck, leaving most optical experiments without nonlinear operations and, consequently, incapable of achieving universality. Here, we report an extensible photonic computer that supports a universal gate set by seamlessly combining fully programmable, scalable linear optical networks with integrated nonlinear modules. This platform enables a broad range of quantum computing and simulation tasks. We demonstrate the quasi-deterministic generation of optical Gottesman-Kitaev-Preskill states, which are essential resources for bosonic error correction, yet had previously been realized only probabilistically. Furthermore, we simulate complex many-body quantum dynamics, exemplified by the Bose-Hubbard model. Such quantum simulation tasks have long been considered beyond the reach of photonic hardware limited to linear operations. These capabilities, enabled by our extensible architecture, establish a viable route towards photonic quantum simulation and fault-tolerant quantum computing.
Linear-optical passive (LOP) devices and photon counters are sufficient to implement universal quantum computation with single photons, and particular schemes have already been proposed. In this paper we discuss the link between the algebraic structure of LOP transformations and quantum computing. We first show how to decompose the Fock space of N optical modes in finite-dimensional subspaces that are suitable for encoding strings of qubits and invariant under LOP transformations (these subspaces are related to the spaces of irreducible unitary representations of U ( N ). Next we show how to design in algorithmic fashion LOP circuits which implement any quantum circuit deterministically. We also present some simple examples, such as the circuits implementing a cNOT gate and a Bell state generator/analyser.
Decomposing arbitrary unitary transformations into physically realizable operations is fundamental to quantum information, quantum control, and linear optics. Layered programmable architectures implement such transformations by alternating tunable phase masks with fixed mode mixers. However, establishing their universality at fixed depth remains challenging: we show that neither a sufficient parameter count nor successful synthesis of sampled targets guarantees global coverage. We prove that an architecture is universal exactly when every reachable transformation can absorb a diagnostic input Fourier multiport by reprogramming its phase masks. The associated Fourier absorption residual (FAR) requires no external target ensemble, vanishes exactly for universal architectures, and bounds worst-target synthesis error. For four-mode Fourier architectures, a permutation obstruction rules out universality with five masks, even under small unitary mixer perturbations, whereas a constructive factorization establishes universality with seven. Beyond exact universality, comparison with a universal reference of the same depth yields certified uniform approximation bounds in terms of unitary mixer errors. Finally, numerical simulations using a geodesic phase optimizer illustrate the distinction between Fourier absorption and direct target synthesis.
Photonic processors are emerging as promising platforms in the race towards the realization of practical universal quantum computers. Several architectures with universal capabilities have been proposed for their implementation via a photonic platform, each with their own set of benefits and drawbacks. In this work we propose an architecture for a universal photonic quantum computer. The proposed architecture is modular, allowing for a high degree of flexibility and scalability, and relies on a loop-based structure, significantly reducing the number of physical components required to implement it experimentally. We prove that our architecture is universal, deterministic, and compatible with the quantum circuital model, as well as reprogrammable and capable of adaptive measurements. Furthermore, we showcase its functioning via numerical simulation on specific examples, by using machine learning techniques on a set of fundamental linear and nonlinear optical components to obtain some of the building blocks used in the architecture. The obtained results can be used to highlight the benefits and the drawbacks of the proposed architecture, as well as the route for future developments towards its physical implementation.
Photonic systems offer a promising platform for interconnecting quantum processors and enabling scalable, networked architectures. Designing and verifying such architectures requires a unified formalism that integrates linear algebraic reasoning with probabilistic and control-flow structures. In this work, we introduce a graphical framework for distributed quantum computing that brings together linear optics, the ZX-calculus, and dataflow programming. Our language supports the formal analysis and optimization of distributed protocols involving both qubits and photonic modes, with explicit interfaces for classical control and feedforward, all expressed within a synchronous dataflow model with discrete-time dynamics. Within this setting, we classify entangling photonic fusion measurements, show how their induced Pauli errors can be corrected via a novel flow structure for fusion networks, and establish correctness proofs for new repeat-until-success protocols enabling arbitrary fusions. Layer by layer, we construct qubit architectures incorporating practical optical components such as beam splitters, switches, and photon sources, with graphical proofs that they are deterministic and support universal quantum computation. Together, these results establish a foundation for verifiable compilation and automated optimization in networked quantum computing.