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.18655

Learning to Program Adaptive Non-Local Observables for Machine Learning

Yu-Ting Lee, Samuel Yen-Chi Chen, Huan-Hsin Tseng

cs.LGquant-phSubmitted Sep 16, 2026• Announced Sep 17, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum neural networks (QNNs) are typically built from variational quantum circuits (VQCs), which are limited by local measurements. Adaptive non-local observables (ANO) address this by jointly optimizing circuit parameters and multi-qubit measurements. However, existing ANO-based VQCs learn only a single static observable that remains invariant across all inputs. We propose QFWP-ANO, a novel architecture which employs a classical hypernetwork to dynamically program VQC parameters and/or non-local observables conditioned on each input. On multivariate time-series forecasting across four ETT datasets, QFWP-ANO achieves the lowest MSE in 16 of 20 settings and second-lowest in the remaining four, surpassing ANO-based and other strong baselines. On reinforcement learning tasks, QFWP-ANO consistently surpasses ANO-VQCs. Our results establish input-conditioned ANO as an effective approach for enhancing QNNs.

AI Summary

The paper asks whether conditioning trainable non-local observables on each input improves quantum neural networks relative to learning one fixed observable per task. It introduces QFWP-ANO, combining a data-reuploading variational circuit with a classical encoder–decoder hypernetwork that generates circuit rotation angles, observable parameters, or both. Unlike recurrent quantum fast-weight programmers, the model processes inputs independently without accumulated memory. Outputs are expectation values over all $\binom{n}{k}$ subsets of $k$ qubits, using trainable Hermitian observables with $4^k$ real parameters. Evaluation covers forecasting on four Electricity Transformer Temperature datasets and reinforcement learning on Acrobot and MiniGrid-SimpleCrossingS9N1, averaged over ten random seeds. Forecasting uses seven qubits, a lookback of 16, five horizons, and a sweep over $k=1,\ldots,7$ and circuit depths $D\in\{1,3\}$. Taking the best variant, QFWP-ANO achieves lowest MSE, including ties, in 16 of 20 settings and second-lowest in four; it improves on the static-observable ANO baseline in 17 settings. Observable-conditioned variants generally outperform angle-only conditioning. Four-qubit reinforcement-learning experiments report faster Acrobot learning and the highest final navigation reward for joint conditioning. The reported gains depend on the setting: Acrobot models ultimately reach similar returns, and forecasting does not improve over the best baseline everywhere. Ablations favor moderate locality, $k\approx2$–$3$; performance deteriorates at $k=7$, attributed to having only one output expectation value. Deeper circuits generally do not improve forecasting performance.

Little sign of AI-generated textIncrementalSmall numerics onlyMissing comparison

Error found: For ETTm1 at forecasting horizon 48, the reported MSEs imply an 8.3% improvement over the best baseline, rather than the stated 6.6%. The experiments do not isolate a specifically non-local quantum-measurement contribution from the added classical hypernetwork, since the allowed input-conditioned observable includes H(x)=g(x)I and no matched control excluding this classical prediction route is reported.

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

Related papers

Quantum Reinforcement Learning by Adaptive Non-Local Observables

Hsin-Yi Lin, Samuel Yen-Chi Chen, Huan-Hsin Tseng +1 more

Hybrid quantum-classical frameworks leverage quantum computing for machine learning; however, variational quantum circuits (VQCs) are limited by local measurements. We introduce an adaptive non-local observable (ANO) paradigm within VQCs for quantum reinforcement learning (QRL), jointly optimizing circuit parameters and multi-qubit measurements. The ANO-VQC architecture serves as the function approximator in Deep Q-Network (DQN) and Asynchronous Advantage Actor-Critic (A3C) algorithms. On multiple benchmark tasks, ANOVQC agents outperform baseline VQCs. Ablation studies reveal that adaptive measurements enhance the function space without increasing circuit depth. Our results demonstrate that adaptive multi-qubit observables can enable practical quantum advantages in reinforcement learning.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•3 citations

Multivariate Time Series Forecasting with Adaptive Non-Local Observables

Yu-Ting Lee, Huan-Hsin Tseng, Samuel Yen-Chi Chen

