Maximum Success Probability Research Articles

Algorithmic Aspects of Optimal Channel Coding

A central question in information theory is to determine the maximum success probability that can be achieved in sending a fixed number of messages over a noisy channel. This was first studied in the pioneering work of Shannon who established a simple expression characterizing this quantity in the limit of multiple independent uses of the channel. Here we consider the general setting with only one use of the channel. We observe that the maximum success probability can be expressed as the maximum value of a submodular function. Using this connection, we establish the following results: 1. There is a simple greedy polynomial-time algorithm that computes a code achieving a (1-1/e)-approximation of the maximum success probability. Moreover, for this problem it is NP-hard to obtain an approximation ratio strictly better than (1-1/e). 2. Shared quantum entanglement between the sender and the receiver can increase the success probability by a factor of at most 1/(1-1/e). In addition, this factor is tight if one allows an arbitrary non-signaling box between the sender and the receiver. 3. We give tight bounds on the one-shot performance of the meta-converse of Polyanskiy-Poor-Verdu.

Upper and lower bounds on optimal success probability of quantum state discrimination with and without inconclusive results

We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state discrimination problem. We also give a necessary and sufficient condition for the upper bound to achieve the maximum success probability; the proposed lower bound can be obtained from this condition. It is derived that a slightly modified version of the proposed upper bound is tighter than that proposed by Qiu et al. [Phys. Rev. A 81, 042329 (2010)]. Moreover, we propose upper and lower bounds on the maximum success probability with a fixed rate of inconclusive results. The performance of the proposed bounds are evaluated through numerical experiments.

Efficient Entanglement Concentration of Nonlocal Two-Photon Polarization-Time-Bin Hyperentangled States

We present two different hyperentanglement concentration protocols (hyper-ECPs) for two-photon systems in nonlocal polarization-time-bin hyperentangled states with known parameters, including Bell-like and cluster-like states, resorting to the parameter splitting method. They require only one of two parties in quantum communication to operate her photon in the process of entanglement concentration, not two, and they have the maximal success probability. They work with linear optical elements and have good feasibility in experiment, especially in the case that there are a big number of quantum data exchanged as the parties can obtain the information about the parameters of the nonlocal hyperentangled states by sampling a subset of nonlocal hyperentangled two-photon systems and measuring them. As the quantum state of photons in the time-bin degree of freedom suffers from less noise in an optical-fiber channel, these hyper-ECPs may have good applications in practical long-distance quantum communication in the future.

Complementarity between entanglement-assisted and quantum distributed random access code

Collaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of RACs, namely, quantum random access code (QRAC) and the entanglement-assisted random access code (EARAC), have demonstrated equal prowess for a number of tasks. However, there do exist specific cases where one outperforms the other. In this article, we study a family of $3 \rightarrow 1$ distributed RACs \cite{network} and present its general construction of both the QRAC and the EARAC. We demonstrate that, depending on the function of inputs that is sought, if QRAC achieves the maximal success probability then EARAC fails to do so and vice versa.Moreover, a tripartite Bell-type inequality associated with the EARAC variants reveals the genuine multipartite nonlocality exhibited by our protocol. We conclude with an experimental realization of the $3 \rightarrow 1$ distributed QRAC that achieves higher success probabilities than the maximum possible with EARACs for a number of tasks.

Optimal state discrimination with an error margin of pure and mixed symmetric states: irreducible qudit and reducible qubit states

Minimum error discrimination (MED) and Unambiguous discrimination (UD) are two common strategies for quantum state discrimination that can be modified by imposing a finite error margin on the error probability. Error margins 0 and 1 correspond to two common strategies. In this paper, for an arbitrary error margin m, the discrimination problem of equiprobable quantum symmetric states is analytically solved for four distinct cases. A generating set of irreducible and reducible representations of a subgroup of a unitary group are considered, separately, as unitary operators that produce one set of the symmetric states. In the irreducible case, for mixed and pure qudit states, one critical m which divides the parameter space into two domains is obtained. The number of critical values m in the reducible case is two, for both N mixed and pure qubit states. The reason for this difference between numbers of critical values m is explained. The optimal set of measurements and corresponding maximum success probability in fully analytical form are determined for all values of the error margin. The relationship between the amount of error that is imposed on error probability and geometrical situation of states with changes in rank of element corresponding to inconclusive result is determined. The behaviors of elements of measurement are explained geometrically in order to decrease the error probability in each domain. Furthermore, the problem of the discrimination with error margin among elements of two different sets of symmetric quantum states is studied. The number of critical values m is equivalent to one set in both reducible and irreducible cases. In addition, optimal measurements in each domain are obtained.

