Multiple-copy state discrimination of noisy qubits
Kieran Flatt Stephen M. Barnett Sarah Croke



k.flatt.1@research.gla.ac.uk


School of Physics and Astronomy, University of Glasgow, Glasgow, G12 8QQ, UK


Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, non-orthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability of successful discrimination allowed by quantum theory. For mixed states, it is known that only collective schemes can perform optimally, so it might be expected that these schemes are more resilient to preparation noise. We calculate the probability of success for two schemes, one local and one collective, in the regime of imperfect preparation fidelity. We find two surprising results. Firstly, both schemes converge upon the same many-copy limit, which is less than unity. Secondly, the local scheme performs better in all cases. This highlights the point that one should take into account noise when designing state discrimination schemes.


Multiple-copy state discrimination of noisy qubits
    Sarah Croke
    Received: date / Accepted: date
==================================================





§ INTRODUCTION


In many quantum information processing tasks, one needs to identify, by measurement, the state of a system given that the finite and discrete set of states from which it is taken is known. This task is called state discrimination <cit.>. Unless the set of possible states is an orthogonal basis for some space they cannot be perfectly discriminated and instead the user usually seeks to minimise one of two figures of merit, either the probability of incorrectly identifying or failing to identify the state. The measurement which minimises the former of these is the Helstrom, or minimum-error, measurement <cit.>. If there are two possible states, the optimal measurement has a simple analytic form. In more complex cases, such as three-or-more pure states <cit.> or mixed states <cit.>, only limited results are known. 
Our above comments relate to single-copy state discrimination. Given a resource of multiple systems, all prepared in the same state, it might be expected that the correlations can be used to improve the probability of success. This intuition is correct and the Helstrom bound, the optimal value of this probability, is known for discriminating two states. However, in this case a physical implementation of the measurement is typically hard to find. Furthermore, the issue of locality versus collectivity arises: can the bound be achieved with local measurements, those on individual systems, only or must the discriminator use collective measurements, which are more difficult to perform? It is known that the best measurement to discriminate multi-partite states is often a collective measurement, even for product states. Famous examples of this are the double trine ensemble <cit.> and the domino states <cit.>.
For two-pure-state discrimination, it is known that a local scheme can reach the Helstrom bound <cit.>. In other scenarios, very few analytic results have been acquired and most knowledge comes from numerical simulations <cit.>. Here, some counterintuitive results emerge. One example is that the distinction between local and global optimality emerges. In some cases, among local schemes, the best overall measurement involves a fixed measurement on each qubit, which succeeds locally with a suboptimal probability <cit.>. For a small number of copies, adaptive schemes perform better than fixed schemes <cit.>, but in the limit of large numbers of copies, this advantage disappears, even for mixed states <cit.>. Further, it is for almost pure, but strictly speaking mixed, states that the gap in performance between collective stratgies and local strategies is most pronounced in the many-copy limit. Such unexpected results signal the need for further analytical work in this area. 


The work presented in this paper investigates a separate, but related question. How resilient are multiple-copy state discrimination schemes to preparation noise? No real preparation is ever perfect, but for high enough fidelity we may consider the states to be pure. Further, decoherence properties of even state-of-the-art qubits can demonstrate significant variability (for a recent example see for examples Refs. <cit.>), resulting in a corresponding variability in the rate at which a preparation characterised as very high fidelity degrades over time. Finally, in a real-world physical communications system, instabilities in noise properties of a channel can lead to uncharacterised noise in the received states. How sensitive are schemes designed for pure states to a small amount of uncharacterized preparation noise? As the truly optimal scheme for noisy qubits will be collective, it might be expected that such schemes will be more resilient to preparation noise than the equivalent local scheme. Our approach is to compare two equivalent schemes, one local <cit.> and one collective <cit.>, both of which reach the Helstrom bound for discriminating two pure states. We apply each scheme, optimised for a specific pair of pure states, to the corresponding mixed states and relate the probability of success to the preparation fidelity. Our results show that, surprisingly, the local scheme consistently performs better than the collective scheme. Neither, however, approaches unit success probability as the number of copies, N, grows. Rather, they approach the same fixed bound. We discuss how to use information which would otherwise be thrown away in the local adaptive scheme to improve on this bound. This recovers asymptotic behaviour which, as the number of qubits approaches infinity, tends towards perfect discrimination.



§ PRELIMINARIES

Two pure states of a qubit occupy a single great circle on the Bloch sphere. For this reason, they can be characterised in relation to each other by real numbers only and written in the form

    |ψ_k⟩ = cos( θ) |0⟩ + (-1)^k sin( θ) |1⟩     k=0,1.

The overlap of these two states is ⟨ψ_0|ψ_1⟩ = cos(2 θ) and, without loss of generality, 0 ≤θ≤π/4. If a single system is prepared in either of these states with probabilities p_k, the highest possible probability of successful discrimination is given by the Helstrom bound,

    P^H_1 = 1/2( 1 + √( 1 - 4 p_0 p_1 cos^2 ( 2 θ) )).

If θ = π/4 the two states are orthogonal. In such a case, P^H_1 = 1 and they can be perfectly discriminated. Otherwise, this quantity is less than one. The measurement which achieves this bound is a projective measurement onto the eigenvectors of p_0 |ψ_0⟩⟨ψ_0| - p_1 |ψ_1⟩⟨ψ_1|. 
If instead there is a resource of N copies of the state, we are seeking to distinguish |ψ_0⟩^⊗ N from |ψ_1⟩^⊗ N. As these can be considered as two single pure states on the total Hilbert space, the multiple-copy Helstrom bound is

    P^H_N = 1/2(1 + √(1 - 4p_0 p_1 cos^2N(2θ) )).

In this case, the measurement which achieves this is again a von Neumann measurement, one that projects onto the eigenstates of p_0 |ψ_0⟩⟨ψ_0| ^ ⊗ N - p_1 |ψ_1⟩⟨ψ_1|^⊗ N. To find these we must find the eigenvalues of a 2^N dimensional matrix, a task which is much simplified by the permutation symmetry in the many copy case. For pure states in particular, there are just two-dimensions that are important, and a number of optimal schemes are known, of which we consider two.
In this article we are concerned with systems in which the resource qubits are prepared imperfectly. This is represented by a parameter δθ_i which characterises the displacement of the ith qubit's state from the ideal case such that

    |ψ̃^i_k⟩   = cos( θ + δθ_i) |0⟩ + (-1)^k sin( θ + δθ_i) |1⟩
       = cos(δθ_i) |ψ_k⟩ - sin( δθ_i) |ψ_k ⊥⟩.

