Related papers: Quantum data hiding with two-qubit separable state…
In this paper, we mainly investigate the detection of quantum states containing fewer than $k$ unentangled particles in multipartite quantum systems. Based on calculations about operators, we derive two practical criteria for judging…
We introduce a new type of cryptographic primitive that we call hiding fingerprinting. A (quantum) fingerprinting scheme translates a binary string of length $n$ to $d$ (qu)bits, typically $d\ll n$, such that given any string $y$ and a…
Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, non-orthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability…
We present the view of quantum algorithms as a search-theoretic problem. We show that the Fourier transform, used to solve the Abelian hidden subgroup problem, is an example of an efficient elimination observable which eliminates a constant…
Quantum discord plays a pragmatic role in analyzing nonclassical feature of quantum correlations beyond entanglement. It is used in several information processing protocols which lacks sufficient amount of entanglement to be used as a…
We employ quantum state discrimination theory to establish the ultimate limit for spoofing detection in electromagnetic signals encoded with random quantum states. Our analysis yields an analytical expression for the optimal bound, which we…
Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using GHZ states. In the quantum…
It is known from Bell's theorem that quantum predictions for some entangled states cannot be mimicked using local hidden variable (LHV) models. From a computer science perspective, LHV models may be interpreted as classical computers…
We propose a scheme for multiparty hierarchical quantum-information splitting (QIS) with a multipartite entangled state, where a boss distributes a secret quantum state to two grades of agents asymmetrically. The agents who belong to…
We consider the separability of rank two quantum states on multiple quantum spaces with different dimensions. The sufficient and necessary conditions for separability of these multiparty quantum states are explicitly presented. A…
We analyze the set of two-qubit states from which a secret key can be extracted by single-copy measurements plus classical processing of the outcomes. We introduce a key distillation protocol and give the corresponding necessary and…
In many quantum information processing protocols, entangled states shared among parties are an important resource. In this article, we study how bipartite states may be distributed in the context of a quantum network limited by timing…
Privacy-preserving vision must overcome the dual challenge of utility and privacy. Too much anonymity renders the images useless, but too little privacy does not protect sensitive data. We propose a novel design for privacy preservation,…
Deterministic discrimination of nonorthogonal states is forbidden by quantum measurement theory. However, if we do not want to succeed all the time, i.e. allow for inconclusive outcomes to occur, then unambiguous discrimination becomes…
If a measurement is made on one half of a bipartite system, then, conditioned on the outcome, the other half has a new reduced state. If these reduced states defy classical explanation -- that is, if shared randomness cannot produce these…
Entangling an unknown qubit with one type of reference state is generally impossible. However, entangling an unknown qubit with two types of reference states is possible. To achieve this, we introduce a new class of states called zero sum…
In this paper, we mainly discuss the separability of $n$-partite quantum states from elements of density matrices. Practical separability criteria for different classes of $n$-qubit and $n$-qudit quantum states are obtained. Some of them…
Quantum state verification (QSV) and quantum data hiding (QDH) have so far been studied separately. QSV decides whether a given quantum state is close to the ideal one, with significantly lower sample complexity compared with direct…
After analysing the main quantum secret sharing protocol based on the entanglement states, we propose an idea to directly encode the qubit of quantum key distributions, and then present a quantum secret sharing scheme where only product…
There are two common settings in a quantum-state discrimination problem. One is minimum-error discrimination where a wrong guess (error) is allowed and the discrimination success probability is maximized. The other is unambiguous…