SearcharxivSearch

arXiv subjects

Roberto Giuntini

Publications and source records attributed to Roberto Giuntini.

16 recordsLinked to original sources

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

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.

quant-ph

QARIMA: A Quantum Approach To Classical Time Series Analysis

We present QARIMA, a quantum state-similarity-based reconstruction of the classical ARIMA modelling pipeline. Rather than using a quantum circuit as a standalone forecaster, QARIMA preserves ARIMA's interpretable forecasting structure while reformulating its core building blocks through analogous quantum-compatible modules. The framework integrates quantum differencing assessment, QACF/QPACF lag discovery, compact-swap-test state projection, swap-test/VQC-based AR and MA coefficient estimation, and weak-lag refinement within a single ARIMA forecasting workflow. QACF and QPACF serve the functional roles of ACF and PACF for MA and AR lag discovery, but construct lag relevance through quantum measurement geometry rather than direct classical correlation. Given screened candidate orders $(p,d,q)$, AR and MA coefficients are estimated through state-alignment losses incorporating cosine alignment, entropy regularization, phase correction, and norm control. We evaluate QARIMA across environmental, climatic, industrial, and weather time-series datasets using rolling-origin out-of-sample testing against automated classical ARIMA baselines, with performance assessed through MSE, MAPE, and Diebold--Mariano tests. The results show that quantum state-similarity modules can produce competitive and, in several cases, improved forecasting behaviour while preserving ARIMA's transparency, modularity, and interpretability. QARIMA therefore establishes a distinct pathway for quantum-enhanced statistical forecasting: its modules remain functionally analogous to classical ARIMA subroutines, but are not algebraic replicas; they serve the same modelling roles through state overlap, projection, and measurement-driven parameter estimation.

quant-ph

Pretty Good Measurement for Radiomics: A Quantum-Inspired Multi-Class Classifier for Lung Cancer Subtyping and Prostate Cancer Risk Stratification

We investigate a quantum-inspired approach to supervised multi-class classification based on the Pretty Good Measurement (PGM), viewed as an operator-valued decision rule derived from quantum state discrimination. The method associates each class with an encoded mixed state and performs classification through a single POVM construction, thus providing a genuinely multi-class strategy without reduction to pairwise or one-vs-rest schemes. In this perspective, classification is reformulated as the discrimination of a finite ensemble of class-dependent density operators, with performance governed by the geometry induced by the encoding map and by the overlap structure among classes. To assess the practical scope of this framework, we apply the PGM-based classifier to two biomedical radiomics case studies: histopathological subtyping of non-small-cell lung carcinoma (NSCLC) and prostate cancer (PCa) risk stratification. The evaluation is conducted under protocols aligned with previously reported radiomics studies, enabling direct comparison with established classical baselines. The results show that the PGM-based classifier is consistently competitive and, in several settings, improves upon standard methods. In particular, the method performs especially well in the NSCLC binary and three-class tasks, while remaining competitive in the four-class case, where increased class overlap yields a more demanding discrimination geometry. In the PCa study, the PGM classifier remains close to the strongest ensemble baseline and exhibits clinically relevant sensitivity--specificity trade-offs across feature-selection scenarios.

cs.CV

QSMOTE-PGM/kPGM: QSMOTE Based PGM and kPGM for Imbalanced Dataset Classification

Quantum-inspired machine learning (QiML) employs mathematical principles from quantum theory, such as Hilbert-space representations and quantum state discrimination, to enhance classical learning algorithms. In this work, we investigate the integration of Quantum Synthetic Minority Oversampling Technique (QSMOTE) variants with two quantum-inspired classifiers: the Pretty Good Measurement (PGM) classifier and the kernelized Pretty Good Measurement (KPGM) classifier. We propose and analyze three QSMOTE variants, namely KNN-based, Fidelity-based, and Margin-based QSMOTE, designed to improve minority-class representation in imbalanced datasets through quantum-inspired similarity and sampling mechanisms. A unified theoretical and empirical comparison of PGM and KPGM is presented under amplitude and stereo encoding strategies with multiple quantum copies. Experimental evaluations on the Telco Customer Churn dataset demonstrate that the proposed quantum-inspired approaches consistently outperform a classical Random Forest baseline, particularly in terms of recall and balanced F1-score. Among all configurations, PGM with stereo encoding and n_{copies}=2 achieves the best performance with an accuracy of 0.8512 and an F1-score of 0.8234, while KPGM exhibits competitive and more stable behavior across different QSMOTE variants, reaching accuracies of 0.8511 under stereo encoding and 0.8483 under amplitude encoding. The results further show that increasing the number of quantum copies systematically improves classification performance, especially for minority-class detection. This work highlights the effectiveness of combining quantum-inspired oversampling and classification strategies for imbalanced learning, while providing practical insights into the complementary strengths of measurement-based and kernel-based quantum-inspired machine learning frameworks.