Multivariate time series forecasting (MTSF) predicts future values of multiple variables from historical data. While quantum neural networks have been increasingly applied to this task, they typically rely on fixed local measurements, which restrict their expressivity. We propose MTSF-ANO, a simple hybrid model for MTSF that integrates variational quantum circuits with adaptive non-local observables (ANO). On the four ETT datasets, MTSF-ANO ranks first or second in MSE in 17 of 20 settings, improving over the strongest baseline by up to 20% on ETTh1, and outperforms or matches its fixed local observable counterpart across all settings. Our ablations show how the quantum circuit design and ANO non-locality affect performance. These results suggest that ANO is a promising direction for quantum time series forecasting.

quant-pharXiv:2607.24399•Jul 28, 2026•0 citations

Diagonal Adaptive Non-local Observables on Quantum Neural Networks

Huan-Hsin Tseng, Yan Li, Hsin-Yi Lin +1 more

Adaptive Non-local Observables (ANOs) have shown that making quantum observables dynamic can substantially enlarge the function space of Variational Quantum Algorithms, partly shifting hardware demands from circuit synthesis to measurement design. However, this advantage is accompanied by a steep increase in the number of parameters, as well as the classical optimization cost for varying general Hermitian observables. We propose a special form of ANO that significantly reduces this burden by considering only diagonal observables paired with quantum circuits. Mathematically, this is equivalent to the full ANO of a large parameter space since diagonal matrices are canonical representatives of the ANO space modulo unitary similarity. As a result, Diagonal ANO retains the same capability of full ANO while reducing $k$-local observable complexity from $O(4^k)$ to $O(2^k)$ and lowering the corresponding measurement-side classical computation. In this sense, diagonal ANO preserves much of the benefit of full ANO while encompassing conventional VQCs as a special case.

quant-pharXiv:2605.15410•International Conference on Computer Communications and Networks (ICCCN)•May 18, 2026•1 citation

Adaptive Non-Local Observable on Quantum Neural Networks

Hsin-Yi Lin, Huan-Hsin Tseng, Samuel Yen-Chi Chen +1 more

Conventional Variational Quantum Circuits (VQCs) for Quantum Machine Learning typically rely on a fixed Hermitian observable, often built from Pauli operators. Inspired by the Heisenberg picture, we propose an adaptive non-local measurement framework that substantially increases the model complexity of the quantum circuits. Our introduction of dynamical Hermitian observables with evolving parameters shows that optimizing VQC rotations corresponds to tracing a trajectory in the observable space. This viewpoint reveals that standard VQCs are merely a special case of the Heisenberg representation. Furthermore, we show that properly incorporating variational rotations with non-local observables enhances qubit interaction and information mixture, admitting flexible circuit designs. Two non-local measurement schemes are introduced, and numerical simulations on classification tasks confirm that our approach outperforms conventional VQCs, yielding a more powerful and resource-efficient approach as a Quantum Neural Network.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•5 citations

Quantum Super-resolution by Adaptive Non-local Observables

Hsin-Yi Lin, Huan-Hsin Tseng, Samuel Yen-Chi Chen +1 more

Super-resolution (SR) seeks to reconstruct high-resolution (HR) data from low-resolution (LR) observations. Classical deep learning methods have advanced SR substantially, but require increasingly deeper networks, large datasets, and heavy computation to capture fine-grained correlations. In this work, we present the \emph{first study} to investigate quantum circuits for SR. We propose a framework based on Variational Quantum Circuits (VQCs) with \emph{Adaptive Non-Local Observable} (ANO) measurements. Unlike conventional VQCs with fixed Pauli readouts, ANO introduces trainable multi-qubit Hermitian observables, allowing the measurement process to adapt during training. This design leverages the high-dimensional Hilbert space of quantum systems and the representational structure provided by entanglement and superposition. Experiments demonstrate that ANO-VQCs achieve up to five-fold higher resolution with a relatively small model size, suggesting a promising new direction at the intersection of quantum machine learning and super-resolution.

quant-pharXiv:2601.14433•IEEE International Conference on Acoustics Speech and Signal Processing•Jan 22, 2026•4 citations

Learning to Program Variational Quantum Circuits with Fast Weights

Samuel Yen-Chi Chen

