scholarly journals Enhanced discrimination of high-dimensional quantum states by concatenated optimal measurement strategies

Author(s):  
Miguel Ángel Solís-Prosser ◽  
Omar Jiménez ◽  
Aldo Delgado ◽  
Leonardo Neves

Abstract The impossibility of deterministic and error-free discrimination among nonorthogonal quantum states lies at the core of quantum theory and constitutes a primitive for secure quantum communication. Demanding determinism leads to errors, while demanding certainty leads to some inconclusiveness. One of the most fundamental strategies developed for this task is the optimal unambiguous measurement. It encompasses conclusive results, which allow for error-free state retrodictions with the maximum success probability, and inconclusive results, which are discarded for not allowing perfect identifications. Interestingly, in high-dimensional Hilbert spaces the inconclusive results may contain valuable information about the input states. Here, we theoretically describe and experimentally demonstrate the discrimination of nonorthogonal states from both conclusive and inconclusive results in the optimal unambiguous strategy, by concatenating a minimum-error measurement at its inconclusive space. Our implementation comprises 4- and 9-dimensional spatially encoded photonic states. By accessing the inconclusive space to retrieve the information that is wasted in the conventional protocol, we achieve significant increases of up to a factor of 2.07 and 3.73, respectively, in the overall probabilities of correct retrodictions. The concept of concatenated optimal measurements demonstrated here can be extended to other strategies and will enable one to explore the full potential of high-dimensional nonorthogonal states for quantum communication with larger alphabets.

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Beatrice Da Lio ◽  
Daniele Cozzolino ◽  
Nicola Biagi ◽  
Yunhong Ding ◽  
Karsten Rottwitt ◽  
...  

AbstractQuantum key distribution (QKD) protocols based on high-dimensional quantum states have shown the route to increase the key rate generation while benefiting of enhanced error tolerance, thus overcoming the limitations of two-dimensional QKD protocols. Nonetheless, the reliable transmission through fiber links of high-dimensional quantum states remains an open challenge that must be addressed to boost their application. Here, we demonstrate the reliable transmission over a 2-km-long multicore fiber of path-encoded high-dimensional quantum states. Leveraging on a phase-locked loop system, a stable interferometric detection is guaranteed, allowing for low error rates and the generation of 6.3 Mbit/s of a secret key rate.


2015 ◽  
Vol 91 (4) ◽  
Author(s):  
David S. Simon ◽  
Casey A. Fitzpatrick ◽  
Alexander V. Sergienko

2011 ◽  
Vol 09 (06) ◽  
pp. 1437-1448
Author(s):  
YI-BAO LI ◽  
KUI HOU ◽  
SHOU-HUA SHI

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.


2014 ◽  
Vol 64 (1) ◽  
Author(s):  
Krzysztof Kaniowski

AbstractLet P 0 and P 1 be projections in a Hilbert space H. We shall construct a class of optimal measurements for the problem of discrimination between quantum states $$\rho _i = \tfrac{1} {{\dim P_i }}P_i$$, with prior probabilities π 0 and π 1. The probabilities of failure for such measurements will also be derived.


2012 ◽  
Vol 12 (5&6) ◽  
pp. 448-460
Author(s):  
Iordanis Kerenidis ◽  
Stephanie Wehner

Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long distances remains a difficult problem. Here, we consider a large network of nodes with only neighboring quantum links. We exploit properties of this cloud of nodes to enable any two nodes to achieve security even if they are not directly connected. Our results are based on techniques from classical cryptography and do not resort to technologically difficult procedures like entanglement swapping. More precisely, we show that oblivious transfer can be achieved in such a network if and only if there exists a path in the network between the sender and the receiver along which all nodes are honest. Finally, we show that useful notions of security can still be achieved when we relax the assumption of an honest path. For example, we show that we can combine our protocol for oblivious transfer with computational assumptions such that we obtain security if either there exists an honest path, or, as a backup, at least the adversary cannot solve a computational problem.


2019 ◽  
Vol 26 (1) ◽  
pp. 152-158 ◽  
Author(s):  
Ondřej Šipr ◽  
Wilayat Khan ◽  
Yves Joly ◽  
Ján Minár

Ca and S K-edge spectra of CaS are calculated by the full-potential Green's function multiple-scattering method, by the FLAPW method and by the finite-difference method. All three techniques lead to similar spectra. Some differences remain close to the edge, both when comparing different calculations with each other and when comparing the calculations with earlier experimental data. Here it is found that using the full potential does not lead to significant improvement over the atomic spheres approximation and that the effect of the core hole can be limited to the photoabsorbing atom alone. Doping CaS with Eu will not affect the Ca and S K-edge XANES of CaS significantly but may give rise to a pre-edge structure not present for clean CaS.


2020 ◽  
Author(s):  
Robert Fickler ◽  
Markus Hiekkamäki ◽  
Florian Brandt ◽  
Frederic Bouchard ◽  
Shashi Prabhakar ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document