Caching Policy Toward Maximal Success Probability and Area Spectral Efficiency of Cache-Enabled HetNets

In this paper, we investigate the optimal caching policy respectively maximizing the success probability and area spectral efficiency (ASE) in a cache-enabled heterogeneous network (HetNet) where a tier of multi-antenna macro base stations (MBSs) is overlaid with a tier of helpers with caches. Under the probabilistic caching framework, we resort to stochastic geometry theory to derive the success probability and ASE. After finding the optimal caching policies, we analyze the impact of critical system parameters and compare the ASE with traditional HetNet where the MBS tier is overlaid by a tier of pico BSs (PBSs) with limited-capacity backhaul. Analytical and numerical results show that the optimal caching probability is less skewed among helpers to maximize the success probability when the ratios of MBS-to-helper density, MBS-to-helper transmit power, user-to-helper density, or the rate requirement are small, but is more skewed to maximize the ASE in general. Compared with traditional HetNet, the helper density is much lower than the PBS density to achieve the same target ASE. The helper density can be reduced by increasing cache size. With given total cache size within an area, there exists an optimal helper node density that maximizes the ASE.

Practical entanglement concentration of nonlocal polarization-spatial hyperentangled states with linear optics

We present some different hyperentanglement concentration protocols (hyper-ECPs) for nonlocal N-photon systems in partially polarization-spatial hyperentangled states with known parameters, resorting to linear optical elements only, including those for hyperentangled Greenberger---Horne---Zeilinger-class states and the ones for hyperentangled cluster-class states. Our hyper-ECPs have some interesting features. First, they require only one copy of nonlocal N-photon systems and do not resort to ancillary photons. Second, they work with linear optical elements, neither Bell-state measurement nor two-qubit entangling gates. Third, they have the maximal success probability with only a round of entanglement concentration, not repeating the concentration process some times. Fourth, they resort to some polarizing beam splitters and wave plates, not unbalanced beam splitters, which make them more convenient in experiment.

Optimal quantum state discrimination via nested binary measurements

A method to compute the optimal success probability of discrimination of N arbitrary quantum states is presented, based on the decomposition of any N-outcome measurement into sequences of nested two-outcome ones. In this way the optimization of the measurement operators can be carried out in successive steps, optimizing first the binary measurements at the deepest nesting level and then moving on to those at higher levels. We obtain an analytical expression for the maximum success probability after the first optimization step and examine its form for the specific case of N=3,4 states of a qubit. In this case, at variance with previous proposals, we are able to provide a compact expression for the success probability of any set of states, whose numerical optimization is straightforward; the results thus obtained highlight some lesser-known features of the discrimination problem.

Optimal designs for probability-based optimality, parameter estimation and model discrimination

Abstract In this paper, a new compound optimality criterion will be introduced. This criterion called PDKL-optimality. The proposed criterion aimed to introduce designs satisfy maximum probability of success, efficient parameter estimation and true model. An equivalence theorem is stated and proved for PDKL-optimality criterion.

Cabello’s nonlocality for generalized three-qubit GHZ states

In this paper, we study Cabello’s nonlocality argument (CNA) for three-qubit systems configured in the generalized GHZ state. For this class of states, we show that CNA runs for almost all entangled ones, and that the maximum probability of success of CNA is 14 % (approx.), which is attained for the maximally entangled GHZ state. This maximum probability is slightly higher than that achieved for the standard Hardy’s nonlocality argument (HNA) for three qubits, namely, 12.5 %. In addition, we show that the success probability of both HNA and CNA for three-qubit systems can reach a maximum of $$50~\%$$ in the framework of generalized no-signaling theory.

Experimental generation of a high-fidelity four-photon linear cluster state

