English
Related papers

Related papers: Complete FSM Testing Using Strong Separability

200 papers

Identifying dependency in multivariate data is a common inference task that arises in numerous applications. However, existing nonparametric independence tests typically require computation that scales at least quadratically with the sample…

Methodology · Statistics 2021-07-08 Shai Gorsky , Li Ma

Self-testing is a method to certify quantum states and measurements in a device-independent way. The device-independent certification of quantum properties is purely based on input-output measurement statistics of the involved devices with…

Quantum Physics · Physics 2024-01-26 Ranendu Adhikary , Abhishek Mishra , Ramij Rahaman

Although quantum entanglement has already been verified experimentally and applied in quantum computing, quantum sensing and quantum networks, most of the existing measures cannot characterize the entanglement faithfully. In this work, by…

Quantum Physics · Physics 2023-01-10 Zhi-Xiang Jin , Shao-Ming Fei , Xianqing Li-Jost , Cong-Feng Qiao

Reasoning about safety, security, and other dependability attributes of autonomous systems is a challenge that needs to be addressed before the adoption of such systems in day-to-day life. Formal methods is a class of methods that…

Artificial Intelligence · Computer Science 2023-11-17 Ashfaq Farooqui , Behrooz Sangchoolie

Co-simulation is a promising approach for the modelling and simulation of complex systems, that makes use of mature simulation tools in the respective domains. It has been applied in wildly different domains, oftentimes without a…

Computers and Society · Computer Science 2019-01-21 Gerald Schweiger , Claudio Gomes , Georg Engel , Josef-Peter Schoeggl , Alfred Posch , Irene Hafner , Thierry Nouidu

The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…

Machine Learning · Computer Science 2017-09-05 A. N. Gorban , I. Y. Tyukin

This paper addresses the issues of conservativeness and computational complexity of probabilistic robustness analysis. We solve both issues by defining a new sampling strategy and robustness measure. The new measure is shown to be much less…

Applications · Statistics 2008-05-12 Xinjia Chen , Kemin Zhou , Jorge L. Aravena

Finding ways to test the behaviour of quantum devices is a timely enterprise, especially in the light of the rapid development of quantum technologies. Device-independent self-testing is one desirable approach, as it makes minimal…

Quantum Physics · Physics 2018-09-26 Ivan Šupić , Andrea Coladangelo , Remigiusz Augusiak , Antonio Acín

High-dimensional entanglement, captured by the Schmidt number, underpins advantages in quantum information tasks, yet a unified resource-theoretic description across different Buscemi-type operational objects has been missing. Here we…

Quantum Physics · Physics 2025-12-30 Xian Shi

Active Learning is concerned with the question of how to identify the most useful samples for a Machine Learning algorithm to be trained with. When applied correctly, it can be a very powerful tool to counteract the immense data…

Computer Vision and Pattern Recognition · Computer Science 2020-06-19 Lukas Hahn , Lutz Roese-Koerner , Peet Cremer , Urs Zimmermann , Ori Maoz , Anton Kummert

We introduce the concept of assemblage moment matrices, i.e., a collection of matrices of expectation values, each associated with a conditional quantum state obtained in a steering experiment. We demonstrate how it can be used for quantum…

Quantum Physics · Physics 2016-06-20 Shin-Liang Chen , Costantino Budroni , Yeong-Cherng Liang , Yueh-Nan Chen

Federated Learning is a framework that jointly trains a model \textit{with} complete knowledge on a remotely placed centralized server, but \textit{without} the requirement of accessing the data stored in distributed machines. Some work…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-26 Jia Qian , Lars Kai Hansen , Xenofon Fafoutis , Prayag Tiwari , Hari Mohan Pandey

The completeness of quantum state space, is usually expressed as \sum_{m=0}^{\infty}|m><m|=1, where {|m>} is selected set of quantum states (basis). Density matrix |m><m| describes a pure quantum state. In this paper, by virtue of the…

Quantum Physics · Physics 2017-11-28 Hongyi Fan , Jun-hua Chen , Dehui Zhan , Liyun Hu

Self-testing protocols enable the certification of quantum systems in a device-independent manner, i.e. without knowledge of the inner workings of the quantum devices under test. Here, we demonstrate this high standard for characterization…

A decade ago, Abdulla, Ben Henda and Mayr introduced the elegant concept of decisiveness for denumerable Markov chains [1]. Roughly speaking, decisiveness allows one to lift most good properties from finite Markov chains to denumerable…

Logic in Computer Science · Computer Science 2018-04-05 Nathalie Bertrand , Patricia Bouyer , Thomas Brihaye , Pierre Carlier

Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…

Data Structures and Algorithms · Computer Science 2007-05-23 Lawrence M. Ioannou

Persistent homology is a vital tool for topological data analysis. Previous work has developed some statistical estimators for characteristics of collections of persistence diagrams. However, tools that provide statistical inference for…

Applications · Statistics 2016-02-23 Andrew Robinson , Katharine Turner

The persistent separability of certain quantum states, known as symmetric absolutely separable (SAS), under symmetry-preserving global unitary transformations is of key significance in the context of quantum resources for bosonic systems.…

Quantum Physics · Physics 2024-02-27 Eduardo Serrano-Ensástiga , Jérôme Denis , John Martin

Large Language Models (LLMs) have demonstrated remarkable capabilities in various reasoning-intensive tasks. However, these models exhibit unexpected brittleness, often failing on simple variations of the same underlying task. Existing…

Computation and Language · Computer Science 2026-04-27 Yutao Hou , Zeguan Xiao , Fei Yu , Yihan Jiang , Ma Shuguang , Zhaoqian Dai , Hailiang Huang , Yun Chen , Guanhua Chen

Providing various machine learning (ML) applications in the real world, concerns about discrimination hidden in ML models are growing, particularly in high-stakes domains. Existing techniques for assessing the discrimination level of ML…

Machine Learning · Computer Science 2024-05-16 Yijun Bian , Yujie Luo