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:2606.13150

Robust Pretty Good Measurement via Hybrid Classical-Quantum Pseudoinverse Approximation and Circuit-Level Realization

Bikash K. Behera, Andrés Camilo Granda Arango, Giuseppe Sergioli, Roberto Giuntini

quant-phSubmitted Jun 11, 2026• Announced Jun 12, 2026• 0 citations
arXivHTMLPDF

Abstract

Pretty Good Measurement (PGM) is a near-optimal strategy for quantum state discrimination, but its practical realization becomes unstable when the ensemble operator is singular or ill-conditioned. We introduce a numerically robust PGM formulation based on the Moore-Penrose pseudoinverse, replacing the standard inverse square root with a threshold-regularized variant that remains well-defined across different spectral regimes. We develop a hybrid classical-quantum framework that combines pseudoinverse-based spectral preprocessing with quantum circuit realizations using block-encoding and spectral-transformation techniques. The framework incorporates support awareness, yielding physically meaningful measurement operators even in rank-deficient cases, and employs oblivious amplitude amplification to improve circuit-level success probabilities. Extensive numerical and circuit-level simulations show close agreement between theoretical predictions and quantum circuit outputs. Experiments on synthetic and real datasets, including ill-conditioned and degenerate scenarios, demonstrate stable discrimination performance where standard PGM becomes numerically unstable. The results establish a practical hybrid classical-quantum framework for robust quantum state discrimination and extend previous circuit-based implementations of the PGM testing stage toward pseudoinverse-aware measurement design.

Comments
21 pages, 7 figures

Related papers

Pretty Good Bounds on the worst-case Pretty Good Measurement

Sergio Escobar, Austin Pechan

We derive a new lower bound on the success probability of the Pretty Good Measurement (PGM) for worst-case quantum state discrimination among $m$ pure states. Our bound is strictly tighter than the previously known Gram-matrix-based bound for $m\geq 4$. The proof adapts techniques from Barnum and Knill's analysis of the average-case PGM, applied here to the worst-case scenario. By comparing the PGM to the sequential measurement algorithm, we obtain a guarantee showing that, in the low-fidelity regime, the PGM's success probability decreases quadratically with respect to the maximum pairwise overlap, rather than linearly as in earlier bounds.

arXiv:2508.19085•Aug 26, 2025•0 citations

Pretty good measurement for bosonic Gaussian ensembles

Hemant K. Mishra, Ludovico Lami, Prabha Mandayam +1 more

The pretty good measurement is a fundamental analytical tool in quantum information theory, giving a method for inferring the classical label that identifies a quantum state chosen probabilistically from an ensemble. Identifying and constructing the pretty good measurement for the class of bosonic Gaussian states is of immediate practical relevance in quantum information processing tasks. Holevo recently showed that the pretty good measurement for a bosonic Gaussian ensemble is a bosonic Gaussian measurement that attains the accessible information of the ensemble [ IEEE Trans. Inf. Theory 66 (9) (2020) 5634]. In this paper, we provide an alternate proof of Gaussianity of the pretty good measurement for a Gaussian ensemble of multimode bosonic states, with a focus on establishing an explicit and efficiently computable Gaussian description of the measurement. We also compute an explicit form of the mean square error of the pretty good measurement, which is relevant when using it for parameter estimation. Generalizing the pretty good measurement is a quantum instrument, called the pretty good instrument. We prove that the post-measurement state of the pretty good instrument is a faithful Gaussian state if the input state is a faithful Gaussian state whose covariance matrix satisfies a certain condition. Combined with our previous finding for the pretty good measurement and provided that the same condition holds, it follows that the expected output state is a faithful Gaussian state as well. In this case, we compute an explicit Gaussian description of the post-measurement and expected output states. Our findings imply that the pretty good instrument for bosonic Gaussian ensembles is no longer merely an analytical tool, but that it can also be implemented experimentally in quantum optics laboratories.

WORLD SCIENTIFIC eBooks•Aug 1, 2025•0 citations

Quantum-Assisted Unambiguous Discrimination of Pure States with Robustness Bounds

