Accessing inaccessible information via quantum indistinguishability

In this paper we present and analyze an information-theoretic task that consists in learning a bit of information by spatially moving the ‘target’ particle that encodes it. We show that, on one hand, the task can be solved with the use of additional independently prepared quantum particles, only if these are indistinguishable from the target particle. On the other hand, the task can be solved with the use of distinguishable quantum particles, only if they are entangled with the target particle. Our task thus provides a new example in which the entanglement apparently inherent to independently prepared indistinguishable quantum particles is put into use for information processing. Importantly, a novelty of our protocol lies in that it does not require any spatial overlap between the involved particles. Besides analyzing the class of quantum-mechanical protocols that solve our task, we gesture towards possible ways of generalizing our results and of applying them in cryptography.


I. INTRODUCTION
Indistinguishable particles are commonly represented in quantum-mechanical models in two distinct ways: roughly, the first-quantization formalism models their state vectors as elements of the (anti)symmetric subspace of a multi-particle Hilbert space, whereas the secondquantization formalism takes their state space to be given by a Fock space of modes.Interestingly, the former option allows for the state of independently prepared indistinguishable particles -e.g. the state of two electrons stemming from causally disconnected galaxies -to be entangled, despite the absence of common past interactions between the particles.On the contrary, in the secondquantization formalism, the entanglement between the particles' modes is contingent on the particles' past interactions: indeed, the state of independently prepared particles is represented as separable.Since entanglement is a paradigmatic resource for quantum information processing, the question arises whether the entanglement that is apparently intrinsic according to the firstquantization formalism can in principle be accessed and used, or whether it is a mere artefact stemming from the choice of representation: possible answers are still being actively debated [1][2][3][4][5][6][7][8] (for a recent review see [9]).
In this paper we address the above question by proposing an information-theoretic task that can be solved with the use of independently prepared indistinguishable particles, but cannot be solved with distinguishable ones, unless they are entangled.We thereby show that, in the context of our task, the indistinguishability of independently prepared particles provides an equal resource to the one obtainable from the entanglement of distinguishable particles: there is thus a sense in which the entanglement present according to the first-quantization formalism is more than a mere mathematical artefact, and can indeed be used in information processing.
The paper is structured as follows.Section II offers an informal presentation of our task, whereas its precise formulation is given in Section III.The same section also contains the quantum-mechanical analysis of the task and an expansion on the requirements necessarily satisfied by any quantum-mechanical protocol that solves it.Finally, Section IV provides a discussion and an outlook on possible future developments of our results and on their potential practical applications.

