scholarly journals A SUFFICIENT AND NECESSARY CONDITION FOR SUPERDENSE CODING OF QUANTUM STATES

2008 ◽  
Vol 06 (05) ◽  
pp. 1115-1125 ◽  
Author(s):  
DAOWEN QIU
Keyword(s):  
Lower Bound ◽  
Success Probability ◽  
Quantum States ◽  
Entangled States ◽  
Necessary Condition ◽  
Entangled State ◽  
Maximally Entangled State ◽  
High Success Probability ◽  
Sufficient And Necessary Condition ◽  
Arbitrary Quantum

Recently, Harrow et al. [Phys. Rev. Lett.92 (2004) 187901] gave a method for preparing an arbitrary quantum state with high success probability by physically transmitting some qubits, and by consuming a maximally entangled state, together with exhausting some shared random bits. In this paper, we discover that some states are impossible to be perfectly prepared by Alice and Bob initially sharing some entangled states. In particular, we present a sufficient and necessary condition for the states being enabled to be exactly prepared with probability equal to unity, in terms of the initial entangled states (maybe nonmaximally). In contrast, if the initially shared entanglement is maximal, then the probabilities for preparing these quantum states are smaller than unity. Furthermore, the lower bound on the probability for preparing some states are derived.

MULTIPARTY REMOTELY PREPARING MULTIPARTITE EQUATORIAL ENTANGLED STATES IN HIGH DIMENSIONS

2011 ◽  
Vol 09 (06) ◽  
pp. 1437-1448
Author(s):  
YI-BAO LI ◽  
KUI HOU ◽  
SHOU-HUA SHI
Keyword(s):  
Quantum State ◽  
Quantum Channel ◽  
Success Probability ◽  
Quantum States ◽  
Remote State Preparation ◽  
Entangled States ◽  
Entangled State ◽  
High Dimensions ◽  
Original State ◽  
State Preparation

We propose two kinds of schemes for multiparty remote state preparation (MRSP) of the multiparticle d-dimensional equatorial quantum states by using partial entangled state as the quantum channel. Unlike more remote state preparation scheme which only one sender knows the original state to be remotely prepared, the quantum state is shared by two-party or multiparty in this scheme. We show that if and only if all the senders agree to collaborate with each other, the receiver can recover the original state with certain probability. It is found that the total success probability of MRSP is only by means of the smaller coefficients of the quantum channel and the dimension d.

Generalized three-party sharing of operations on remote single qutrit

2014 ◽  
Vol 12 (03) ◽  
pp. 1450011 ◽  
Author(s):  
Pengfei Xing ◽  
Yimin Liu ◽  
Chuanmei Xie ◽  
Xiansong Liu ◽  
Zhanjun Zhang
Keyword(s):  
Success Probability ◽  
Entangled States ◽  
Entangled State ◽  
Quantum Channels ◽  
Channel State ◽  
Classical Communication ◽  
Maximally Entangled State ◽  
Quantum Operations ◽  
Local Operation ◽  
Maximally Entangled States

Two three-party schemes are put forward for sharing quantum operations on a remote qutrit with local operation and classical communication as well as shared entanglements. The first scheme uses a two-qutrit and three-qutrit non-maximally entangled states as quantum channels, while the second replaces the three-qutrit non-maximally entangled state with a two-qutrit. Both schemes are treated and compared from the four aspects of quantum and classical resource consumption, necessary-operation complexity, success probability and efficiency. It is found that the latter is overall more optimal than the former as far as a restricted set of operations is concerned. In addition, comparisons of both schemes with other four relevant ones are also made to show their two features, including degree generalization and channel-state generalization. Furthermore, some concrete discussions on both schemes are made to expose their important features of security, symmetry and experimental feasibility. Particularly, it is revealed that the success probabilities and intrinsic efficiencies in both schemes are completely determined by the shared entanglement.

scholarly journals A Time-Homogeneous Diffusion Model with Tax

2013 ◽  
Vol 50 (1) ◽  
pp. 195-207 ◽  
Author(s):  
Bin Li ◽  
Qihe Tang ◽  
Xiaowen Zhou
Keyword(s):  
Lower Bound ◽  
Diffusion Process ◽  
Necessary Condition ◽  
Present Value ◽  
Ruin Theory ◽  
Exit Problem ◽  
Explicit Formulae ◽  
Exit Probabilities ◽  
Tax Payments ◽  
Sufficient And Necessary Condition

We study the two-sided exit problem of a time-homogeneous diffusion process with tax payments of loss-carry-forward type and obtain explicit formulae for the Laplace transforms associated with the two-sided exit problem. The expected present value of tax payments until default, the two-sided exit probabilities, and, hence, the nondefault probability with the default threshold equal to the lower bound are solved as immediate corollaries. A sufficient and necessary condition for the tax identity in ruin theory is discovered.

