Searcharxiv⌕ Search

arXiv subjects

Nicola Fabiano

Publications and source records attributed to Nicola Fabiano.

At least 19 recordsLinked to original sources

Non-Markovian Quantum Decay in Complex Environments: A Hyperstatistical Approach

The exponential decay of an unstable quantum state, as described by standard Markovian theories such as Fermi's Golden Rule, assumes a simple, structureless environment. However, in complex environments characterized by disorder, long-range interactions, or strong fluctuations, local decay rates fluctuate, leading to non-Markovian dynamics and power-law ``long-time tails.'' In this paper, we apply the recently proposed \textit{hyperstatistics} framework to the problem of quantum decay in such complex environments. By considering a $γ$-distribution of local decay rates across mesoscopic domains, we derive a macroscopic survival probability governed by a $q$-exponential function. We then use the $q$-generalized Gamma function, defined via the Mellin transform of the $q$-exponential, to calculate the moments of the decay-time distribution. We show that the mean quantum lifetime is $\langle t\rangle = \int_0^\infty P(t)\,dt= [\langleΓ\rangle(2-q)]^{-1},$ and is therefore finite for $q<2$. The convergence of the second moment, and hence of the lifetime variance, instead requires the stricter condition $q<3/2$. These results provide a refined physical interpretation: for $1<q<3/2$ both the mean lifetime and its variance are finite; for $3/2\le q<2$ the mean lifetime remains finite but lifetime fluctuations become infinitely broad; and for $q\ge2$ the mean lifetime itself diverges, corresponding to a truly trapped, localized, or Griffiths-like regime.

quant-ph↗

Path--Averaged Contractions: A New Generalization of the Banach Contraction Principle

We introduce a novel class of self-mappings on metric spaces, called {PA-contractions} (Path-Averaged Contractions), defined by an averaging condition over iterated distances. Unlike classical pointwise conditions, the PA-condition allows for transient expansion provided the long-term orbital average contracts. We prove that every continuous PA-contraction on a complete metric space has a unique fixed point, and the Picard iterates converge to it. This condition strictly generalizes that of the classical Banach contraction principle, accommodating mappings where pointwise contraction fails locally. We provide examples showing that PA-contractions are not contained in the classes of F-contractions, Kannan, Chatterjea, or Ćirić contractions. A comparison table highlights the distinctions. The PA-condition offers a robust framework for analyzing asymptotic behavior in iterative processes where local instability occurs.

math.FA↗

Qualified Cross-References as a Verification Method: The Normative Environment of the EU AI Act

Legal cross-references are commonly represented as links between instruments or provisions. In a curated legal knowledge base, a link must also identify the legal character of the interaction, its supporting provisions and conditions, and remain consistent from either instrument. This paper presents a provision-level model and a protocol for qualified cross-references, developed through a bilingual corpus of fourteen instruments surrounding Regulation (EU) 2024/1689 (the AI Act). The model distinguishes direct textual reference, bounded presumption of conformity, substantive interaction without textual reference, mediated intersection, and institutional analogy; applicative interaction and definitional overlap are independent dimensions. Its methodological contribution is bidirectional inversion: a relationship documented from act A towards act B is reconstructed from B's perspective against both instruments. This verification tests provisions, qualification, direction, and conditions before deciding how to render the relationship from either side. Applied during construction, the protocol surfaced six incorrect article references, three inaccurate legal qualifications, and one divergence between two published descriptions of the same interaction. A reference to Regulation (EU) 2019/881 illustrates why qualification matters: the AI Act's bounded cybersecurity presumption differs from other product legislation's uses of the same certification framework. The contribution is a map of one regulatory environment and an explicitly specified method for making curated cross-reference knowledge bases inspectable and internally testable. A later, separately scoped corpus audit is discussed among the limitations, without pooling its findings with the original measurements; limited access to historical inputs constrains independent reproduction.

cs.CY↗

Inferential Capability Does Not Determine Legal Scope

