The difficulty in manipulating quantum resources deterministically often necessitates the use of probabilistic protocols, but the characterization of their capabilities and limitations has been lacking. We develop a general approach to this problem by introducing a new resource monotone that obeys a very strong type of monotonicity: it can rule out all transformations, probabilistic or deterministic, between states in any quantum resource theory. This allows us to place fundamental limitations on state transformations and restrict the advantages that probabilistic protocols can provide over deterministic ones, significantly strengthening previous findings and extending recent no-go theorems. We apply our results to obtain a substantial improvement in bounds for the errors and overheads of probabilistic distillation protocols, directly applicable to tasks such as entanglement or magic state distillation, and computable through convex optimization. In broad classes of resources, we strengthen our results to show that the monotone completely governs probabilistic transformations -- its monotonicity provides a necessary and sufficient condition for state convertibility. This endows the monotone with a direct operational interpretation, as it can exactly quantify the highest fidelity achievable in resource distillation tasks by means of any probabilistic manipulation protocol.
We study the ability of a quantum channel to generate quantum coherence when it applies to incoherent states. Based on probabilistic averages, we define a measure of such coherence generating power (CGP) for a generic quantum channel, based on the average coherence generated by the quantum channel acting on a uniform ensemble of incoherent states. Explicit analytical formula of the CGP for any unitary channels are presented in terms of subentropy. An upper bound for CGP of unital quantum channels has been also derived. Detailed examples are investigated.
We determine all $2\times 2$ quantum states that can serve as useful catalysts for a given probabilistic entanglement transformation, in the sense that they can increase the maximal transformation probability. When higher-dimensional catalysts are considered, a sufficient and necessary condition is derived under which a certain probabilistic transformation has useful catalysts.
We are concerned with catalyst-assisted probabilistic entanglement transformations. A necessary and sufficient condition is presented under which there exist partial catalysts that can increase the maximal transforming probability of a given entanglement transformation. We also design an algorithm which leads to an efficient method for finding the most economical partial catalysts with minimal dimension. The mathematical structure of catalyst-assisted probabilistic transformation is carefully investigated.
Resource theories provide a general framework for the characterization of properties of physical systems in quantum mechanics and beyond. Here, we introduce methods for the quantification of resources in general probabilistic theories (GPTs), focusing in particular on the technical issues associated with infinite-dimensional state spaces. We define a universal resource quantifier based on the robustness measure, and show it to admit a direct operational meaning: in any GPT, it quantifies the advantage that a given resource state enables in channel discrimination tasks over all resourceless sta…
By using straightforward frequency arguments we classify transformations of probabilities which can be generated by transition from one preparation procedure (context) to another. There are three classes of transformations corresponding to statistical deviations of different magnitudes: (a) trigonometric; (b) hyperbolic; (c) hyper-trigonometric. It is shown that not only quantum preparation procedures can have trigonometric probabilistic behaviour. We propose generalizations of ${\bf C}$-linear space probabilistic calculus to describe non quantum (trigonometric and hyperbolic) probabilistic tr…
We proposed a general transformation in probabilistic teleportation, which is based on different entanglement matching coefficients $K$ corresponding to different unitary evolution which provides one with more flexible evolution method experimentally. Through analysis based on the Bell basis and generalized Bell basis measurement for two probabilistic teleportation, we suggested a general probability of successful teleportation, which is not only determined by the entanglement degree of transmission channels and measurement methods, but also related to the unitary transformation in the telepor…
The holographic transformation, belief propagation and loop calculus are generalized to problems in generalized probabilistic theories including quantum mechanics. In this work, the partition function of classical factor graph is represented by an inner product of two high-dimensional vectors both of which can be decomposed to tensor products of low-dimensional vectors. On the representation, the holographic transformation is clearly understood by using adjoint linear maps. Furthermore, on the formulation using inner product, the belief propagation is naturally defined from the derivation of t…
A combination of a finite number of linear independent states forms superposition in a way that cannot be conceived classically. Here, using the tools of resource theory of superposition, we give the conditions for a class of superposition state transformations. These conditions strictly depend on the scalar products of the basis states and reduce to the well-known majorization condition for quantum coherence in the limit of orthonormal basis. To further superposition-free transformations of $d$-dimensional systems, we provide superposition-free operators for a deterministic transformation of …
We provide frequency probabilistic analysis of perturbations of physical systems by preparation procedures. We obtained the classification of possible probabilistic transformations connecting input and output probabilities that can appear in physical experiments. We found that so called quantum probabilistic rule is just one of possible rules. Besides the well known trigonometric transformation (for example, for the polarization of light), there exist the hyperbolic transformation of probabilities. In fact, `hyperbolic polarization' have laready been observed in experiments with elementary par…
In this paper we present a simple algorithm for representation of statistical data of any origin by complex probability amplitudes. Numerical simulation with Mathematica-6 is performed. The Bloch's sphere is used for visualization of results of numerical simulation. On the one hand, creation of such a quantum-like (QL) representation and its numerical approval is an important step in clarification of extremely complicated interrelation between classical and quantum randomness. On the other hand, it opens new possibilities for application the mathematical formalism of QM in other domains of sci…
One of the fundamental features of quantum mechanics is the superposition principle, a manifestation of which is embodied in quantum coherence. Coherence of a quantum state is invariably defined with respect to a preferred set of pointer states, and there exist quantum coherence measures with respect to deterministically as well as probabilistically distinguishable sets of quantum state vectors. Here we study the resource theory of quantum coherence with respect to an arbitrary set of quantum state vectors, that may not even be probabilistically distinguishable. Geometrically, a probabilistica…
We demonstrate the quantum probabilistic rule (which differ from classical Bayes' formula by the cosinus factor) can be obtained on purely classical basis as a consequence of the perturbation effect of preparation procedures. In any case the interference can be easily simulated for macrosystems. Moreover, we obtain the classification of all possible transformations of probablities which can arise via perturbation effects. There are two main transformation classes: with trigonometric and hyperbolic ("interference") perturbations of classical Bayes' formula. Quantum probabilistic rule is just a …
We present a general theoretical framework for both deterministic and probabilistic entanglement transformations of bipartite pure states achieved via local operations and classical communication. This framework unifies and greatly simplifies previous works. A necessary condition for ``pure contraction'' transformations is given. Finally, constructive protocols to achieve both probabilistic and deterministic entanglement transformations are presented.
We develop a scheme for generating a universal qubit cluster state using probabilistic Bell measurements without the need for feed-forward or long-time quantum memories. Borrowing ideas from percolation theory we numerically show that using unambiguous Bell measurements that succeed with 75% success probability, one could build a cluster state with an underlying pyrochlore geometry such that the probability of having a spanning cluster in a chosen direction approaches unity in the limit of an infinite lattice size. The initial resources required for the generation of a universal state in our p…
We study a quantum theory based on two assumptions: In the intrinsic frame of reference of an isolated, macroscopic system, (i) the system has no global motion and is not entangled with any other system, (ii) time evolution of statevectors of systems outside the system satisfy Schrödinger equation. A process of collision-type interaction between a microscopic system and a macroscopic system is studied in an auxiliary frame of reference. In transforming the statevector of the two systems obtained in the auxiliary frame of reference to the intrinsic frame of reference of the macroscopic system, …
It is known that if the shared resource is a maximally entangled state then it is possible to teleport an unknown state with unit fidelity and unit probability. However, if the shared resource is a non-maximally entangled state then one has to follow a probabilistic scheme where one can teleport a qubit with unit fidelity and non-unit probability. In this work, we investigate the feasibility of using partially entangled states as a resource for quantum teleportation of a qudit. We also give an expression for the probability of successful teleportation of an unknown qudit.
The remarkable phenomenon of catalyst tells us that adding a catalyst could help state transformation. In this paper, we consider the problem of catalyst-assisted probabilistic coherence distillation for mixed states under strictly incoherent operations. To this end, we first present the necessary and sufficient conditions for distilling a target pure coherent state from an initial mixed state via stochastic strictly incoherent operations and the maximal probability of obtaining the target pure state from the initial state. With the help of these results, we present the necessary and sufficien…
We examine the execution of general U(1) transformations on programmable quantum processors. We show that, with only the minimal assumption of availability of copies of the one-qubit program state, that the apparent advantage of existing schemes proposed by G.Vidal it et al. [Phys. Rev. Lett. 88, 047905 (2002)] and M.Hillery et al. [Phys. Rev. A. 65, 022301 (2003)] to execute a general U(1) transformation with greater probability using complex program states appears not to hold.
The optimal control of unitary transformations is a fundamental problem in quantum control theory and quantum information processing. The feasibility of performing such optimizations is determined by the computational and control resources required, particularly for systems with large Hilbert spaces. Prior work on unitary transformation control indicates that (i) for controllable systems, local extrema in the search landscape for optimal control of quantum gates have null measure, facilitating the convergence of local search algorithms; but (ii) the required time for convergence to optimal con…
Determining whether a given state can be transformed into a target state using free operations is one of the fundamental questions in the study of resources theories. Free operations in resource theories can be enhanced by allowing for a catalyst system that assists the transformation and is returned unchanged, but potentially correlated, with the target state. While this has been an active area of recent research, very little is known about the necessary properties of such catalysts. Here, we prove fundamental limits applicable to a large class of correlated catalytic transformations by showi…
The most basic scenario of quantum control involves the organized manipulation of pure dynamical states of the system by means of unitary transformations. Recently, Vilela Mendes and Mank'o have shown that the conditions for controllability on the state space become less restrictive if unitary control operations may be supplemented by projective measurement. The present work builds on this idea, introducing the additional element of indirect measurement to achieve a kind of remote control. The target system that is to be remotely controlled is first entangled with another identical system, cal…
In this work we show that one cannot use non-local resources for probabilistic signalling even if one can delete a quantum state with the help of probabilistic quantum deletion machine. Here we find that probabilistic quantum deletion machine is not going to help us in identifying two statistical mixture at remote location. Also we derive the bound on deletion probability from no-signalling condition.
We show that non-local resources cannot be used for probabilistic signalling even if one can produce exact clones with the help of a probabilistic quantum cloning machine (PQCM). We show that PQCM cannot help to distinguish two statistical mixtures at a remote location. Thus quantum theory rules out the possibility of sending superluminal signals not only deterministically but also probabilistically. We give a bound on the success probability of producing multiple clones in an entangled system.
We investigate probabilistic transformations of quantum states from a `source' set to a `target' set of states. Such transforms have many applications. They can be used for tasks which include state-dependent cloning or quantum state discrimination, and as interfaces between systems whose information encodings are not related by a unitary transform, such as continuous-variable systems and finite-dimensional systems. In a probabilistic transform, information may be lost or leaked, and we explain the concepts of leak and redundancy. Following this, we show how the analysis of probabilistic trans…
We present a systematic analysis how one can improve performance of probabilistic programmable quantum processors. We generalize a simple Vidal-Masanes-Cirac processor that realizes U(1) rotations on a qubit with the phase of the rotation encoded in a state of the program register. We show how the probability of success of the probabilistic processor can be enhanced by using the processor in loops. In addition we show that the same strategy can be utilized for a probabilistic implementation of non-unitary transformations on qubits. In addtion, we show that an arbitrary SU(2) transformations of…
We present a scheme of probabilistic dense coding via a quantum channel of non-maximally entangled three-particle state. The quantum dense coding will be succeeded with a certain probability if the sender introduces an auxiliary particle and performs a collective unitary transformation. Furthermore, the average information transmitted in this scheme is calculated.
A general framework of quantum state amplification using the language of quantum state transformation is given systematically for the first time. The concept of amplification of quantum states is defined specifically and the amplification of a set of quantum states is formulated generally as the transformation of quantum states. Three different kinds of important quantum amplifications, i.e., deterministic noisy quantum amplification, probabilistic noiseless quantum amplification, and deterministic noiseless quantum amplification are identified and discussed. For deterministic quan- tum amplif…
Quantum coherence, emerging from the 'superposition' of quantum states, is widely used in various information processing tasks. Recently, the resource theory of multilevel quantum coherence is attracting substantial attention. In this paper, we mainly study the deterministic transformations of resource pure states via free operations in the theoretical framework for multilevel coherence. We prove that any two multilevel coherent resource pure states can be interconverted with a nonzero probability via a completely positive and trace non-increasing $k$-coherence-preserving map. Meanwhile, we pr…
Improving the probabilistic quantum teleportation efficiency of arbitrary superposed coherent state using multipartite even and odd j-spin coherent states as resource
In a large-scale quantum computer, the cost of communications will dominate the performance and resource requirements, place many severe demands on the technology, and constrain the architecture. Unfortunately, fault-tolerant computers based entirely on photons with probabilistic gates, though equipped with "built-in" communication, have very large resource overheads; likewise, computers with reliable probabilistic gates between photons or quantum memories may lack sufficient communication resources in the presence of realistic optical losses. Here, we consider a compromise architecture, in wh…
Based on ideas of quantum theory of open systems we propose the consistent approach to the formulation of logic of plausible propositions. To this end we associate with every plausible proposition diagonal matrix of its likelihood and examine it as density matrix of relevant quantum system. We are showing that all logical connectives between plausible propositions can be represented as special positive valued transformations of these matrices. We demonstrate also the above transformations can be realized in relevant composite quantum systems by quantum engineering methods. The approach propose…
Uniqueness of imaginarity-assisted exact transformation from real orthogonal operations to arbitrary unitary operations
NTT Communication Science Laboratories, NTT Inc.（NTT通信科学实验室）；Mitsubishi Electric Corporation（三菱电机株式会社）；NTT Research Center for Theoretical Quantum Information, NTT Inc.（NTT理论量子信息研究中心）
We construct the protocols to achieve probabilistic and deterministic entanglement transformations for bipartite pure states by means of local operations and classical communication. A new condition on pure contraction transformations is provided.
We study the probabilistic (conditional) teleportation protocol when the entanglement needed to its implementation is given by thermal entanglement, i.e., when the entangled resource connecting Alice and Bob is an entangled mixed state described by the canonical ensemble density matrix. Specifically, the entangled resource we employ here is given by two interacting spin-1/2 systems (two qubits) in equilibrium with a thermal reservoir at temperature T. The interaction between the qubits is described by a Heisenberg-like Hamiltonian, encompassing the Ising, the XX, the XY, the XXX, and XXZ model…
A class of fermionic quantum field theories with interactions is shown to be equivalent to probabilistic cellular automata, namely cellular automata with a probability distribution for the initial states. Probabilistic cellular automata on a one-dimensional lattice are equivalent to two - dimensional quantum field theories for fermions. They can be viewed as generalized Ising models on a square lattice and therefore as classical statistical systems. As quantum field theories they are quantum systems. Thus quantum mechanics emerges from classical statistics. As an explicit example for an intera…
One-time programs, computer programs which self-destruct after being run only once, are a powerful building block in cryptography and would allow for new forms of secure software distribution. However, ideal one-time programs have been proved to be unachievable using either classical or quantum resources. Here we relax the definition of one-time programs to allow some probability of error in the output and show that quantum mechanics offers security advantages over purely classical resources. We introduce a scheme for encoding probabilistic one-time programs as quantum states with prescribed m…
Quantum resource manipulation may include an ancillary state called a catalyst, which aids the transformation while restoring its original form at the end, and characterizing the enhancement enabled by catalysts is essential to reveal the ultimate manipulability of the precious resource quantity of interest. Here, we show that allowing correlation among multiple catalysts can offer arbitrary power in the manipulation of quantum coherence. We prove that any state transformation can be accomplished with an arbitrarily small error by covariant operations with catalysts that may create a correlati…