Quantum Machine Learning (QML) has surfaced as a pioneering framework addressing sequential control tasks and time-series modeling. It has demonstrated empirical quantum advantages notably within domains such as Reinforcement Learning (RL) and time-series prediction. A significant advancement lies in Quantum Recurrent Neural Networks (QRNNs), specifically tailored for memory-intensive tasks encompassing partially observable environments and non-linear time-series prediction. Nevertheless, QRNN-based models encounter challenges, notably prolonged training duration stemming from the necessity to compute quantum gradients using backpropagation-through-time (BPTT). This predicament exacerbates when executing the complete model on quantum devices, primarily due to the substantial demand for circuit evaluation arising from the parameter-shift rule. This paper introduces the Quantum Fast Weight Programmers (QFWP) as a solution to the temporal or sequential learning challenge. The QFWP leverages a classical neural network (referred to as the ’slow programmer’) functioning as a quantum programmer to swiftly modify the parameters of a variational quantum circuit (termed the ’fast programmer’). Instead of completely overwriting the fast programmer at each time-step, the slow programmer generates parameter changes or updates for the quantum circuit parameters. This approach enables the fast programmer to incorporate past observations or information. Notably, the proposed QFWP model achieves learning of temporal dependencies without necessitating the use of quantum recurrent neural networks. Numerical simulations conducted in this study showcase the efficacy of the proposed QFWP model in both time-series prediction and RL tasks. The model exhibits performance levels either comparable to or surpassing those achieved by QLSTM-based models.

