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

IEEE International Conference on Quantum Control, Computing and Learning (qCCL)

Incorporating Prior Knowledge of Coherent Control Errors in Quantum Algorithms via Possibility Theory

Jan Schneider, Tom Könecke, Michael Hanss

Published Jun 1, 2026• 0 citations
Publisher

Abstract

Robustness analysis of quantum algorithms against coherent control errors is essential for the reliable deployment of quantum computing. While existing approaches often assume either systematic errors or only upper bounds, this work develops a framework to incorporate (partial) prior knowledge about error distributions using possibility theory, allowing multiple information sources to be combined. We derive worst-case fidelity bounds for individually bounded coherent control errors by generalizing Lipschitz-based fidelity estimates. Furthermore, we propose an approximation for confidence levels on different fidelities using the concept of α-cuts, and project these bounds onto expectation values of projective measurements, fusing the information into a unified bound. Finally, we apply the framework to two quantum algorithms from the literature to illustrate its practical utility.

DOI
10.1109/qccl70331.2026.11668578

Related papers

Robustness of quantum algorithms against coherent control errors

Julian Berberich, Daniel Fink, Christian Holm

Coherent control errors, for which ideal Hamiltonians are perturbed by unknown multiplicative noise terms, are a major obstacle for reliable quantum computing. In this paper we present a framework for analyzing the robustness of quantum algorithms against coherent control errors using Lipschitz bounds. We derive worst-case fidelity bounds which show that the resilience against coherent control errors is mainly influenced by the norms of the Hamiltonians generating the individual gates. These bounds are explicitly computable even for large circuits and they can be used to guarantee fault tolerance via threshold theorems. Moreover, we apply our theoretical framework to derive a guideline for robust quantum algorithm design and transpilation, which amounts to reducing the norms of the Hamiltonians. Using the three-qubit quantum Fourier transform as an example application, we demonstrate that this guideline targets robustness more effectively than existing ones based on circuit depth or gate count. Furthermore, we apply our framework to study the effect of parameter regularization in variational quantum algorithms. The practicality of the theoretical results is demonstrated via implementations in simulation and on a quantum computer.

arXiv:2303.00618•Physical Review A•Jan 10, 2024•27 citations

Robustness of quantum algorithms: Worst-case fidelity bounds and implications for design

Julian Berberich, Tobias Fellner, Robert L. Kosut +1 more

Errors occurring on noisy hardware pose a key challenge to reliable quantum computing. Existing techniques such as error correction, mitigation, or suppression typically separate the error handling from the algorithm analysis and design. In this paper, we develop an alternative, algorithm-centered framework for understanding and improving the robustness against errors. For a given quantum algorithm and error model, we derive worst-case fidelity bounds which can be efficiently computed to certify the robustness. We consider general error models including coherent and (Markovian) incoherent errors and allowing for set-based error descriptions to address uncertainty or time-dependence in the errors. Our results give rise to guidelines for robust algorithm design and compilation by optimizing our theoretical robustness measure. We demonstrate the practicality of the framework with numerical results on algorithm analysis and robust optimization, including the robustness analysis of a 50-qubit modular adder circuit.

arXiv:2509.08481•Sep 10, 2025•2 citations

Ensemble-Based Quantum Signal Processing for Error Mitigation

Suying Liu, Yulong Dong, Dong An +1 more

Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source. We introduce a noise-resilient framework for Quantum Signal Processing (QSP) that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements. Our approach uses ensembles of noisy QSP circuits combined with measurement-level averaging to suppress random phase errors in Z rotations. Building on this framework, we develop robust QSP algorithms for implementing polynomial functions of Hermitian matrices and for estimating observables, with applications to Hamiltonian simulation, quantum linear systems, and ground-state preparation. We analyze the trade-off between approximation error and hardware noise, which is essential for practical implementation under the stringent depth and coherence constraints of current quantum hardware. Our results establish a practical pathway for integrating error mitigation seamlessly into algorithmic design, advancing the development of robust quantum computing, and enabling the discovery of scientific applications with near- and mid-term quantum devices.

quant-pharXiv:2601.20073•Jan 29, 2026•0 citations

Exploring Imprecise Probabilities in Quantum Algorithms with Possibility Theory

Jan Schneider, Tom Könecke, Michael Hanss