QUANTUM TELEPORTATION OF AN ARBITRARY N-QUBIT STATE VIA NON-MAXIMALLY ENTANGLED STATE

2007 ◽  
Vol 05 (05) ◽  
pp. 673-683 ◽  
Author(s):  
YU-LING LIU ◽  
ZHONG-XIAO MAN ◽  
YUN-JIE XIA
Keyword(s):  
Quantum Teleportation ◽  
Success Probability ◽  
Qubit State ◽  
Bell States ◽  
Entangled State ◽  
Quantum Channels ◽  
Maximally Entangled State ◽  
Ghz States ◽  
Measurement Basis ◽  
Unit Probability

We explicitly present two schemes for quantum teleportation of an arbitrary N-qubit entangled state using, respectively, non-maximally entangled Bell states and GHZ states as the quantum channels, and generalized Bell states as the measurement basis. The scheme succeeds with unit fidelity but less than unit probability. By introducing additional qubit and unitary operations, the success probability of these two schemes can be increased.

scholarly journals MAXIMALLY ENTANGLED STATES AND BELL'S INEQUALITY IN RELATIVISTIC REGIME

2009 ◽  
Vol 07 (01) ◽  
pp. 395-401 ◽  
Author(s):  
SHAHPOOR MORADI
Keyword(s):  
Ghz State ◽  
Entangled States ◽  
Entangled State ◽  
Maximally Entangled State ◽  
Expectation Value ◽  
Spin Observables ◽  
Chsh Inequality ◽  
Relativistic Regime ◽  
Maximal Violation ◽  
Maximally Entangled States

In this letter we show that in the relativistic regime, maximally entangled state of two spin-1/2 particles not only gives maximal violation of the Bell-CHSH inequality but also gives the largest violation attainable for any pairs of four spin observables that are noncommuting for both systems. Also, we extend our results to three spin-1/2 particles. We obtain the largest eigenvalue of Bell operator and show that this value is equal to the expectation value of Bell operator on GHZ state.

scholarly journals Performance Analysis and Parameter Optimization of the Optimal Fixed-Point Quantum Search

2019 ◽  
Vol 9 (17) ◽  
pp. 3584
Author(s):  
Tianyi Bao ◽  
Duan Huang
Keyword(s):  
Fixed Point ◽  
Target Item ◽  
Optimal Parameter ◽  
Success Probability ◽  
Query Complexity ◽  
Necessary Condition ◽  
Quantum Search ◽  
Application Research ◽  
Sufficient And Necessary Condition ◽  
Number Of Iterations

The optimal fixed-point quantum search (OFPQS) algorithm [Phys. Rev. Lett. 113, 210501 (2014)] achieves both the fixed-point property and quadratic speedup over classical algorithms, which gives a sufficient condition on the number of iterations to ensure the success probability is no less than a given lower bound (denoted by 1 − δ 2 ). However, this condition is approximate and not exact. In this paper, we derive the sufficient and necessary condition on the number of feasible iterations, based on which the exact least number of iterations can be obtained. For example, when δ = 0 . 8 , iterations can be saved by almost 25%. Moreover, to find a target item certainly, setting directly 1 − δ 2 = 100 % , the quadratic advantage of the OFPQS algorithm will be lost, then, applying the OFPQS algorithm with 1 − δ 2 < 100 % requires multiple executions, which leads to a natural problem of choosing the optimal parameter δ . For this, we analyze the extreme and minimum properties of the success probability and further analytically derive the optimal δ which minimizes the query complexity. Our study can be a guideline for both the theoretical and application research on the fixed-point quantum search algorithms.

Two novel schemes for probabilistic remote state preparation and the physical realization via the linear optics

2016 ◽  
Vol 14 (01) ◽  
pp. 1650003 ◽  
Author(s):  
Jiahua Wei ◽  
Hong-Yi Dai ◽  
Ming Zhang ◽  
Le Yang ◽  
Jingsong Kuang
Keyword(s):  
Partial Information ◽  
Research Field ◽  
Remote State Preparation ◽  
Entangled State ◽  
The Novel ◽  
Linear Optics ◽  
Maximally Entangled State ◽  
Application Range ◽  
State Preparation ◽  
Arbitrary Quantum

In this paper, we put forward two novel schemes for probabilistic remote preparation of an arbitrary quantum state with the aid of appropriate local unitary operations when the sender and the receiver only have partial information of non-maximally entangled state, respectively. The concrete implementation procedures of the novel proposals are given in detail. Additionally, the physical realizations of our proposals are discussed based on the linear optics. Because of that neither the sender nor the receiver need to know fully the information of the partially entangled state, our schemes are useful to not only expand the application range of quantum entanglement, but also enlarge the research field of probabilistic remote state preparation (RSP).