Cluster state plays a crucial role in the one-way quantum computation. Here, we propose and experimentally demonstrate a new scheme to prepare an ultrahigh-fidelity four-photon linear cluster state via spontaneous parametric down-conversion process. The state fidelity is measured to be $0.9517\pm0.0027$. Our scheme can be directly extended to more photons to generate N-qubit linear cluster state. Furthermore, our scheme is optimal for generating photonic linear cluster states in the sense of achieving the maximal success probability and having the simplest strategy. The key idea is that the photon pairs are prepared in some special non-maximally entangled states instead of the normal Bell states. To generate a 2N-qubit linear cluster state from N pairs of entangled photons, only (N-1) Hong-Ou-Mandel interferences are needed and a success probability of $(\frac{1}{4})^{N-1}$ is achieved.

Success Probability and Area Spectral Efficiency in Multiuser MIMO HetNets

We derive a general and closed-form result for the success probability in downlink multiple-antenna (MIMO) heterogeneous cellular networks (HetNets), utilizing a novel Toeplitz matrix representation. This main result, which is equivalently the signal-to-interference ratio (SIR) distribution, includes multiuser MIMO, single-user MIMO and per-tier biasing for K different tiers of randomly placed base stations (BSs), assuming zero-forcing precoding and perfect channel state information. The large SIR limit of this result admits a simple closed form that is accurate at moderate SIRs, e.g., above 5 dB. These results reveal that the SIR-invariance property of SISO HetNets does not hold for MIMO HetNets; instead the success probability may decrease as the network density increases. We prove that the maximum success probability is achieved by activating only one tier of BSs, while the maximum area spectral efficiency (ASE) is achieved by activating all the BSs. This reveals a unique tradeoff between the ASE and link reliability in multiuser MIMO HetNets. To achieve the maximum ASE while guaranteeing a certain link reliability, we develop efficient algorithms to find the optimal BS densities. It is shown that as the link reliability requirement increases, more BSs and more tiers should be deactivated.

Heralded high-efficiency quantum repeater with atomic ensembles assisted by faithful single-photon transmission.

Quantum repeater is one of the important building blocks for long distance quantum communication network. The previous quantum repeaters based on atomic ensembles and linear optical elements can only be performed with a maximal success probability of 1/2 during the entanglement creation and entanglement swapping procedures. Meanwhile, the polarization noise during the entanglement distribution process is harmful to the entangled channel created. Here we introduce a general interface between a polarized photon and an atomic ensemble trapped in a single-sided optical cavity, and with which we propose a high-efficiency quantum repeater protocol in which the robust entanglement distribution is accomplished by the stable spatial-temporal entanglement and it can in principle create the deterministic entanglement between neighboring atomic ensembles in a heralded way as a result of cavity quantum electrodynamics. Meanwhile, the simplified parity-check gate makes the entanglement swapping be completed with unity efficiency, other than 1/2 with linear optics. We detail the performance of our protocol with current experimental parameters and show its robustness to the imperfections, i.e., detuning and coupling variation, involved in the reflection process. These good features make it a useful building block in long distance quantum communication.

Maximal entanglement concentration for a set of $$(n+1)$$ ( n + 1 ) -qubit states

We propose two schemes for concentration of $$(n+1)$$(n+1)-qubit entangled states that can be written in the form of $$\left( \alpha |\varphi _{0}\rangle |0\rangle +\beta |\varphi _{1}\rangle |1\rangle \right) _{n+1}$$?|?0?|0?+s|?1?|1?n+1 where $$|\varphi _{0}\rangle $$|?0? and $$|\varphi _{1}\rangle $$|?1? are mutually orthogonal n-qubit states. The importance of this general form is that the entangled states such as Bell, cat, GHZ, GHZ-like, $$|\varOmega \rangle $$|Ω?, $$|Q_{5}\rangle $$|Q5?, 4-qubit cluster states and specific states from the nine SLOCC-nonequivalent families of 4-qubit entangled states can be expressed in this form. The proposed entanglement concentration protocol is based on the local operations and classical communications (LOCC). It is shown that the maximum success probability for ECP using quantum nondemolition technique (QND) is $$2\beta ^{2}$$2s2 for $$(n+1)$$(n+1)-qubit states of the prescribed form. It is shown that the proposed schemes can be implemented optically. Further, it is also noted that the proposed schemes can be implemented using quantum dot and microcavity systems.

Limited preparation contextuality in quantum theory and its relation to the Cirel'son bound