Jinhyeok Heo, Dongkeun Lee, Junghee Ryu +1 more

We propose a hybrid quantum-classical framework for the unambiguous discrimination of pure states by combining the noisy intermediate-scale quantum semidefinite program solver (NSS) with the reciprocal-state representation. In NSS, a given semidefinite program (SDP) is represented within a subspace spanned by chosen ansatz states, with the required quantities estimated using quantum circuits, and the resulting optimization is performed classically. This makes NSS naturally applicable to discrimination problems involving circuit-prepared states, as finding a discrimination measurement can be formulated as an SDP. By choosing the discriminated states themselves as the ansatz and exploiting the reciprocal-state representation, the general matrix-variable NSS formulation is reduced to an optimization over N scalar variables, where N is the number of discriminated states. The resulting formulation reduces the number of optimization variables and positive-semidefinite constraints compared with the original NSS formulation. We further establish robustness guarantees against Gram matrix estimation errors, including a rescaling procedure that guarantees a valid positive operator-valued measure (POVM) under bounded perturbations. The resulting bounds quantify both the deviation in average success probability and violations of the no-error condition using only the estimated Gram matrix, its SDP solution, and a characterized perturbation bound, without access to the ideal Gram matrix. Numerical simulations validate the derived robustness bounds and characterize finite-shot scaling. We also perform experiments on IBM quantum hardware to estimate pairwise overlaps, and then evaluate the performance of the resulting POVMs.

quant-pharXiv:2610.22954•Oct 19, 2026•0 citations

Pretty good measurement for bosonic Gaussian ensembles

Hemant K. Mishra, Ludovico Lami, Prabha Mandayam +1 more

The pretty good measurement is a fundamental analytical tool in quantum information theory, giving a method for inferring the classical label that identifies a quantum state chosen probabilistically from an ensemble. Identifying and constructing the pretty good measurement for the class of bosonic Gaussian states is of immediate practical relevance in quantum information processing tasks. Holevo recently showed that the pretty good measurement for a bosonic Gaussian ensemble is a bosonic Gaussian measurement that attains the accessible information of the ensemble [IEEE Trans. Inf. Theory 66(9) (2020) 5634]. In this paper, we provide an alternate proof of Gaussianity of the pretty good measurement for a Gaussian ensemble of multimode bosonic states, with a focus on establishing an explicit and efficiently computable Gaussian description of the measurement. We also compute an explicit form of the mean square error of the pretty good measurement, which is relevant when using it for parameter estimation. Generalizing the pretty good measurement is a quantum instrument, called the pretty good instrument. We prove that the post-measurement state of the pretty good instrument is a faithful Gaussian state if the input state is a faithful Gaussian state whose covariance matrix satisfies a certain condition. Combined with our previous finding for the pretty good measurement and provided that the same condition holds, it follows that the expected output state is a faithful Gaussian state as well. In this case, we compute an explicit Gaussian description of the post-measurement and expected output states. Our findings imply that the pretty good instrument for bosonic Gaussian ensembles is no longer merely an analytical tool, but that it can also be implemented experimentally in quantum optics laboratories.

arXiv:2303.04949•International Journal of Quantum Information•Apr 30, 2024•6 citations

Classical Regularization in Variational Quantum Eigensolvers

Yury Chernyak, Ijaz Ahamed Mohammad, Martin Plesch

While quantum computers are a very promising tool for the far future, in their current state of the art they remain limited both in size and quality. This has given rise to hybrid quantum-classical algorithms, where the quantum device performs only a small but vital part of the overall computation. Among these, variational quantum algorithms (VQAs), which combine a classical optimization procedure with quantum evaluation of a cost function, have emerged as particularly promising. However, barren plateaus and ill-conditioned optimization landscapes remain among the primary obstacles faced by VQAs, often leading to unstable convergence and high sensitivity to initialization. Motivated by this challenge, we investigate whether a purely classical remedy, standard L2 squared-norm regularization, can systematically stabilize hybrid quantum-classical optimization. Specifically, we augment the Variational Quantum Eigensolver (VQE) objective with a quadratic penalty proportional to the squared norm of the parameters, without modifying the quantum circuit or measurement process. Across all tested Hamiltonians, H2, LiH, and the Random Field Ising Model (RFIM), we observe improved performance over a broad window of the regularization strength. Our large-scale numerical results demonstrate that classical regularization provides a robust, system-independent mechanism for mitigating VQE instability, enhancing the reliability and reproducibility of variational quantum optimization without altering the underlying quantum circuit.

