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

Electronic Notes in Discrete Mathematics

Quantum Predictor Models

Ulrich Faigle, Alexander Schönhuth

Published Jul 25, 2006• 7 citations
Publisher
DOI
10.1016/j.endm.2006.06.075

Related papers

Quantum Algorithms for Universal Prediction

Elliot Catt

•Jan 1, 2018•0 citations

Quantum Architecture Search with Neural Predictor Based on Graph Measures

Zhimin He, Zhengjiang Li, Maijie Deng +3 more

Abstract Quantum architecture search (QAS) has attracted increasing attention owing to its remarkable ability to automate the design of quantum circuits for variational quantum algorithms (VQAs). However, evaluating the performance of numerous quantum circuits is essential to provide feedback for the search strategy, which inevitably renders QAS computationally expensive. Performance predictors have emerged as highly efficient evaluation methods to mitigate this challenge. However, the performance predictor faces a critical challenge in reducing the required number of circuit‐performance pairs for training. This study encodes circuit architecture by representing a quantum circuit as a relational graph that emphasizes message exchange. Subsequently, valuable information about circuit architecture is extracted through three types of graph measures, including distance‐based, degree‐based, and cluster‐based measures. The graph measures define a smooth space related to circuit performance, facilitating the training of the performance predictor. The effectiveness of the proposed method is assessed across three tasks within variational quantum eigensolvers (VQE): identifying the ground states of the Transverse Field Ising Model (TFIM), the Heisenberg model, and the molecule. The simulation results demonstrate notable enhancements in predictive accuracy achieved by our method, coupled with a substantial reduction in the required number of training samples for the predictor.

Advanced Quantum Technologies•Aug 12, 2024•6 citations

Extended quantum models

Miroslav Svítek

Elsevier eBooks•Jan 1, 2021•0 citations

Quantum decoherence induced by irreversible logical erasure in a classical predictor

Alberto Valis

This repository presents a theoretical and experimental proposal for a non-conservative source of quantum decoherence linked to irreversible logical erasure in a physically coupled classical system. The work introduces a minimal model in which a quantum system is weakly coupled to a classical predictor performing real-time inference. When the predictor irreversibly erases internal counterfactual states, the model predicts an additional decoherence channel that scales with the rate of logical erasure, independently of energy dissipation or measurement strength. The manuscript derives the expected scaling, defines strict null tests excluding standard decoherence mechanisms, and outlines a concrete experimental protocol designed to be decisively falsifiable. No experimental data are included. This deposit establishes theoretical priority and experimental criteria for testing the proposed effect.

•Dec 28, 2025•0 citations

Quantum architecture generation via predictor-guided diffusion models

Anonymous, Jialiang Gu, Raymond H. Ho +4 more

Physical Review A•Sep 28, 2026•0 citations

Quantum Machine Learning

Lucas Lamata, José D. Martín‐Guerrero

Advanced Quantum Technologies•Nov 11, 2025•2 citations
Abstract Quantum architecture search (QAS) has attracted increasing attention owing to its remarkable ability to automate the design of quantum circuits for variational quantum algorithms (VQAs). However, evaluating the performance of numerous quantum circuits is essential to provide feedback for the search strategy, which inevitably renders QAS computationally expensive. Performance predictors have emerged as highly efficient evaluation methods to mitigate this challenge. However, the performance predictor faces a critical challenge in reducing the required number of circuit‐performance pairs for training. This study encodes circuit architecture by representing a quantum circuit as a relational graph that emphasizes message exchange. Subsequently, valuable information about circuit architecture is extracted through three types of graph measures, including distance‐based, degree‐based, and cluster‐based measures. The graph measures define a smooth space related to circuit performance, facilitating the training of the performance predictor. The effectiveness of the proposed method is assessed across three tasks within variational quantum eigensolvers (VQE): identifying the ground states of the Transverse Field Ising Model (TFIM), the Heisenberg model, and the molecule. The simulation results demonstrate notable enhancements in predictive accuracy achieved by our method, coupled with a substantial reduction in the required number of training samples for the predictor.
This repository presents a theoretical and experimental proposal for a non-conservative source of quantum decoherence linked to irreversible logical erasure in a physically coupled classical system. The work introduces a minimal model in which a quantum system is weakly coupled to a classical predictor performing real-time inference. When the predictor irreversibly erases internal counterfactual states, the model predicts an additional decoherence channel that scales with the rate of logical erasure, independently of energy dissipation or measurement strength. The manuscript derives the expected scaling, defines strict null tests excluding standard decoherence mechanisms, and outlines a concrete experimental protocol designed to be decisively falsifiable. No experimental data are included. This deposit establishes theoretical priority and experimental criteria for testing the proposed effect.