Two instruments of EU digital law place inference at their centre and mean different things by it. Article 3(1) of the AI Act uses the capability to infer constitutively: it is the central feature separating the regulated category from conventional software. The GDPR never defines inference, yet governs it protectively: the consequences follow from the processing of personal data and from what the inference says about, or does to, a person, whether or not the technology that produced it qualifies as an AI system. The two perimeters are not concentric. Their non-coincidence remained invisible in single-shot systems; agentic architectures make it operationally acute. The thesis: inferential capability does not determine legal scope, and its absence does not create immunity. The framework is two-level. Inference performs two legal functions, constitutive and protective; the protective function operates through three pathways - identificatory, attributive and decisional. Composition is not a fourth pathway but a cross-cutting architectural dimension which, with reach, persistence and reviewability, is what agentic architectures modify. Three concepts support it: the inferential threshold, the inferential reach and the inferential chain, mapped onto the chain of imputation. Regulation (EU) 2026/1744 left the constitutive criterion untouched and inserted a provision contemplating outputs that influence the inputs of future operations, without supplying any rule of aggregation. The article proposes an interpretive rule, a compositional-effects test identifying the decision unit under Article 22 GDPR together with the allocation of the burden of establishing it, and documentation duties calibrated to inference chains.

cs.CY↗

A Restatement of Fixed Point Existence: From Banach to Singh Contractions

This paper presents a reformulation of classical existence and uniqueness results for second-order boundary value problems (BVPs). For Singh contractions, we allow $T^p$ to satisfy the condition, providing greater flexibility. Examples illustrate the applicability of all results. The work highlights the utility of generalized contractions in differential equations, particularly when the Banach contraction principle fails.

math.FA↗

Prioritization of Risks from Artificial Intelligence: A Delphi Study of 272 International Experts

Artificial intelligence poses many risks, ranging from familiar present-day harms to unprecedented and potentially catastrophic ones. Effective risk management requires prioritization: we must understand which risks are most severe, who is most vulnerable, and who is most responsible for addressing them. We report results from a three-round Delphi study conducted late 2025 with 272 international AI experts. Experts rated 24 AI risks on harm probability and severity, sector and actor vulnerability, actor responsibility, and overall concern. Experts estimated the five most severe harms in the next 5 years were likely to come from dangerous capabilities, competitive dynamics, weapons & cyberattacks (including CBRNE), power centralization, and false information. In a business-as-usual scenario, experts judged 18 of 24 risks as having a more than 10% probability of catastrophic outcomes (e.g., more than 1 million deaths or more than USD 100B in financial loss) in the next 5 years (2025-2030). In a scenario where pragmatic mitigations are implemented, experts still judged five risks as having a more than 10% probability of catastrophic outcomes: dangerous capabilities, weapons & cyberattacks, environmental harm, inequality & unemployment, and power centralization. All 24 risks were judged as being more than 5% likely to cause catastrophic outcomes. AI users and the general public were judged the most vulnerable to these risks, but experts assigned the highest responsibility for addressing them to general-purpose AI developers and governance actors (including governments, regulators, and standards bodies). Across most risks, experts identified information, finance, and national security as the most vulnerable sectors. These findings can guide AI risk prioritization and clarify expert expectations about who should bear responsibility for mitigation.

cs.CY↗

The AI Legal Specialist: A Juridically Autonomous Professional Profile for AI Governance

The rapid global expansion of artificial intelligence regulation has generated, across multiple jurisdictions, a demand for legal expertise dedicated to AI that the market has addressed in a fragmented manner. Data protection officers extend their remit beyond data protection law; privacy lawyers reposition themselves toward AI; compliance officers add AI chapters to their existing manuals. This paper argues that none of these adaptive responses adequately covers the professional space opened by the emerging global AI regulatory landscape, of which the EU Artificial Intelligence Act (Regulation (EU) 2024/1689) is the most comprehensive instance, alongside the Council of Europe Framework Convention on AI, the United States executive and sectoral framework, and analogous initiatives in the United Kingdom, Canada, Brazil, China, Japan, Singapore, and beyond. A distinct professional profile is required: the AI Legal Specialist, conceived as a jurist -- understood broadly to encompass any professional with advanced legal training -- operating at the intersection of legal interpretation and AI governance. The profile is juridically autonomous: it derives its existence from the structure of regulatory obligations generated wherever AI is subject to substantive regulation, rather than from any technical standard or the extension of adjacent roles. The paper provides a juridically grounded definition of the profile, argues for its autonomy from adjacent figures and international standards, proposes a reference competence architecture aligned with the European e-Competence Framework (e-CF, EN 16234-1) as a methodological choice, and articulates the conditions for its operational measurement through key performance indicators. The contribution is intended as a foundation for international standardization of the profile and as a reference for practice, curricula, and adoption across jurisdictions.

cs.CY↗

Discontinuity at the fixed point in suprametric spaces