cs.LG

Distribution of Non-Locality On Quantum Random Circuits

In this work we explore how different types of resources are distributed among the states generated by quantum random circuits (QRC). We focus on multipartite non-locality, but we also analyze quantum correlations by appealing to different entanglement and non-classicality measures. We analyze the violation of Mermin and Svetlichny inequalities in order to get a glance at the distribution of nonlocality and genuine multipartite nonlocality. Next, we compare universal vs non-universal sets of gates, to gain insight into the problem of explaining quantum advantage. By comparing the results obtained with ideal (noiseless) vs noisy intermediate-scale quantum (NISQ) devices, we lay the basis of a certification protocol, which aims to quantify how robust is the resources distribution among the states that a given device can generate. We have implemented our non-locality-based benchmark on actual quantum processors with different architectures, in order to assess up to which point they are capable of reproducing the ideal results.

quant-ph

Recognizing Concepts and Recognizing Musical Themes. A Quantum Semantic Analysis

How are abstract concepts and musical themes recognized on the basis of some previous experience? It is interesting to compare the different behaviors of human and of artificial intelligences with respect to this problem. Generally, a human mind that abstracts a concept (say, table) from a given set of known examples creates a table-Gestalt: a kind of vague and out of focus image that does not fully correspond to a particular table with well determined features. A similar situation arises in the case of musical themes. Can the construction of a gestaltic pattern, which is so natural for human minds, be taught to an intelligent machine? This problem can be successfully discussed in the framework of a quantum approach to pattern recognition and to machine learning. The basic idea is replacing classical data sets with quantum data sets, where either objects or musical themes can be formally represented as pieces of quantum information, involving the uncertainties and the ambiguities that characterize the quantum world. In this framework, the intuitive concept of Gestalt can be simulated by the mathematical concept of positive centroid of a given quantum data set. Accordingly, the crucial problem "how can we classify a new object or a new musical theme (we have listened to) on the basis of a previous experience?" can be dealt with in terms of some special quantum similarity-relations. Although recognition procedures are different for human and for artificial intelligences, there is a common method of "facing the problems" that seems to work in both cases.

cs.LG

Quantum State Discrimination for Supervised Classification

In this paper we investigate the connection between quantum information theory and machine learning. In particular, we show how quantum state discrimination can represent a useful tool to address the standard classification problem in machine learning. Previous studies have shown that the optimal quantum measurement theory developed in the context of quantum information theory and quantum communication can inspire a new binary classification algorithm that can achieve higher inference accuracy for various datasets. Here we propose a model for arbitrary multiclass classification inspired by quantum state discrimination, which is enabled by encoding the data in the space of linear operators on a Hilbert space. While our algorithm is quantum-inspired, it can be implemented on classical hardware, thereby permitting immediate applications.

quant-ph

On PBZ*-lattices

We continue our investigation of paraorthomodular BZ*-lattices (PBZ*-lattices), started in \cite{GLP1+,PBZ2,rgcmfp,pbzsums,pbz5}. We shed further light on the structure of the subvariety lattice of the variety $\mathbb{PBZL}^{\ast }$ of PBZ*-lattices; in particular, we provide axiomatic bases for some of its members. Further, we show that some distributive subvarieties of $\mathbb{PBZL}^{\ast }$ are term-equivalent to well-known varieties of expanded Kleene lattices or of nonclassical modal algebras. By so doing, we somehow help the reader to locate PBZ*-lattices on the atlas of algebraic structures for nonclassical logics.

math.RA

PBZ*-Lattices: Structure Theory and Subvarieties

We investigate the structure theory of the variety of \emph{PBZ*-lattices} and some of its proper subvarieties. These lattices with additional structure originate in the foundations of quantum mechanics and can be viewed as a common generalisation of orthomodular lattices and Kleene algebras expanded by an extra unary operation. We lay down the basics of the theories of ideals and of central elements in PBZ*-lattices, we prove some structure theorems, and we explore some connections with the theories of subtractive and binary discriminator varieties.

math.LO

Ordinal and Horizontal Sums Constructing PBZ*-lattices

