English
Related papers

Related papers: Quantifiability: Concurrent Correctness from First…

200 papers

Despite the superior performance of Large Reasoning Models (LRMs), their reasoning behaviors are often counterintuitive, leading to suboptimal reasoning capabilities. To theoretically formalize the desired reasoning behaviors, this paper…

Artificial Intelligence · Computer Science 2025-12-22 Junyu Zhang , Yifan Sun , Tianang Leng , Jingyan Shen , Liu Ziyin , Paul Pu Liang , Huan Zhang

Wave--particle duality is a cornerstone of quantum mechanics, traditionally formulated under definite causal order. We investigate how complementarity is modified when the temporal order of operations is coherently superposed, as in the…

Quantum Physics · Physics 2026-03-31 Mohd Asad Siddiqui , Md Qutubuddin , Tabish Qureshi

Document ranking based on probabilistic evaluations of relevance is known to exhibit non-classical correlations, which may be explained by admitting a complex structure of the event space, namely, by assuming the events to emerge from…

Information Retrieval · Computer Science 2012-05-28 Roman Zapatrin

The article considers the quantitative assessment approach to the innovativeness of different objects. The proposed assessment model is based on the object data retrieval from various databases including the Internet. We present an object…

Digital Libraries · Computer Science 2021-03-31 V. K. Ivanov

Contextuality - the obstruction to describing quantum mechanics in a classical statistical way - has been proposed as a resource that powers quantum computing. The measurement-based model provides a concrete manifestation of contextuality…

Quantum Physics · Physics 2018-10-12 Markus Frembs , Sam Roberts , Stephen D. Bartlett

We approach the physical implications of the non-commutative nature of Complementary Observable Algebras (COA) from an information theoretic perspective. In particular, we derive a general \textit{entropic certainty principle} stating that…

High Energy Physics - Theory · Physics 2021-01-20 Javier M. Magan , Diego Pontello

Logic-based models can be used to build verification tools for machine learning classifiers employed in the legal field. ML classifiers predict the outcomes of new cases based on previous ones, thereby performing a form of case-based…

Artificial Intelligence · Computer Science 2025-10-16 Cecilia Di Florio , Huimin Dong , Antonino Rotolo

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Logic in Computer Science · Computer Science 2017-03-08 Lidia Tendera

Contextuality is a defining feature that separates the quantum from the classical descriptions of physical systems. Within the marginal-scenario framework, noncontextual models are characterized by the existence of a single joint…

Quantum Physics · Physics 2026-04-08 Andrea Navoni , Marco G. Genoni , Andrea Smirne

Hybrid variational quantum algorithms are promising for solving practical problems, such as combinatorial optimization, quantum chemistry simulation, quantum machine learning, and quantum error correction on noisy quantum computers.…

The class of problems in causal inference which seeks to isolate causal correlations solely from observational data even without interventions has come to the forefront of machine learning, neuroscience and social sciences. As new large…

Emerging Technologies · Computer Science 2022-01-02 Mohammad Ali Javidian , Vaneet Aggarwal , Fanglin Bao , Zubin Jacob

Complementarity was originally introduced as a qualitative concept for the discussion of properties of quantum mechanical objects that are classically incompatible. More recently, complementarity has become a \emph{quantitative} relation…

Quantum Physics · Physics 2009-11-11 Xinhua Peng , Xiwen Zhu , Dieter Suter , Jiangfeng Du , Maili Liu , Kelin Gao

There are at least a number of ways to formally define complexity. Most of them relate to some kind of minimal description of the studied object. Being this one in form of minimal resources of minimal effort needed to generate the object…

Quantum Physics · Physics 2013-04-25 Yuri Campbell , José Roberto Castilho Piqueira

Quantifying the complexity of quantum states that possess intrinsic structure, such as symmetry or encoding, in a fair manner constitutes a core challenge in the benchmarking of quantum technologies. This paper introduces the…

Quantum Physics · Physics 2025-12-30 HongZheng Liu , YiNuo Tian , Zhiyue Wu

Entanglement and coherence are fundamental properties of quantum systems, promising to power near future quantum technologies, such as quantum computation, quantum communication and quantum metrology. Yet, their quantification, rather than…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

Logic · Mathematics 2013-08-30 Andre Nies

First-order logic has been established as an important tool for modeling and verifying intricate systems such as distributed protocols and concurrent systems. These systems are parametric in the number of nodes in the network or the number…

Logic in Computer Science · Computer Science 2024-08-21 Raz Lotan , Eden Frenkel , Sharon Shoham

In quantitative program analysis, values are assigned to execution traces to represent a quality measure. Such analyses cover important applications, e.g. resource usage. Examining all traces is well known to be intractable and therefore…

Programming Languages · Computer Science 2016-07-11 Duc-Hiep Chu , Joxan Jaffar , Vijayaraghavan Murali

Specification theories as a tool in model-driven development processes of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature, and therefore…

Logic in Computer Science · Computer Science 2012-10-23 Sebastian S. Bauer , Uli Fahrenberg , Line Juhl , Kim G. Larsen , Axel Legay , Claus Thrane

We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…

Logic in Computer Science · Computer Science 2017-03-06 Dietrich Kuske , Nicole Schweikardt