Quantum SEDONet: Spectrally-Embedded Quantum Deep Operator Networks for Partial Differential Equations

• URL: http://arxiv.org/abs/2608.27626v1
• Date: Thu, 27 Aug 2026 19:07:34 GMT
• Title: Quantum SEDONet: Spectrally-Embedded Quantum Deep Operator Networks for Partial Differential Equations
• Abstract summary: We propose Quantum SEDONet, which assigns each trunk coordinate a spectral basis according to its boundary condition.<n>Across four benchmarks, Quantum SEDONet reduces the mean relative L2 error by 54.1% for the antiderivative, 49.6% for advection, 36.2% for Burgers, and 36.2% for a mixed-boundary channel Poisson problem.
• Score: 0.5499796332553707
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum DeepONet accelerates neural-operator inference by evaluating an orthogonally parameterized network on a quantum computer, reproducing in ideal simulation the accuracy of its classical counterpart at asymptotically lower inference cost. Its trunk network, however, receives query coordinates with limited spectral structure, requiring the network to learn oscillatory features through its nonlinearities. We propose Quantum SEDONet (Spectral-Embedded Deep Operator Network), which assigns each trunk coordinate a spectral basis according to its boundary condition: Fourier features for periodic coordinates and Chebyshev features for bounded, non-periodic coordinates. The basis is selected per coordinate rather than per problem, allowing both representations within a single problem. Under unary amplitude encoding, the embedding incurs no additional qubits or circuit depth when its dimension remains within the network width, while increasing the parameter count by only a few percent. Across four benchmarks, Quantum SEDONet reduces the mean relative L2 error by 54.1% for the antiderivative, 49.6% for advection, 36.0% for Burgers, and 36.2% for a mixed-boundary channel Poisson problem. Quantum and classical evaluation paths agree to within 10^-8 throughout. The channel Poisson problem simultaneously uses Fourier features in the periodic direction and Chebyshev features in the bounded direction, demonstrating coordinate-wise boundary-matched spectral embedding without additional quantum-resource cost.

Related papers

• Wavelength-Uniform Quantum Algorithms for Quantum Dynamics [39.740772144144366]
  We develop a quantum algorithm for it all ranges of wavelengths. Specifically, it has a it complexity in spatial dimension, and discretization and bounds it without negative powers of possibly small wavelength, thus enabling it to capture the correct physical observables even if the spatial grid does not resolve the frequency, hence defying the Nyquist-Shannon sampling theorem.
  arXiv  Detail & Related papers  (2026-09-07T12:00:04Z)
• Asymptotic Limits of Entanglement Distribution [43.748379918040854]
  We investigate the limits of entanglement distribution across quantum networks utilizing intermediate stations and local operations.<n>We establish a strict dichotomy: the preservation of entanglement over arbitrarily long distances is possible if the underlying quantum channel admits a correctable subspace.<n>We derive a fundamental lower bound on the physical resource requirements, proving that for channels without a correctable subspace, the number of parallel channels per link must scale at least logarithmically with the number of intermediate stations to sustain a non-zero amount of entanglement.
  arXiv  Detail & Related papers  (2026-05-22T09:56:38Z)
• Quantum Feature Pyramid Gating for Seismic Image Segmentation [0.0]
  This work introduces quantum feature gating, a hybrid segmentation architecture.<n>It embeds a parameterized quantum circuit at feature-fusion points within an encoder-decoder pipeline.<n>It is evaluated on the 2018 TGS Salt Identification Challenge using 4,000 seismic images at 101 x 101 resolution.
  arXiv  Detail & Related papers  (2026-05-14T19:50:01Z)
• Quantum Detection of Sequency-Band Structure [0.5729426778193398]
  We present a quantum algorithm for estimating the amplitude content of user-specified sequency bands in quantum-encoded signals.<n>The method employs a sequency-ordered Quantum Walsh-Hadamard Transform (QWHT), a comparator-based oracle that coherently marks basis states within an arbitrary sequency range.<n>This enables the detection of structured signal components, including both high- and low-sequency features, as well as the identification of rapid sign-change behavior associated with noise or anomalies.
  arXiv  Detail & Related papers  (2026-02-09T08:47:51Z)
• Efficient classical computation of the neural tangent kernel of quantum neural networks [3.7498611358320733]
  We propose an efficient algorithm to estimate the Neural Tangent Kernel (NTK) associated with a broad class of quantum neural networks.<n>These networks consist of arbitrary unitary operators interleaved with parametric gates given by the time evolution generated by an arbitrary Hamiltonian.
  arXiv  Detail & Related papers  (2025-08-06T14:48:01Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Accurate Numerical Simulations of Open Quantum Systems Using Spectral Tensor Trains [0.0]
  Decoherence between qubits is a major bottleneck in quantum computations. We present a numerical method, Quantum Accelerated Propagator Evaluation (Q-ASPEN) Q-ASPEN is arbitrarily accurate and can be applied to provide estimates for resources needed to error-correct quantum computations.
  arXiv  Detail & Related papers  (2024-07-16T02:33:27Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Non-parametric Greedy Optimization of Parametric Quantum Circuits [2.77390041716769]
  This work aims to reduce depth and gate count of PQCs by replacing parametric gates with their approximate fixed non-parametric representations. We observe roughly 14% reduction in depth and 48% reduction in gate count at the cost of 3.33% reduction in inferencing accuracy.
  arXiv  Detail & Related papers  (2024-01-27T15:29:38Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Green, Quantized Federated Learning over Wireless Networks: An Energy-Efficient Design [68.86220939532373]
  The finite precision level is captured through the use of quantized neural networks (QNNs) that quantize weights and activations in fixed-precision format. The proposed FL framework can reduce energy consumption until convergence by up to 70% compared to a baseline FL algorithm.
  arXiv  Detail & Related papers  (2022-07-19T16:37:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.