The influence of excitation number of photon-added coherent state field on the entanglement swapping process

2017 ◽  
Vol 31 (27) ◽  
pp. 1750198 ◽  
Author(s):  
M. Soltani ◽  
M. K. Tavassoly ◽  
R. Pakniat
Keyword(s):  
Coherent State ◽  
Quantum Electrodynamics ◽  
Coherent States ◽  
Success Probability ◽  
Entanglement Swapping ◽  
Cavity Quantum Electrodynamics ◽  
Linear Entropy ◽  
Entangled State ◽  
Maximally Entangled State ◽  
Coherent Field

In this paper, we outline a scheme for the entanglement swapping procedure based on cavity quantum electrodynamics using the Jaynes–Cummings model consisting of the coherent and photon-added coherent states. In particular, utilizing the photon-added coherent states ([Formula: see text][Formula: see text][Formula: see text][Formula: see text], where [Formula: see text] is the Glauber coherent state) in the scheme, enables us to investigate the effect of [Formula: see text], i.e., the number of excitations corresponding to the photon-added coherent field on the entanglement swapping process. In the scheme, two two-level atoms [Formula: see text] and [Formula: see text] are initially entangled together, and distinctly two exploited cavity fields [Formula: see text] and [Formula: see text] are prepared in an entangled state (a combination of coherent and photon-added coherent states). Interacting the atom [Formula: see text] with field [Formula: see text] (via the Jaynes–Cummings model) and then making detection on them, transfers the entanglement from the two atoms [Formula: see text], [Formula: see text] and the two fields [Formula: see text], [Formula: see text] to the atom-field “[Formula: see text]-[Formula: see text]”, i.e., entanglement swapping occurs. In the continuation, we pay our attention to the evaluation of the fidelity of the swapped entangled state relative to a suitable maximally entangled state, success probability of the performed detections and linear entropy as the degree of entanglement of the swapped entangled state. It is demonstrated that, an increase in the number of excitations, [Formula: see text], leads to the increment of fidelity as well as the amount of entanglement. According to our numerical results, the maximum values of fidelity (linear entropy) 0.98 (0.46) is obtained for [Formula: see text], however, the maximum value of success probability does not significantly change by increasing [Formula: see text].

scholarly journals Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states

2011 ◽  
Vol 11 (9&10) ◽  
pp. 813-819
Author(s):  
Eric Chitambar ◽  
Carl Miller ◽  
Yaoyun Shi
Keyword(s):  
Success Probability ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Quantum States ◽  
Unitary Equivalence ◽  
Matrix Polynomials ◽  
Unitary Transformations ◽  
The Matrix ◽  
Pure States ◽  
High Success Probability

In this brief report, we consider the equivalence between two sets of $m+1$ bipartite quantum states under local unitary transformations. For pure states, this problem corresponds to the matrix algebra question of whether two degree $m$ matrix polynomials are unitarily equivalent; i.e. $UA_iV^\dagger=B_i$ for $0\leq i\leq m$ where $U$ and $V$ are unitary and $(A_i, B_i)$ are arbitrary pairs of rectangular matrices. We present a randomized polynomial-time algorithm that solves this problem with an arbitrarily high success probability and outputs transforming matrices $U$ and $V$.

Unbounded entanglement in nonlocal games

2015 ◽  
Vol 15 (15&16) ◽  
pp. 1317-1332
Author(s):  
Laura Mančinska ◽  
Thomas Vidick
Keyword(s):  
Quantum Entanglement ◽  
Finite Length ◽  
Success Probability ◽  
The Other ◽  
Entangled States ◽  
Entangled State ◽  
Local Dimension ◽  
Hardy's Paradox ◽  
First Time ◽  
Quantum Strategies

Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a purely classical scenario for which no finite amount of entanglement suffices. To this end we introduce a simple two-party nonlocal game H, inspired by Lucien Hardy’s paradox. In our game each player has only two possible questions and can provide bit strings of any finite length as answer. We exhibit a sequence of strategies which use entangled states in increasing dimension d and succeed with probability 1 − O(d−c ) for some c ≥ 0.13. On the other hand, we show that any strategy using an entangled state of local dimension d has success probability at most 1 − Ω(d−2 ). In addition, we show that any strategy restricted to producing answers in a set of cardinality at most d has success probability at most 1 − Ω(d−2 ). Finally, we generalize our construction to derive similar results starting from any game G with two questions per player and finite answers sets in which quantum strategies have an advantage.

Sign in / Sign up

Export Citation Format

Share Document