In the second line we have related the noisy form of the state to the ideal case, Eq. <ref> and introduce |ψ_k ⊥⟩ to indicate the state orthogonal to |ψ_k⟩. The fidelity F is the standard way to parameterise the noise on a system. It can be understood operationally as the probability that a measurement of the prepared state will identify it as the ideal state <cit.>. For pure states, it is defined as the overlap of the prepared and ideal states, averaged over the noise's probability distribution which we assume is symmetric, i.e., P( δθ_i) =  P( - δθ_i). One can consider this a Gaussian distribution however that level of detail is not required in what follows. The two noise parameters are then related by

    ⟨cos^2 ( δθ_i ) ⟩ = ∫ | ⟨ψ̃^i_k|ψ_k⟩ |^2  P(δθ_i) = F ,

where 1/2 ≤ F ≤ 1. From this we also have

    ⟨sin^2 (δθ_i) ⟩   = 1-F 
    ⟨cos(2 δθ_i) ⟩   = 2F-1 
    ⟨sin(2 δθ_i ) ⟩   = 0.

The first two of these follows from the definition of the fidelity while the third uses the symmetry of the probability distribution. These are the only functions which are averaged in what follows. We assume that the noise on each qubit is independent of the others and average at each stage.
Using these results we express the noisy form of the state, Eq. <ref>, as a mixed state. We obtain

    ρ_k = F |ψ_k⟩⟨ψ_k| + (1-F) |ψ_k ⊥⟩⟨ψ_k ⊥|,

where we have averaged over the probabilty distribution of δθ_i. If F=1 it is the relevant pure state. If instead F=1/2, which is the smallest possible value of the fidelity, it is a maximally mixed state, so that maximum noise erases all information about the state. For other values of F, the state varies monotically between these two points. Our interest throughout this paper will be in systems which are close to perfect fidelity.



§ LOCAL-ADAPTIVE MEASUREMENT

An important result in multiple-copy state discrimination is that it is possible to reach the Helstrom bound, Eq. <ref>, using local measurements only. We follow here the scheme of Acín et al <cit.> but similar results have been found by others <cit.>. They examine a local and adaptive scheme in which the measurement of the nth copy can depend upon the outcome of measurements on the previous (n-1) copies. We first need to introduce some notation. The sequence of measurement outcomes is represented by a bit string x as long as the number N of qubits, with the nth result labelled i_n. The measurement onto the nth qubit is a projector onto the basis

    |ω^n_0⟩   = cos( ϕ_x) |0⟩ + sin( ϕ_x) |1⟩
    |ω^n_1⟩   = sin( ϕ_x ) |0⟩ - cos( ϕ_x) |1⟩.

Here, we use x for the bit string of the first (n-1) results and adopt a different notation when it is required. In the local-adaptive measurement scheme, the measurement at each point depends on the previous outcomes in the scheme however the overall result is determined by the final measurement outcome alone. The optimal scheme of this kind turns out to be Bayesian updating <cit.>. On the first qubit, one projects onto the eigenvectors of p_0 |ψ_0⟩⟨ψ_0| - p_1 |ψ_1⟩⟨ψ_1|. On the rest, the relevant eigenbasis is instead P(0 |x) |ψ_0⟩⟨ψ_0| -  P(1|x) |ψ_1⟩⟨ψ_1|, in which P(k|x) is the probability, calculated from Bayes' theorem, that the state |ψ_k⟩ was prepared given that bit string x is the measurement record. The ϕ_x for which this measurement satisifies the Helstrom bound is found to be 

    cos( 2 ϕ_x ) = (-1)^i_N-1√( 1 - 4 p_0 p_1 cos^2N-2(2 θ) /1- 4 p_0 p_1 cos^2N(2 θ) ).

The only appearance of the bit string x here is in the single index i_N-1, which is the value of the prior measurement. Thus the scheme does not use the entire measurement and is in this sense Markovian as well as Bayesian.
Here we apply the local-adaptive scheme, in the form optimised for pure states, to the mixed states relevant to imperfect preparation. A true Bayesian scheme, one that uses the entire measurement record, would be the best way to generalise the scheme to mixed states. We return to this point later. For now, we are interested in a direct comparison of the pure state schemes and so proceed with the Markovian form.
We begin by showing that this scheme reaches the Helstrom bound in the case of perfect preparation. We use a different approach to that in Ref. <cit.> as it does not generalise straightforwardly to include noise. This calculation gives a form for the success probability with N qubits in terms of that for (N-1) qubits, an inductive formula which is solved by the Helstrom bound. We then modify the calculation to include noise. This leads to a different inductive formula, which is then solved to give the overall success probability. In thse calculations, we make repeated use of the result

    P(i_N | x, k ) = 1/2[ 1 .    + (-1)^i_Ncos(2θ) cos(2 ϕ_x) 
       . + (-1)^i_N + ksin(2θ) sin(2 ϕ_x) ]

for the probability that the Nth outcome is i_N given that the state |ψ_k⟩ was sent and that the initial (N-1) results were x. This is calculated using Eqs. <ref> and <ref>. 
In the local-adaptive scheme, the identification of the prepared state is made with the final outcome. For this reason, the probability of success is

    P^ad_N = ∑_x, k p_k  P( k | x, k )  P( x | k ) .

This is a sum over both signal states k=0,1 and over all bit strings x of length (N-1), none of which contribute directly to the state identification. We first substitute Eq. <ref>, with i_N = k, into this result to give

    P^ad_N = 1/2[ 1 .    +  ∑_x,k(  sin(2θ) sin(2ϕ_x)  p_k  P(x|k) .   
       . . +  cos(2θ) cos(2 ϕ_x ) (-1)^i_N-1+k p_k  P( x | k) ) ].