arXiv:2402.17760•International Joint Conference on Neural Networks (IJCNN)•Jun 30, 2024•28 citations
Quantum neural networks (QNNs) are typically built from variational quantum circuits (VQCs), which are limited by local measurements. Adaptive non-local observables (ANO) address this by jointly optimizing circuit parameters and multi-qubit measurements. However, existing ANO-based VQCs learn only a single static observable that remains invariant across all inputs. We propose QFWP-ANO, a novel architecture which employs a classical hypernetwork to dynamically program VQC parameters and/or non-local observables conditioned on each input. On multivariate time-series forecasting across four ETT datasets, QFWP-ANO achieves the lowest MSE in 16 of 20 settings and second-lowest in the remaining four, surpassing ANO-based and other strong baselines. On reinforcement learning tasks, QFWP-ANO consistently surpasses ANO-VQCs. Our results establish input-conditioned ANO as an effective approach for enhancing QNNs.
The paper asks whether conditioning trainable non-local observables on each input improves quantum neural networks relative to learning one fixed observable per task. It introduces QFWP-ANO, combining a data-reuploading variational circuit with a classical encoder–decoder hypernetwork that generates circuit rotation angles, observable parameters, or both. Unlike recurrent quantum fast-weight programmers, the model processes inputs independently without accumulated memory. Outputs are expectation values over all (nk)\binom{n}{k}(kn​) subsets of kkk qubits, using trainable Hermitian observables with 4k4^k4k real parameters.
Evaluation covers forecasting on four Electricity Transformer Temperature datasets and reinforcement learning on Acrobot and MiniGrid-SimpleCrossingS9N1, averaged over ten random seeds. Forecasting uses seven qubits, a lookback of 16, five horizons, and a sweep over k=1,…,7k=1,\ldots,7k=1,…,7 and circuit depths D∈{1,3}D\in\{1,3\}D∈{1,3}. Taking the best variant, QFWP-ANO achieves lowest MSE, including ties, in 16 of 20 settings and second-lowest in four; it improves on the static-observable ANO baseline in 17 settings. Observable-conditioned variants generally outperform angle-only conditioning. Four-qubit reinforcement-learning experiments report faster Acrobot learning and the highest final navigation reward for joint conditioning.
The reported gains depend on the setting: Acrobot models ultimately reach similar returns, and forecasting does not improve over the best baseline everywhere. Ablations favor moderate locality, k≈2k\approx2k≈2–333; performance deteriorates at k=7k=7k=7, attributed to having only one output expectation value. Deeper circuits generally do not improve forecasting performance.
Hybrid quantum-classical frameworks leverage quantum computing for machine learning; however, variational quantum circuits (VQCs) are limited by local measurements. We introduce an adaptive non-local observable (ANO) paradigm within VQCs for quantum reinforcement learning (QRL), jointly optimizing circuit parameters and multi-qubit measurements. The ANO-VQC architecture serves as the function approximator in Deep Q-Network (DQN) and Asynchronous Advantage Actor-Critic (A3C) algorithms. On multiple benchmark tasks, ANOVQC agents outperform baseline VQCs. Ablation studies reveal that adaptive measurements enhance the function space without increasing circuit depth. Our results demonstrate that adaptive multi-qubit observables can enable practical quantum advantages in reinforcement learning.
Multivariate time series forecasting (MTSF) predicts future values of multiple variables from historical data. While quantum neural networks have been increasingly applied to this task, they typically rely on fixed local measurements, which restrict their expressivity. We propose MTSF-ANO, a simple hybrid model for MTSF that integrates variational quantum circuits with adaptive non-local observables (ANO). On the four ETT datasets, MTSF-ANO ranks first or second in MSE in 17 of 20 settings, improving over the strongest baseline by up to 20% on ETTh1, and outperforms or matches its fixed local observable counterpart across all settings. Our ablations show how the quantum circuit design and ANO non-locality affect performance. These results suggest that ANO is a promising direction for quantum time series forecasting.
Adaptive Non-local Observables (ANOs) have shown that making quantum observables dynamic can substantially enlarge the function space of Variational Quantum Algorithms, partly shifting hardware demands from circuit synthesis to measurement design. However, this advantage is accompanied by a steep increase in the number of parameters, as well as the classical optimization cost for varying general Hermitian observables. We propose a special form of ANO that significantly reduces this burden by considering only diagonal observables paired with quantum circuits. Mathematically, this is equivalent to the full ANO of a large parameter space since diagonal matrices are canonical representatives of the ANO space modulo unitary similarity. As a result, Diagonal ANO retains the same capability of full ANO while reducing kkk-local observable complexity from O(4k)O(4^k)O(4k) to O(2k)O(2^k)O(2k) and lowering the corresponding measurement-side classical computation. In this sense, diagonal ANO preserves much of the benefit of full ANO while encompassing conventional VQCs as a special case.
Conventional Variational Quantum Circuits (VQCs) for Quantum Machine Learning typically rely on a fixed Hermitian observable, often built from Pauli operators. Inspired by the Heisenberg picture, we propose an adaptive non-local measurement framework that substantially increases the model complexity of the quantum circuits. Our introduction of dynamical Hermitian observables with evolving parameters shows that optimizing VQC rotations corresponds to tracing a trajectory in the observable space. This viewpoint reveals that standard VQCs are merely a special case of the Heisenberg representation. Furthermore, we show that properly incorporating variational rotations with non-local observables enhances qubit interaction and information mixture, admitting flexible circuit designs. Two non-local measurement schemes are introduced, and numerical simulations on classification tasks confirm that our approach outperforms conventional VQCs, yielding a more powerful and resource-efficient approach as a Quantum Neural Network.
Super-resolution (SR) seeks to reconstruct high-resolution (HR) data from low-resolution (LR) observations. Classical deep learning methods have advanced SR substantially, but require increasingly deeper networks, large datasets, and heavy computation to capture fine-grained correlations. In this work, we present the \emph{first study} to investigate quantum circuits for SR. We propose a framework based on Variational Quantum Circuits (VQCs) with \emph{Adaptive Non-Local Observable} (ANO) measurements. Unlike conventional VQCs with fixed Pauli readouts, ANO introduces trainable multi-qubit Hermitian observables, allowing the measurement process to adapt during training. This design leverages the high-dimensional Hilbert space of quantum systems and the representational structure provided by entanglement and superposition. Experiments demonstrate that ANO-VQCs achieve up to five-fold higher resolution with a relatively small model size, suggesting a promising new direction at the intersection of quantum machine learning and super-resolution.
Quantum Machine Learning (QML) has surfaced as a pioneering framework addressing sequential control tasks and time-series modeling. It has demonstrated empirical quantum advantages notably within domains such as Reinforcement Learning (RL) and time-series prediction. A significant advancement lies in Quantum Recurrent Neural Networks (QRNNs), specifically tailored for memory-intensive tasks encompassing partially observable environments and non-linear time-series prediction. Nevertheless, QRNN-based models encounter challenges, notably prolonged training duration stemming from the necessity to compute quantum gradients using backpropagation-through-time (BPTT). This predicament exacerbates when executing the complete model on quantum devices, primarily due to the substantial demand for circuit evaluation arising from the parameter-shift rule. This paper introduces the Quantum Fast Weight Programmers (QFWP) as a solution to the temporal or sequential learning challenge. The QFWP leverages a classical neural network (referred to as the ’slow programmer’) functioning as a quantum programmer to swiftly modify the parameters of a variational quantum circuit (termed the ’fast programmer’). Instead of completely overwriting the fast programmer at each time-step, the slow programmer generates parameter changes or updates for the quantum circuit parameters. This approach enables the fast programmer to incorporate past observations or information. Notably, the proposed QFWP model achieves learning of temporal dependencies without necessitating the use of quantum recurrent neural networks. Numerical simulations conducted in this study showcase the efficacy of the proposed QFWP model in both time-series prediction and RL tasks. The model exhibits performance levels either comparable to or surpassing those achieved by QLSTM-based models.