ABSTRACT Quantum computing utilizes the underlying principles of quantum mechanics to perform computations with unmatched performance capabilities. Rather than using classical bits, it operates on qubits, which can exist in superposition and entangled states. This enables the solution of problems that are considered intractable for classical computers. However, since qubits are realized by physical systems such as the spins of electrons, they are highly sensitive to environmental disturbances and hardware imperfections. To achieve reliable scaling and practical application in the future, addressing these errors is of utmost importance. Different classes of errors exist, such as coherent and incoherent errors, caused by imperfections in quantum operations or the decoherence of quantum states. They are inherently different, as they arise from either a lack of precision or intrinsic randomness. Current literature struggles to provide a unified framework that models both types of errors simultaneously. In this paper, an approach based on possibility theory—a theory of imprecise probabilities—is presented to model quantum uncertainty. Possibility theory is particularly useful for systems affected by both epistemic and aleatoric uncertainty, that is, uncertainty due to limited knowledge and uncertainty due to inherent randomness, respectively. By exploring noisy quantum algorithms within a possibilistic framework, different statements about robustness can be derived without requiring prior assumptions about the underlying noise model. Moreover, a possibilistic model enables the derivation of sampling criteria for guaranteed statistical performance and provides insight into the number of measurements required—an important consideration, given that such resources are costly in practice.

PAMM•Jan 28, 2026•1 citation

A Fundamental Bound for Robust Quantum Gate Control

Robert L. Kosut, Daniel A. Lidar, Herschel Rabitz

We derive a universal performance limit for coherent quantum control in the presence of modeled and unmodeled uncertainties. For any target unitary $W$ that is implementable in the absence of error, we prove that the worst-case (and hence the average) gate fidelity obeys the lower bound $F \ge \Flb\bigl(\tf \Omeff\bigr)$, where $\tf$ is the gate duration and $\Omeff$ is a single frequency-like measure that aggregates \emph{all} bounded uncertainty sources, e.g., coherent control imperfections, unknown couplings, and residual environment interactions, without assuming an initially factorizable system-bath state or a completely positive map. The bound is obtained by combining an interaction-picture averaging method with a Bellman-Gronwall inequality and holds for any finite-norm Hamiltonian decomposition. Hence it applies equally to qubits, multi-level qudits, and ancilla-assisted operations. Because $\Flb$ depends only on the dimensionless product $\tf\Omeff$, it yields a device-independent metric that certifies whether a given hardware platform can, in principle, reach a specified fault-tolerance threshold, and also sets a quantitative target for robust-control synthesis and system identification.

arXiv:2507.01215•Jul 1, 2025•5 citations

Robust Feedback-Based Quantum Optimization: Analysis of Coherent Control Errors

Mirko Legnini, Julian Berberich

The Feedback-based Algorithm for Quantum Optimization (FALQON) is a Lyapunov inspired quantum algorithm proposed to tackle combinatorial optimization problems. In this paper, we examine the robustness of FALQON against coherent control errors, a class of multiplicative errors that affect the control input. We show that the algorithm is asymptotically robust with respect to systematic errors, and we derive robustness bounds for independent errors. Finally, we propose a robust version of FALQON which minimizes a regularized Lyapunov function. Our theoretical results are supported through simulations.

