Related papers: On the conditions for discrimination between quant…
We solve the problem of quantum state discrimination with "general (symmetric) figures of merit" for an even number of symmetric quantum bits with use of the no-signaling principle. It turns out that conditional probability has the same…
We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we…
Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…
We derive an algebraic framework which identifies the minimal information required to assess how well a quantum device implements a desired quantum operation. Our approach is based on characterizing only the unitary part of an open system's…
We establish a lower bound on the quantum coherence of an arbitrary quantum state in arbitrary dimension, using a noncommutativity estimator of an arbitrary observable of sub-unit norm, where the estimator is the commutator of the…
The purpose of this paper is to obtain a sufficient and necessary condition as a criteria to test whether an arbitrary multipartite state is entangled or not. Based on the tensor expression of a multipartite pure state, the paper shows that…
We can learn (more) about the state a quantum system is in through measurements. We look at how to describe the uncertainty about a quantum system's state conditional on executing such measurements. We show that by exploiting the interplay…
Sequential methods for quantum hypothesis testing offer significant advantages over fixed-length approaches, which rely on a predefined number of state copies. Despite their potential, these methods remain underexplored for unambiguous…
Quantum machine learning (QML) algorithms have obtained great relevance in the machine learning (ML) field due to the promise of quantum speedups when performing basic linear algebra subroutines (BLAS), a fundamental element in most ML…
We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is…
The coherence of an individual quantum state can be meaningfully discussed only when referring to a preferred basis. This arbitrariness can however be lifted when considering sets of quantum states. Here we introduce the concept of set…
Calculation of the quantum discord requires to find the minimum of the quantum conditional entropy $S(\rho^{AB}|\{\Pi^B_{k}\})$ over all measurements on the subsystem $B$. In this paper, we provide a simple relation for the conditional…
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,…
In this paper we investigate the connection between quantum information theory and machine learning. In particular, we show how quantum state discrimination can represent a useful tool to address the standard classification problem in…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
It is shown that different distinguishability measures impose different orderings on ensembles of $N$ pure quantum states. This is demonstrated using ensembles of equally-probable, linearly independent, symmetrical pure states, with the…
We introduce a measure of the compatibility between quantum states--the likelihood that two density matrices describe the same object. Our measure is motivated by two elementary requirements, which lead to a natural definition. We list some…
We consider the discrimination of two-party quantum states and provide a quantum data-hiding scheme using two-qubit separable states. We first provide a bound on the optimal local discrimination of two-party quantum states, and establish a…
The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which…
We study the concurrence of arbitrary multipartite mixed quantum states. An explicit lower bound of the concurrence is derived, which detects quantum entanglement of some states better than some separability criteria, and gives sufficient…