Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userConclusive discrimination between arbitrary quantum states by N sequential receivers
238
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In the present article, we develop a general framework for the description of an $N$-sequential state discrimination, where each of $N$ receivers always obtains a conclusive result. For this new state discrimination scenario, we derive two mutually equivalent general representations of the success probability and prove that if one of two states, pure or mixed, is prepared by a sender, then the optimal success probability is given by the Helstrom bound for any number $N$ of sequential receivers. Furthermore, we specify receivers indirect measurements resulting in the optimal $N$-sequential conclusive state discrimination protocol. The developed framework is true for any number $N$ of sequential receivers, any number of arbitrary quantum states, pure or mixed, to be discriminated, and all types of receivers quantum measurements. The new general results derived within the developed framework are important both from the theoretical point of view and for a successful multipartite quantum communication even in the presence of a quantum noise.
rate research
Read More
A general scenario for an $N$-sequential conclusive state discrimination introduced recently in Loubenets and Namkung [arXiv:2102.04747] can provide a multipartite quantum communication realizable in the presence of a noise. In the present article, we propose a new experimental scheme for the implementation of a sequential conclusive discrimination between binary coherent states via indirect measurements within the Jaynes-Cummings interaction model. We find that if the mean photon number is less than 1.6, then, for our two-sequential state discrimination scheme, the optimal success probability is larger than the one presented in Fields, Varga, and Bergou [2020, IEEE Int. Conf. Quant. Eng. Comp.]. We also show that, if the mean photon number is almost equal to 1.2, then the optimal success probability nearly approaches the Helstrom bound.
The sequential unambiguous state discrimination (SSD) of two states prepared in arbitrary prior probabilities is studied, and compared with three strategies that allow classical communication. The deviation from equal probabilities contributes to the success in all the tasks considered. When one considers at least one of the parties succeeds, the protocol with probabilistic cloning is superior to others, which is not observed in the special case with equal prior probabilities. We also investigate the roles of quantum correlations in SSD, and show that the procedure requires discords but rejects entanglement. The left and right discords correspond to the part of information extracted by the first observer and the part left to his successor respectively. Their relative difference is extended by the imbalance of prior probabilities.
We explore reachable sets of open $n$-qubit quantum systems, the coherent parts of which are under full unitary control and that have just one qubit whose Markovian noise amplitude can be modulated in time such as to provide an additional degree of incoherent control. In particular, adding bang-bang control of amplitude damping noise (non-unital) allows the dynamic system to act transitively on the entire set of density operators. This means one can transform any initial quantum state into any desired target state. Adding switchable bit-flip noise (unital), on the other hand, suffices to explore all states majorised by the initial state. We have extended our open-loop optimal control algorithm (DYNAMO package) by such degrees of incoherent control so that these unprecedented reachable sets can systematically be exploited in experiments. As illustrated for an ion trap experimental setting, open-loop control with noise switching can accomplish all state transfers one can get by the more complicated measurement-based closed-loop feedback schemes.
We study the procedure for sequential unambiguous state discrimination. A qubit is prepared in one of two possible states, and measured by two observers Bob and Charlie sequentially. A necessary condition for the state to be unambiguously discriminated by Charlie is the absence of entanglement between the principal qubit, prepared by Alice, and Bobs auxiliary system. In general, the procedure for both Bob and Charlie to recognize between two nonorthogonal states conclusively relies on the availability of quantum discord which is precisely the quantum dissonance when the entanglement is absent. In Bobs measurement, the left discord is positively correlated with the information extracted by Bob, and the right discord enhances the information left to Charlie. When their product achieves its maximum the probability for both Bob and Charlie to identify the state achieves its optimal value.
We present an instance of a task of mininum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We then establish two new classes of strategies for channel discrimination that involve indefinite causal order and show that there exists a strict hierarchy among the performance of all four strategies. Our proof technique employs a general method of computer-assisted proofs. We also provide a systematic method for finding pairs of channels that showcase this phenomenon, demonstrating that the hierarchy between the strategies is not exclusive to our main example.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