Kochen-Specker (KS) theorem lies at the heart of the foundations of quantum mechanics. It establishes impossibility of explaining predictions of quantum theory by any noncontextual ontological model. Spekkens generalized the notion of KS contextuality in [Phys. Rev. A 71, 052108 (2005)] for arbitrary experimental procedures (preparation, measurement, and transformation procedure). Interestingly, later on it was shown that preparation contextuality powers parity-oblivious multiplexing [Phys. Rev. Lett. 102, 010401 (2009)], a two party information theoretic game. Thus, using resources of a given operational theory, the maximum success probability achievable in such a game suffices as a \emph{bona-fide} measure of preparation contextuality for the underlying theory. In this work we show that preparation contextuality in quantum theory is more restricted compared to a general operational theory known as \emph{box world}. Moreover, we find that this limitation of quantum theory implies the quantitative bound on quantum nonlocality as depicted by the Cirel'son bound.

Efficient entanglement concentration for partially entangled cluster states with weak cross-Kerr nonlinearity

In this paper, we propose an optimal entanglement concentration protocol (ECP) for partially entangled cluster states with the help of the weak cross-Kerr nonlinearity. We can obtain the maximally entangled cluster states assisted with the projection measurements on the additional photons. The protocol is based on optical elements, single polarization photons, cross-Kerr nonlinearity, and the conventional photon detectors, which are feasible with existing experimental technology. Numerical simulation demonstrates that by iterating the entanglement concentration process $$n=m=6$$n=m=6 times, the ECP has the approximate maximal success probability 100 %. Moreover, the present protocol is also suitable for partially entangled $$4N$$4N-photon cluster states concentration. All these advantages make this protocol more efficient and more convenient than others in the applications in quantum communication.

Resource-efficient generation of linear cluster states by linear optics with postselection

We report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon–photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups that are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability for each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that the maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to an m-tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of (1/4)m−1.

Probabilistic cloning of three nonorthogonal states

We study the probabilistic cloning of three nonorthogonal states with equal success probabilities. For simplicity, we assume that the three states belong to a special set. Analytical form of the maximal success probability for $$M\rightarrow N$$M?N probabilistic cloning is calculated. With the maximal success probability, we deduce the explicit form of $$M\rightarrow N$$M?N probabilistic quantum cloning machine. In the case of $$1\rightarrow 2$$1?2 cloning, we get the unambiguous form of the unitary operation. It is demonstrated that the upper bound for probabilistic quantum cloning machine in (Qiu in J Phys A 35:6931, 2002) can be reached only if the three states are equidistant.

Measurement-based quantum computation with an optical two-dimensional Affleck–Kennedy–Lieb–Tasaki state

Measurement-based quantum computation can achieve universal quantum computation via simply performing single-qubit measurements alone on an entangled resource state. Instead of the canonical resource state–cluster state, we pay great attention to another resource state, the Affleck–Kennedy–Lieb–Tasaki (AKLT) state, which is a nondegenerate ground state of a nearest-neighbor two-body interaction Hamiltonian. We propose an optical scheme to generate a two-dimensional AKLT state defined on the honeycomb lattice. In our proposal, three photons from different singlet states are projected onto a spin-32 particle comprising the AKLT state with maximum success probability 38. We also show the controlled-NOT gate can be implemented on this photonic AKLT state via projective measurement using linear optics and photodetection.

Cumulants-Based Toeplitz Matrices Reconstruction Method for 2-D Coherent DOA Estimation

In this paper, a new high-resolution approach called fourth-order cumulants-based Toeplitz matrices reconstruction (FOC-TMR) method, is presented for two-dimensional (2-D) direction-of-arrival (DOA) estimation of incident narrowband coherent signals. The angle estimation problem is addressed by arranging the cumulants elements of received signals from two parallel uniform linear arrays (ULAs) to two Toeplitz matrices. In Gaussian noise cases, it is shown that the ranks of the two Toeplitz matrices equal the number of the incoming waves and are independent of their coherency. Therefore, with eigen decomposition of the Toeplitz-based generalized DOA matrix, the closed-form, automatically paired 2-D angle parameters can be estimated properly from its large eigenvalues and corresponding eigenvectors, respectively. In the condition of two closely spaced coherent signals in both 2-D angles, simulation results show that, in comparison with the fourth-order cumulants-based forward spatial smoothing (FOC-FSS) method, the proposed algorithm has lower computational complexity and yields better estimation performance in terms of maximum probability of success (MPS), maximum root mean square error (MRMSE) of incoming signals in both white noise and color Gaussian noise situations, especially, in low signal-to-noise ratio (SNR) and small number of snapshots conditions.