The aim of this paper is to generalize some fixed point theorems in the class of convex contraction of order $m$ on a complete suprametric space. Then, we will prove that the class of convex contraction of order m is strong enough to generate a fixed point on a complete suprametric spaces but do not force the mapping to be continuous at the fixed point, and it can be replaced by relatively weaker conditions of $k$-continuity or $T$-orbitally lower semi-continuous. On this way a new and distinct solution to the open problem of Rhoades (Contemp Math 72:233-245,1988) is found. In sequel, we will prove some fixed point results in the setting suprametric spaces which are generalizations of the results regarding Sehgal, Ćirić and Fisher's quasi-contraction. Some examples and application will be approved our results.

math.GM↗

Path Averaged Polynomial Contractions: A New Generalization of Polynomial Contractions, Path-Averaged Contractions, and Banach Contractions

The notion of polynomial contraction appeared in [2], whilst the notion of path-averaged contraction appeared in [3] for metric spaces, in [4,5] for b-metric spaces, , and in [6] for suprametric spaces. In this paper, we combine both notions to introduce path-averaged polynomial contractions, as a generaliation of polynomial contractions, path-averaged contractions, and Banach contractions.We obtain a fixed point theorem for such contractions in the setting of metric spaces.We give an example showing path-averaged polynomial contractions are not Banach contractions

math.GM↗

Fixed Point Theorem for Path-Averaged Contractions in Complete b-Metric Spaces

We extend the fixed point result for Path-Averaged Contractions (PA-contractions) from complete metric spaces to complete b-metric spaces. We prove that every PA-contraction on a complete b-metric space has a unique fixed point, provided the contraction constant $ α$ satisfies $s α^{1/N} < 1$, where $ s \geq 1 $ is the b-metric coefficient and $N$ the averaging parameter. Moreover, we establish that every PA-contraction is automatically continuous. The proof relies on geometric decay of successive distances and the generalized triangle inequality. This result paves the way for extending averaged contraction principles to other classical types, such as Kannan, Chatterjea, and Ćirić-type mappings, as well as Wardowski's F-contractions, in generalized metric settings.

math.FA↗

Fixed Points in Quantum Metric Spaces: A Structural Advantage over Fuzzy Frameworks

We prove an existence and uniqueness theorem for fixed points of contraction maps in the framework of quantum metric spaces, where distinguishability is defined by the $L^2$ norm: $d_Q(ψ_1,ψ_2) = \|ψ_1 - ψ_2\|$. The result applies to normalized real-valued Gaussian wavefunctions under continuous contractive evolution preserving the functional form. In contrast, while fuzzy metric spaces admit analogous fixed point theorems, they lack interference, phase sensitivity, and topological protection. This comparison reveals a deeper structural coherence in the quantum framework -- not merely technical superiority, but compatibility with the geometric richness of Hilbert space. Our work extends the critique of fuzzy logic into dynamical reasoning under intrinsic uncertainty.

quant-ph↗

Subject Roles in the EU AI Act: Mapping and Regulatory Implications

The European Union's Artificial Intelligence Act (Regulation (EU) 2024/1689) establishes the world's first comprehensive regulatory framework for AI systems through a sophisticated ecosystem of interconnected subjects defined in Article 3. This paper provides a structured examination of the six main categories of actors - providers, deployers, authorized representatives, importers, distributors, and product manufacturers - collectively referred to as "operators" within the regulation. Through examination of these Article 3 definitions and their elaboration across the regulation's 113 articles, 180 recitals, and 13 annexes, we map the complete governance structure and analyze how the AI Act regulates these subjects. Our analysis reveals critical transformation mechanisms whereby subjects can assume different roles under specific conditions, particularly through Article 25 provisions ensuring accountability follows control. We identify how obligations cascade through the supply chain via mandatory information flows and cooperation requirements, creating a distributed yet coordinated governance system. The findings demonstrate how the regulation balances innovation with the protection of fundamental rights through risk-based obligations that scale with the capabilities and deployment contexts of AI systems, providing essential guidance for stakeholders implementing the AI Act's requirements.

cs.CY↗

Fixed Point Theory For Singh-Chatterjea Type Contractive Mappings

In this paper, we introduce a new contraction condition that combines the framework of Singh's extension with the classical Chatterjea contraction. This generalized form, called the Singh-Chatterjea contraction, is defined on the p-th iterate of a mapping. We establish fixed point theorems for such mappings in complete metric spaces and show that our results extend and unify both Singh's and Chatterjea's classical fixed point theorems. Illustrative examples and a simple numerical implementation are provided to demonstrate the applicability of the obtained results.

