English
Related papers

Related papers: Quantifiability: Concurrent Correctness from First…

200 papers

We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…

Logic in Computer Science · Computer Science 2015-07-01 Benoit Larose , Cynthia Loten , Claude Tardif

Uncertainty representation and quantification are paramount in machine learning and constitute an important prerequisite for safety-critical applications. In this paper, we propose novel measures for the quantification of aleatoric and…

Machine Learning · Computer Science 2024-04-22 Paul Hofman , Yusuf Sale , Eyke Hüllermeier

In this paper we present an alternative approach to formalize the theory of logic programming. In this formalization we allow existential quantified variables and equations in queries. In opposite to standard approaches the role of answer…

Logic in Computer Science · Computer Science 2022-07-20 Ján Komara

We propose a new model for augmenting algorithms with predictions by requiring that they are formally learnable and instance robust. Learnability ensures that predictions can be efficiently constructed from a reasonable amount of past data.…

Machine Learning · Computer Science 2021-07-05 Thomas Lavastida , Benjamin Moseley , R. Ravi , Chenyang Xu

Quantum coherence is a fundamental manifestation of the quantum superposition principle. Recently, Baumgratz \emph{et al}. [Phys. Rev. Lett. \textbf{113}, 140401 (2014)] presented a rigorous framework to quantify coherence from the view of…

Quantum Physics · Physics 2017-08-02 Xianfei Qi , Ting Gao , Fengli Yan

Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…

Quantum Physics · Physics 2018-08-09 Hamza Fawzi , Omar Fawzi

Linearisability is a central notion for verifying concurrent libraries: a given library is proven safe if its operational history can be rearranged into a new sequential one which, in addition, satisfies a given specification.…

Programming Languages · Computer Science 2016-10-26 Andrzej S. Murawski , Nikos Tzevelekos

Traditional models grounded in first principles often struggle with accuracy as the system's complexity increases. Conversely, machine learning approaches, while powerful, face challenges in interpretability and in handling physical…

Machine Learning · Computer Science 2024-01-31 Jessica Leoni , Valentina Breschi , Simone Formentin , Mara Tanelli

The quantification of aleatoric and epistemic uncertainty in terms of conditional entropy and mutual information, respectively, has recently become quite common in machine learning. While the properties of these measures, which are rooted…

Machine Learning · Computer Science 2023-06-27 Lisa Wimmer , Yusuf Sale , Paul Hofman , Bern Bischl , Eyke Hüllermeier

Correctness conditions for concurrent objects describe how atomicity of an abstract sequential object may be decomposed. Many different concurrent objects and proof methods for them have been developed. However, arguments about correctness…

Logic in Computer Science · Computer Science 2016-06-08 Brijesh Dongol , Lindsay Groves

In modelling complex processes, the potential past data that influence future expectations are immense. Models that track all this data are not only computationally wasteful but also shed little light on what past data most influence the…

Linearizability and progress properties are key correctness notions for concurrent objects. However, model checking linearizability has suffered from the PSPACE-hardness of the trace inclusion problem. This paper proposes to exploit…

Programming Languages · Computer Science 2016-10-03 Xiaoxiao Yang , Joost-Pieter Katoen , Huimin Lin , Hao Wu

In this paper, we propose the classification method based on a learning paradigm we are going to call Quantum Low Entropy based Associative Reasoning or QLEAR learning. The approach is based on the idea that classification can be understood…

Machine Learning · Computer Science 2017-05-31 Marko V. Jankovic

The existence of incompatible measurements, i.e. measurements which cannot be performed simultaneously on a single copy of a quantum state, constitutes an important distinction between quantum mechanics and classical theories. While…

Quantum Physics · Physics 2022-06-22 Krzysztof Mordasewicz , Jędrzej Kaniewski

The fidelity-based smooth min-relative entropy is a distinguishability measure that has appeared in a variety of contexts in prior work on quantum information, including resource theories like thermodynamics and coherence. Here we provide a…

Quantum Physics · Physics 2024-05-29 Theshani Nuradha , Mark M. Wilde

Standard quantum inference converts quantum data into classical outputs. We study an alternative inference setting in which the desired output is quantum, preserving coherence. Such settings include quantum purity amplification (QPA),…

Quantum Physics · Physics 2026-05-21 Zhaoyi Li , Elias Theil , Aram W. Harrow , Isaac Chuang

Properties expressed as the provability of a first-order sentence can be disproved by just finding a model of the negation of the sentence. This fact, however, is meaningful in restricted cases only, depending on the shape of the sentence…

Programming Languages · Computer Science 2017-09-18 Salvador Lucas

Quantum metrology promises higher precision measurements than classical methods. Entanglement has been identified as one of quantum resources to enhance metrological precision. However, generating entangled states with high fidelity…

Quantum Physics · Physics 2024-07-16 Jeongwoo Jae , Jiwon Lee , M. S. Kim , Kwang-Geol Lee , Jinhyoung Lee

Causal nonseparability refers to processes where events take place in a coherent superposition of different causal orders. These may be the key resource for experimental violations of causal inequalities and have been recently identified as…

Quantum Physics · Physics 2019-12-16 Márcio M. Taddei , Ranieri V. Nery , Leandro Aolita

Learning compact and interpretable representations is a very natural task, which has not been solved satisfactorily even for simple binary datasets. In this paper, we review various ways of composing experts for binary data and argue that…

Computer Vision and Pattern Recognition · Computer Science 2016-11-01 Marc Goessling , Yali Amit