scholarly journals Sharing quantum steering among multiple Alices and Bobs via a two-qubit Werner state

2021 ◽  
Vol 20 (8) ◽  
Author(s):  
Xinhong Han ◽  
Ya Xiao ◽  
Huichao Qu ◽  
Runhong He ◽  
Xuan Fan ◽  
...  
Keyword(s):  
Quantum Information ◽  
Lower Bound ◽  
Quantum Correlation ◽  
The Other ◽  
Werner State ◽  
Sharing Scheme ◽  
Asymmetric Quantum ◽  
Quantum Steering ◽  
Information Tasks

AbstractQuantum steering, a type of quantum correlation with unique asymmetry, has important applications in asymmetric quantum information tasks. We consider a new quantum steering scenario in which one half of a two-qubit Werner state is sequentially measured by multiple Alices and the other half by multiple Bobs. We find that the maximum number of Alices who can share steering with a single Bob increases from 2 to 5 when the number of measurement settings N increases from 2 to 16. Furthermore, we find a counterintuitive phenomenon that for a fixed N, at most 2 Alices can share steering with 2 Bobs, while 4 or more Alices are allowed to share steering with a single Bob. We further analyze the robustness of the steering sharing by calculating the required purity of the initial Werner state, the lower bound of which varies from 0.503(1) to 0.979(5). Finally, we show that our both-sides sequential steering sharing scheme can be applied to control the steering ability, even the steering direction, if an initial asymmetric state or asymmetric measurement is adopted. Our work gives insights into the diversity of steering sharing and can be extended to study the problems such as genuine multipartite quantum steering when the sequential unsharp measurement is applied.

scholarly journals Density Guarantee on Finding Multiple Subgraphs and Subtensors

2021 ◽  
Vol 15 (5) ◽  
pp. 1-32
Author(s):  
Quang-huy Duong ◽  
Heri Ramampiaro ◽  
Kjetil Nørvåg ◽  
Thu-lan Dam
Keyword(s):  
Lower Bound ◽  
State Of The Art ◽  
The State ◽  
The Other ◽  
Exact Methods ◽  
Practical Solution ◽  
Novel Approach ◽  
Wide Range ◽  
Real World Datasets ◽  
Tensor Data

Dense subregion (subgraph & subtensor) detection is a well-studied area, with a wide range of applications, and numerous efficient approaches and algorithms have been proposed. Approximation approaches are commonly used for detecting dense subregions due to the complexity of the exact methods. Existing algorithms are generally efficient for dense subtensor and subgraph detection, and can perform well in many applications. However, most of the existing works utilize the state-or-the-art greedy 2-approximation algorithm to capably provide solutions with a loose theoretical density guarantee. The main drawback of most of these algorithms is that they can estimate only one subtensor, or subgraph, at a time, with a low guarantee on its density. While some methods can, on the other hand, estimate multiple subtensors, they can give a guarantee on the density with respect to the input tensor for the first estimated subsensor only. We address these drawbacks by providing both theoretical and practical solution for estimating multiple dense subtensors in tensor data and giving a higher lower bound of the density. In particular, we guarantee and prove a higher bound of the lower-bound density of the estimated subgraph and subtensors. We also propose a novel approach to show that there are multiple dense subtensors with a guarantee on its density that is greater than the lower bound used in the state-of-the-art algorithms. We evaluate our approach with extensive experiments on several real-world datasets, which demonstrates its efficiency and feasibility.

scholarly journals An Exponential Separation Between MA and AM Proofs of Proximity

2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Tom Gur ◽  
Yang P. Liu ◽  
Ron D. Rothblum
Keyword(s):  
Quantum Information ◽  
Lower Bound ◽  
Recent Result ◽  
Query Complexity ◽  
Random String ◽  
Natural Property ◽  
Public And Private ◽  
Alternate Proof ◽  
Interactive Proofs ◽  
Exponential Separation

