scholarly journals Adaptive State Fidelity Estimation for Higher Dimensional Bipartite Entanglement

Entropy ◽  
2020 ◽  
Vol 22 (8) ◽  
pp. 886
Author(s):  
Jun-Yi Wu
Keyword(s):  
Quantum State ◽  
Adaptive Method ◽  
Upper Bounds ◽  
The State ◽  
Entangled States ◽  
Lower And Upper Bounds ◽  
Bipartite Entanglement ◽  
Higher Dimensional ◽  
Computational Basis

An adaptive method for quantum state fidelity estimation in bipartite higher dimensional systems is established. This method employs state verifier operators which are constructed by local POVM operators and adapted to the measurement statistics in the computational basis. Employing this method, the state verifier operators that stabilize Bell-type entangled states are constructed explicitly. Together with an error operator in the computational basis, one can estimate the lower and upper bounds on the state fidelity for Bell-type entangled states in few measurement configurations. These bounds can be tighter than the fidelity bounds derived in [Bavaresco et al., Nature Physics (2018), 14, 1032–1037], if one constructs more than one local POVM measurements additional to the measurement in the computational basis.

scholarly journals Seeking for the Maximum Symmetric Rank

Mathematics ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 247 ◽  
Author(s):  
Alessandro De Paris
Keyword(s):  
State Of The Art ◽  
Symmetric Tensor ◽  
Upper Bounds ◽  
The State ◽  
Tensor Rank ◽  
Symmetric Tensors ◽  
Lower And Upper Bounds ◽  
Symmetric Tensor Rank ◽  
Set Up ◽  
Divided Powers

We present the state-of-the-art on maximum symmetric tensor rank, for each given dimension and order. After a general discussion on the interplay between symmetric tensors, polynomials and divided powers, we introduce the technical environment and the methods that have been set up in recent times to find new lower and upper bounds.

scholarly journals Nonmaximal Entanglement Can Make Joint Remote State Preparation Absolutely Secure

2013 ◽  
Vol 23 (2) ◽  
pp. 97
Author(s):  
Cao Thi Bich ◽  
Nguyen Ba An
Keyword(s):  
Quantum State ◽  
Quantum Channel ◽  
The State ◽  
Remote State Preparation ◽  
Entangled States ◽  
Joint Remote State Preparation ◽  
State Preparation ◽  
Quantum Task

Joint remote state preparation is a multiparty global quantum task in which several parties are assigned to jointly prepare a quantum state for a remote party. Although various protocols have been proposed so far, none of them are absolutely secure in the sense that the legitimate parties (the preparers plus the receiver) can by no means identify the state to be prepared even if they all collude with each other. Here we resolve this drawback by employing the quantum channel in terms of nonmaximally entangled states whose parameters are kept secret to all the participants but used to split the information in a judicious way so that not only absolute security in the above-mentioned sense is achieved but also the performance is the simplest possible.

Extension of the Spatial PDI Model to Three Dimensions

1997 ◽  
Vol 84 (1) ◽  
pp. 176-178
Author(s):  
Frank O'Brien
Keyword(s):  
Population Density ◽  
Dimensional Space ◽  
Finite Lattice ◽  
Three Dimensional ◽  
Upper Bounds ◽  
Three Dimensions ◽  
Lower And Upper Bounds ◽  
Density Index ◽  
Three Dimensional Space

The author's population density index ( PDI) model is extended to three-dimensional distributions. A derived formula is presented that allows for the calculation of the lower and upper bounds of density in three-dimensional space for any finite lattice.

Energy of spherical fuzzy graphs

2020 ◽  
pp. 321-332
Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali
Keyword(s):  
Adjacency Matrix ◽  
Upper Bounds ◽  
Fuzzy Graph ◽  
Lower And Upper Bounds ◽  
Fuzzy Graphs

In this paper, the notion of energy extended to spherical fuzzy graph. The adjacency matrix of a spherical fuzzy graph is defined and we compute the energy of a spherical fuzzy graph as the sum of absolute values of eigenvalues of the adjacency matrix of the spherical fuzzy graph. Also, the lower and upper bounds for the energy of spherical fuzzy graphs are obtained.

scholarly journals Relationship between Age and Value of Information for a Noisy Ornstein–Uhlenbeck Process

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 940
Author(s):  
Zijing Wang ◽  
Mihai-Alin Badiu ◽  
Justin P. Coon
Keyword(s):  
Value Of Information ◽  
Markov Models ◽  
Upper Bounds ◽  
Distribution Functions ◽  
Lower And Upper Bounds ◽  
Uhlenbeck Process ◽  
Source Data ◽  
Non Linear ◽  
Queue Model ◽  
Selection Of

The age of information (AoI) has been widely used to quantify the information freshness in real-time status update systems. As the AoI is independent of the inherent property of the source data and the context, we introduce a mutual information-based value of information (VoI) framework for hidden Markov models. In this paper, we investigate the VoI and its relationship to the AoI for a noisy Ornstein–Uhlenbeck (OU) process. We explore the effects of correlation and noise on their relationship, and find logarithmic, exponential and linear dependencies between the two in three different regimes. This gives the formal justification for the selection of non-linear AoI functions previously reported in other works. Moreover, we study the statistical properties of the VoI in the example of a queue model, deriving its distribution functions and moments. The lower and upper bounds of the average VoI are also analysed, which can be used for the design and optimisation of freshness-aware networks. Numerical results are presented and further show that, compared with the traditional linear age and some basic non-linear age functions, the proposed VoI framework is more general and suitable for various contexts.

The Lower and Upper Bounds of Turán Number for Odd Wheels

2021 ◽  
Vol 37 (3) ◽  
pp. 919-932
Author(s):  
Byeong Moon Kim ◽  
Byung Chul Song ◽  
Woonjae Hwang
Keyword(s):  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Turán Number
Sign in / Sign up

Export Citation Format

Share Document