Tensorization of the strong data processing inequality for quantum chi-square divergences

Sabadini, Walters and others have developed a categorical, machine based theory of concurrency in which there are four essential aspects: a distributive category of data-types; a bicategory Mach whose objects are data types, and whose arrows are input-output machines built from data types; a semantic category (or categories) Sem, suitable to contain the behaviors of machines, and a functor, “behavior”: Mach→Sem. Suitable operations on machines and semantics are found so that the behavior functor preserves these operations. Then, if each machine is decomposable into primitive machines using these operations, the behavior of a general machine is deducible from the behavior of its parts. The theory of non-deterministic finite state automata provides an example of the paradigm and also throws some light on the classical theory of finite state automata. We describe a bicategory whose objects are natural numbers, in which an arrow M: n→p is a finite state automaton with n input states, p output states, and some additional internal states; we require that no transitions begin at output states or end at input states. A machine is represented by an q+n by q+p matrix. The bicategory supports additional operations: non-deterministic choice, parallel interleaving, and feedback. Enough operations are imposed on machines to show that each machine may be obtained from some atomic ones by means of the operations. The semantic category is the (Bloom-Esik) iteration theory Mat (X✶ whose objects are natural numbers and whose arrows from n to p are n×p matrices with entries in the semiring of languages. The behavior functor associates to a machine M: n→p a matrix |M| of languages, one language to each pair of input and output states. Behavior preserves composition, feedback, takes non-deterministic choice to union, and parallel-interleaving to shuffle. Thus, behavior gives a compositional semantics to a primitive notion of concurrent processes.

Controlled teleportation of an arbitrary n-qubit quantum information using quantum secret sharing of classical message

The problem of quantum cloning is closely connected to quantum cryptography. In quantum cryptography, an eavesdropper on the quantum channel can not copy perfectly the sent quantum states, however in many cases the cloning machine is known to be the most powerful eavesdropping strategy against quantum cryptographic protocols. The geometric interpretation of quantum states investigates distances between two different quantum states. In our method we use quantum relative entropy as an informational distance between quantum states. We show a geometrical approach to analyze the security of quantum cryptography, based on quantum relative entropy and Delaunay triangulation on the Bloch sphere. In our security analysis, we use an approximation algorithm from classical computational geometry to determine the smallest enclosing ball of balls using core-sets.

The quantum relative entropy between two states satisfies a monotonicity\nproperty meaning that applying the same quantum channel to both states can\nnever increase their relative entropy. It is known that this inequality is only\ntight when there is a "recovery map" that exactly reverses the effects of the\nquantum channel on both states. In this paper we strengthen this inequality by\nshowing that the difference of relative entropies is bounded below by the\nmeasured relative entropy between the first state and a recovered state from\nits processed version. The recovery map is a convex combination of rotated Petz\nrecovery maps and perfectly reverses the quantum channel on the second state.\nAs a special case we reproduce recent lower bounds on the conditional mutual\ninformation such as the one proved in [Fawzi and Renner, Commun. Math. Phys.,\n2015]. Our proof only relies on elementary properties of pinching maps and the\noperator logarithm.\n

We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a one-shot quantum covering lemma in terms of smooth min-entropies by leveraging decoupling techniques from quantum Shannon theory. This covering result is shown to be equivalent to a coding theorem for rate distortion under a posterior (reverse) channel distortion criterion by two of the present authors. Both one-shot results directly yield corollaries about the i.i.d. asymptotics, in terms of the coherent information of the channel. The power of our quantum covering lemma is demonstrated by two additional applications: first, we formulate a quantum channel resolvability problem, and provide one-shot as well as asymptotic upper and lower bounds. Second, we provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels, in particular separating for the first time the simultaneous identification capacity from the unrestricted one, proving a long-standing conjecture of the last author.

Performance of quantum teleportation is typically measured by the average fidelity, an overlap between the input and output states. Along with the first moment, we introduce the second moment of fidelity in continuous-variable (CV) teleportation, i.e., the fidelity deviation as the figure of merit to assess the protocol's efficiency. We show that CV states, both Gaussian and non-Gaussian, can be better characterized by considering both average fidelity and fidelity deviation, which is not possible with only average fidelity. Moreover, we shed light on the performance of the teleportation protocol in two different input scenarios: One is when input states are sampled from constrained uniform distribution while the other one is Gaussian suppression of the input states which again leads to a different classification of CV states according to their performance. The entire analysis is carried out in noiseless and noisy scenarios with noise being incorporated in the measurement and the shared channels. We also report that one type of noise can make the protocol robust against the other one, which leads to a ``constructive effect,'' and identify the noise models which are responsible for decreasing average fidelity and the increment in fidelity deviation.

Trainable parameterized quantum encoding and application based on enhanced robustness and parallel computing

We have developed an enhanced technique for characterizing quantum optical processes based on probing unknown quantum processes only with coherent states. Our method substantially improves the original proposal (Lobino et al 2008 Science 322 563), which uses a filtered Glauber–Sudarshan decomposition to determine the effect of the process on an arbitrary state. We introduce a new relation between the action of a general quantum process on coherent state inputs and its action on an arbitrary quantum state. This relation eliminates the need to invoke the Glauber–Sudarshan representation for states; hence, it dramatically simplifies the task of process identification and removes a potential source of error. The new relation also enables straightforward extensions of the method to multi-mode and non-trace-preserving processes. We illustrate our formalism with several examples, in which we derive analytic representations of several fundamental quantum optical processes in the Fock basis. In particular, we introduce photon-number cutoff as a reasonable physical resource limitation and address resource versus accuracy trade-off in practical applications. We show that the accuracy of process estimation scales inversely with the square root of photon-number cutoff.

We experimentally demonstrate a controlled-phase gate for continuous variables using a cluster-state resource of four optical modes. The two independent input states of the gate are coupled with the cluster in a teleportation-based fashion. As a result, one of the entanglement links present in the initial cluster state appears in the two unmeasured output modes as the corresponding entangling gate acting on the input states. The genuine quantum character of this gate becomes manifest and is verified through the presence of entanglement at the output for a product two-mode coherent input state. By combining our gate with the recently reported module for single-mode Gaussian operations [R. Ukai et al., Phys. Rev. Lett. 106, 240504 (2011)], it is possible to implement any multimode Gaussian operation as a fully measurement-based one-way quantum computation.

In this work, we investigate the question of which objects can be discriminated by totally “interaction-free” measurements. To this end, we interpret the Elitzur–Vaidman bomb-tester experiment as a quantum channel discrimination problem and generalize the notion of “interaction-free” measurement to arbitrary quantum channels. Our main result is a necessary and sufficient criterion for when it is possible or impossible to discriminate quantum channels in an “interaction-free” manner (i.e., such that the discrimination error probability and the “interaction” probability can be made arbitrarily small). For the case where our condition holds, we devise an explicit protocol with the property that both probabilities approach zero with an increasing number of channel uses, N. More specifically, the “interaction” probability in our protocol decays as frac{1}{N} and we show that this rate is the optimal achievable one. Furthermore, our protocol only needs at most one ancillary qubit and might thus be implementable in near-term experiments. For the case where our condition does not hold, we prove an inequality that quantifies the trade-off between the error probability and the “interaction” probability.

We propose a quantum optical device to experimentally realize quantum processes, which perform the regularization of the---in general highly singular---Glauber-Sudarshan $P$~functions of arbitrary quantum states before their application and/or measurement. This allows us to produce a broad class of nonclassical states with regular $P$~functions, also called nonclassicality quasiprobabilities. For this purpose, the input states are combined on highly transmissive beam splitters with specific Gaussian or non-Gaussian classical states. We study both balanced and unbalanced homodyne detections for the direct sampling of the output states of the implemented processes, which requires no further regularization or state-reconstruction. By numerical simulations we demonstrate the feasibility of our approach and we outline the generalization to multimode light.

The use of the output states generated by the broadcasting of entanglement in quantum teleportation

We discuss the cases where local decoherence selectively degrades one type of entanglement more than other types. A typical case is called state ordering change, in which two input states with different amounts of entanglement undergoes a local decoherence and the state with the larger entanglement results in an output state with less entanglement than the other output state. We are also interested in a special case where the state with the larger entanglement evolves to a separable state while the other output state is still entangled, which we call selective entanglement breaking. For three-level or larger systems, it is easy to find examples of the state ordering change and the selective entanglement breaking, but for two-level systems it is not trivial whether such situations exist. We present a general strategy to construct examples of two-qubit states exhibiting the selective entanglement breaking regardless of entanglement measure. We also give a more striking example of the selective entanglement breaking in which the less entangled input state has only an infinitesimal amount of entanglement.

We undertake experimental detection of the entanglement present in arbitrary three-qubit pure quantum states on an NMR quantum information processor. Measurements of only four observables suffice to experimentally differentiate between the six classes of states which are inequivalent under stochastic local operation and classical communication (SLOCC). The experimental realization is achieved by mapping the desired observables onto Pauli $z$-operators of a single qubit, which is directly amenable to measurement. The detection scheme is applied to known entangled states as well as to states randomly generated using a generic scheme that can construct all possible three-qubit states. The results are substantiated via direct full quantum state tomography as well as via negativity calculations and the comparison suggests that the protocol is indeed successful in detecting tripartite entanglement without requiring any {\it a priori} information about the states.

Perfect teleportation of arbitrary n-qudit states using different quantum channels