Then next step is to use Eq. <ref> for the optimal value of 2 ϕ_x in this equation:

    P^ad_N = 1/2[ 1+  sin^2 (2 θ) /√(1-cos^2N(2 θ))∑_x,k p_k  P(x|k)  . 
       + . cos^2 ( 2 θ) √(1 -cos^2N-2(2 θ)/1 - cos^2N(2θ))∑_x,k (-1)^i_N-1+k p_k  P( x | k) ].

The first sum in this expression is straightforward to evalulate. It is simply a sum over a complete set of possible scenarios and we have ∑_x,k p_k  P(x | k) = 1. The other series is a little more complicated. We use the usual rules of conditional probability to write

    P(x | k) =  P( i_N-1ẋ | k ) =  P( i_N-1 | ẋ, k)  P(ẋ | k),

where we introduce the notation ẋ for the bit string of the first (N-2) results. We use also Eq. <ref>, with x replaced by ẋ and i_N replaced by i_N-1, for the probabilities P( i_N-1 | ẋ, k) in this equation. Bringing together all of these results, a short calculation reveals

    ∑_x,k (-1)^i_N-1 + k  p_k  P(x | k ) 
       =  ∑_ẋ,k( sin(2θ) sin(2ϕ_ẋ)  p_k  P(ẋ|k)  . 
       . +  cos(2θ) cos(2 ϕ_ẋ ) (-1)^i_N-2+k p_k  P( ẋ | k) ).

This should be compared with Eq. <ref>, in which the same expression occurs but over the final rather than penultimate outcome. This can be used to write the expression as

    ∑_x,k (-1)^i_N-1 + k  p_k  P(x | k ) = 2 P^ad_N-1 -1.

After subsituting this into Eq. <ref>, we are left with the inductive expression 

    P^ad_N = 1/2[  1 .    + sin^2 (2 θ)/√(1 - cos^2N(2 θ))
       . + cos^2 (2 θ) √(1 - cos^2N-2(2 θ) /1 - cos^2N(2 θ)) (2  P^ad_N-1 - 1) ].

The general solution to this equation is the multiple-copy Helstrom bound, Eq. <ref>, which can be verified by direct substitution. The N=1 case corresponds to single-copy state discrimination and that bound is derived in the usual manner. That the probability expression has this inductive form follows as the measurement strategy is Markovian. We have followed others in showing that the Helstrom bound can be reached with local measurements only <cit.>. Our main result in this section is a generalisation of this expression to the regime of imperfect preparation fidelity. 
The calculation proceeds in the same manner as that without noise. The difference is in the probability of a specific result i_N given that the state |ψ_k⟩ was prepared, which changes when the latter is replaced with a noisy state. To take this into account, Eq. <ref> is replaced by an equivalent expression calculated using Eqs. <ref> and <ref>. The new probability is 

    P(i_N | x, k )  
       = 1/2[ 1 + (2F - 1) (-1)^i_Ncos(2 θ) cos(2 ϕ_x) . 
       .  +(2F-1) (-1)^i_N + ksin(2 θ) sin(2 ϕ_x)  ]

so that the only change in the noisy case is the appearance of the factor (2F-1) here. We use this to derive, in exactly the same manner as in the perfect-fidelity case, the probability of success. The result of this, as might be expected based on the change to the individual probabilities, is simply

    P^ad_N   = 1/2[ 1 + (2F-1) sin^2 (2 θ)/√(1 - cos^2N(2 θ)). 
       .+ (2F-1) cos^2 (2 θ) √(1 - cos^2N-2(2 θ) /1 - cos^2N(2 θ)) ( 2  P^ad_N-1 - 1) ].

This relation is hardly more complicated than the noisless case, Eq. <ref>, but its solution is much more complicated. By recursive application of this formula using the N=1 case, which can be evaluated analytically, we establish that the solution is

    P^ad_N = 1/2(  1 .     + (2F-1)^N √(1-cos^2N(2 θ) )
       . + sin^2(2 θ) /√(1 - cos^2N(2 θ) )𝒮_N ),

where we introduce the notation

    𝒮_N = ∑^N_i=1 (2F-1)^N+1-i (1 - (2F-1)^i-1 ) cos^2N-2i(2 θ).

This solution can be verified by substitution into the inductive relationship. The series 𝒮_N can be evaluated using the usual formulae for geometric progressions. After some algebraic manipulation we find

    𝒮_N =    (2F-1)  1 - (2F-1)^N cos^2N(2θ) /1 - (2F-1)cos^2 ( 2θ) 
       - (2F-1)^N 1 - cos^2N(2 θ)/1 -cos^2 (2 θ).

Between Eqs. <ref> and <ref>, the probability that the local-adpative scheme successfully identifies the state is defined in terms of the preparation fidelity F. In the perfect-fidelity case F=1, substitution shows that 𝒮_N = 0, and we have that the usual Helstrom bound is achieved. If instead F=1/2, the prepared state is by definition a completely mixed state for both |ψ_0⟩ and |ψ_1⟩, so that the states are indistinguishable. For this value of the fidelity, the probability becomes one-half which corresponds to guessing. The other interesting limit is the behaviour of the scheme if there are many copies of the state. We look at this in a later section where we also plot the success probability. 



§ QUANTUM DATA GATHERING

The previous measurement scheme is purely local. It produces a classical bit value for each of the resource qubits. It is known that schemes of this type are in general not able to perform optimal state discrimination when the possible states are mixed. One requires collective measurements. Here, we are interested in the ability of these schemes to function in the presence of preparation noise. As an example of one scheme which measures collectively, we consider quantum data gathering <cit.>.
This scheme requires a quantum memory, a qubit which does not decohere between interactions. This probe is initialised in the state |0⟩. When required, we label this space ℋ_A. The interaction with the first qubit is a SWAP gate. The remaining interactions leave the resource qubits, labelled S_i (where i = 1,2,...,N), each in the state |0⟩ and, if there is no preparation noise, leave the probe in one of two states

    |ψ^(n)_k⟩ = cos(θ_n) |0⟩ + (-1)^k sin(θ_n) |1⟩,     k=0,1

in which

    cos(θ_n) = √(1/2( 1 + cos^n(2 θ) ) ) .