AbstractInteractive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof. The first variant, known as -proofs of Proximity (), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as -proofs of Proximity (), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both s and s is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity. Our main result is an exponential separation between the power of s and s. Specifically, we exhibit an explicit and natural property $$\Pi$$ Π that admits an with complexity $$O(\log n)$$ O ( log n ) , whereas any for $$\Pi$$ Π has complexity $$\tilde{\Omega}(n^{1/4})$$ Ω ~ ( n 1 / 4 ) , where n denotes the length of the input in bits. Our lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a $$\Omega(n^{1/6})$$ Ω ( n 1 / 6 ) lower bound for the same property $$\Pi$$ Π .Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that s can only be quadratically stronger than s. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.

scholarly journals Tripartite entropic uncertainty relation under phase decoherence

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
R. A. Abdelghany ◽  
A.-B. A. Mohamed ◽  
M. Tammam ◽  
Watson Kuo ◽  
H. Eleuch
Keyword(s):  
Lower Bound ◽  
Uncertainty Relation ◽  
Nearest Neighbors ◽  
The Other ◽  
Uncertainty In Measurement ◽  
Entropic Uncertainty Relation ◽  
Specific Choice ◽  
Phase Decoherence ◽  
Time Invariant ◽  
Incompatible Observables

AbstractWe formulate the tripartite entropic uncertainty relation and predict its lower bound in a three-qubit Heisenberg XXZ spin chain when measuring an arbitrary pair of incompatible observables on one qubit while the other two are served as quantum memories. Our study reveals that the entanglement between the nearest neighbors plays an important role in reducing the uncertainty in measurement outcomes. In addition we have shown that the Dolatkhah’s lower bound (Phys Rev A 102(5):052227, 2020) is tighter than that of Ming (Phys Rev A 102(01):012206, 2020) and their dynamics under phase decoherence depends on the choice of the observable pair. In the absence of phase decoherence, Ming’s lower bound is time-invariant regardless the chosen observable pair, while Dolatkhah’s lower bound is perfectly identical with the tripartite uncertainty with a specific choice of pair.

Lower Bounds to the Eigenvalues in One-Dimensional Problems by a Shift in the Weight Function

1970 ◽  
Vol 37 (2) ◽  
pp. 267-270 ◽  
Author(s):  
D. Pnueli
Keyword(s):  
Lower Bound ◽  
Weight Function ◽  
Lower Bounds ◽  
Variational Formulation ◽  
Ritz Method ◽  
The Other ◽  
One Dimensional ◽  
Systematic Shift ◽  
The One ◽  
Detailed Computation

A method is presented to obtain both upper and lower bound to eigenvalues when a variational formulation of the problem exists. The method consists of a systematic shift in the weight function. A detailed procedure is offered for one-dimensional problems, which makes improvement of the bounds possible, and which involves the same order of detailed computation as the Rayleigh-Ritz method. The main contribution of this method is that it yields the “other bound;” i.e., the one which cannot be obtained by the Rayleigh-Ritz method.

A Model of Secure Functioning of Computer Systems

2021 ◽  
Vol 12 (3) ◽  
pp. 150-156
Author(s):  
A. V. Galatenko ◽  
◽  
V. A. Kuzovikhina ◽  
Keyword(s):  
Lower Bound ◽  
Computer System ◽  
Finite Automaton ◽  
Nonnegative Integer ◽  
The Other ◽  
Shannon Function ◽  
Security Breaches ◽  
System Functioning ◽  
The Cost ◽  
The Given

We propose an automata model of computer system security. A system is represented by a finite automaton with states partitioned into two subsets: "secure" and "insecure". System functioning is secure if the number of consecutive insecure states is not greater than some nonnegative integer k. This definition allows one to formally reflect responsiveness to security breaches. The number of all input sequences that preserve security for the given value of k is referred to as a k-secure language. We prove that if a language is k-secure for some natural and automaton V, then it is also k-secure for any 0 < k < k and some automaton V = V (k). Reduction of the value of k is performed at the cost of amplification of the number of states. On the other hand, for any non-negative integer k there exists a k-secure language that is not k"-secure for any natural k" > k. The problem of reconstruction of a k-secure language using a conditional experiment is split into two subcases. If the cardinality of an input alphabet is bound by some constant, then the order of Shannon function of experiment complexity is the same for al k; otherwise there emerges a lower bound of the order nk.

scholarly journals An improved lower bound related to the Furstenberg-Sárközy theorem

