Construnctions of LOCC indistinguishable set of generalized Bell states

05/23/2018
by   Jiang-Tao Yuan, et al.
0

In this paper, we mainly consider the local indistinguishability of the set of mutually orthogonal bipartite generalized Bell states (GBSs). We construct small sets of GBSs with cardinality smaller than d which are not distinguished by one-way local operations and classical communication (1-LOCC) in d⊗ d. The constructions, based on linear system and Vandermonde matrix, is simple and effective. The results give a unified upper bound for the minimum cardinality of 1-LOCC indistinguishable set of GBSs, and greatly improve previous results in [Zhang et al., Phys. Rev. A 91, 012329 (2015); Wang et al., Quantum Inf. Process. 15, 1661 (2016)]. The case that d is odd of the results also shows that the set of 4 GBSs in 5⊗ 5 in [Fan, Phys. Rev. A 75, 014305 (2007)] is indeed a 1-LOCC indistinguishable set which can not be distinguished by Fan's method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2021

Local planar domination revisited

We show how to compute a 20-approximation of a minimum dominating set in...
research
10/16/2022

Twin-width of Planar Graphs is at most 8, and at most 6 when Bipartite Planar

The structural parameter twin-width was introduced by Bonnet et al. in [...
research
10/08/2021

Bipartite Independent Set Oracles and Beyond: Can it Even Count Triangles in Polylogarithmic Queries?

Beame et al. [ITCS 2018] introduced and used the Bipartite Independent S...
research
10/24/2021

New Bounds for the Flock-of-Birds Problem

In this paper, we continue a line of work on obtaining succinct populati...
research
10/12/2022

From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments

Recently, Aaronson et al. (arXiv:2009.07450) showed that detecting inter...
research
08/17/2020

Cardinality estimation using Gumbel distribution

Cardinality estimation is the task of approximating the number of distin...
research
06/25/2023

Solving the Identifying Code Set Problem with Grouped Independent Support

An important problem in network science is finding an optimal placement ...

Please sign up or login with your details

Forgot password? Click here to reset