These two states have an overlap ⟨ψ^(n)_0|ψ^(n)_1⟩ = cos^n (2 θ), where n is the number of qubits which the probe has interacted with until that point in the scheme. Thus, the probability of success is the Helstrom bound. The protocol works as the product state of the N systems exists in a two-dimensional subspace of the overall Hilbert space. This, of course, no longer holds for mixed states, for which some information about the states will be retained in the resource qubits. The interactions between the probe and resource qubits is a unitary operation which maps this subspace onto the two dimensions of the probe's space through the index k, which is the only piece of information needed to characterise each state. The unitary operator U_n that performs such an operation has the property U_n |ψ_k⟩_S_n|ψ^(n-1)_k⟩_A = |0⟩_S_n|ψ^(n)_k⟩_A. Alone, this does not span the Hilbert space and we need to include also the state's components which appear only if the preparation is imperfect. The choice we make is U_n |ψ_k ⊥⟩_S_n|ψ^(n-1)_k ⊥⟩_A = |1⟩_S_n|ψ^(n)_k ⊥⟩. The unitary operator, written in the computational basis for both qubits, is

    U_n |0_S_n 0_A⟩   = cos(θ) cos(θ_n-1)/cos(θ_n)|0_S_n 0_A⟩
        + sin(θ) sin(θ_n-1)/cos(θ_n)|1_S_n 0_A⟩
    
    U_n |1_S_n 1_A⟩   = sin(θ) sin(θ_n-1)/cos(θ_n)|0_S_n 0_A⟩
       - cos(θ) cos(θ_n-1)/cos(θ_n)|1_S_n 0_A⟩
    
    U_n |1_S_n 0_A⟩   = sin(θ) cos(θ_n-1)/sin ( θ_n)|0_S_n 1_A⟩
       + cos(θ) sin(θ_n-1)/sin(θ_n)|1_S_n 1_A⟩
    
    U_n | 0 _S_n 1_A⟩   = cos(θ) sin( θ_n-1)/sin(θ_n)|0_S_n 1_A⟩
       - sin(θ) cos(θ_n-1)/sin(θ_n)|1_S_n 0_A⟩.

After all resource qubits have been processed, the qubit is measured with a Helstrom measurement which corresponds to distinguishing |ψ^(N)_0⟩ from |ψ^(N)_1⟩. Again, the quantity we calculate is the probability that this measurement is successful if the prepared qubits are instead mixed states. 
The strategy that we use to calculate this probability is to find, by representing the interactions as Kraus operators acting on ℋ_A, the probe's state at each stage of the protocol. These Kraus operators are derived by considering that the resource qubits are subsequently measured in the computational basis though we sum over both outcomes. This strategy gives us the possibility of considering that such a measurement, which could be used as a diagnostic for the protocol's behaviour, does occur. The Kraus operators are calculated as M^(n)_i,k = ⟨i|_S_n U_n |ψ̃^n_k⟩_S_n, where i=0,1 and we use the noisy form of the state. As the calculation involves pairs of Kraus operators, at this point we do not average over the noise. The Kraus operators are best expressed in the form

    M^(n)_0,k|ψ^(n-1)_k⟩   = cos( δθ_n) |ψ^(n)_k⟩
    
    M^(n)_0,k|ψ^(n-1)_k ⊥⟩   = -sin(2 θ) sin( δθ_n) cos(2 θ_n-1)/sin(2 θ_n)|ψ^(n)_k⟩
       + cos(2 θ + δθ_n) sin(2 θ_n-1)/sin(2 θ_n)|ψ^(n)_k ⊥⟩
    
    M^(n)_1,k|ψ^(n-1)_k⟩   = sin( 2 θ + δθ_n) |ψ^(n)_k ⊥⟩
    
    M^(n)_1,k|ψ^(n-1)_k ⊥⟩   = - sin( δθ_n) sin( 2 θ_n-1) /sin(2 θ_n)|ψ^(n)_k⟩
       + sin( δθ_n) cos( 2 θ_n-1) - sin( 2 θ + δθ_n) cos( 2 θ_n)/sin(2 θ_n)|ψ^(n)_k ⊥⟩.

One way to think about these is objects is that the outcome M^(n)_0,k indicates that the protocol is running well and conversely for M^(n)_1,k. This is because the former is the only outcome if the fidelity is perfect. This is seen in the Kraus representation as the action of M^(n)_0,k is to map the state |ψ^(n-1)_k⟩ onto |ψ^(n)_k⟩, thus preserving the information which is encoded in that basis, whereas the operator M^(n)_1,k has the opposite effect: by mapping the state |ψ^(n-1)_k⟩ onto |ψ^(n)_k⊥⟩ it deletes all the information which has been acquired up to that point. This is the origin of the claim that a subsequent measurement of the prepared qubit can act as a diagnostic. This point is later considered in more detail. 
We are now in a position to calculate the density matrix of the probe after N interactions. We assume that all noise is in the state preparation and that the operations are implemented perfectly. At the first step, the sample is swapped with the probe, so that the probe is left in the state

    ρ_1 = F |ψ_k⟩⟨ψ_k| + (1-F) |ψ_k ⊥⟩⟨ψ_k ⊥|,

as was shown earlier (to simplify the notation, we drop the index k from the density operator ρ). We evaluate the next step in full detail and the result allows us to find, by inspection, the form of the density matrix in general. We multiply by the Kraus operators and then average over δθ_i in one step here. It is a straightforward (though longwinded) calculation to find

    ρ_2    = M^(2)_0,kρ_1 M^(2) †_0,k + M^(2)_1,kρ_1 M^(2) †_1,k
       = ( F - (1-F)(2F-1) cos^2(2 θ) ) |ψ^(2)_k⟩⟨ψ^(2)_k|
       +  (1 - F + (1-F)(2F-1) cos^2 (2 θ) ) |ψ^(2)_k ⊥⟩⟨ψ^(2)_k ⊥|
        + (1-F) cos^2(2 θ) sin^2(2 θ)/sin^2 (2 θ_2)σ^(2)_x,