PBZ*-lattices are algebraic structures related to quantum logics, which consist of bounded lattices endowed with two kinds of complements, named {\em Kleene} and {\em Brouwer}, such that the Kleene complement satisfies a weakening of the orthomodularity condition and the De Morgan laws, while the Brouwer complement only needs to satisfy the De Morgan laws for the pairs of elements with their Kleene complements. PBZ*-lattices form a variety $\mathbb{PBZL}^{\ast }$, which includes the variety $\mathbb{OML}$ of orthomodular lattices (considered with an extended signature, by letting their two complements coincide) and the variety $V(\mathbb{AOL})$ generated by the class $\mathbb{AOL}$ of antiortholattices. We investigate the congruences of antiortholattices, in particular of those obtained through certain ordinal sums and of those whose Brower complements satisfy the De Morgan laws, infer characterizations for their subdirect irreducibility and prove that even the lattice reducts of antiortholattices are directly irreducible. Since the two complements act the same on the lattice bounds in all PBZ*-lattices, we can define the horizontal sum of any nontrivial PBZ*-lattices, obtained by glueing them at their smallest and at their largest elements; a horizontal sum of two nontrivial PBZ*-lattices is a PBZ*-lattice exactly when at least one of its summands is an orthomodular lattice. We investigate the algebraic structures and the congruence lattices of these horizontal sums, then the varieties they generate. We obtain a relative axiomatization of the variety $V(\mathbb{OML}\boxplus \mathbb{AOL})$ generated by the horizontal sums of nontrivial orthomodular lattices with nontrivial antiortholattices w.r.t. $\mathbb{PBZL}^{\ast }$, as well as a relative axiomatization of the join of varieties $\mathbb{OML}\vee V(\mathbb{AOL})$ w.r.t. $V(\mathbb{OML}\boxplus \mathbb{AOL})$.

math.RA

On some properties of PBZ*-lattices

We continue the algebraic investigation of PBZ*-lattices, a notion introduced in [12] in order to obtain insights into the structure of certain algebras of effects of a Hilbert space, lattice-ordered under the spectral ordering.

math.LO

Quantum-inspired Minimum Distance Classification in Biomedical Context

We face the problem of pattern classification by proposing a quantum-inspired version of the widely used minimum distance classifier (i.e. the Nearest Mean Classifier (NMC)) already introduced in [31,33,28,27] and by applying this quantum-inspired classifier in a biomedical context. In particular, we show and compare the NMC and our quantum model performance to solve a problem related to classify the probability of survival for patients affected by idiopathic pulmonary fibrosis (IPF).

quant-ph

Pattern recognition on the quantum Bloch sphere

We introduce a framework suitable for describing pattern recognition task using the mathematical language of density matrices. In particular, we provide a one-to-one correspondence between patterns and pure density operators. This correspondence enables us to: i) represent the Nearest Mean Classifier (NMC) in terms of quantum objects, ii) introduce a Quantum Classifier (QC). By comparing the QC with the NMC on different 2D datasets, we show the first classifier can provide additional information that are particularly beneficial on a classical computer with respect to the second classifier.

quant-ph

A Quantum Computational Semantics for Epistemic Logical Operators. Part I: Epistemic Structures

Some critical open problems of epistemic logics can be investigated in the framework of a quantum computational approach. The basic idea is to interpret sentences - like Alice knows that Bob does not understand that Pi is irrational - as pieces of quantum information (generally represented by density operators of convenient Hilbert spaces). Logical epistemic operators (to understand, to know ...) are dealt with as (generally irreversible) quantum operations, which are, in a sense, similar to measurement-procedures. This approach permits us to model some characteristic epistemic processes, that concern both human and artificial intelligence. For instance, the operation of \memorizing and retrieving information" can be formally represented, in this framework, by using a quantum teleportation phenomenon.

quant-ph

A Quantum Computational Semantics for Epistemic Logical Operators. Part II: Semantics

By using the abstract structures investigated in the first Part of this article, we develop a semantics for an epistemic language, which expresses sentences like "Alice knows that Bob does not understand that PI is irrational". One is dealing with a holistic form of quantum computational semantics, where entanglement plays a fundamental role, thus, the meaning of a global expression determines the contextual meanings of its parts, but generally not the other way around. The epistemic situations represented in this semantics seem to reflect some characteristic limitations of the real processes of acquiring information. Since knowledge is not generally closed under logical consequence, the unpleasant phenomenon of logical omniscience is here avoided.

quant-ph

Holistic logical arguments in quantum computation

Quantum computational logics represent a logical abstraction from the circuit-theory in quantum computation. In these logics formulas are supposed to denote pieces of quantum information (qubits, quregisters or mixtures of quregisters), while logical connectives correspond to (quantum logical) gates that transform quantum information in a reversible way. The characteristic holistic features of the quantum theoretic formalism (which play an essential role in entanglement-phenomena) can be used in order to develop a holistic version of the quantum computational semantics. In contrast with the compositional character of most standard semantic approaches, meanings of formulas are here dealt with as global abstract objects that determine the contextual meanings of the formulas' components (from the whole to the parts). We present a survey of the most significant logical arguments that are valid or that are possibly violated in the framework of this semantics. Some logical features that may appear prima facie strange seem to reflect pretty well informal arguments that are currently used in our rational activity.

quant-ph