Abstract
It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. In general, the optimal measurement for distinguishing such states is a collective measurement. However, to the best our knowledge, collective measurements have not been used to enhance quantum state discrimination to date. One of the main reasons for this is the fact that, in the usual state discrimination setting with equal prior probabilities, at least three copies of a quantum state are required to be measured collectively to outperform separable measurements. This is very challenging experimentally. In this work, by considering unequal prior probabilities, we propose and experimentally demonstrate a protocol for distinguishing two copies of single qubit states using collective measurements which achieves a lower probability of error than can be achieved by any non-entangling measurement. Additionally, we implemented collective measurements on three and four copies of the unknown state and found they performed poorly.
Similar content being viewed by others
Explore related subjects
Find the latest articles, discoveries, and news in related topics.Introduction
Quantum state discrimination, or hypothesis testing, was first introduced by Helstrom1. It can be described in terms of a simple two party game. Alice sends M copies of one of two states, ρ+ or ρ−, to Bob, with some specified prior probability. Bob then tries to implement the optimal measurement to decide which state he has received according to some figure of merit. Owing to the no-cloning theorem2 if the two states to be distinguished are not orthogonal, they can’t be distinguished perfectly. This means that there will necessarily be some error when Bob decides which state he has received. Typically, Bob tries to minimise the average probability of error. When distinguishing between two pure orthogonal states, it is known that a single separable measurement, consisting of only local operations and classical communication (LOCC), can distinguish between the two states perfectly3. (Note that while LOCC usually refers to operations and communication between two parties Alice and Bob, in this work local operations means operations on a single mode of Bob’s state and classical communication means Bob cannot implement entangling operations between the different modes of the state he receives.)
The situation becomes considerably more interesting when considering non-orthogonal states. For distinguishing multiple pure non-orthogonal states, it was first conjectured by Peres and Wooters that collective measurements can improve the error probability compared to LOCC measurements4. A collective measurement here refers to an entangling measurement acting on M copies of the state, \({\rho }_{+}^{\otimes M}\) or \({\rho }_{-}^{\otimes M}\), simultaneously. In contrast, a LOCC measurement means that the M copies of the state received by Bob are measured individually, and each subsequent measurement may be adaptively updated based on previous measurement results. Hence, collective measurements are more general than LOCC measurements. For distinguishing a continuous spectrum of different quantum states given a finite number of copies, the advantage of collective measurements over separable measurements has been confirmed5. However, for distinguishing two non-orthogonal pure states, it is known that collective measurements offer no advantage over separable measurements6,7,8.
When we consider distinguishing between mixed states, the situation becomes more interesting again. For distinguishing two mixed states, collective measurements generally offer an advantage over separable measurements. Despite theoretical progress on the role of collective measurements for discriminating between mixed states9,10,11,12, experimental progress along this avenue has been limited. A great deal of experimental work has focused on optimally distinguishing single copies of pure states13,14,15,16,17,18,19,20,21 or using adaptive separable measurements to distinguish multiple copies of either pure22 or mixed23 states. The multi-copy discrimination of coherent and thermal states was considered recently24. However, in this case, the multiple copies were measured individually, not with a collective measurement and the multi-copy part refers only to the decision making process.
Thus, all previous state discrimination experiments have been limited to LOCC measurements which may not attain the ultimate limits for distinguishing non-orthogonal mixed states. A major reason for this is that collective measurements are difficult to implement experimentally. Indeed, although collective measurements are known to aid a range of tasks in quantum information, including quantum metrology25, Bell violations26 and entanglement distillation27, they have only recently been experimentally demonstrated28,29,30. (It is worth noting that there are other tasks which benefit from measurements in an entangled basis, not necessarily on multiple copies of the same quantum state, including some quantum metrology problems31, quantum orienteering32,33,34 and quantum communications35,36.) The advantage of collective measurements is thus far restricted to performing collective measurements on only two copies of a quantum state30. Previous investigations into the use of collective measurements for state discrimination suggest that collective measurements only offer an advantage over LOCC measurements when measuring at least three copies of the quantum state simultaneously10,11,23. However, as we shall show, this is only true when the prior probabilities for the unknown state being either ρ+ or ρ− are equal.
In this work, we bypass these difficulties and experimentally demonstrate state discrimination enhanced by collective measurements. That is, we implement a collective measurement which distinguishes between two copies of a qubit state with some known prior probability, either \({\rho }_{+}^{\otimes 2}\) or \({\rho }_{-}^{\otimes 2}\), with an error probability lower than what is possible by any LOCC measurement on the same states. A conceptual schematic of both two-copy LOCC and two-copy collective measurements is shown in Fig. 1. To realise our goal, we first find a regime where two copy collective measurements are able to outperform any LOCC measurement. This is done through the dynamic programming approach introduced in previous works23. We then convert the optimal collective measurements to quantum circuits using existing techniques30,37. The same process is followed when implementing three- and four-collective measurements. Finally, these quantum circuits are implemented on the Fraunhofer IBM Q System One (F-IBM QS1) processor. This is in line with a recent trend of using such processors to test otherwise hard to reach aspects of quantum physics, such as quantum metrology30,38, quantum foundations39,40,41, quantum chemistry42,43, quantum optics44 and quantum network simulations45.
Results
Theoretical results
Theoretical model
We follow the model of Higgins et al.11, where we wish to discriminate between the two qubit states described by
where \({{\mathbb{I}}}_{2}\) is the 2 × 2 identity matrix, σi denotes the ith Pauli matrix, and v and α describe the extent to which the state is mixed and the angle between the two states in Hilbert space respectively. Note that v = 0 corresponds to a pure state and v = 1 represents the maximally mixed state. Given M copies of the above state, \({\rho }_{\pm }^{\otimes M}\), our task is to decide which state we are given with the minimum probability of error. Denoting the prior probability for the unknown state to be the state ρ+ as q, the error probability is given by
where P−∣+ is the probability of guessing the state ρ− when given the state ρ+ and P+∣− is similarly defined.
Optimal collective measurement
In general, the optimal measurement to distinguish \({\rho }_{\pm }^{\otimes M}\), will be a collective measurement that involves entangling operations between all M modes. The minimum error probability, in this case, is given by the Helstrom bound1
where Pe,Col denotes the error probability which can be attained by collective measurements and ∥A∥ is the sum of the absolute values of the eigenvalues of A. It is known that the Helstrom bound can be saturated by measuring the following observable, which may or may not correspond to a collective measurement
The state ρ± is guessed according to the sign of the measurement output. Note that, in some scenarios, Γ will be either positive or negative meaning that the best strategy is always simply to guess the corresponding state. In practice, we implement the operator Γ, through a positive operator valued measure (POVM). A POVM is a set of positive operators {Πk ≥ 0}, which sum to the identity \({\sum }_{k}{{{\Pi }}}_{k}={\mathbb{I}}\). In general, to experimentally implement an arbitrary POVM, Naimark’s theorem46 is used to convert the POVM to a projective measurement in a higher dimensional Hilbert space. However, it transpires that for the purposes of this work, the number of POVM elements necessary to saturate Helstrom’s bound is less than or equal to the dimensions of the Hilbert space and so Naimark’s theorem is not needed. Using the optimal measurement, given in Eq. (4), and the definition of error probability in Eq. (2), we can verify that the Helstrom bound becomes (1 − ∥Γ∥)/2, as expected from Eq. (3)47. In general, the POVM required to implement Γ will correspond to a collective measurement. In this work we implement two-copy collective measurements, as depicted in Fig. 1b).
Optimal separable measurement
A separable measurement is any measurement where entangling operations are not allowed, i.e. only LOCC are allowed. Although there are many different types of LOCC measurements11, for the purposes of this work, we need only consider the optimal separable measurement. In general, this requires measurements that are optimised depending on the number of copies available. When finding the optimal LOCC measurement for a large number of copies, it can be beneficial to use a dynamic programming approach23. As we are concerned with LOCC measurements on only a small number of copies of the state it is easy to verify the optimal measurement by a brute force computation. A description of the simulation approaches used to find the optimal LOCC measurements is provided in the methods section.
For the scenario we are considering, the individual measurements are parametrised by a single angle. We need only consider the measurements defined by the projectors \({{{\Pi }}}_{0}=\left\vert \psi \right\rangle \left\langle \psi \right\vert\) and \({{{\Pi }}}_{1}=\left\vert {\psi }^{\perp }\right\rangle \left\langle {\psi }^{\perp }\right\vert\) where
and \(\left\langle \psi \right\vert \left\vert {\psi }^{\perp }\right\rangle =0\). For two-copy LOCC measurements the optimal angle used in the second measurement will depend on the measurement outcome of the first POVM as shown in Fig. 1a). Either Π0 or Π1 will click in the first measurement, giving two different posterior probabilities, which will each have their own optimal measurement angle. After the second measurement the posterior probabilities are updated again and the more likely state is chosen as our guess. Therefore, the optimal two-copy LOCC measurement is described by three measurement angles, which can be numerically optimised to find the minimum expected LOCC error probability.
Gap between collective and separable measurements
Knowledge of the optimal separable and collective two-copy measurements enables us to find an experimentally feasible regime for demonstrating the advantage of collective measurements. This is done by operating in the regime of unequal priors, i.e. q ≠ 0.5. This operating regime was found through the rather surprising observation that at q = 0.5, for two copies, LOCC measurements perform the same as collective measurements but for three copies collective measurements outperform LOCC measurements. The expected error probabilities for both collective and LOCC measurements for distinguishing two copies and three copies of the quantum state are shown in Fig. 2a). To investigate this behaviour further, we define the gap between LOCC measurements and collective measurements for M copies of the quantum state (in terms of minimum attainable error probability), as
where Pe,LOCC(M) corresponds to the minimum error probability which can be attained with LOCC measurements given M copies of the unknown state, \({\rho }_{\pm }^{\otimes M}\). We plot this quantity in Fig. 2b) for a particular value of α and v. Further plots of Δ for different sets of α and v values are presented in Supplementary Note 1. The optimal LOCC measurement is obtained using dynamic programming, with 2501 entries in the measurement angle and error probability tables. The number of entries in these tables corresponds to how discretised the space of possible measurement angles is. A greater number of entries therefore corresponds to greater numerical accuracy. 2501 entries was found to be a sufficiently large number of entries to ensure the optimality of our solutions to 9 significant figures. Although, the differences between two and three-copy measurements in Fig. 2 are interesting in and of itself, the key take-away here is that two-copy collective measurements can offer an advantage over LOCC measurements when q ≠ 0.5. This is important as two-copy collective measurements are at the limit of what is experimentally feasible30.
Experimental Results
Two-copy collective measurement results
It is always possible to saturate the Helstrom bound by implementing the observable given in Eq. (4). However, mapping this observable to an experimental set-up is not straightforward. To circumvent this, we numerically find a projective measurement that saturates the Helstrom bound. From this, the unitary matrix we need to implement can be obtained30. Finally, we convert the necessary unitary matrix to experimentally implementable quantum circuits using a known decomposition37. This involves finding 15 free parameters and requires only three CNOT gates as is shown in Fig. 1c). We then implement these circuits on the F-IBM QS1 processor. When measuring in the computational basis there are four possible measurement outcomes, \(\left\vert 00\right\rangle ,\left\vert 01\right\rangle ,\left\vert 10\right\rangle\) and \(\left\vert 11\right\rangle\).
We assign the outcome \(\left\vert 00\right\rangle\) to the state ρ− and the remaining outcomes are assigned to the state ρ+, i.e. if the circuit output is \(\left\vert 00\right\rangle\) we guess that the unknown state was ρ−, for all other measurement results we guess ρ+. By preparing the states ρ+ and ρ− many times, the average error probability can be extracted. We repeat this for several different prior probabilities using an optimised POVM for each prior. For each prior probability, we use 200,000 shots, to ensure we obtain an accurate estimate of the average error probability. The results of these experiments are shown in Fig. 3 for three different sets of α and v values. The red shaded regions in Fig. 3 correspond to the minimal error probability which can be achieved by any LOCC measurement. The blue shaded regions correspond to the error probability which can be attained by the optimal collective measurements. In theory, our quantum circuits should be able to reach the minimum error probability set by the blue line. However, as can be seen in Fig. 3 our experiment does not reach the theoretical collective measurement limit. This is due to a combination of gate errors and readout error in the F-IBM QS1 device. Nevertheless, in several instances our collective measurements surpass what is possible by LOCC measurements. For example, the two data points shown in the inset of Fig. 3 surpass the expected error probability attainable by LOCC measurements by more than six standard deviations. To the best of our knowledge, this is the first time this has been achieved for quantum state discrimination.
However, we note that not all of our experiments were successful in showing the advantage of collective measurements. For some values of α and v, our collective measurements achieved an error probability that was comparable to the best LOCC measurement. These data points are included in Supplementary Note 2.
Simulation of two-copy collective measurement with noise
We now present a noisy simulation of one particular implementation of our two-copy collective measurement to provide an indication of the noise level needed to reach the Helstrom bound in future experiments. We use IBM Q’s QISKIT package to model the noise, which includes readout error and depolarising noise on all gates. We choose a starting noise level that approximates the device used in our experiments: single qubit gate error rates of 10−3, two qubit gate error rates of 10−2, \(\left\vert 0\right\rangle\) state readout error of 10−2 and \(\left\vert 1\right\rangle\) state readout error of 2 × 10−2. With these parameters, we model the error probability which can be attained for v = 0.1, α = π/4 and q = 0.75. The simulation was then repeated, scaling all the error rates by a noise scaling term, as shown in Fig. 4. As expected, when the noise is scaled down sufficiently, the two-copy collective measurement approaches the Helstrom bound. These simulations suggest that an improvement in error rates by approximately one order of magnitude would allow the two-copy Helstrom bound to be saturated. However, this comes with the caveat that the noise model used may be missing important features.
Three- and four-copy collective measurements
Finally, we extend the above results to three- and four-copy collective measurements. The three- and four-copy measurements that we implement were found by searching for projective measurements in a three and four-qubit Hilbert space respectively. In the ideal case, the three-copy measurement found is able to saturate the three-copy Helstrom bound. The four-copy measurement cannot saturate the four-copy Helstrom bound, however, it can surpass the optimal four-copy LOCC measurement. To saturate the four-copy Helstrom bound with projective measurements would likely require ancilla qubits, which would significantly increase the complexity of the corresponding quantum circuit. For v = 0.1, α = π/4 and q = 0.75, we implemented these three- and four-copy measurements on the F-IBM QS1 device, with the results presented in Fig. 5. Notably, both the three- and four-copy measurement perform worse than measuring only a single qubit. This suggests that when given many copies of a state, rather than trying to implement a very complex entangling measurement, it is better to measure the quantum states in smaller groups. Even in an optimistic scenario, we will need an order of magnitude reduction in noise levels for the four-copy entangling measurement to be useful. However, it should be noted that if it was known in advance that our measurement device is extremely noisy, we can always attain an error probability of 0.25 as, in this case, we can simply ignore our measurement results and guess the more likely state.
In contrast to the three-copy experimental results, the simulation of the three-copy measurement, using the same noise parameters as the previous section, performed quite well. This highlights the limitations of our noise model, particularly for circuits involving larger numbers of qubits. For example, qubit connectivity becomes an important factor in practical three-copy measurements. There is also a significant gap between the experimental results and the noisy simulation in the four-copy case. These experiments and simulations suggest that while it is possible to surpass the LOCC limits using two-copy collective measurements, the ultimate limits in state discrimination shall remain out of reach for the foreseeable future.
Conclusion
Recent experimental advances have led to collective measurements offering an advantage in several areas of quantum information28,29,30,48,49,50,51. However, prior to this work, this advantage had not been extended to quantum state discrimination. By utilising the F-IBM QS1 superconducting processor and operating in the regime of unequal prior probabilities, we have been able to experimentally distinguish two copies of two quantum states with an error probability smaller than the best possible LOCC measurement. The further development of this capability may aid numerous applications of quantum state discrimination, including quantum illumination52,53,54,55 and exoplanet detection56.
There are several natural avenues for extending this work. In this work, we have taken, as our figure of merit, the average error in distinguishing two states, but several other figures of merit are commonly used57,58, including unambiguous state discrimination59,60, asymmetric state discrimination61 and state discrimination using the minimum number of copies62. When decomposing the three- and four-copy measurement circuits, we simply used the default decomposition provided on QISKIT. It may be possible to obtain an approximate circuit with a similar theoretical minimum error probability, but requiring a greatly reduced number of CNOT gates63. Furthermore, this work may be extended to examine the role of collective measurements when distinguishing more than two states64 or for distinguishing states which live in a larger Hilbert space, as has been done for two qubit states65. In this work, we have experimentally investigated the role of collective measurements for only a small number of copies of the quantum state. However, going beyond the few-copy setting and investigating the asymptotic attainability of the ultimate limits in quantum state discrimination, as has recently been done in quantum metrology66, may reveal other important features of state discrimination.
Note added: While this manuscript was under review we became aware of new work where two-copy collective measurements were used for minimum consumption state discrimination67.
Methods
Details of numerical simulations for finding the optimal LOCC measurement
Here we give a detailed description of how the expected error probabilities attainable by LOCC measurements are computed. We first describe the dynamic programming approach used in previous works10,11,23. This technique allows us to break the overall optimisation problem into smaller optimisation problems which can be solved in turn. We wish to find the measurement angles which minimise the expected probability of error when allowing LOCC measurements on multiple copies of the state ρ.
We define qi as the probability that the unknown state is the state ρ+ just before performing the ith measurement. Hence, the initial prior probability that the unknown state is ρ+, which is denoted q in the main text, is denoted q1 in this section. After performing each measurement, the posterior probability of the unknown state being ρ+ will change, depending on the measurement result. At each stage, we wish to find the optimal angle ϕ for the measurement given by Eq. (5). The optimal angle for the ith measurement, ϕi, is that which minimises the average error probability and will depend on the number of copies available M and the prior probability qi. For every measurement there are two possible outcomes, \({{{\Pi }}}_{0}(\phi )=\left\vert \psi \right\rangle \left\langle \psi \right\vert\) or \({{{\Pi }}}_{1}(\phi )=\left\vert {\psi }^{\perp }\right\rangle \left\langle {\psi }^{\perp }\right\vert\), where we have made the dependence on ϕ explicit. The probability of each outcome is given by \({{{{{{{\rm{tr}}}}}}}}\{\rho {{{\Pi }}}_{i}\}\). We shall denote the outcome of the ith measurement as Di, so that Di can correspond to either Π0 or Π1 clicking. Given the measurement outcome Di, the posterior probability after performing the ith measurement (or equivalently the prior probability for the following measurement) is given by
where Pr[Di∣a] is the probability of observing the measurement outcome Di given the conditions a.
Given M total states to measure, we can measure m (m ≤ M) states to obtain an intermediate error probability. We denote the expected error probability (with M − m states available to measure) as Rm. Using this notation, RM is the error probability when there are no states left to measure. At this point, the optimal strategy is simply to guess whichever state is more likely, so that
Note that at each measurement stage Rm depends on qm+1, which is determined by the preceding measurement angles ϕ1, ϕ2(D1), ϕ3(D1, D2)…ϕM(D1, D2, . . , DM−1). The expected error probability at each previous measurement step can be calculated from the error probability at the current step
Our aim is to minimise the expected error probability when all M copies of the quantum state are available to measure, denoted R0. If we have only a single copy of the quantum state left to measure, the optimal measurement angle is known to be11
This allows RM−1 to be calculated. RM−2 can then be calculated by minimising Eq. (9). Each measurement stage can be recursively optimised in this manner. Continuing in this manner gives R0(q1) as the expected error probability.
Dynamic programming offers an efficient way to compute the optimal angles. In the two-copy case it is possible to do a brute force search for the optimal angles to verify the correctness of our simulations. A simple expression for the expected error probability in the two-copy case is given by
where \({p}_{i}^{1}\) is the probability of the POVM Πi clicking, \({p}_{i| j}^{2,1}\) is the probability of the POVM Πi clicking in the second measurement given that the POVM Πj clicked in the first measurement and q2∣ij is the posterior probability when Πi clicked in the first measurement and Πj clicked in the second measurement. By numerically searching over all angles we can verify the correctness of our results in the two-copy case. However, even in the three-copy case a numerical search is already very slow compared to dynamic programming.
Finally, we note that in Figs. 2 and 3 we can observe points where the gradient of the LOCC error probability is not continuous. It is worth noting that the discrete nature of Eq. (8) is responsible for this behaviour.
Data availability
All data are available at the following Github repository: https://github.com/LorcanConlon/State_Discrimination_Collective_Measurements.
Code availability
All codes are available at the following Github repository: https://github.com/LorcanConlon/State_Discrimination_Collective_Measurements.
References
Helstrom, C. W. Quantum detection and estimation theory. J. Stat. Phys. 1, 231–252 (1969).
Wootters, W. K. & Zurek, W. H. A single quantum cannot be cloned. Nature 299, 802–803 (1982).
Walgate, J., Short, A. J., Hardy, L. & Vedral, V. Local distinguishability of multipartite orthogonal quantum states. Phys. Rev. Lett. 85, 4972 (2000).
Peres, A. & Wootters, W. K. Optimal detection of quantum information. Phys. Rev. Lett. 66, 1119 (1991).
Massar, S. & Popescu, S. Optimal extraction of information from finite quantum ensembles. Phys. Rev. Lett. 74, 1259 (1995).
Brody, D. & Meister, B. Minimum decision cost for quantum ensembles. Phys. Rev. Lett. 76, 1 (1996).
Ban, M., Yamazaki, K. & Hirota, O. Accessible information in combined and sequential quantum measurementson a binary-state signal. Phys. Rev. A 55, 22 (1997).
Acín, A., Bagan, E., Baig, M., Masanes, L. & Munoz-Tapia, R. Multiple-copy two-state discrimination with individual measurements. Phys. Rev. A 71, 032338 (2005).
Calsamiglia, J., Munoz-Tapia, R., Masanes, L., Acin, A. & Bagan, E. Quantum chernoff bound as a measure of distinguishability between density matrices: application to qubit and gaussian states. Phys. Rev. A 77, 032311 (2008).
Calsamiglia, J., De Vicente, J., Muñoz-Tapia, R. & Bagan, E. Local discrimination of mixed states. Phys. Rev. Lett. 105, 080504 (2010).
Higgins, B., Doherty, A., Bartlett, S., Pryde, G. & Wiseman, H. Multiple-copy state discrimination: thinking globally, acting locally. Phys. Rev. A 83, 052314 (2011).
Flatt, K., Barnett, S. M. & Croke, S. Multiple-copy state discrimination of noisy qubits. Phys. Rev. A 100, 032122 (2019).
Cook, R. L., Martin, P. J. & Geremia, J. M. Optical coherent state discrimination using a closed-loop quantum measurement. Nature 446, 774–777 (2007).
Wittmann, C. et al. Demonstration of near-optimal discrimination of optical coherent states. Phys. Rev. Lett. 101, 210501 (2008).
Bartůšková, L., Černoch, A., Soubusta, J. & Dušek, M. Programmable discriminator of coherent states: experimental realization. Phys. Rev. A 77, 034306 (2008).
Waldherr, G. et al. Distinguishing between nonorthogonal quantum states of a single nuclear spin. Phys. Rev. Lett. 109, 180501 (2012).
Becerra, F., Fan, J. & Migdall, A. Implementation of generalized quantum measurements for unambiguous discrimination of multiple non-orthogonal coherent states. Nat. Commun. 4, 1–6 (2013).
Izumi, S., Neergaard-Nielsen, J. S., Miki, S., Terai, H. & Andersen, U. L. Experimental demonstration of a quantum receiver beating the standard quantum limit at telecom wavelength. Phys. Rev. Appl. 13, 054015 (2020).
Izumi, S., Neergaard-Nielsen, J. S. & Andersen, U. L. Adaptive generalized measurement for unambiguous state discrimination of quaternary phase-shift-keying coherent states. PRX Quant. 2, 020305 (2021).
Sidhu, J. S., Izumi, S., Neergaard-Nielsen, J. S., Lupo, C. & Andersen, U. L. Quantum receiver for phase-shift keying at the single-photon level. PRX Quant. 2, 010332 (2021).
Gómez, S. et al. Experimental quantum state discrimination using the optimal fixed rate of inconclusive outcomes strategy. Sci. Rep. 12, 17312 (2022).
Becerra, F. et al. Experimental demonstration of a receiver beating the standard quantum limit for multiple nonorthogonal state discrimination. Nat. Photon. 7, 147–152 (2013).
Higgins, B. et al. Mixed state discrimination using optimal control. Phys. Rev. Lett. 103, 220503 (2009).
Jagannathan, A. et al. Demonstration of quantum-limited discrimination of multicopy pure versus mixed states. Phys. Rev. A 105, 032446 (2022).
Conlon, L. O., Suzuki, J., Lam, P. K. & Assad, S. M. Efficient computation of the nagaoka–hayashi bound for multiparameter estimation with separable measurements. npj Quant. Inf. 7, 110 (2021).
Liang, Y.-C. & Doherty, A. C. Better bell-inequality violation by collective measurements. Phys. Rev. A 73, 052116 (2006).
Bennett, C. H. et al. Purification of noisy entanglement and faithful teleportation via noisy channels. Phys. Rev. Lett. 76, 722 (1996).
Roccia, E. et al. Entangling measurements for multiparameter estimation with two qubits. Quant. Sci. Technol. 3, 01LT01 (2017).
Hou, Z. et al. Deterministic realization of collective measurements via photonic quantum walks. Nat. Commun. 9, 1–7 (2018).
Conlon, L. O. et al. Approaching optimal entangling collective measurements on quantum computing platforms. Nat. Phys. 19, 351–357 (2023).
Marciniak, C. D. et al. Optimal metrology with programmable quantum sensors. Nature 603, 604–609 (2022).
Gisin, N. & Popescu, S. Spin flips and quantum information for antiparallel spins. Phys. Rev. Lett. 83, 432 (1999).
Jeffrey, E. R., Altepeter, J. B., Colci, M. & Kwiat, P. G. Optical implementation of quantum orienteering. Phys. Rev. Lett. 96, 150503 (2006).
Tang, J.-F. et al. Experimental optimal orienteering via parallel and antiparallel spins. Phys. Rev. Lett. 124, 060502 (2020).
Delaney, C. et al. Demonstration of a quantum advantage by a joint detection receiver for optical communication using quantum belief propagation on a trapped-ion device. Phys. Rev. A 106, 032613 (2022).
Crossman, J., Dimitroff, S., Cincio, L. & Sarovar, M. Quantum computer-enabled receivers for optical communication. arXiv preprint arXiv:2309.15914 (2023).
Vatan, F. & Williams, C. Optimal quantum circuits for general two-qubit gates. Phys. Rev. A 69, 032315 (2004).
Li, B., Conlon, L. O., Lam, P. K. & Assad, S. M. Optimal single-qubit tomography: Realization of locally optimal measurements on a quantum computer. Phys. Rev. A 108, 032605 (2023).
Alsina, D. & Latorre, J. I. Experimental test of mermin inequalities on a five-qubit quantum computer. Phys. Rev. A 94, 012314 (2016).
Ku, H.-Y. et al. Experimental test of non-macrorealistic cat states in the cloud. npj Quant. Inf. 6, 98 (2020).
Sadana, S., Maccone, L. & Sinha, U. Testing quantum foundations with quantum computers. Phys. Rev. Res. 4, L022001 (2022).
Kandala, A. et al. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. Nature 549, 242–246 (2017).
Kandala, A. et al. Error mitigation extends the computational reach of a noisy quantum processor. Nature 567, 491–495 (2019).
Cholsuk, C., Davani, S., Conlon, L. O., Vogl, T. & Eilenberger, F. Efficient light propagation algorithm using quantum computers. arXiv preprint arXiv:2303.07032 (2023).
Bäumer, E., Gisin, N. & Tavakoli, A. Demonstrating the power of quantum computers, certification of highly entangled measurements and scalable quantum nonlocality. npj Quant. Inf. 7, 117 (2021).
Neumark, M. On spectral functions of a symmetric operator. Izv. Rossiiskoi Akad. Nauk. Seriya Matematicheskaya 7, 285–296 (1943).
Bergou, J. A. Discrimination of quantum states. J. Mod. Opt. 57, 160–180 (2010).
Parniak, M. et al. Beating the Rayleigh limit using two-photon interference. Phys. Rev. Lett. 121, 250503 (2018).
Wu, K.-D. et al. Experimentally reducing the quantum measurement back action in work distributions by a collective measurement. Sci. Adv. 5, eaav4944 (2019).
Yuan, Y. et al. Direct estimation of quantum coherence by collective measurements. npj Quant. Inf. 6, 1–5 (2020).
Wu, K.-D. et al. Minimizing backaction through entangled measurements. Phys. Rev. Lett. 125, 210401 (2020).
Lloyd, S. Enhanced sensitivity of photodetection via quantum illumination. Science 321, 1463–1465 (2008).
Tan, S.-H. et al. Quantum illumination with gaussian states. Phys. Rev. Lett. 101, 253601 (2008).
Bradshaw, M. et al. Optimal probes for continuous-variable quantum illumination. Phys. Rev. A 103, 062413 (2021).
Pirandola, S., Bardhan, B. R., Gehring, T., Weedbrook, C. & Lloyd, S. Advances in photonic quantum sensing. Nat. Photon. 12, 724–733 (2018).
Huang, Z. & Lupo, C. Quantum hypothesis testing for exoplanet detection. Phys. Rev. Lett. 127, 130502 (2021).
Barnett, S. M. & Croke, S. Quantum state discrimination. Adv. Opt. Photon. 1, 238–278 (2009).
Bae, J. & Kwek, L.-C. Quantum state discrimination and its applications. J. Phys. A: Math. Theor. 48, 083001 (2015).
Ivanovic, I. D. How to differentiate between non-orthogonal states. Phys. Lett. A 123, 257–259 (1987).
Dieks, D. Overlap and distinguishability of quantum states. Phys. Lett. A 126, 303–306 (1988).
Karsa, A., Spedalieri, G., Zhuang, Q. & Pirandola, S. Quantum illumination with a generic gaussian source. Phys. Rev. Res. 2, 023414 (2020).
Slussarenko, S. et al. Quantum state discrimination using the minimum average number of copies. Phys. Rev. Lett. 118, 030502 (2017).
Gundlapalli, P. & Lee, J. Deterministic and entanglement-efficient preparation of amplitude-encoded quantum registers. Phys. Rev. Appl. 18, 024013 (2022).
Andersson, E., Barnett, S. M., Gilson, C. R. & Hunter, K. Minimum-error discrimination between three mirror-symmetric states. Phys. Rev. A 65, 052308 (2002).
Patterson, A. et al. Quantum state discrimination using noisy quantum neural networks. Phys. Rev. Res. 3, 013063 (2021).
Conlon, L. O., Suzuki, J., Lam, P. K. & Assad, S. M. The gap persistence theorem for quantum multiparameter estimation. arXiv preprint arXiv:2208.07386 (2022).
Tian, B. et al. Minimum-consumption state discrimination with global optimal adaptive measurements. arXiv preprint arXiv:2307.16347 (2023).
Acknowledgements
We acknowledge the use of IBM Quantum services for this work. The views expressed are those of the authors, and do not reflect the official policy or position of IBM or the IBM Quantum team. This research was funded by the Australian Research Council Centre of Excellence CE170100012, Laureate Fellowship FL150100019 and the Australian Government Research Training Program Scholarship. This research is supported by A*STAR C230917010, Emerging Technology and A*STAR C230917004, Quantum Sensing. This work has been supported by the Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V via the QuantumNow programme and the German Federal Ministry of Education and Research, FKZ: 13XP5053A. This work was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of CRC 1375 NOA.
Author information
Authors and Affiliations
Contributions
L.O.C. conceived the project. L.O.C. and S.M.A. derived the theoretical results and designed the optimal quantum circuits. L.O.C. and F.E. ran the experiments. L.O.C. performed the data analysis. L.O.C. wrote the manuscript with contributions from all authors (F.E., P.K.L. and S.M.A.).
Corresponding authors
Ethics declarations
Competing interests
The authors declare no competing interests.
Peer review
Peer review information
Communications Physics thanks Zhibo Hou and the other, anonymous, reviewer(s) for their contribution to the peer review of this work. A peer review file is available.
Additional information
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Conlon, L.O., Eilenberger, F., Lam, P.K. et al. Discriminating mixed qubit states with collective measurements. Commun Phys 6, 337 (2023). https://doi.org/10.1038/s42005-023-01454-z
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s42005-023-01454-z
- Springer Nature Limited
This article is cited by
-
Verifying the security of a continuous variable quantum communication protocol via quantum metrology
npj Quantum Information (2024)