where σ^(2)_x = |ψ^(2)_k⟩⟨ψ^(2)_k ⊥| +  |ψ^(2)_k ⊥⟩⟨ψ^(2)_k|. We keep the convention of using a superscript on the Pauli matrix to indicate the basis in which it is written. This density matrix can be understood as two pieces: a trace-one, diagonal piece consisting of the first two terms and another consiting of only the σ_x matrix. We can expect, based on this, that the same is true of the general density matrix, which we expect can be written

    ρ_N   = A_N |ψ^(N)_k⟩⟨ψ^(N)_k| + (1- A_N) |ψ^(N)_k ⊥⟩⟨ψ^(N)_k ⊥|
       + B_N σ^(N)_x .

This is confirmed by the following analysis, in which we evaluate A_N and B_N by calculating how each piece (diagonal and Pauli) is updated. We again multiply by the Kraus operators and average over δθ_i in a single step. The first result is

    A_N-1∑_i M^(n)_i,k|ψ^(N-1)_k⟩⟨ψ^(N-1)_k| M^(n) †_i,k
       +  (1 - A_N-1)∑_i M^(n)_i,k|ψ^(N-1)_k ⊥⟩⟨ψ^(N-1)_k ⊥| M^(n) †_i,k
       = ( F - (1-A_N-1) (2F-1)cos^2 (2 θ) ) |ψ^(N)_k⟩⟨ψ^(N)_k|
       + ( 1 - F +(1 - A_N-1) (2F-1) cos^2 ( 2 θ) ) |ψ^(N)_k ⊥⟩⟨ψ^(N)_k ⊥|
        - (1 - A_N-1)  (2F-1) sin^2(2 θ) cos(2 θ_N)/sin(2 θ_N)σ^(N)_x.

Notice that again we find the same structure, that of a diagonal piece and a Pauli matrix. The other update is 

    ∑_i M^(n)_i,kσ^(N-1)_x M^(n) †_i,k
       =  (2F-1) cos(2 θ) sin(2 θ_N-1)/sin(2 θ_N)σ^(N)_x.

It is seen that both terms contribute in the form, written in the natural basis of the next step, that we have predicted and the density matrix will always take the form of Eq. <ref>. Repeated application of the above two results allow us to evaluate A_N and B_N, which are both written in terms of geometric progressions. We find 

    A_N    = F cos^2N-2(2 θ) (2F-1)^N-1
       + ( F - (2F-1) cos^2(2 θ) ) ∑^N-2_i=0cos^2i(2 θ) (2F-1)^i 
    
    B_N    = (2F-1) sin^2 ( 2 θ)  
       ×∑^N-1_i=1cos(2 θ_i+1)/sin(2 θ_i+1)∏^N_j = i+2 (2F-1) cos(2 θ) sin(2 θ_j-1)/sin(2 θ_j).

It is straightforward to evaluate the summation to give

    A_N = 1 - (1-F)  1 - cos^2N(2θ) (2F-1)^N /1 - cos^2 ( 2 θ) (2F-1),

which is then used alongside Eq. <ref> to evaluate

    B_N = (1-F) sin^2 ( 2 θ) cos^N-1(2θ)/sin(2 θ_N)
       ×[ 1 - (2F-1)^N-1/1-(2F-1). 
       .  - cos^N+1(2 θ) (2F-1)^N-11 - cos^2N-2(2 θ)/1- cos^2 (2 θ)].

The denominators of the two fractions inside the braces could each be simplified however we leave them in this form so that it is clear that there are no convergence issues in the limit F → 1/2 or θ→ 0. Between Eqs. <ref>, <ref> and <ref>, we have characterised the probe's density matrix in terms of the fidelity and state parameters only. If F=1, which corresponds to the perfect fidelity case,  A_N=1 and B_N=0. This corresponds to the probe being in the pure state |ψ^(N)_k⟩, as one would expect. If instead F=1/2, which corresponds to maximum infidelity, then again B_N = 0 however here A_N=1/2. This means that the probe is in a maximally mixed state so that it carries no information about the prepared state. This corroborates with the analysis of the similar cases in the local-adaptive scheme.
In the quantum data gathering routine, following the unitary interactions between the probe and all resource qubits, the probe is left in the density matrix that we have calculated. If the fidelity is perfect, this will be one of two possible states, either |ψ^(N)_0⟩ or |ψ^(N)_1⟩. At this stage in the protocol, the probe is then measured with the Helstrom measurement which best distinguishes these states. This is the final piece of the calculation, which gives us the probability P^qdg_N that the scheme succeeds. Helstrom's conditions tell us that the best measurement is a projector onto the eigenvalues of p_0 |ψ^(N)_0⟩⟨ψ^(N)_0| - p_1 |ψ^(N)_1⟩⟨ψ^(N)_1|. The case p_0 ≠ p_1 is significantly more involved without adding further understanding. For this reason we restrict our attention to equiprobable preparation p_0 = p_1 = 1/2 for this scheme. The relevant eigenvectors are

    |ψ^(N)_+⟩   = √(1 + sin(2 θ_N)/2)|ψ^(N)_k⟩ + √(1- sin(2 θ_N)/2)|ψ^(N)_k ⊥⟩
    |ψ^(N)_-⟩   = √(1- sin(2 θ_N)/2)|ψ^(N)_k⟩ - √(1 + sin(2 θ_N)/2)|ψ^(N)_k ⊥⟩,

where the subscript ± indicates an associated eigenvalue of λ = ± 1. It is the uppermost of these which corresponds to the correct outcome. The success probability derived from this

    P^qdg_N   = ⟨ψ^(N)_+|ρ_N |ψ^(N)_+⟩
       = 1 - sin(2 θ_N)/2 + A_N sin(2 θ_N) - B_N cos(2 θ_N).

The Helstrom bound is written in a form useful here as P^H_N = ( 1 + sin(2 θ_N))/2. We see that P^qdg_N is leading order in the Helstrom bound (once A_N and B_N are entered), followed by terms which are linearly and inversely proportional to that object. This structure is similar to the equivalent expression for the local-adaptive measurement scheme. Eqs. <ref>, <ref> and <ref> together define the probability of success for the quantum data gathering.



§ DISCUSSION