quant-pharXiv:2601.16679•Jan 26, 2026•0 citations

Noise-Robust Hybrid Quantum Neural Networks

Jesus Rafael Gil

uantum computing offers the potential to solve selected computational problems more efficiently than classical systems by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum devices operate in the noisy intermediatescale quantum (NISQ) regime, where limited coherence times, gate errors, measurement instability, and hardware variability significantly constrain practical performance. As a result, many quantum machine learning architectures that appear promising under idealized simulation conditions experience substantial degradation when executed under realistic noisy environments. This thesis investigates the problem of robustness in hybrid quantum neural network (HQNN) systems operating under realistic NISQ conditions. Rather than focusing primarily on quantum expressivity or claims of quantum advantage, the work examines whether practical hybrid quantum learning can maintain stable optimization and reliable inference in the presence of stochastic perturbations. A robustness-engineering framework is developed that integrates learned-readout decoding, multi-observable quantum feature extraction, architecture-level optimization, stability-aware training, and noise-augmented learning within a unified hybrid quantum-classical pipeline. To evaluate the framework, a comprehensive benchmarking methodology is developed across multiple datasets, architectures, perturbation environments, software frameworks, and hardware platforms. The experiments compare classical machine learning models, quantum kernel methods, and several HQNN architectures, including quanvolutional neural networks, quantum convolutional neural networks, and quantum transfer learning systems. Performance is evaluated under both noiseless and noisy conditions using standardized metrics, cross-noise validation, architecture-level comparisons, and real IBM Quantum hardware execution. The results demonstrate that baseline HQNN systems are highly sensitive to optimization instability, parity-based information loss, measurement variability, and perturbation accumulation. The experiments further reveal that robustness, rather than representational expressivity alone, is the dominant factor limiting practical hybrid quantum learning under realistic NISQ conditions. Through successive robustness-engineering stages, noisy performance improves from approximately 0.37 to 0.50 in baseline architectures to approximately 0.97 under several benchmark environments while maintaining substantially improved stability and reduced degradation under perturbation. These findings establish robustness as a central design objective for practical quantum machine learning. The thesis demonstrates that reliable hybrid quantum learning emerges through coordinated interaction between quantum feature generation, adaptive classical inference, stability-aware optimization, and hardware-aware architecture design. More broadly, the results suggest that hybrid quantum-AI systems are most effective when viewed as integrated quantum-classical computational frameworks in which quantum circuits function as probabilistic feature generators operating within larger robustness-oriented learning pipelines.

