Quantum Process Randomness
Sreetama Das, Asutosh Kumar, Aditi Sen De, Ujjwal Sen

TL;DR
This paper explores how minimizing measurement randomness in quantum processes like cloning and teleportation affects their optimization, revealing that maximizing fidelity and minimizing randomness lead to different optimal processes.
Contribution
It introduces a measure of quantum process randomness and analyzes its impact on optimizing quantum cloning and teleportation, highlighting differences from fidelity-based optimization.
Findings
Optimal cloning by maximizing fidelity differs from minimizing randomness.
Minimizing randomness does not necessarily maximize process fidelity.
The proposed randomness measure provides new insights into quantum process optimization.
Abstract
We study the optimization of any quantum process by minimizing the "randomness" in the measurement result at the output of that quantum process. We conceptualize and propose a measure of such randomness and inquire whether an optimization of the quantum process based on that measure, can reach the point where the process operates with maximum fidelity. We consider approximate quantum cloning and teleportation processes, and find, in particular, that the optimal approximate state-dependent quantum cloning machine obtained by maximizing the fidelity is different from that obtained by minimizing the randomness.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Quantum Process Randomness
Sreetama Das1, Asutosh Kumar2, Aditi Sen(De)1, Ujjwal Sen1
1Harish-Chandra Research Institute, HBNI, Chhatnag Road, Jhunsi, Allahabad 211 019, India
2P.G. Department of Physics, Gaya College, Magadh University, Rampur, Gaya 823 001, India
Abstract
We introduce the concept of “randomness” of a quantum process by examining a measurement to estimate the figure of merit of the process. We quantify the randomness by the standard deviation of the probability distribution obtained from the measurement, and inquire whether an optimization of the quantum process based on that measure, can reach the point where the process operates with maximum fidelity. We consider approximate quantum cloning and teleportation processes to illustrate the concept. Interestingly, we find that the optimal approximate state-dependent quantum cloning machine obtained by maximizing the fidelity is different from that obtained by minimizing the randomness.
The distinctive features of quantum mechanics, uncustomary from a classical perspective, have led to path-breaking successes in several spheres, including in quantum information. It has been possible to propose quantum processes and build quantum machines corresponding to several of them, which can perform tasks with enhanced efficiencies, as compared to their classical counterparts. Examples of such quantum processes are quantum key distribution ekert , quantum dense coding gamanush , quantum teleportation bennett , Shor algorithm jati , etc. Any quantum process is inevitably subject to environmental noise, which prohibits it from being executed perfectly. It causes the quantum process to produce outputs which differ from the desired ones. Also, in some scenarios, it may in principle be impossible to achieve a particular task through a quantum process, reasons for which being inherent in the quantum mechanical laws. A prominent example is the impossibility of exact cloning of an arbitrary quantum state as well as that of a non-orthogonal pair of states brisTi-poRe-Tapur-Tup . In these scenarios, we try to optimize the system parameters in the best possible way so that the state obtained at the output of a quantum process remains as close as possible to the actual output targeted. To measure how close the obtained output state is to the desired state, one typically uses a fidelity measure between the two states. We argue that along with the fidelity, which can be seen as an average in a quantum measurement, the spread of the outcomes in the same measurement is also a physically relevant quantity.
In this paper, we provide a formal definition of the spread, terming it as “quantum process randomness”, by using the statistical measure of standard deviation. We determine this quantity in universal and state-dependent approximate quantum cloning and approximate quantum teleportation. In particular, we find that the best quantum cloning machine in the state-dependent case when we maximize the fidelity is different from the one obtained by minimizing the process randomness. Minimizing the ratio of fidelity to the process randomness leads to the same machine that minimizes the process randomness.
Consider a quantum system for which the associated complex Hilbert space is . We define a “protocol” as a rule that assigns a pure quantum state to another pure quantum state . Note that the output belongs to a Hilbert space, , that can be different from that of the input. The considerations can be generalized to allow mixed quantum states as inputs and outputs in the protocol. It is to be remembered that is a function of . Note however that the protocol may not be quantum mechanically allowed, at least not for all pairs of . Let be an allowed quantum mechanical “process” such that
[TABLE]
Again, the output state, , of the process, , is defined on the Hilbert space, , which can be different from , and again it is possible to generalize to the case of a mixed quantum state input to the process. The actual output, , can be different from the desired one, of the protocol .
The quantum process is associated with the protocol in the sense that the former approximates the latter as far as is quantum mechanically allowed. As an example, we can consider the protocol of exact cloning of arbitrary quantum states of a certain -dimensional Hilbert space – known to be quantum mechanically impossible brisTi-poRe-Tapur-Tup – and the associated quantum process of approximate universal quantum cloning jole-bhijte-moja-khub ; bruss . As a further example, we can refer to the protocol of exact teleportation bennett of arbitrary quantum states of by using a state that is not maximally entangled in and a finite amount of classical communication – known to be disallowed in quantum mechanics – and the associated quantum process of approximate universal quantum teleportation through non-maximally entangled states and an additional usage of a finite amount of classical communication shatadru . We now proceed to quantify the extent to which the quantum process can approximate the protocol .
The usual quantification of the success of a process in simulating the protocol for the input is via the “fidelity”,
[TABLE]
As is a measure of how close the obtained state is to the desired one, we call it the “efficiency” or strength of the process for the state . Clearly, . This quantity provides an important piece of information about the success of the process in attaining the task it has been pressed into, viz. producing a state that is as close as possible to . A measurement of the quantity can be performed in the following way, which also gives a possible interpretation for . Suppose that forms the eigenbasis of . If has full rank, spans . Otherwise, can be completed to get a complete orthonormal basis of . Consider the projection-valued measurement on such a complete orthonormal basis of , that is partly or entirely the eigenbasis of , and suppose that the state is fed as an input to that measurement. Let be the eigenvalue of corresponding to the eigenvector . Of course, for . The average , with being the Born probability that clicks in the measurement, is the quantity of our interest, . In the special case when (this is the case in the quantum teleportation “protocol” alluded to above), .
Remaining still with the general case when is not necessarily true, although the quantity contains important information about the experiment, there may still remain further information to be gathered from the distribution . In particular, the spread of the distribution, which can, for example, be quantified by the standard deviation, , given by
[TABLE]
contains a significant fragment of information about the distribution. It can be rewritten as
[TABLE]
with being given in Eq. (2). There are of course higher moments of the probability distribution that could have also been used, to obtain complete information about the process. However, in this paper, we restrict ourselves to the second moment. Note that quantifies a randomness that is inherent in the quantum process even for a given input. It is therefore a randomness of the process for a given input . We refer to it as the quantum process randomness of the process for a given input .
In the special case when , we get
[TABLE]
If further, is a pure state , the standard deviation reduces to
[TABLE]
Thus, vanishes when is either orthogonal or equal (up to a phase) to , and is nonvanishing otherwise. The cases when the output is orthogonal or equal to the input, there is of course no randomness, as only one of the “pointers” clicks for the measurement in the basis .
In general, we may not be in a position to know the input exactly. Let () be the set that encapsulates the information about the input state , i.e., . In such a situation, we will have to consider the average quantum process efficiency,
[TABLE]
and the average quantum process randomness,
[TABLE]
where is a Haar uniform measure on the set , and where is given in Eq. (3). For a given protocol, , the main objective is to maximize and to minimize .
Quantum cloning: Let us now consider a few specific cases in some detail. We begin with the case of quantum cloning. Suppose that we have a two-dimensional quantum system (“qubit”), which in a certain instance is in the state in the Hilbert space . The protocol in this case, is to have two exact copies of the state , and we suppose that we do not have any information about the input state other than that it is a qubit, so that we intend to consider a “universal” approximate cloning machine. So, we start with two qubits, one in the initial state , and the other in the fixed blank state . The protocol is to have , which is quantum mechanically forbidden brisTi-poRe-Tapur-Tup . The Bužek-Hillery (BH) quantum cloning machine jole-bhijte-moja-khub is a quantum process that approximates this protocol. If is an orthonormal basis of the qubit, then the action of the BH machine can be expressed as
[TABLE]
where is the initial state of the cloning device, forms an orthonormal basis of that device, and is a two-qubit state in the joint Hilbert space of the original copy and its intended clone, spanned by . We use this machine to approximately clone an arbitrary qubit-state , where , are any two complex numbers with . Since ideal cloning is prohibited, the reduced state of the clone at the output is not the same as . Let us suppose that the clone is in the state . The machine is “symmetric” in that the output for the original copy is the same density matrix as that for the clone. Then one can use the “local” fidelity to measure the efficiency of the cloning machine. In case of the BH machine, the efficiency is well-known and is given by . This value is independent of (or ), i.e. the efficiency is irrespective of the input state we want to clone; hence it is a universal symmetric “isotropic” approximate quantum cloning machine. Thus, averaging over input states gives the same value of the average efficiency .
Let us now inquire about the quantum process randomness of the BH machine from Eq. (5). We find it to be zero irrespective of the input state, so that the average quantum process randomness also vanishes.
Towards maximizing the efficiency and minimizing the randomness, we can consider the minimized value of the ratio as a figure of merit to decide the performance of a quantum process . However, this cannot be done when either of or becomes zero. In that case, instead of , we can minimize to optimize the performance. In case of the BH machine, it is the latter option that must be used and its value is .
Let us now move on from the “universal” cloning of a qubit, i.e., approximate quantum cloning of an arbitrary qubit state, to the case of state-dependent cloning. In state-dependent cloning, the cloning process is optimized for a given ensemble of states. In particular, we consider an ensemble consisting of two states of a qubit which are, in general, non-orthogonal to each other. For such an ensemble, an “optimal” cloning machine, that maximizes the average quantum process efficiency, was constructed in bruss by Bruß et al. We now try to find whether this machine remains optimal when we minimize the ratio of average randomness to average efficiency. So, let us suppose that and are two pure non-orthogonal states of a qubit, given by
[TABLE]
where the “angle” between and is , . The state of the qubit which we wish to clone is either or , occuring with equal probabilities. The states of the joint system consisting of the original copy and the clone, obtained after cloning of and , are respectively and , given by
[TABLE]
where is the unitary operator performing the cloning operation and is the initial state of the blank qubit (clone), which is then transformed into an approximate clone of the original qubit. The efficiency of this machine is manifested in the fidelity of the cloned states and with respect to the states and respectively. This quantity is the average “global” fidelity of the cloning machine, and is given by bruss
[TABLE]
Let us now derive an analytical expression for the average quantum process randomness associated with such a state-dependent cloning machine. Eq. (Quantum Process Randomness) in this case reads as
[TABLE]
If , , and are the angles between and , and , and and respectively (Fig. 1 (left panel)), then and (see bruss ), by using the unitarity of , assuming that all the vectors before and after cloning, remain in one plane. The angle between and is . Then we have
[TABLE]
while
[TABLE]
It was shown in bruss that the average efficiency in this scenario is maximized when , i.e. when the angle between and is equal to that between and .
It is natural to ask what the average quantum process randomness will be when maximum average efficiency is reached. More importantly, we can ask whether the optimal machine that minimizes , is different from the one that maximizes . We begin by finding the machines that minimize (Eq. (17)) and check whether it coincides with the ones maximizing of (Eq. (16)).
Case @slowromancapi@: and . Setting , we obtain , which in turn implies , . Only is relevant in our case as other values give the same amount of randomness, so that . For the “” sign, we have,
[TABLE]
while for the “” sign,
[TABLE]
The second solution implies that the initial states and are either equal (up to a phase) or orthogonal, so that exact cloning is possible. So, in case and , we are left with Eq. (18). Now, . So, at , reaches a local maximum.
Case @slowromancapii@: and . Again, implies that , which in turn gives , . Again considering the case ,
[TABLE]
For the “”, we have
[TABLE]
while for the “”,
[TABLE]
But and are positive numbers (in radians) and can never have values higher than , and so Eq. (22) is not valid. Hence we have . For , we need . Now, . So, also produces a local maximum.
As we have studied the behavior of over the entire allowed region for , i.e. from [math] to ( being the period of ) by the method of derivatives, and have been able to identify only the maxima of , we can infer that the minima of lies at the boundary points of and/or where is discontinuous. Further analysis reveals that the local minima, which are also the global ones, of are at =[math], =, and at an intermediate point . We plot as a function of for in Fig. 2. We find that in this case, and it is different from the value of at which is maximized. We comment here that when , is exactly though may not be an exact clone of . Focusing back to the point, we therefore see that the best cloning machine is different, depending on whether we maximize the average efficiency or minimize the average quantum process randomness. The points where is minimized are the same where is minimized.
Now we assume that the vectors have a relative positioning as in Fig. 1 (right panel). In this case also, the minima of coincide with the minima of . However, the minimum value of in this case is higher than the minimum value obtained in case of Fig. 1 (left panel). The maximum fidelity obtained in this case also has a lower value than that obtained in the earlier case. So, we conclude that the earlier picture provides us with the optimal quantum cloning machines, irrespective of whether considered with respect to efficiency, or quantum randomness, or their ratio.
Lastly, we note that if in the cloning protocol, we have the information that the input is chosen from a set of mutually orthonormal vectors, exact cloning will become quantum mechanically possible, so that the average efficiency becomes unity, while the average randomness vanishes.
Quantum teleportation: Let us now move on to another specific case, viz. that of quantum teleportation. Suppose that the protocol is to teleport the quantum state from a sender, called Alice, to a receiver, Bob, and that we have no information about the state to be sent, except that it is a qubit. To begin, suppose that the resources available are a single copy of a Bell state, say , shared between the sender and the receiver, and a finite amount of classical communication between them. The celebrated quantum teleportation process bennett achieves this protocol exactly, whereby the efficiency in this case is unity and the randomness is vanishing. The process consists in a measurement in the Bell basis by Alice on the joint Hilbert space formed by her part of the shared state and the state to be teleported, classical communication of the measurement result from Alice to Bob, and a unitary rotation at Bob’s end that depends on the received classical information. The Bell basis is formed of the four orthonormal states , .
Next, let us suppose that among the resources available to perform the teleportation protocol, we replace the Bell state with the Werner state Braunschweig , , between Alice and Bob, where is the identity operator on the two-qubit Hilbert space, and where . Following the same quantum process as when the shared state is , the teleported state , obtained at Bob’s end, is given by
[TABLE]
where is the identity operator on the qubit Hilbert space. Though is different for different , depends only on the noise parameter in the Werner state. Also, is independent of . Hence, for the teleportation process with a shared Werner state, the quantum process randomness vanishes.
Let us now consider the teleportation protocol where the shared state – between Alice and Bob – is the noisy nonmaximally entangled state , where , with . In this case, pursuing the teleportation process, we find that for an input , where and , with and , the output, in the basis, is
\rho_{\varphi}=$$p\begin{bmatrix}|\alpha|^{2}&\alpha\beta^{*}\sin 2\theta\\ \alpha^{*}\beta\sin 2\theta&|\beta|^{2}\end{bmatrix}+\frac{1-p}{2}I_{2}.
Note that we are using the same notation for the output as in Eq. (23). The quantum process efficiency is given by , and the average quantum process efficiency is . The corresponding quantum process randomness is , so that . Thus while there is finite nonzero randomness when the shared state between Alice and Bob is unentangled ( case), the randomness vanishes when the shared state is maximally entangled.
Along with the fidelity for the quantum teleportation process (which we have referred here as the average quantum process efficiency), Ref. fidelity-dev considers an interesting quantity that quantifies the variation of the fidelity as the input moves over the relevant set . The quantum process randomness is at a more “atomic” level, in the sense that it can be present even for a given . Once this quantum process randomness has been considered (for a given ), one is still left with the variation in that randomness as we move over different in . This variation can now be quantified by the average (using e.g. the mean) and the spread (using e.g. the standard deviation).
To summarize, we have argued that the fidelity of a quantum process should be considered along with an associated quantum process randomness. We provided a measure for the proposed characteristic for an arbitrary quantum process. We analyzed the properties of the measure in approximate cloning and teleportation processes. In case of cloning, we found that the approximate quantum state-dependent machine that minimizes the process randomness or minimizes the ratio of process randomness and fidelity is different from the one that maximizes the fidelity.
Acknowledgment: The research of SD was supported in part by the INFOSYS scholarship for senior students.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) C. H. Bennett and G. Brassard, Proceedings of IEEE International Conference on Computers, Systems and Signal Processing 175 (1984); A. K. Ekert, Phys. Rev. Lett. 67 , 661 (1991); C. H. Bennett, Phys. Rev. Lett. 68 , 3121 (1992); D. Bruß, Phys. Rev. Lett. 81 , 3018 (1998).
- 2(2) C. H. Bennett and S. Wiesner, Phys. Rev. Lett. 69 , 2881 (1992).
- 3(3) C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, Phys. Rev. Lett. 70 , 1895 (1993).
- 4(4) P. W. Shor, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov. 20-22, 1994 ; SIAM J. Comput. 26 , 1484 (1997).
- 5(5) E. P. Wigner, The Logic of Personal Knowledge. Essays in Honor of Michael Polanyi (London, 1961, ch. 19), see in Symmetries and Reflections (Indian University Press, Bloomington-London 1970); W. K. Wootters and W. H. Zurek, Nature 299 , 802 (1982); D. Dieks, Phys. Lett. A 92 , 271 (1982); G. C. Ghirardi and T. Weber, Nuovo Cimento 78B , 9 (1983); H. P. Yuen Phys. Lett. A 113, 405 (1986); R. Jozsa, ar Xiv:quant-ph/0204153.
- 6(6) V. Bužek and M. Hillery, Phys. Rev. A 54 , 1844 (1996); N. Gisin and S. Massar, Phys. Rev. Lett. 79 , 2153 (1997); R. F. Werner, Phys. Rev. A 58 , 1827 (1998); M. Keyl and R. F. Werner, J. Math. Phys. 40 , 3283 (1999); V. Scarani, S. Iblisdir, N. Gisin, and A. Acín, Rev. Mod. Phys. 77 , 1225 (2005).
- 7(7) D. Bruß, D. P. Di Vincenzo, A. Ekert, C. A. Fuchs, C. Macchiavello, and J. A. Smolin, Phys. Rev. A 57 , 2368 (1998).
- 8(8) P. Horodecki, M. Horodecki, and R. Horodecki, Phys. Rev. A 60 , 1888 (1999); M. A. Nielsen, Phys. Lett. A 303 , 249 (2002).