II. INFORMAL PRESENTATION
Consider the following scenario.An agent named Alice is given a box, which contains a physical object (e.g. an atom) prepared in one of two perfectly distinguishable states, thereby encoding one bit of information.The box is sealed in such a way that Alice does not have the means of opening it and thus cannot access the object directly.Suppose that the only action she can perform on the box is to move it in space, e.g.she can move the box from some initial position x to another position x .Alice may also have available various experimental devices and other physical objects (as for example other boxes).Lastly, we will assume that spatially moving the box leaves the state of the object within it invariant, and that Alice cannot infer the state by merely moving the box (e.g. via some state-dependent back-reaction acting on Alice's experimental devices or additional objects).An example of this scenario, where the additional objects consist of other boxes, is pictured in Fig. 1.Now we are ready to formulate the task: can Alice learn the state of the object within the box, given the above restrictions on what she is allowed to do?At the current stage, this question may appear nonsensical: if (i) Alice is only able to move the box, and (ii) a mere movement of the box cannot reveal the state of the object within it, then it trivially follows that Alice cannot accomplish the task!However, if the box can be treated quantummechanically and if Alice has at disposal additional identical quantum systems, then, as we will show in the next section, she can in fact learn the state of the object, while -in a sense that will be made precise below -still only moving the box.Let us now provide a formalized version of the task and the quantum-mechanical protocol that can be used to solve it.

III. FORMALIZATION OF THE TASK
Here we will put the scenario presented in the previous section on more formal and abstract grounds.Consider that Alice is given a localized physical object, henceforth named T .T can be characterized to have two degrees of freedom (d.o.f.): an intrinsic one, which we will label with k, and a position, labelled with x.We will thus represent the overall state of the object with the ordered pair ( x, k) T .Throughout the paper, we attach only an operational meaning to states, i.e. the sentence "the object is in state ( x, k) T " is hereafter synonymous with "a position measurement on the object would output value x, and an appropriate measurement of the internal d.o.f.would output value k".We furthermore assume that k can take only two possible values, 0 or 1.Let us now suppose that Alice is only allowed to move the object through space, while keeping the internal d.o.f.intact.We will model this restriction by assuming that she has at disposal a device D that can implement any transformation in M, where M is a set of transformations M : R 3 → R 3 , the latter being operators that map position vectors x into position vectors x = M x.We will associate states (M ) D to the device, where M indicates which map the device is set to implement on a potential target object.The device is constructed in such a way that the dynamical interaction with the localized target object T , which is initially in state ( x, k) T , is given by Furthermore, Alice may have at disposal other localized objects, which cannot interact directly with the initial object T , but can interact with the device D. Labelling collectively these additional objects with A, and their pertaining state with (α) A , the latter constraint means that the overall interaction between D, A and T can be represented as: where the final state α(M, α) of A is in principle any function insensitive to the internal d.o.f.pertaining to T .Moreover, if the initial state of D is not equal to any (M ) D (but is e.g. a probabilistic mixture or a quantum superposition state), we assume that it is still the case that, were one to find the final state of D to be (M ) D , one would find the final state of T and A to be (α(M, α)) A (M x, k) T .Stated more precisely, for any initial state of D, post-selecting the final state on a definite state (M ) D of D results in the postselected joint state being equal to the RHS of Eq. ( 2).Now suppose that Alice is allowed only to interact with her device, i.e. she is solely able to control and to read out the state of D. In other words, she can interact only indirectly with objects T and A, via mediation through D. Furthermore, Alice has perfect knowledge of the initial state (α) A associated to the additional objects A, but does not have any prior knowledge of the value k pertaining to T .The information-theoretic task can now be formulated as follows: Task: can Alice learn the state k pertaining to T , solely by manipulating the given device D?
As can be immediately seen from Eq. ( 2), the state of D is insensitive to k, so the answer to the latter question seems to be an immediate 'No'.Also, at the current stage, it is admittedly not clear at all what role, if any, the additional objects A could play for the accomplishment of the required task.However, in what follows, we will show that if D, A and T can be treated as quantum systems, and if Alice is able to coherently manipulate the device D, then she can in fact learn the required value k, given that A and T can be modelled as indistinguishable quantum particles.

The quantum protocol
We will now assume that D, A and T can be treated as quantum systems that can be modelled via the usual rules of quantum mechanics.Therefore, we can associate a quantum state to the joint system comprised of D, A and T .The Hilbert space H D associated to the device is spanned by vectors {|M , ∀M ∈ M}, whereas the Hilbert space H T associated to T is spanned by Vectors |M are eigenstates of the observable M that corresponds to the "measurement" of the device in the intended classical basis, whereas | x and |k are respectively eigenstates of observables ˆ x and k corresponding to measurements of the position and internal d.o.f. of T .The structure of the Hilbert space H A pertaining to A remains for now unspecified.We now assume, in accord with Eq. ( 2), that the interaction between D, A and T is given by the following unitary evolution: Notice that the above corresponds to a control gate, where the device D acts as the control system, and the objects T and A act as targets.We stress that we are assuming that D, A and T are not interacting with any further environment, i.e. that they constitute an isolated system; in the next subsection we will analyze protocols that violate this assumption.
Let us now specify the additional objects A to consist only of one object localized at position x A , and possessing a binary internal d.o.f., whose value is for simplicity set to k A = 0.The Hilbert space associated to A is thus isomorphic to the one associated to T , and the object A is assigned state | x A , 0 .We also assume that the device D can be used to move A through space.Consequently, Alice is now able to swap the two objects with the use of her device, by moving T to position x A , and A to position x T .In order to simplify the discussion, let us introduce an effective state of D, which we will label with 'S', and that is constructed in such a way that it effectively swaps the two objects upon interaction, i.e.
where we introduced more indices in order to avoid confusion.
Under the assumption that A and T are distinguishable systems, Eq. ( 4) implies that Alice cannot accomplish the task, because the internal degree of freedom pertaining to T is isolated from the other subsystems.Let us now suppose that objects A and T are indistinguishable, i.e. that they can be modelled as indistinguishable quantum particles: here we assume for simplicity the bosonic case, even though the protocol would also work in the fermionic case, as it can be easily checked.This warrants us to introduce the "second quantization" notation via the following recipe: where the latter state means that at location x A there is an object with internal state 0, and at location x T an object with internal state k T , with no further labels that may distinguish the objects1 .Mathematically, the quantum state is now an element of H x T ⊗ H x A , where H x T /A is associated to spatial mode x T /A and is spanned by vectors |0 x T /A , |1 x T /A .The interaction between the device D set in state 'S' and the two indistinguishable objects is thus given by: Now comes the crucial observation: unlike as in the case of distinguishable objects (see Eq. ( 5)), the overall quantum state in Eq. ( 7) is invariant upon interaction if and only if k T = k A , i.e. k T = 0.This enables the construction of the following protocol that can be used by Alice to learn k T with probability higher than 1  2 , given that she knows the value k A = 0 of the additional system A. The procedure goes as follows.(a) Alice prepares the device in state |φ ≡ where '1' is the state of the device that implements the identity transformation.(b) She then lets D, A and T interact as: After the interaction, the reduced density state ρ associated to D is: where 1 2 is the identity operator on H D restricted to the subspace spanned by {|1 D , |S D }.Notice that, were the objects T and A distinguishable, the device would end up in a maximally mixed state for all combinations of k T , k A .(c) Finally, Alice measures D with projectors If she obtains outcome '0', she guesses k T = 0; conversely, if she obtains '1' she guesses k T = 1: the probability of a correct guess is 3  4 , thereby beating a random guess.Can the probability of success be raised closer to unity?The answer is affirmative, and is given by a straightforward extension of the protocol, where A now consists of (N − 1) additional identical quantum objects, each of them set in the reference state k A = 0.The extended protocol is presented in Appendix A, where it is shown that Alice's probability P W of correctly guessing the required bit is that asymptotically reaches unity for large N .Note that if Alice at the end of the process wants to guess which of the objects is the one containing k T (i.e.T ), she is able to do so only with probability 1 N .Alternatively, instead of implementing measurement {Π 0 , Π 1 }, she could have measured D in the {|1 D , |S D } basis and found out with certainty the location of k T , which would however not have provided her with any knowledge of the value of k T .There is thus a trade-off between the possibility of acquiring knowledge of the value of k T and of retaining knowledge of its location, which is inherited from the non-commutativity of the observables on D that would correspondingly need to be measured.

The necessity of entanglement and indistinguishability
In the protocol presented in the previous subsection, the interaction between the target objects (T and A) and the device D produces a k T -dependent back-reaction on the latter: in particular, the device gets entangled with the target objects if and only if k T = 1.This suggests that the possibility of establishing entanglement between the device and the targets, along with the targets being indistinguishable, may be a necessary ingredient for the protocol to work.However, it is not yet clear whether this is the case, since the transformation defined abstractly in Eq. ( 2) admits other quantum-mechanical realizations besides the ideal quantum control gate that was assumed in Eq. ( 4): we thus cannot yet exclude the possibility of there being a noisy control gate that produces a k T -dependent transformation on the device even without the latter getting entangled with the target objects.Nevertheless, as we will sketch here (while leaving the proof for Appendix B), the possibility of establishing entanglement between D and the targets turns out after all to be a necessary condition for any quantum-mechanical protocol to solve the task.
Let us assume that N = 2 and that the two target objects are indistinguishable.As before, states |1 D and |S D pertaining to D correspond to the 'identity' and 'swap' operations.The assumption of our task is that the interaction between D and the targets is such that, postselecting the final state on |1 D leaves the targets' state invariant, whereas postselecting on |S D leaves the targets in a 'swapped' state.More precisely, the most general allowed interaction G is a CPTP-map that satisfies the following: for any quantum states ρ (D) and ρ (T ) of the device D and the targets T and A, the post-interaction state ρ ≡ G(ρ (D) ⊗ ρ (T ) ) satisfies k T the initial state of the targets when the unknown bit's value is k T .For any gate G that satisfies Eq. ( 11) and any initial state ρ (D) of D, our task can be solved with probability higher than 1  2 only if the final reduced state of D depends on k T , i.e.
where ρk k T ).The permutation invariance of state ρ (T ) 0 implies that ρ0 is a separable state.On the other hand, Eq. ( 12) holds if and only if ρ1 is an entangled state, as we prove in Appendix B, wherein we also prove a generalization of the latter condition for arbitrary N > 2.
Therefore, the necessary conditions for a quantummechanical protocol to outperform a random guess are that (i) it involves indistinguishable target objects, and that (ii) the final quantum state of the device and the target objects is entangled if and only if k T = 1.