•Jul 1, 2026•0 citations
Pretty Good Measurement (PGM) is a near-optimal strategy for quantum state discrimination, but its practical realization becomes unstable when the ensemble operator is singular or ill-conditioned. We introduce a numerically robust PGM formulation based on the Moore-Penrose pseudoinverse, replacing the standard inverse square root with a threshold-regularized variant that remains well-defined across different spectral regimes. We develop a hybrid classical-quantum framework that combines pseudoinverse-based spectral preprocessing with quantum circuit realizations using block-encoding and spectral-transformation techniques. The framework incorporates support awareness, yielding physically meaningful measurement operators even in rank-deficient cases, and employs oblivious amplitude amplification to improve circuit-level success probabilities. Extensive numerical and circuit-level simulations show close agreement between theoretical predictions and quantum circuit outputs. Experiments on synthetic and real datasets, including ill-conditioned and degenerate scenarios, demonstrate stable discrimination performance where standard PGM becomes numerically unstable. The results establish a practical hybrid classical-quantum framework for robust quantum state discrimination and extend previous circuit-based implementations of the PGM testing stage toward pseudoinverse-aware measurement design.
We derive a new lower bound on the success probability of the Pretty Good Measurement (PGM) for worst-case quantum state discrimination among mmm pure states. Our bound is strictly tighter than the previously known Gram-matrix-based bound for m≥4m\geq 4m≥4. The proof adapts techniques from Barnum and Knill's analysis of the average-case PGM, applied here to the worst-case scenario. By comparing the PGM to the sequential measurement algorithm, we obtain a guarantee showing that, in the low-fidelity regime, the PGM's success probability decreases quadratically with respect to the maximum pairwise overlap, rather than linearly as in earlier bounds.
The pretty good measurement is a fundamental analytical tool in quantum information theory, giving a method for inferring the classical label that identifies a quantum state chosen probabilistically from an ensemble. Identifying and constructing the pretty good measurement for the class of bosonic Gaussian states is of immediate practical relevance in quantum information processing tasks. Holevo recently showed that the pretty good measurement for a bosonic Gaussian ensemble is a bosonic Gaussian measurement that attains the accessible information of the ensemble [ IEEE Trans. Inf. Theory 66 (9) (2020) 5634]. In this paper, we provide an alternate proof of Gaussianity of the pretty good measurement for a Gaussian ensemble of multimode bosonic states, with a focus on establishing an explicit and efficiently computable Gaussian description of the measurement. We also compute an explicit form of the mean square error of the pretty good measurement, which is relevant when using it for parameter estimation. Generalizing the pretty good measurement is a quantum instrument, called the pretty good instrument. We prove that the post-measurement state of the pretty good instrument is a faithful Gaussian state if the input state is a faithful Gaussian state whose covariance matrix satisfies a certain condition. Combined with our previous finding for the pretty good measurement and provided that the same condition holds, it follows that the expected output state is a faithful Gaussian state as well. In this case, we compute an explicit Gaussian description of the post-measurement and expected output states. Our findings imply that the pretty good instrument for bosonic Gaussian ensembles is no longer merely an analytical tool, but that it can also be implemented experimentally in quantum optics laboratories.
We propose a hybrid quantum-classical framework for the unambiguous discrimination of pure states by combining the noisy intermediate-scale quantum semidefinite program solver (NSS) with the reciprocal-state representation. In NSS, a given semidefinite program (SDP) is represented within a subspace spanned by chosen ansatz states, with the required quantities estimated using quantum circuits, and the resulting optimization is performed classically. This makes NSS naturally applicable to discrimination problems involving circuit-prepared states, as finding a discrimination measurement can be formulated as an SDP. By choosing the discriminated states themselves as the ansatz and exploiting the reciprocal-state representation, the general matrix-variable NSS formulation is reduced to an optimization over N scalar variables, where N is the number of discriminated states. The resulting formulation reduces the number of optimization variables and positive-semidefinite constraints compared with the original NSS formulation. We further establish robustness guarantees against Gram matrix estimation errors, including a rescaling procedure that guarantees a valid positive operator-valued measure (POVM) under bounded perturbations. The resulting bounds quantify both the deviation in average success probability and violations of the no-error condition using only the estimated Gram matrix, its SDP solution, and a characterized perturbation bound, without access to the ideal Gram matrix. Numerical simulations validate the derived robustness bounds and characterize finite-shot scaling. We also perform experiments on IBM quantum hardware to estimate pairwise overlaps, and then evaluate the performance of the resulting POVMs.
The pretty good measurement is a fundamental analytical tool in quantum information theory, giving a method for inferring the classical label that identifies a quantum state chosen probabilistically from an ensemble. Identifying and constructing the pretty good measurement for the class of bosonic Gaussian states is of immediate practical relevance in quantum information processing tasks. Holevo recently showed that the pretty good measurement for a bosonic Gaussian ensemble is a bosonic Gaussian measurement that attains the accessible information of the ensemble [IEEE Trans. Inf. Theory 66(9) (2020) 5634]. In this paper, we provide an alternate proof of Gaussianity of the pretty good measurement for a Gaussian ensemble of multimode bosonic states, with a focus on establishing an explicit and efficiently computable Gaussian description of the measurement. We also compute an explicit form of the mean square error of the pretty good measurement, which is relevant when using it for parameter estimation. Generalizing the pretty good measurement is a quantum instrument, called the pretty good instrument. We prove that the post-measurement state of the pretty good instrument is a faithful Gaussian state if the input state is a faithful Gaussian state whose covariance matrix satisfies a certain condition. Combined with our previous finding for the pretty good measurement and provided that the same condition holds, it follows that the expected output state is a faithful Gaussian state as well. In this case, we compute an explicit Gaussian description of the post-measurement and expected output states. Our findings imply that the pretty good instrument for bosonic Gaussian ensembles is no longer merely an analytical tool, but that it can also be implemented experimentally in quantum optics laboratories.
While quantum computers are a very promising tool for the far future, in their current state of the art they remain limited both in size and quality. This has given rise to hybrid quantum-classical algorithms, where the quantum device performs only a small but vital part of the overall computation. Among these, variational quantum algorithms (VQAs), which combine a classical optimization procedure with quantum evaluation of a cost function, have emerged as particularly promising. However, barren plateaus and ill-conditioned optimization landscapes remain among the primary obstacles faced by VQAs, often leading to unstable convergence and high sensitivity to initialization. Motivated by this challenge, we investigate whether a purely classical remedy, standard L2 squared-norm regularization, can systematically stabilize hybrid quantum-classical optimization. Specifically, we augment the Variational Quantum Eigensolver (VQE) objective with a quadratic penalty proportional to the squared norm of the parameters, without modifying the quantum circuit or measurement process. Across all tested Hamiltonians, H2, LiH, and the Random Field Ising Model (RFIM), we observe improved performance over a broad window of the regularization strength. Our large-scale numerical results demonstrate that classical regularization provides a robust, system-independent mechanism for mitigating VQE instability, enhancing the reliability and reproducibility of variational quantum optimization without altering the underlying quantum circuit.
uantum computing offers the potential to solve selected computational problems more efficiently than classical systems by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum devices operate in the noisy intermediatescale quantum (NISQ) regime, where limited coherence times, gate errors, measurement instability, and hardware variability significantly constrain practical performance. As a result, many quantum machine learning architectures that appear promising under idealized simulation conditions experience substantial degradation when executed under realistic noisy environments. This thesis investigates the problem of robustness in hybrid quantum neural network (HQNN) systems operating under realistic NISQ conditions. Rather than focusing primarily on quantum expressivity or claims of quantum advantage, the work examines whether practical hybrid quantum learning can maintain stable optimization and reliable inference in the presence of stochastic perturbations. A robustness-engineering framework is developed that integrates learned-readout decoding, multi-observable quantum feature extraction, architecture-level optimization, stability-aware training, and noise-augmented learning within a unified hybrid quantum-classical pipeline. To evaluate the framework, a comprehensive benchmarking methodology is developed across multiple datasets, architectures, perturbation environments, software frameworks, and hardware platforms. The experiments compare classical machine learning models, quantum kernel methods, and several HQNN architectures, including quanvolutional neural networks, quantum convolutional neural networks, and quantum transfer learning systems. Performance is evaluated under both noiseless and noisy conditions using standardized metrics, cross-noise validation, architecture-level comparisons, and real IBM Quantum hardware execution. The results demonstrate that baseline HQNN systems are highly sensitive to optimization instability, parity-based information loss, measurement variability, and perturbation accumulation. The experiments further reveal that robustness, rather than representational expressivity alone, is the dominant factor limiting practical hybrid quantum learning under realistic NISQ conditions. Through successive robustness-engineering stages, noisy performance improves from approximately 0.37 to 0.50 in baseline architectures to approximately 0.97 under several benchmark environments while maintaining substantially improved stability and reduced degradation under perturbation. These findings establish robustness as a central design objective for practical quantum machine learning. The thesis demonstrates that reliable hybrid quantum learning emerges through coordinated interaction between quantum feature generation, adaptive classical inference, stability-aware optimization, and hardware-aware architecture design. More broadly, the results suggest that hybrid quantum-AI systems are most effective when viewed as integrated quantum-classical computational frameworks in which quantum circuits function as probabilistic feature generators operating within larger robustness-oriented learning pipelines.