Related papers: Adversarial quantum channel discrimination
We consider the problem of discriminating finite-dimensional quantum processes, also called quantum supermaps, that can consist of multiple time steps. Obtaining the ultimate performance for discriminating quantum processes is of…
We analyze various eavesdropping strategies on a quantum cryptographic channel. We present the optimal strategy for an eavesdropper restricted to a two-dimensional probe, interacting on-line with each transmitted signal. The link between…
Consider a distributed detection problem in which the underlying distributions of the observations are unknown; instead of these distributions, noisy versions of empirically observed statistics are available to the fusion center. These…
We study the error detection problem in $ q $-ary asymmetric channels wherein every input symbol $ x_i $ is mapped to an output symbol $ y_i $ satisfying $ y_i \geq x_i $. A general setting is assumed where the noise vectors are…
A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely,…
We show that hybrid quantum classifiers based on quantum kernel methods and support vector machines are vulnerable against adversarial attacks, namely small engineered perturbations of the input data can deceive the classifier into…
The study of quantum channels is the most fundamental theoretical problem in quantum information and quantum communication theory. The link product theory of quantum channels is an important tool for studying quantum networks. In this…
Adversarial robustness in quantum classifiers is a critical area of study, providing insights into their performance compared to classical models and uncovering potential advantages inherent to quantum machine learning. In the NISQ era of…
A minimax converse for the identification via channels is derived. By this converse, a general formula for the identification capacity, which coincides with the transmission capacity, is proved without the assumption of the strong converse…
The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum…
Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that…
We propose a new simulation-based estimation method, adversarial estimation, for structural models. The estimator is formulated as the solution to a minimax problem between a generator (which generates simulated observations using the…
We study the problem of generating an approximately i.i.d. string at the output of a discrete memoryless channel using a limited amount of randomness at its input in presence of causal noiseless feedback. Feedback does not decrease the…
Martingale concentration inequalities constitute a powerful mathematical tool in the analysis of problems in a wide variety of fields ranging from probability and statistics to information theory and machine learning. Here we apply…
Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider a revised unambiguous discrimination of quantum resources. First, we present an upper bound of the success…
Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy…
We explore the task of optimal quantum channel identification, and in particular the estimation of a general one parameter quantum process. We derive new characterizations of optimality and apply the results to several examples including…
Tasks involving black boxes appear frequently in quantum computer science. An example that has been deeply studied is quantum channel discrimination. In this work, we study the discrimination between two quantum unitary channels in the…
The optimal error exponents of binary composite i.i.d. state discrimination are trivially bounded by the worst-case pairwise exponents of discriminating individual elements of the sets representing the two hypotheses, and in the…
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: (1) We propose and motivate a definition for quantum broadcast. Our model of quantum broadcast channel is new. (2) We discovered that quantum…