IV. DISCUSSION
We have seen in the previous section that Alice can accomplish her task thanks to the indistinguishability of the target objects and the possibility of establishing entanglement between the latter and the device.We now want to emphasize that the task and its solution are reminiscent of the well known swap test [11], which enables one to check whether two quantum systems are prepared in equal states by performing a control-swap operation on them, where the swap operation -henceforth referred to as 'abstract swap' -acts as |ψ ⊗ |φ → |φ ⊗ |ψ .This offers another angle on how to understand the necessity of the targets' indistinguishability for the quantum protocol to solve our task.Namely, when applied to independently prepared indistinguishable particles, spatially swapping the particles precisely implements, on the space of the particles' spatial modes, the 'abstract swap' operation that is required for the swap-test; on the other hand, a spatial swap of independently prepared distinguishable particles strictly differs from an 'abstract swap' operation acting on their joint Hilbert space.Stated succinctly, a spatial swap of two independently prepared particles implements the 'abstract swap' operation (of the kind needed in the swap-test) if and only if the particles are indistinguishable: particle indistinguishability is what enables the operations allowed in our task to be used to implement a standard swap-test.
As our task presents an instance of quantum indistinguishability serving as an information-theoretic resource, this leads us back to the ongoing debate on the possible physical merit of the entanglement apparently intrinsic to indistinguishable particles, as mentioned in the introductory section.Indeed, notice that our task cannot be solved with distinguishable particles under the requirement that the target objects T and A be prepared independently.However, if we drop this assumption, the task can be equally well solved with mutually entangled distinguishable particles, as briefly explained in what follows.
In fact, notice that in the first-quantization formalism, the quantum state associated to a pair of independently prepared indistinguishable particles is mathematically equivalent to a maximally entangled state of ordinary distinguishable particles.Therefore, the quantummechanical protocol presented in Section III -originally interpreted as involving indistinguishable particles -can be straightforwardly re-interpreted, without any change in the mathematical expressions, as involving maximally entangled distinguishable particles.Indistinguishability and entanglement thus represent equivalent informationtheoretic resources in our task, which we take to support the claim that the entanglement that appears in the first quantization notation is more than a mere representational artefact.However, we do not want to delve here into a more detailed discussion on whether independently prepared indistinguishable particles need to (or can) be considered as entangled or not, the answer of which would starkly depend on particular definitions and measures of entanglement [7]: our aim is only to point out that there exists a simple information-theoretic task in which the indistinguishability of independently prepared particles and the entanglement of non-independently prepared distinguishable particles serve as equivalent resources.
Let us now comment on possible future developments of our results.In the current manuscript we have provided only a quantum-mechanical analysis of our task; however, we believe that the latter, as presented abstractly at the beginning of Section III, can be transposed into the framework of generalized probabilistic theories [12,13], which would enable the assessment of how much of our results hinge on the specificities of quantum theory.We may thereby gain a better understanding of the general relationship between indistinguishability and entanglement, by analyzing questions such as the following.In which other operational theories are the indistinguishability of the targets and the possibility of entangling the latter and the device, both necessary to solve the task?In which theories do indistinguishability and entanglement of the targets constitute equivalent resources for our task?
Finally, moving on to potential practical aspects of our findings, it is commonly expected that, following Moore's law, hardware components used in information processing may soon reach a regime in which quantummechanical effects cannot be neglected [14].When (and if) that becomes the case, our results may prove relevant for hardware-security modules that incorporate physical protection against tampering.Examples of this type of devices can already be found both in classical and quantum computing, where the security of one-time programs essentially relies on hardware components, i.e. on one-time memories [15,16].Other potential applications of our results may be expected to be found in cryptography and hardware security in general.
Since by assumption Alice is only able to coherently swap the targets, the effective Hilbert space H T that can be associated to the latter is spanned by the vectors in Eq. (B1), i.e.H T = Span(|i T , i = 0, ..., N ).A swap gate S j that swaps the first and j-th object thus acts as S j |0 T = |0 T , and S j |1 T = |j T (notice that S 1 is the identity operator).The initial targets' state is equal to |k T , with k being 0 or 1.Finally, the Hilbert space H D associated to the device D is spanned by vectors {|j D , j = 1, ..., N }, with each |j D representing the setting corresponding to swap gate S j .Now we want to characterize the most general interaction between D and the targets that is allowed by the assumptions of our task.Let St DT , St D and St T be respectively sets of density operators on H D ⊗ H T , H D and H T .We will label with Ch DT the set of completely positive trace preserving (CPTP) superoperators that map St DT into itself.Let G be the subset of CPTP maps that represent the device-targets interactions implementable by Alice.The abstract formulation of the task implies that, for any G ∈ G, if the initial state of D is some |i D , then the interaction is given by for any ρ (T ) ∈ St T , where we have used the property S † i = S i .More generally, if the initial state of D is an arbitrary density operator ρ (D) ∈ St D , then the interaction is such, that postselecting the final state on the device's state |i D implements gate S i on the targets, i.e.
where Π i ≡ |i D i|, and α i are arbitrary real coefficients.Since G is linear in its arguments, Eqs.(B2) and (B3) imply the following condition: thereby fixing the coefficients α i .Therefore, the assumptions of the task imply that the set G of allowed device-targets interactions can be characterized as follows: where p i ≡ Tr Π i ρ (D) .G can be understood as the class of generalized control gates, with D being the control system and A and T constituting the target system.In the main text we have seen that in the case of the ideal control gate, which is a particular element of G, the device and the targets get entangled upon interaction if k = 1; in what follows we will prove that this is the case for any element of G that can be used to outperform a random guess at solving our task.Let us first slightly generalize the discussion by defining a broader class of generalized control gates for which we will prove a Lemma that will be of use later.Then, for any G ∈ G X , there exists a natural number M and a set v (1) , ..., v (N D ) of unit vectors in C M , such that, for all ρ (D) ∈ St D and ρ (T ) ∈ St T : kl |k l| ⊗ U (k) ρ (T ) U (l) † , is an eigenvector of (1 ⊗ T )ρ 1 with its corresponding eigenvalue equal to −|α kl |, which is negative.Therefore, if α kl = 0 for some k = l, then the state ρ 1 is necessarily entangled.We thereby completed the proof that a quantum-mechanical protocol that involves indistinguishable particles can outperform a random guess if and only if the device and the targets get entangled upon interaction when k = 1.

