English
Related papers

Related papers: On Anomaly Identification and the Counterfeit Coin…

200 papers

Given a set of $n$ integer-valued coin types and a target value $t$, the well-known change-making problem asks for the minimum number of coins that sum to $t$, assuming an unlimited number of coins in each type. In the more general…

Data Structures and Algorithms · Computer Science 2021-10-07 Timothy M. Chan , Qizheng He

The random cost problem is the problem of finding the minimum in an exponentially long list of random numbers. By definition, this problem cannot be solved faster than by exhaustive search. It is shown that a classical NP-hard optimization…

Disordered Systems and Neural Networks · Physics 2009-10-31 Stephan Mertens

In an era where data underpins decision-making across science, politics, and economics, ensuring high data quality is of paramount importance. Conventional computing algorithms for enhancing data quality, including anomaly detection, demand…

Quantum Physics · Physics 2025-12-02 Sven Groppe , Valter Uotila , Jinghua Groppe

Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…

Information Theory · Computer Science 2017-08-01 Pat Morin , Wolfgang Mulzer , Tommy Reddad

Counterfactual inference considers a hypothetical intervention in a parallel world that shares some evidence with the factual world. If the evidence specifies a conditional distribution on a manifold, counterfactuals may be analytically…

Machine Learning · Statistics 2024-07-03 Juha Karvanen , Santtu Tikka , Matti Vihola

Unknown quantum information cannot be perfectly copied (cloned). This statement is the bedrock of quantum technologies and quantum cryptography, including the seminal scheme of Wiesner's quantum money, which was the first…

The goal of demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity…

Quantum Physics · Physics 2019-09-16 Niraj Kumar , Iordanis Kerenidis , Eleni Diamanti

Binary classification problems can be naturally modeled as bipartite graphs, where we attempt to classify right nodes based on their left adjacencies. We consider the case of labeled bipartite graphs in which some labels and edges are not…

Combinatorics · Mathematics 2018-11-13 R. W. R. Darling , Mark L. Velednitsky

Public-key quantum money is a cryptographic proposal for using highly entangled quantum states as currency that is publicly verifiable yet resistant to counterfeiting due to the laws of physics. Despite significant interest, constructing…

Quantum Physics · Physics 2023-01-24 Prabhanjan Ananth , Zihan Hu , Henry Yuen

Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible…

Quantum Physics · Physics 2009-10-31 Andrew M. Steane

Anomaly detection is a method for discovering unusual and suspicious behavior. In many real-world scenarios, the examined events can be directly linked to the actions of an adversary, such as attacks on computer networks or frauds in…

Machine Learning · Computer Science 2020-04-23 Olga Petrova , Karel Durkota , Galina Alperovich , Karel Horak , Michal Najman , Branislav Bosansky , Viliam Lisy

In this paper we study the notion of synchronization from the point of view of combinatorics. As a first step, we address the quantitative problem of counting the number of executions of simple processes interacting with synchronization…

Programming Languages · Computer Science 2019-07-10 Olivier Bodini , Matthieu Dien , Antoine Genitrini , Frédéric Peschanski

An increasing number of communication and computational schemes with quantum advantages have recently been proposed, which implies that quantum technology has fertile application prospects. However, demonstrating these schemes…

Quantum Physics · Physics 2022-05-06 Min-Gang Zhou , Xiao-Yu Cao , Yu-Shuo Lu , Yang Wang , Yu Bao , Zhao-Ying Jia , Yao Fu , Hua-Lei Yin , Zeng-Bing Chen

Here is considered a specific detection loophole, that is relevant not only to testing of quantum nonlocality, but also to some other applications of quantum computations and communications. It is described by a simple affine relation…

Quantum Physics · Physics 2007-05-23 Alexander Yu. Vlasov

A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…

Quantum Physics · Physics 2009-11-10 K. Khodjasteh , D. A. Lidar

The element distinctness problem is the problem of determining whether the elements of a list are distinct, that is, if $x=(x_1,...,x_N)$ is a list with $N$ elements, we ask whether the elements of $x$ are distinct or not. The solution in a…

Quantum Physics · Physics 2018-11-13 Renato Portugal

This work focuses on quantum methods for cryptanalysis of schemes based on the integer factorization problem and the discrete logarithm problem. We demonstrate how to practically solve the largest instances of the factorization problem by…

Cryptography and Security · Computer Science 2024-10-08 Olgierd Żołnierczyk

Anomaly detection has a wide range of real-world applications, such as bank fraud detection and cyber intrusion detection. In the past decade, a variety of anomaly detection models have been developed, which lead to big progress towards…

Machine Learning · Computer Science 2022-02-17 Shuhan Yuan , Xintao Wu

Quantum metrology makes use of coherent superpositions to detect weak signals. While in principle the sensitivity can be improved by increasing the density of sensing particles, in practice this improvement is severely hindered by…

Although polynomial-time probabilistic Turing machines can utilize uncomputable transition probabilities to recognize uncountably many languages with bounded error when allowed to use logarithmic space, it is known that such "magic coins"…

Computational Complexity · Computer Science 2014-12-01 A. C. Cem Say , Abuzer Yakaryilmaz