10.37236/4656 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Mark Lewko
Keyword(s):  
Lower Bound ◽  
The Other ◽  
The Difference

Let $D(n)$ denote the cardinality of the largest subset of the set $\{1,2,\ldots,n\}$ such that the difference of no pair of distinct elements is a square. A well-known theorem of Furstenberg and Sárközy states that $D(n)=o(n)$. In the other direction, Ruzsa has proven that $D(n) \gtrsim n^{\gamma}$ for $\gamma = \frac{1}{2}\left( 1 + \frac{\log 7}{\log 65} \right) \approx 0.733077$. We improve this to $\gamma = \frac{1}{2}\left( 1 + \frac{\log 12}{\log 205} \right)  \approx 0.733412$.

ONLINE SCHEDULING OF DYNAMIC TREES

1995 ◽  
Vol 05 (04) ◽  
pp. 635-646 ◽  
Author(s):  
MICHAEL A. PALIS ◽  
JING-CHIOU LIOU ◽  
SANGUTHEVAR RAJASEKARAN ◽  
SUNIL SHENDE ◽  
DAVID S.L. WEI
Keyword(s):  
Lower Bound ◽  
Competitive Ratio ◽  
Scheduling Algorithm ◽  
Optimal Schedule ◽  
Online Scheduling ◽  
The Other ◽  
Static Case ◽  
Scheduling Problem ◽  
Dynamic Trees ◽  
Dynamic Tree

The scheduling problem for dynamic tree-structured task graphs is studied and is shown to be inherently more difficult than the static case. It is shown that any online scheduling algorithm, deterministic or randomized, has competitive ratio Ω((1/g)/ log d(1/g)) for trees with granularity g and degree at most d. On the other hand, it is known that static trees with arbitrary granularity can be scheduled to within twice the optimal schedule. It is also shown that the lower bound is tight: there is a deterministic online tree scheduling algorithm that has competitive ratio O((1/g)/ log d(1/g)). Thus, randomization does not help.

scholarly journals WKB FORMALISM AND A LOWER LIMIT FOR THE ENERGY EIGENSTATES OF BOUND STATES FOR SOME POTENTIALS

2007 ◽  
Vol 22 (35) ◽  
pp. 2675-2687 ◽  
Author(s):  
LUIS F. BARRAGÁN-GIL ◽  
ABEL CAMACHO
Keyword(s):  
Quantum Mechanics ◽  
Gravitational Field ◽  
Lower Bound ◽  
Harmonic Oscillator ◽  
Approximation Method ◽  
Bound States ◽  
The Other ◽  
Homogeneous Gravitational Field ◽  
Definition Of ◽  
Ground Energy

In this work the conditions appearing in the so-called WKB approximation formalism of quantum mechanics are analyzed. It is shown that, in general, a careful definition of an approximation method requires the introduction of two length parameters, one of them always considered in the textbooks on quantum mechanics, whereas the other is usually neglected. Afterwards we define a particular family of potentials and prove, resorting to the aforementioned length parameters, that we may find an energy which is a lower bound to the ground energy of the system. The idea is applied to the case of a harmonic oscillator and also to a particle freely falling in a homogeneous gravitational field, and in both cases the consistency of our method is corroborated. This approach, together with the so-called Rayleigh–Ritz formalism, allows us to define an energy interval in which the ground energy of any potential, belonging to our family, must lie.

scholarly journals Quantum state space dimension as a quantum resource

2015 ◽  
Vol 13 (06) ◽  
pp. 1550039 ◽  
Author(s):  
A. Plastino ◽  
G. Bellomo ◽  
A. R. Plastino
Keyword(s):  
Quantum Information ◽  
State Space ◽  
Quantum State ◽  
Space Dimension ◽  
Quantum Systems ◽  
Quantum States ◽  
Information Tasks

We argue that the dimensionality of the space of quantum systems’ states should be considered as a legitimate resource for quantum information tasks. The assertion is supported by the fact that quantum states with discord-like capacities can be obtained from classically-correlated states in spaces of dimension large enough. We illustrate things with some simple examples that justify our claim.

Sign in / Sign up

Export Citation Format

Share Document