FIG. 1 .
FIG.1.Alice is given a box containing an object prepared in state k ∈ {0, 1}.She also has at disposal other boxes, with their pertaining objects set in state 0. Alice is challenged to learn the value k by solely moving the box that contains the hidden object (without opening it), while also being allowed to implement transformations on the other boxes: for example, as represented in the diagram, she can swap the locations of the first two boxes.

( 11 )
where Π 1/S ≡ |1/S D 1/S|, and Ŝ is the 'swap' operator acting on the targets.The factors p 1 ≡ Tr Π 1 ρ (D) and p S ≡ Tr Π S ρ (D) are determined by the requirement on how G acts in the case of the initial state of D being |1 D or |S D .Let us label with ρ (T )

Definition 1 .Lemma 1 .
Consider H D ≡ C N D and H T ≡ C N T for some finite natural numbers N D and N T .Let St DT , St D and St T be sets containing all and only density operators on respectively H D ⊗ H T , H D and H T .Let Ch DT be the set of completely positive trace preserving (CPTP) superoperators that map St DT into itself.Let U ≡ U(1) , ..., U (N D ) be a list of N D unitary operators on H T , and let Π ≡ Π 1 , ..., Π N D be a list of projectors that form a projection-valued measure on H D .Define a 4-tuple X as X ≡ N D , N T , U , Π .The set of generalized control gates relative to X is a set G X defined asG X = G ∈ Ch DT | ∀ρ (D) ∈ St D , ρ (T ) ∈ St T , i = 1, ..., N D : Tr D (Π i ⊗ 1) G ρ (D) ⊗ ρ (T ) = p i U (i) ρ (T ) U (i) † ,where p i = Tr Π i ρ(D) .Consider a 4-tuple X ≡ N D , N T , U , Π , where N D , N T are natural numbers, U ≡ U(1) , ..., U (N D ) is a list of unitary operators on H T ≡ C N T , and Π ≡ Π 1 , ..., Π N D is a projection-valued measure on H D ≡ C N D .Let G X be the set of generalized control gates relative to X.