Distinguishing quantum states via separable measurements
As previously mentioned, optimizing over the set of separable measurements is NP-hard. However, there does exist a hierarchy of semidefinite programs which eventually does converge to the separable value. This hierarchy is based off the notion of symmetric extensions. More information about this hierarchy of SDPs can be found here [Nav08].
Minimum-error distinguishability via separable measurements
Entanglement cost of distinguishing Bell states
One may ask whether the ability to distinguish a state can be improved by making use of an auxiliary resource state.
for some \(\epsilon \in [0,1]\).
Distinguishing four Bell states
It was shown in [BCJRWY15] that the probability of distinguishing four Bell states with a resource state via separable measurements is given by the closed-form expression:
where the ensemble is defined as
Using qustop
, we may encode this scenario as follows.
1import numpy as np
2from toqito.states import basis, bell
3
4from qustop import Ensemble, OptDist, State
5
6e_0, e_1 = basis(2, 0), basis(2, 1)
7
8eps = 0.5
9tau = np.sqrt((1 + eps) / 2) * np.kron(e_0, e_0) + np.sqrt(
10 (1 - eps) / 2
11) * np.kron(e_1, e_1)
12
13dims = [2, 2, 2, 2]
14ensemble = Ensemble(
15 [
16 State(np.kron(bell(0), tau), dims),
17 State(np.kron(bell(1), tau), dims),
18 State(np.kron(bell(2), tau), dims),
19 State(np.kron(bell(3), tau), dims),
20 ],
21 [1 / 4, 1 / 4, 1 / 4, 1 / 4],
22)
23
24ppt_res = OptDist(ensemble, "ppt", "min-error")
25ppt_res.solve()
26
27sep_res = OptDist(ensemble, "sep", "min-error")
28sep_res.solve()
29
30eq = 1 / 2 * (1 + np.sqrt(1 - eps ** 2))
31
32# 0.9330127018922193
33print(eq)
34# 0.9330127016540999
35print(ppt_res.value)
36# 0.9330127016540999
37print(sep_res.value)
Note that [BCJRWY15] also proved the same closed-form expression for when Alice and Bob make use of PPT measurements (which is an upper bound for separable measurements). More on that in the tutorial on distinguishing via PPT measurements.
Distinguishing three Bell states
It was also shown in [BCJRWY15] that the closed-form probability of distinguishing three Bell states with a resource state using separable measurements to be given by the closed-form expression:
where the ensemble is defined as
Using qustop
, we may encode this scenario as follows.
1import numpy as np
2from toqito.states import basis, bell
3
4from qustop import Ensemble, OptDist, State
5
6e_0, e_1 = basis(2, 0), basis(2, 1)
7
8eps = 0.5
9tau = np.sqrt((1 + eps) / 2) * np.kron(e_0, e_0) + np.sqrt(
10 (1 - eps) / 2
11) * np.kron(e_1, e_1)
12
13dims = [2, 2, 2, 2]
14states = [
15 State(np.kron(bell(0), tau), dims),
16 State(np.kron(bell(1), tau), dims),
17 State(np.kron(bell(2), tau), dims),
18]
19probs = [1 / 3, 1 / 3, 1 / 3]
20ensemble = Ensemble(states, probs)
21ensemble.swap([2, 3])
22
23sep_res = OptDist(ensemble, "sep", "min-error", level=2)
24sep_res.solve()
25
26eq = 1 / 3 * (2 + np.sqrt(1 - eps ** 2))
27
28# 0.9553418012614794
29print(eq)
30
31# 0.9583970406126399
32print(sep_res.value)
Note that the value of sep_res.value
is actually a bit higher than eq
. This is because the separable
value is calculated by a hierarchy of SDPs. At low levels of the SDP, the problem can often converge to the optimal
value, but other times it is necessary to compute higher levels of the SDP to eventually arrive at the optimal value.
While this is intractable in general, in practice, the SDP can often converge, or at least get fairly close to the
optimal value for small problem sizes.
Unextendible product bases and separable measurements
For complex Euclidean spaces \(\mathcal{X}\) and \(\mathcal{Y}\), an unextendable product basis is defined as an orthonormal collection of vectors
for unit vectors \(u_1, \ldots, u_m \in \mathcal{X}\) and \(v_1, \ldots, v_m \in \mathcal{Y}\) where:
\(m < \text{dim}(\mathcal{X} \otimes \mathcal{Y})\).
2. For every \(x \in \mathcal{X}\) and \(y \in \mathcal{Y}\) satisfying \(x \otimes y \perp \mathcal{U}\) it holds that \(x \otimes y = 0\).
All UPBs are known to be indistinguishable by LOCC measurements and all UPBs are distinguishable by PPT measurements. As separable measurements lie in between LOCC and PPT measurements, it is of interest to know which UPBs are distinguishable by separable measurements.
For instance, in [DMSST99], it was shown that all UPBs in \(\mathbb{C}^3 \otimes \mathbb{C}^3\) are perfectly distinguishable via separable measurements.
Consider the “Tiles” UPB
Note that the “Tiles” states are contained in \(\mathbb{C}^3 \otimes \mathbb{C}^3\). We can use qustop
to
indeed verify that these states are perfectly distinguishable via separable measurements.
1from toqito.states import basis, tile
2
3from qustop import Ensemble, OptDist, State
4
5# Construct the corresponding density matrices of the Tiles UPB.
6dims = [3, 3]
7ensemble = Ensemble(
8 [
9 State(tile(0) * tile(0).conj().T, dims),
10 State(tile(1) * tile(1).conj().T, dims),
11 State(tile(2) * tile(2).conj().T, dims),
12 State(tile(3) * tile(3).conj().T, dims),
13 State(tile(4) * tile(4).conj().T, dims),
14 ]
15)
16res = OptDist(ensemble, "sep", "min-error", level=2)
17res.solve()
18
19# 0.999999
20print(res.value)
In [BCJRWY15], it was shown that the 8-state UPB contained in \(\mathbb{C}^4 \otimes \mathbb{C}^4\) introduced in [Feng06] defined as
is not perfectly distinguishable via separable measurements. This can be observed using qustop
as follows.
1import numpy as np
2from toqito.states import basis
3
4from qustop import Ensemble, OptDist, State
5
6e_0, e_1, e_2, e_3 = basis(4, 0), basis(4, 1), basis(4, 2), basis(4, 3)
7
8phi_1 = np.kron(e_0, e_0)
9phi_2 = np.kron(e_1, (e_0 - e_2 + e_3) / np.sqrt(3))
10phi_3 = np.kron(e_2, (e_0 + e_1 - e_3) / np.sqrt(3))
11phi_4 = np.kron(e_3, e_3)
12phi_5 = np.kron((e_1 + e_2 + e_3), (e_0 - e_1 + e_2) / 3)
13phi_6 = np.kron((e_0 - e_2 + e_3), e_2 / np.sqrt(3))
14phi_7 = np.kron((e_0 + e_1 - e_3), e_1 / np.sqrt(3))
15phi_8 = np.kron((e_0 - e_1 + e_2), (e_1 + e_2 + e_3) / 3)
16
17dims = [4, 4]
18ensemble = Ensemble(
19 [
20 State(phi_1, dims),
21 State(phi_2, dims),
22 State(phi_3, dims),
23 State(phi_4, dims),
24 State(phi_5, dims),
25 State(phi_6, dims),
26 State(phi_7, dims),
27 State(phi_8, dims),
28 ]
29)
30res = OptDist(ensemble, "sep", "min-error", level=2)
31res.solve()
32
33# 0.9967296337698935
34print(res.value)
Impossibility to distinguish a UPB plus one extra pure state
It was shown in [BCJRWY15] that if we consider an ensemble of states consisting of a UPB along with a pure state that is orthogonal to all states in said ensemble, then it is impossible to perfectly distinguish this ensemble.
1import numpy as np
2from toqito.states import basis, tile
3
4from qustop import Ensemble, OptDist, State
5
6dims = [3, 3]
7e_0, e_1, e_2 = basis(3, 0), basis(3, 1), basis(3, 2)
8
9# Define a pure state to add to the ensemble.
10psi = (
11 1
12 / 2
13 * (
14 np.kron(e_0, e_0)
15 + np.kron(e_0, e_1)
16 - np.kron(e_0, e_2)
17 - np.kron(e_1, e_2)
18 )
19)
20
21# Construct the corresponding density matrices of the Tiles UPB + pure state:
22ensemble = Ensemble(
23 [
24 State(tile(0) * tile(0).conj().T, dims),
25 State(tile(1) * tile(1).conj().T, dims),
26 State(tile(2) * tile(2).conj().T, dims),
27 State(tile(3) * tile(3).conj().T, dims),
28 State(tile(4) * tile(4).conj().T, dims),
29 State(psi * psi.conj().T, dims),
30 ]
31)
32
33res = OptDist(ensemble, "sep", "min-error", level=2)
34res.solve()
35
36# 0.9860588510298623
37print(res.value)
References
Navascués, Miguel. “Pure state estimation and the characterization of entanglement.” Physical review letters 100.7 (2008): 070503. https://arxiv.org/abs/0707.4398
- DMSST99
DiVincenzo, David P., et al. “Unextendible product bases, uncompletable product bases and bound entanglement.” Communications in Mathematical Physics 238.3 (2003): 379-410.
- Feng06
Feng, Keqin. “Unextendible product bases and 1-factorization of complete graphs.” Discrete applied mathematics 154.6 (2006): 942-949.