arXiv:2507.02532•IEEE International Conference on Quantum Control, Computing and Learning (qCCL)•Jun 25, 2025•2 citations
Robustness analysis of quantum algorithms against coherent control errors is essential for the reliable deployment of quantum computing. While existing approaches often assume either systematic errors or only upper bounds, this work develops a framework to incorporate (partial) prior knowledge about error distributions using possibility theory, allowing multiple information sources to be combined. We derive worst-case fidelity bounds for individually bounded coherent control errors by generalizing Lipschitz-based fidelity estimates. Furthermore, we propose an approximation for confidence levels on different fidelities using the concept of α-cuts, and project these bounds onto expectation values of projective measurements, fusing the information into a unified bound. Finally, we apply the framework to two quantum algorithms from the literature to illustrate its practical utility.
Coherent control errors, for which ideal Hamiltonians are perturbed by unknown multiplicative noise terms, are a major obstacle for reliable quantum computing. In this paper we present a framework for analyzing the robustness of quantum algorithms against coherent control errors using Lipschitz bounds. We derive worst-case fidelity bounds which show that the resilience against coherent control errors is mainly influenced by the norms of the Hamiltonians generating the individual gates. These bounds are explicitly computable even for large circuits and they can be used to guarantee fault tolerance via threshold theorems. Moreover, we apply our theoretical framework to derive a guideline for robust quantum algorithm design and transpilation, which amounts to reducing the norms of the Hamiltonians. Using the three-qubit quantum Fourier transform as an example application, we demonstrate that this guideline targets robustness more effectively than existing ones based on circuit depth or gate count. Furthermore, we apply our framework to study the effect of parameter regularization in variational quantum algorithms. The practicality of the theoretical results is demonstrated via implementations in simulation and on a quantum computer.
Errors occurring on noisy hardware pose a key challenge to reliable quantum computing. Existing techniques such as error correction, mitigation, or suppression typically separate the error handling from the algorithm analysis and design. In this paper, we develop an alternative, algorithm-centered framework for understanding and improving the robustness against errors. For a given quantum algorithm and error model, we derive worst-case fidelity bounds which can be efficiently computed to certify the robustness. We consider general error models including coherent and (Markovian) incoherent errors and allowing for set-based error descriptions to address uncertainty or time-dependence in the errors. Our results give rise to guidelines for robust algorithm design and compilation by optimizing our theoretical robustness measure. We demonstrate the practicality of the framework with numerical results on algorithm analysis and robust optimization, including the robustness analysis of a 50-qubit modular adder circuit.
Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source. We introduce a noise-resilient framework for Quantum Signal Processing (QSP) that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements. Our approach uses ensembles of noisy QSP circuits combined with measurement-level averaging to suppress random phase errors in Z rotations. Building on this framework, we develop robust QSP algorithms for implementing polynomial functions of Hermitian matrices and for estimating observables, with applications to Hamiltonian simulation, quantum linear systems, and ground-state preparation. We analyze the trade-off between approximation error and hardware noise, which is essential for practical implementation under the stringent depth and coherence constraints of current quantum hardware. Our results establish a practical pathway for integrating error mitigation seamlessly into algorithmic design, advancing the development of robust quantum computing, and enabling the discovery of scientific applications with near- and mid-term quantum devices.
ABSTRACT Quantum computing utilizes the underlying principles of quantum mechanics to perform computations with unmatched performance capabilities. Rather than using classical bits, it operates on qubits, which can exist in superposition and entangled states. This enables the solution of problems that are considered intractable for classical computers. However, since qubits are realized by physical systems such as the spins of electrons, they are highly sensitive to environmental disturbances and hardware imperfections. To achieve reliable scaling and practical application in the future, addressing these errors is of utmost importance. Different classes of errors exist, such as coherent and incoherent errors, caused by imperfections in quantum operations or the decoherence of quantum states. They are inherently different, as they arise from either a lack of precision or intrinsic randomness. Current literature struggles to provide a unified framework that models both types of errors simultaneously. In this paper, an approach based on possibility theory—a theory of imprecise probabilities—is presented to model quantum uncertainty. Possibility theory is particularly useful for systems affected by both epistemic and aleatoric uncertainty, that is, uncertainty due to limited knowledge and uncertainty due to inherent randomness, respectively. By exploring noisy quantum algorithms within a possibilistic framework, different statements about robustness can be derived without requiring prior assumptions about the underlying noise model. Moreover, a possibilistic model enables the derivation of sampling criteria for guaranteed statistical performance and provides insight into the number of measurements required—an important consideration, given that such resources are costly in practice.
We derive a universal performance limit for coherent quantum control in the presence of modeled and unmodeled uncertainties. For any target unitary WWW that is implementable in the absence of error, we prove that the worst-case (and hence the average) gate fidelity obeys the lower bound $F \ge \Flb\bigl(\tf \Omeff\bigr)$, where $\tf$ is the gate duration and $\Omeff$ is a single frequency-like measure that aggregates \emph{all} bounded uncertainty sources, e.g., coherent control imperfections, unknown couplings, and residual environment interactions, without assuming an initially factorizable system-bath state or a completely positive map. The bound is obtained by combining an interaction-picture averaging method with a Bellman-Gronwall inequality and holds for any finite-norm Hamiltonian decomposition. Hence it applies equally to qubits, multi-level qudits, and ancilla-assisted operations. Because $\Flb$ depends only on the dimensionless product $\tf\Omeff$, it yields a device-independent metric that certifies whether a given hardware platform can, in principle, reach a specified fault-tolerance threshold, and also sets a quantitative target for robust-control synthesis and system identification.
The Feedback-based Algorithm for Quantum Optimization (FALQON) is a Lyapunov inspired quantum algorithm proposed to tackle combinatorial optimization problems. In this paper, we examine the robustness of FALQON against coherent control errors, a class of multiplicative errors that affect the control input. We show that the algorithm is asymptotically robust with respect to systematic errors, and we derive robustness bounds for independent errors. Finally, we propose a robust version of FALQON which minimizes a regularized Lyapunov function. Our theoretical results are supported through simulations.