Quantum Distortion Model for Running Variational Quantum Algorithms without Error Corrections

The classical distortion models similarly to temporal data analysis provide a way to predict the trends in the output of the algorithms and discard the anomalies in the output which may impact the accuracy of the method.In this paper, we introduce a quantum distortion modeling framework that enables variational quantum algorithms to operate effectively in the presence of errors without traditional error correction. Drawing inspirations from classical distortion-tolerant computing, we describe different distortions measures and formulation which can be used in variational quantum algorithms. In particular, we develop mathematical foundations for distortion metrics including energy progression, parameter stability, and state fidelity distortions, and demonstrate their applicability to variational quantum eigensolver, quantum approximate optimization algorithm, and quantum power method. We believe this paper will provide a milestone for distortion-aware quantum computing which can expand the practical applicability of the pre-fault-tolerant era devices to problems where approximate solutions provide sufficient value, representing a paradigm shift from exact error elimination to managed accuracy degradation. Keywords: Variational Quantum Algorithms, Quantum Optimization, Quantum Distortion Model, Quantum Error Correction, Quantum Error Mitigation

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-10-03
DOI
https://doi.org/10.5281/zenodo.17262788
Primary Topic
Endometriosis Research and Treatment
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum Distortion Model for Running Variational Quantum Algorithms without Error Corrections

Zenodo (CERN European Organization for Nuclear Research)
Endometriosis Research and Treatment
article

Quantum Distortion Model for Running Variational Quantum Algorithms without Error Corrections

article en

Abstract

The classical distortion models similarly to temporal data analysis provide a way to predict the trends in the output of the algorithms and discard the anomalies in the output which may impact the accuracy of the method.In this paper, we introduce a quantum distortion modeling framework that enables variational quantum algorithms to operate effectively in the presence of errors without traditional error correction. Drawing inspirations from classical distortion-tolerant computing, we describe different distortions measures and formulation which can be used in variational quantum algorithms. In particular, we develop mathematical foundations for distortion metrics including energy progression, parameter stability, and state fidelity distortions, and demonstrate their applicability to variational quantum eigensolver, quantum approximate optimization algorithm, and quantum power method. We believe this paper will provide a milestone for distortion-aware quantum computing which can expand the practical applicability of the pre-fault-tolerant era devices to problems where approximate solutions provide sufficient value, representing a paradigm shift from exact error elimination to managed accuracy degradation. Keywords: Variational Quantum Algorithms, Quantum Optimization, Quantum Distortion Model, Quantum Error Correction, Quantum Error Mitigation

Zenodo (CERN European Organization for Nuclear Research)
Istanbul Medeniyet University (TR)
Affordable and clean energy
Openalex Percentile: Top 37%
Endometriosis Research and Treatment
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.