In Fig. <ref> we plot, as a function of the number N of resource qubits, the probability of failure for both local-adaptive measurements and quantum data gathering, alongside a majority voting fixed measurement scheme, for two values of the angle θ and the fidelity F. For now we focus on the former two schemes. In both cases, we have used equiprobable preparation p_0=p_1=1/2. Despite the range of values, some broad features emerge. We comment on the many-copy limit, in which both quantitites converge upon the same value, below. What is relevant at this point is that, in all cases, the local scheme approaches this limit with fewer qubits than the collective scheme. This improvement is small enough, in the fourth or fifth decimal place for some cases, that it is probably not experimentally significant. Nonetheless, we have shown that one property, resilience to noise, is improved by measuring locally.
The third scheme plotted in Fig. <ref> is a majority voting scheme in which the Helstrom measurement is performed on each qubit and the most common outcome in the measurement record is the overall outcome. There is no simple analytic expression for the success probability but it is straightforward to find numerically <cit.>. The Helstrom measurement is that for discriminating the two mixed states, rather than the original pure states, though this will be the same for equal priors. Thus, this measurement scheme takes into account both the whole measurement record and the noise in the preparation. In general, we find that this simple generalisation is enough to outperform the other two schemes. In particular, it is not limited by the same asymptotic behaviour as those schemes. This turns out not to be true if there is only a small amount of noise, as can be seen in the graph with F=0.999 and θ=π/12. The majority voting scheme will not reach the multiple-copy Helstrom bound in any case. As the fidelity becomes closer to one, the two previously analysed schemes will become closer to the genuine optimal scheme, hence they perform better for moderate N in the high-fidelity case.
Special attention should be paid to the many-copy limit of both schemes. Interestingly, one finds the same value in both cases:

    lim_N →∞ P^qdg_N    = lim_N →∞ P^ad_N 
       = 1 - 1-F/1- (2F-1)cos^2 ( 2 θ) .

In the limit F=1, this equation reaches unity and so the states can be perfectly discriminated given an infinite number of copies. If instead the two states are the same θ=0, then we find a probability of one-half. This makes sense as it should be impossible to distinguish two equal states and all that can be done is to guess. These two limits are non-commuting. This occurs because the measurement schemes are ill-defined when discriminating equal states, i.e., the unitary operation for quantum data gathering would need to map two orthogonal states onto the same state, which is clearly not possible.
That both schemes reach the same many-copy limit, which in general is less than unity, is intriguing. It suggests that there is a systematic error which arises when applying a state discrimination scheme to the wrong pair of states, which cannot be overcome by increasing the number of resource qubits.
The specific form of the many-copy limit can be calculated in a different manner, by understanding the behaviour of the local-adaptive measurement scheme in such a regime. Analysing this behaviour also helps in improving intuition of that scheme. Inspection of Eq. <ref> reveals that the scheme in this case can be understood as hypothesis checking. If the outcome on one qubit suggests that |ψ_0⟩ was the prepared state, the next measurement will be onto the basis |ψ_0⟩, |ψ_0 ⊥⟩, with the latter outcome associated with a preparation of |ψ_1⟩. This explains why the strategy cannot perfectly discriminate. When applied to mixed states, neither measurement outcome is impossible. This hypothesis-checking scheme can be used to calculate the probability of success. We assume that the strategy of hypothesis checking is used for an infinite number of qubits. We find agreement with the original calculation. Two probabilities are required. Firstly,

    P(a | i_N-1 =a , a ) = F

is the probability of finding outcome a, given that the previous outcome was a (so that the measurement at this stage is |ψ_a⟩, |ψ_a ⊥⟩), given that |ψ_a⟩ was sent. We require also

    P(a | i_N-1 = a, a )= F - cos^2 ( 2 θ) (2F-1),

which is the probability of outcome a (i.e., the state |ψ_a⊥⟩) given that the previous measurement gave the outcome a, the other possible state, and that |ψ_a⟩ was sent. In terms of these objects, the probability of success on the (N+1)th qubit is written in terms of the probability of success on the Nth qubit:

    P^ad_N+1   =  P(a | i_N-1 =a , a )  P^ad_N 
       +  P(a | i_N-1 = a, a ) (1 -  P^ad_N) 
       = F - cos^2 ( 2 θ) (2F-1) + cos^2 ( 2 θ) (2F-1)  P^ad_N.

This result is then used iteratively to find an expression for the probability of success after N^' more measurements:

    P^ad_N+N^'   = ( cos^2 ( 2 θ) (2F-1) )^N^' P^ad_N
        + (F - cos^2 (2 θ) (2F-1) ) ∑^N^'-1_i=0cos^2i(2 θ) (2F-1)^i .

Finally, as N^' is increased the first term will be suppressed, and in the limit of an infinite number of copies, the probability of success at a given point makes no contribution to the overall expression. All that remains is to evaluate the geometric summation and to rearrange for

    lim_N^'→∞ P^ad_N+N^' = 1 - 1-F/1- (2F-1)cos^2(2θ),

