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

Reports on Mathematical Physics

Concepts of convergence for a quantum law of large numbers

Wilhelm Ochs

Published Feb 1, 1980• 3 citations
Publisher
DOI
10.1016/0034-4877(80)90081-6

Related papers

On the strong law of large numbers in quantum probability theory

Wilhelm Ochs

Journal of Philosophical Logic•Jan 1, 1977•18 citations

Numerical Error Extraction by Quantum Measurement Algorithm

Clement Ronfaut, Robin Ollive, Stephane Louise

In quantum computing, some of the main quantum operations (i.e., gates) cannot be simply implemented and require an approximation. Major quantum algorithm routines enable the implementation of these specific quantum gates by combining basic quantum circuits with an iterative structure. In this structure, the number of repetitions of the basic circuit pattern is associated with convergence parameters. The asymptotic convergence of the gate error with respect to the number of basic pattern repetitions is known as the query complexity. The underlying convergence law is bounded, but often lacks explicit constants for specific problem instances. Upper bounds are generally too pessimistic to be useful in practice. The actual convergence law contains constants that depend on the joint properties of the matrix encoded by the query and the initial state vector, which are difficult to compute classically. This paper proposes a strategy to study this convergence law directly from the Quantum Processing Unit (QPU) output. Given a convergence law, this protocol extracts the numerical values of the associated constants from the gate (i.e., operation) approximation at different accuracies (i.e., convergence parameters) constructed directly on the QPU. This protocol is called Numerical Error Extraction by Quantum Measurement Algorithm (NEEQMA). NEEQMA concepts are tested on specific instances of Quantum Signal Processing (QSP) and Hamiltonian Simulation via Trotterization. Knowing the convergence constants associated with a semi-norm of the error allows selecting the smallest convergence parameters that achieve the required gate approximation accuracy, thereby satisfying the quantum algorithm's requirements.

quant-pharXiv:2602.01927•Feb 3, 2026•4 citations

Indeterminate Probabilities and the Weak Quantum Law of Large Numbers

Fedor Herbut

The quantum probabilistic convergence in measurement, distinct from mathematical convergence, is derived for indeterminate probabilities from the weak quantum law of large numbers. This is presented in three theorems. The first establishes the necessary bridge between ensemble theory and experiment. The second analyzes the most important theoretical ensemble entity: the eigen-projector of the relative frequency operator. Its physical meaning is the experimental relative frequency. The third theorem formulates the quantum probabilistic convergence, which is the final result of this investigation.

arXiv:1512.00474•Dec 1, 2015•1 citation

Quantum Theory and Its Stochastic Limit

Luigi Accardi, Igor Vasil'evich Volovich, Yun Gang Lu

Springer eBooks•Jan 1, 2002•424 citations

The Principle of Ontological Statistical Convergence: Physical Statistical Convergence Laws in Deterministic Causal Systems

Jiale Wu

Traditional physics often directly attributes the phenomenon of frequency convergence in large samples to the existence of intrinsic randomness at the fundamental physical level. However, the mathematical Law of Large Numbers (LLN) is merely a theorem within a formal axiomatic system and makes no ontological assertions regarding its physical origin. Equating frequency convergence with intrinsic randomness is an unverified logical extrapolation. Building upon the "Ontology-Information Dichotomy Framework," this paper proposes the Principle of Ontological Statistical Convergence: In a physical system with an underlying fully deterministic causal structure, the frequency of sample occurrences will progressively converge to the objective frequency ratio inherent in the ontological statistical truth set after numerous independent repeated physical samplings. This convergence behavior does not depend on object intrinsic randomness, information gap , or the existence of an observer. This paper designs a transparent visualized shaking experiment, a foreign object perturbation experiment, and a sample size-relative fluctuation experiment. Under the conditions of (complete information) and completely determined single-run physical results, the large-sample frequency convergence phenomenon is reproduced, and it is empirically demonstrated that the convergence target is entirely determined by the physical interaction structure. This paper strictly distinguishes the mathematical LLN from physical statistical convergence, corrects the traditional logical leap of attributing convergence to intrinsic randomness, and lays a solid foundation for a unified physical statistical theory across macro and micro scales.

•Nov 4, 2026•0 citations

Problems of Probability Theory in the Light of Quantum Mechanics

Martin Strauss

Springer eBooks•Jan 1, 1972•2 citations
In quantum computing, some of the main quantum operations (i.e., gates) cannot be simply implemented and require an approximation. Major quantum algorithm routines enable the implementation of these specific quantum gates by combining basic quantum circuits with an iterative structure. In this structure, the number of repetitions of the basic circuit pattern is associated with convergence parameters. The asymptotic convergence of the gate error with respect to the number of basic pattern repetitions is known as the query complexity. The underlying convergence law is bounded, but often lacks explicit constants for specific problem instances. Upper bounds are generally too pessimistic to be useful in practice. The actual convergence law contains constants that depend on the joint properties of the matrix encoded by the query and the initial state vector, which are difficult to compute classically. This paper proposes a strategy to study this convergence law directly from the Quantum Processing Unit (QPU) output. Given a convergence law, this protocol extracts the numerical values of the associated constants from the gate (i.e., operation) approximation at different accuracies (i.e., convergence parameters) constructed directly on the QPU. This protocol is called Numerical Error Extraction by Quantum Measurement Algorithm (NEEQMA). NEEQMA concepts are tested on specific instances of Quantum Signal Processing (QSP) and Hamiltonian Simulation via Trotterization. Knowing the convergence constants associated with a semi-norm of the error allows selecting the smallest convergence parameters that achieve the required gate approximation accuracy, thereby satisfying the quantum algorithm's requirements.
The quantum probabilistic convergence in measurement, distinct from mathematical convergence, is derived for indeterminate probabilities from the weak quantum law of large numbers. This is presented in three theorems. The first establishes the necessary bridge between ensemble theory and experiment. The second analyzes the most important theoretical ensemble entity: the eigen-projector of the relative frequency operator. Its physical meaning is the experimental relative frequency. The third theorem formulates the quantum probabilistic convergence, which is the final result of this investigation.
Traditional physics often directly attributes the phenomenon of frequency convergence in large samples to the existence of intrinsic randomness at the fundamental physical level. However, the mathematical Law of Large Numbers (LLN) is merely a theorem within a formal axiomatic system and makes no ontological assertions regarding its physical origin. Equating frequency convergence with intrinsic randomness is an unverified logical extrapolation. Building upon the "Ontology-Information Dichotomy Framework," this paper proposes the Principle of Ontological Statistical Convergence: In a physical system with an underlying fully deterministic causal structure, the frequency of sample occurrences will progressively converge to the objective frequency ratio inherent in the ontological statistical truth set after numerous independent repeated physical samplings. This convergence behavior does not depend on object intrinsic randomness, information gap , or the existence of an observer. This paper designs a transparent visualized shaking experiment, a foreign object perturbation experiment, and a sample size-relative fluctuation experiment. Under the conditions of (complete information) and completely determined single-run physical results, the large-sample frequency convergence phenomenon is reproduced, and it is empirically demonstrated that the convergence target is entirely determined by the physical interaction structure. This paper strictly distinguishes the mathematical LLN from physical statistical convergence, corrects the traditional logical leap of attributing convergence to intrinsic randomness, and lays a solid foundation for a unified physical statistical theory across macro and micro scales.