dorsal/arxiv
View SchemaLearning parameter curves in feedback-based quantum optimization algorithms
| Authors | Vicente Peña Pérez, Matthew D. Grace, Christian Arenz, Alicia B. Magann |
|---|---|
| Categories | |
| ArXiv ID | 2601.08085vv1 |
| URL | https://arxiv.org/abs/2601.08085 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Feedback-based quantum algorithms (FQAs) operate by iteratively growing a quantum circuit to optimize a given task. At each step, feedback from qubit measurements is used to inform the next quantum circuit update. In practice, the sampling cost associated with these measurements can be significant. Here, we ask whether FQA parameter sequences can be predicted using classical machine learning, obviating the need for qubit measurements altogether. To this end, we train a teacher-student model to map a MaxCut problem instance to an associated FQA parameter curve in a single classical inference step. Numerical experiments show that this model can accurately predict FQA parameter curves across a range of problem sizes, including problem sizes not seen during model training. To evaluate performance, we compare the predicted parameter curves in simulation against FQA reference curves and linear quantum annealing schedules. We observe similar results to the former and performance improvements over the latter. These results suggest that machine learning can offer a heuristic, practical path to reducing sampling costs and resource overheads in quantum algorithms.
{
"annotation_id": "29b276f9-90ad-4c6a-b166-d3cd2e669c7e",
"date_created": "2026-02-17T05:53:15.356000Z",
"date_modified": "2026-02-17T05:53:15.356000Z",
"file_hash": "32490c5ee5ef44b263bd60aaf17c209fb52edb9b38359073a9377b6ef34b7f4c",
"private": false,
"record": {
"abstract": "Feedback-based quantum algorithms (FQAs) operate by iteratively growing a quantum circuit to optimize a given task. At each step, feedback from qubit measurements is used to inform the next quantum circuit update. In practice, the sampling cost associated with these measurements can be significant. Here, we ask whether FQA parameter sequences can be predicted using classical machine learning, obviating the need for qubit measurements altogether. To this end, we train a teacher-student model to map a MaxCut problem instance to an associated FQA parameter curve in a single classical inference step. Numerical experiments show that this model can accurately predict FQA parameter curves across a range of problem sizes, including problem sizes not seen during model training. To evaluate performance, we compare the predicted parameter curves in simulation against FQA reference curves and linear quantum annealing schedules. We observe similar results to the former and performance improvements over the latter. These results suggest that machine learning can offer a heuristic, practical path to reducing sampling costs and resource overheads in quantum algorithms.",
"arxiv_id": "2601.08085",
"authors": [
"Vicente Pe\u00f1a P\u00e9rez",
"Matthew D. Grace",
"Christian Arenz",
"Alicia B. Magann"
],
"categories": [
"quant-ph"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Learning parameter curves in feedback-based quantum optimization algorithms",
"url": "https://arxiv.org/abs/2601.08085",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "56af78e6-dd97-4554-9ead-47a66fd57045",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}