math.FA↗

On the Incompatibility of Quantum State Geometry and Fuzzy Metric Spaces: Three No-Go Theorems

We prove three structural impossibility results demonstrating that fuzzy metric spaces cannot capture essential features of quantum state geometry. First, we show they cannot model destructive interference between concepts due to phase insensitivity. Second, we prove there is no distance-preserving embedding from quantum state space into any fuzzy metric space. Third, we establish that fuzzy logic cannot distinguish symmetric from antisymmetric concept combinations -- a fundamental limitation for modeling structured knowledge. These theorems collectively show that fuzzy frameworks are structurally incapable of representing intrinsic uncertainty, where quantum mechanics provides a superior, geometrically coherent alternative.

quant-ph↗

Affective Computing and Emotional Data: Challenges and Implications in Privacy Regulations, The AI Act, and Ethics in Large Language Models

This paper examines the integration of emotional intelligence into artificial intelligence systems, with a focus on affective computing and the growing capabilities of Large Language Models (LLMs), such as ChatGPT and Claude, to recognize and respond to human emotions. Drawing on interdisciplinary research that combines computer science, psychology, and neuroscience, the study analyzes foundational neural architectures - CNNs for processing facial expressions and RNNs for sequential data, such as speech and text - that enable emotion recognition. It examines the transformation of human emotional experiences into structured emotional data, addressing the distinction between explicit emotional data collected with informed consent in research settings and implicit data gathered passively through everyday digital interactions. That raises critical concerns about lawful processing, AI transparency, and individual autonomy over emotional expressions in digital environments. The paper explores implications across various domains, including healthcare, education, and customer service, while addressing challenges of cultural variations in emotional expression and potential biases in emotion recognition systems across different demographic groups. From a regulatory perspective, the paper examines emotional data in the context of the GDPR and the EU AI Act frameworks, highlighting how emotional data may be considered sensitive personal data that requires robust safeguards, including purpose limitation, data minimization, and meaningful consent mechanisms.

cs.CY↗

Quantum Metric Spaces: Replacing Fuzzy Metrics with the Hilbert Space Structure of Quantum States

Fuzzy metric spaces, grounded in t-norms and membership functions, have been widely proposed to model uncertainty in machine learning, decision systems, and artificial intelligence. Yet these frameworks treat uncertainty as an external layer of imprecision imposed upon classical, point-like entities - a conceptual mismatch for domains where indeterminacy is intrinsic, such as quantum systems or cognitive representations. We argue that fuzzy metrics are unnecessary for modeling such uncertainty: instead, the well-established structure of complex Hilbert spaces - the foundational language of quantum mechanics for over a century - provides a natural, rigorous, and non-contradictory metric space where the ``points'' are quantum states themselves. The distance between states is given by the Hilbert norm, which directly encodes state distinguishability via the Born rule. This framework inherently captures the non-classical nature of uncertainty without requiring fuzzy logic, t-norms, or membership degrees. We demonstrate its power by modeling AI concepts as Gaussian wavefunctions and classifying ambiguous inputs via quantum overlap integrals. Unlike fuzzy methods, our approach naturally handles interference, distributional shape, and concept compositionality through the geometry of state vectors. We conclude that fuzzy metric spaces, while historically useful, are obsolete for representing intrinsic uncertainty - superseded by the more robust, predictive, and ontologically coherent framework of quantum state geometry.

quant-ph↗

AI Act and Large Language Models (LLMs): When critical issues and privacy impact require human and ethical oversight

The imposing evolution of artificial intelligence systems and, specifically, of Large Language Models (LLM) makes it necessary to carry out assessments of their level of risk and the impact they may have in the area of privacy, personal data protection and at an ethical level, especially on the weakest and most vulnerable. This contribution addresses human oversight, ethical oversight, and privacy impact assessment.

cs.CY↗

The approach with the Data Protection and Privacy Relationships Model (DAPPREMO)

We describe the Data Protection and Privacy Relationships Model (DAPPREMO), which is based on the set theory, considering that both the data protection and privacy regulation and Ethics principles in those domains belong to a set. DAPPREMO is a new and innovative solution to adopt a model in any data protection and privacy activities. We theorise that DAPPREMO is an innovative approach to have a broad overview of all the objects related to a specific case or more cases from data protection and privacy perspective. We describe DAPPREMO as a solution for a multidisciplinary approach to address any data protection and privacy issue.

cs.CR↗