the same value which was found previously. Here, it has been found with a different method to the more general case. Unfortunately, a similar method for confirming the calculation does not exist for quantum data gathering, however inspection of the unitary Eq. <ref> reveals similar behaviour. In the many-copy limit there, the probe states become the diagonal basis states |+⟩,|-⟩. One example of the behaviour of the unitary in this regime is U_N |ψ_0⟩_S_N|+⟩_A = |0⟩_S_N|+⟩_A, so that all the unitary has done is to delete the resource qubit's information conditioned upon it matching what is already known.
We have considered here only preparation noise. In the quantum data gathering scheme, there will also be noise in the gates needed to implement the unitary Eq. <ref>. This operation takes the form of a rotation controlled upon binary addition of the register of each individual qubit, which can be implemented by two CNOT gates alongside single-qubit gates. Thus, 2N two-qubit gates are needed to perform quantum data gathering on a resource of N qubits. We assume that the contribution to the noise from single qubit gates is negligible. Because the diamond norm <cit.>, the standard measure of gate noise, satisfies the triangle inequality, that there are 2N gates required means that the total gate noise scales linearly with N. This will appear as a noisy channel acting upon the probe's state, and decrease further the probability of success. To make further comments, we would need to understand the form of the noise in more detail <cit.>.
Methods to improve the schemes exist in each case. For the local measurement scheme, we have neglected the entire measurement record and made a decision based only on the final measurement made. As discussed above, the local adaptive scheme converges to a measurement which, in the pure state case is in a basis along and orthogonal to the prepared state (the “fully biased" measurement <cit.>). Thus in the limit, we always obtain the outcome verifying the current guess, and the probability of error approaches zero exponentially. This procedure, however, is not robust to noise: as soon as there is any finite probability of error in measurement, whether due to imperfect measurement or noisy preparation, the Markovian scheme results in a non-zero probability of error, which is simply the probability of error in any given round. This can be improved by referring back to the whole measurement record. If we have measured N systems, and N-1 gave the result 1, while the Nth gave the result 0, we could reasonably infer that an error occured in the Nth round, and return outcome 1. Majority vote on the measurement record thus may be expected to recover an exponential decay in the probability of error. Note however that, although the probability of error at any given N is given by Eq. <ref> in the large N limit, the measurement performed at each step depends on the outcome of the previous measurement. If each measurement were the same, the measurement record would be a sequence of independent and identically distributed (i.i.d.) random variables, and we could use classical statistical techniques, specifically the classical Chernoff bound <cit.> to argue that the probability of error indeed decays exponentially. Indeed, this is verified by the numerically evaluated function in Fig. <ref>. As the measurement record is not i.i.d., this is not possible, and more sophisticated techniques are needed. However, we know that in this limit the measurement switches between the two possible fully biased measurements, and an upper bound on the probability of error is given by considering just the measurement outcomes for that measurement which occurs more often. This tells us that the probability of error decays with an error exponent given by the classical Chernoff bound for this measurement, and with the exponent modified by the fraction of the total measurement record considered. Further, previous work <cit.> shows that for very high fidelities, the fixed measurement giving the best error exponent in the asymptotic limit is close to fully biased. For fidelities less than around 99%, the optimal fixed measurement becomes unbiased <cit.>.
In quantum data gathering, the scheme can be modified by measuring the resource qubits at each step and acting based upon the outcome. As noted, an outcome of |1⟩ indicates that all quantum information gathered up until that point has been lost. So, one way to modify the protocol is to restart whenever such an outcome occurs. Some care must be taken as only a finite number of consecutive |0⟩ outcomes can occur before a bad outcome. In Fig. <ref> it is seen that only small number, three or four, of interactions are required to get very close to the best-possible probability. However, numerical evaluation of the relevant probabilities reveals that even this small number is unlikely enough (while still being highly probably, p ≥ 0.97 typically) to bring the overall probability of state discrimination below that which occurs if the qubits are not measured. This is played off against two things. Firstly, success here is heralded at the expense of increasing ambiguity in some cases, similar to unambiguous state discrimination. Secondly, if there are many resource qubits available, a small run of successes becomes likely to occur at some point. Thus, in some scenarios it may be advantageous to post-select based on the measurement outcomes. A hybrid scheme in which subsets of systems are measured collectively, followed by majority voting on the measurement output would give an improved probability of success, but still less than the local scheme. Here we chose to evaluate the performance of a scheme requiring a single qubit of memory as the quantum probe. A fully general scheme, which would achieve the optimal Helstrom measurement for arbitrary many-copy states, would require a processor of size log N <cit.>. Our results show that how a collective measurement is implemented has a considerable effect on its robustness to noise.



§ CONCLUSION


We have considered the ability of two multiple-copy state discrimination schemes to perform when the state preparation is imperfect. We find two surprising results. Firstly, that for small amounts of uncharacterised noise, the optimal local adaptive measurement is more robust than the simple, single qubit collective scheme. With a simple modification of the scheme to take into account the whole measurement record, we obtain a protocol which performs better than fixed, unbiased local measurements and majority vote for small N, and retains the desirable exponential decay of error probability in the limit of large N, without requiring prior knowledge of the amount of noise. We also find that both schemes have the same many-copy limit, which is less than unity. Despite the different physical mechanisms used in each scheme, they have precisely the same behaviour in this regime. This suggests that the quantity found is a generic property of applying an incorrect scheme, and should be investigated further.
It would be useful to know an optimal state discrimination scheme for mixed states of the type considered here. A natural starting point would be to generalise the local-adaptive scheme to use the entire measurement record when updating the prior probabilities in a Bayesian manner and to calculate the range, if any, in which this strategy is optimal. In general, more analytic work is required in multiple-copy state discrimination. Some of the techniques used here may be found to be useful in that task.

This work was supported by the UK Engineering and Physical Sciences Research Council
and by the Royal Society (RP150122). 









33
fxundefined [1]
 ifx#1

fnum [1]
 #1firstoftwo
 secondoftwo
 
fx [1]
 #1firstoftwo
 secondoftwo
 





noop [0]secondoftwo

ref[1]@startlink#1@href
href[1]#1@endlink
anitize@url [0]`
12`$12`&12`#12`1̂2`_12`%12
startlink[1]
endlink[0]

rl [1]href #1












@bib@innerbibempty

[Barnett and Croke(2009)]statediscriminationreview
  author author S. M. Barnett and author S. Croke, @noop  journal journal Adv.
  Opt. Photon. volume 1, pages 238
  (year 2009)NoStop
[Bae and Kwek(2015)]baekwek
  author author J. Bae and author L.-C. Kwek,  @noop  journal journal J. Phys. A: Math.
  Theor volume 48, pages 083001
  (year 2015)NoStop
[Bergou(2010)]bergoureview
  author author J. Bergou, @noop  journal journal Mod.
  Opt. volume 57, pages 160 (year 2010)NoStop
[Barnett(2009)]steveqi
  author author S. M. Barnett, @noop  title Quantum Information  (publisher Oxford University Press, address
  Oxford, year 2009)NoStop
[Chefles(2010)]chefles
  author author A. Chefles, @noop  journal journal
  Contemp. Phys. volume 41, pages 401
  (year 2010)NoStop
[Helstrom(1976)]helstrombook
  author author C. W. Helstrom, @noop  title Quantum detection and
  estimation theory (publisher Academic, year
  1976)NoStop
[Ha and Kwon(2013)]haetal
  author author D. Ha and author Y. Kwon,  @noop  journal journal Phys. Rev. A  volume 87, pages 062302 (year 2013)NoStop
[Weir et al.(2017)Weir,
  Barnett, and Croke]weirmixed
  author author G. Weir, author S. M. Barnett,   and author S. Croke,  @noop  journal journal Phys. Rev. A  volume 96, pages 022312 (year 2017)NoStop
[Bae and Hwang(2013)]baehwang
  author author J. Bae and author W.-Y. Hwang, @noop  journal journal Phys.
  Rev. A volume 87, pages 012334
  (year 2013)NoStop
[Peres and Wootters(1991)]pereswootters
  author author A. Peres and author W. K. Wootters, @noop  journal journal
  Phys. Rev. Lett. volume 66, pages
  1119 (year 1991)NoStop
[Massar and Popescu(1995)]massarpopescu
  author author S. Massar and author S. Popescu, @noop  journal journal Phys.
  Rev. Lett. volume 74, pages 1259
  (year 1995)NoStop
[Chitambar and Hsieh(2013)]chitambarhsieh
  author author E. Chitambar and author M.-H. Hsieh, @noop  journal journal Phys.
  Rev. A volume 88, pages 020302(R)
  (year 2013)NoStop
[Croke et al.(2017)Croke,
  Weir, and Barnett]crokeetaltrine
  author author S. Croke, author S. M. Barnett,  and  author G. Weir,  @noop  journal journal Phys. Rev. A  volume 95, pages 052308 (year 2017)NoStop
[Bennett et al.(1999)Bennett
  et al.]bennettetal
  author author C. H. Bennett et al., @noop  journal journal Phys. Rev. A volume 59 pages 1070 (year
  1999)NoStop
[Childs et al.(2013)Childs
  et al.]childsetal
  author author A. M. Childs et al., @noop  journal journal Comms. Math. Phys. volume 323, pages 1121 (year 2013)NoStop
[Croke and Barnett(2017)]crokedomino
  author author S. Croke and author S. M. Barnett, @noop  journal journal Phys.
  Rev. A volume 95, pages 012337
  (year 2017)NoStop
[Acín et al.(2005)Acín, Bagan et al.]acinetal
  author author A. Acín, author E. Bagan,
  et al., @noop  journal journal
  Phys. Rev. A volume 71, pages 032338
  (year 2005)NoStop
[Brody and Meister(1996)]brodymeister
  author author D. Brody and author B. Meister, @noop  journal journal Phys.
  Rev. Lett. volume 76 pages 1 (year
  1996)NoStop
[Ban et al.(1997)Ban,
  Yamazaki, and Hirota]banetal
  author author M. Ban, author K. Yamazaki,   and author O. Hirota,  @noop  journal journal Phys. Rev. A  volume 55, pages 22 (year
  1997)NoStop
[Higgins et al.(2011)Higgins, Doherty et al.]higginsetal
  author author B. L. Higgins, author A. C. Doherty,  et al., @noop  journal journal Phys. Rev. A volume 83, pages 052314 (year 2011)NoStop
[Slussarenko et al.(2017)Slussarenko, Weston et al.]slussarenkoetal
  author author S. Slussarenko, author M. M. Weston,  et al., @noop  journal journal Phys. Rev. Lett. volume 118, pages 030502 (year 2017)NoStop
[Higgins et al.(2009)Higgins
  et al.]higginsetal2
  author author B. Higgins et al., @noop  journal journal Phys. Rev. Lett. volume 103, pages 220503 (year 2009)NoStop
[Calsamiglia et al.(2008)Calsamiglia et al.]calsamigliaetal1
  author author J. Calsamiglia et al., @noop  journal
  journal Phys. Rev. A volume 77,  pages 032311 (year 2008)NoStop
[Calsamiglia et al.(2010)Calsamiglia et al.]calsamigliaetal2
  author author J. Calsamiglia et al., @noop  journal
  journal Phys. Rev. Lett. volume 105,  pages 080504 (year 2010)NoStop
[Hayashi(2009)]hayashi
  author author M. Hayashi, @noop  journal journal IEEE
  Trans. Inf. Theory volume 55, pages
  3807 (year 2009)NoStop
[Burnett et al.(2019)Burnett
  et al.]burnettetal
  author author J. Burnett et al., @noop  title
  Decoherence benchmarking of superconducting qubits,  (year
  2019), note arxiv:1901.04417NoStop
[Schlör et al.(2019)Schlör et al.]schloretal
  author author S. Schlör et al., @noop  title
  Correlating decoherence in transmon qubits: Low frequency noise by single
  fluctuators,  (year 2019), note
  arxiv:1901.05352NoStop
[Blume-Kohout et al.(2013)Blume-Kohout, Croke, and Zwolak]quantumdatagathering
  author author R. Blume-Kohout, author S. Croke,
   and author M. Zwolak,  @noop  journal journal Scientific
  Reports volume 3 (year
  2013)NoStop
[Aharanov et al.(1997)Aharanov, Kitaev, and Nisan]aharanovart
  author author D. Aharanov, author A. Kitaev,   and author N. Nisan, in  @noop  booktitle Proceedings of the Thirteenth
  Annual ACM Symposium on theory of Computation (publisher
  STOC, year 1997) pp. pages 20–30NoStop
[Aliferis et al.(2006)Aliferis, Gottesman, and Preskill]aliferisetal
  author author P. Aliferis, author D. Gottesman,
   and author J. Preskill,  @noop  journal journal Quantum Info.
  Comput. volume 6, pages 97 (year 2006)NoStop
[Aharanov and Ben-Or(2008)]aharanovetal
  author author D. Aharanov and author M. Ben-Or, @noop  journal journal SIAM
  J. Comput. volume 38, pages 1207
  (year 2008)NoStop
[Sanders et al.(2016)Sanders, Wallman, and Sanders]sandersdiamond
  author author Y. R. Sanders, author J. J. Wallman,  and author B. C. Sanders, @noop  journal journal New
  J. Phys. volume 18, pages 012002
  (year 2016)NoStop
[Cover and Thomas(2006)]coverandthomas
  author author T. Cover and author J. Thomas,  @noop  title Elements of Information Theory  (publisher Wiley, year 2006)NoStop



