Abstract
We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a set of non-local correlations that can only be achieved (quantumly) by that particular graph state and certain local measurements. The number of correlations considered is small, being linear in the number of vertices in the graph. We also prove robustness for the test.
Keywords
- Connected State Graph
- Reference Experiment
- Logical Qubit
- Measurement-based Quantum Computation
- CNOT Gate
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
We consider only pure states, but since the Hilbert space of the physical system has unbounded dimension we may easily add a purification to mixed states.
- 2.
The matrix may be constructed by taking the adjacency matrix of \(G^{\prime }\), which has a 1 in the \(u,v\) position when \((u,v) \in E^{\prime }\), replacing the diagonal with \(X\)s, the 0s with \(I\)s and the \(1\)s with \(Z\).
References
Diestel, R.: Graph theory. In: Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg. http://diestel-graph-theory.com/ (2010)
McKague, M., Mosca, M.: Generalized self-testing and the security of the 6-state protocol. In: van Dam, W., Kendon, V.M., Severini, S. (eds.) TQC 2010. LNCS, vol. 6519, pp. 113–130. Springer, Heidelberg (2011)
Magniez, F., Mayers, D., Mosca, M., Ollivier, H.: Self-testing of quantum circuits. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 72–83. Springer, Heidelberg (2006)
Mayers, D., Yao, A.: Self testing quantum apparatus. Quantum Inf. Comput. 4(4), 273–286 (2004). (http://arxiv.org/abs/quant-ph/0307205, http://www.rintonpress.com/journals/qiconline.html#v4n4)
Pironio, S., Acin, A., Massar, S., Boyer de la Giroday, A., Matsukevich, D.N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T.A., Monroe, C.: Random numbers certified by bell’s theorem. Nature 464(7291), 1021–1024 (2010). doi:10.1038/nature09008. (EPRINT aXiv:0911.3427)
Raussendorf, R., Briegel, H.J.: A one-way quantum computer. Phys. Rev. Lett. 86(22), 5188–5191 (2001). doi:10.1103/PhysRevLett.86.5188. (EPRINT arxiv:quant-ph/0010033)
van Dam, W., Magniez, F., Mosca, M., Santha, M.: Self-testing of universal and fault-tolerant sets of quantum gates. In: STOC ’00: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 688–696. ACM, New York. (2000). doi:10.1145/335305.335402. (EPRINT arxiv:quant-ph/9904108)
Acknowledgments
This work is funded by the Centre for Quantum Technologies, which is funded by the Singapore Ministry of Education and the Singapore National Research Foundation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Proof of Robustness for Reference Experiment 1
First we note that if \(\left\langle \psi \, \right| M\left| \, \psi \right\rangle \ge 1 - \epsilon \) then
Next, suppose that we have \(\left| \left| \left| \, \psi \right\rangle - M \left| \, \psi \right\rangle \right| \right| _{2} \le \alpha \) and \(\left| \left| \left| \, \psi \right\rangle - N \left| \, \psi \right\rangle \right| \right| _{2} \le \beta \). Using the triangle inequality and the fact that \(\left| \left| M\right| \right| _{\infty } = 1\) we have
The remainder of the proof will use these estimates repeatedly, along with the triangle inequality. We need only count the number of operators multiplied together.
First, for Lemma 3 let \(c\) be the size of the induced cycle. We multiply \(c+1\) operators together. Thus we conclude that for a vertex \(u\) in the induced cycle
Next, for Lemma 2 we multiply four operators, then invoke the anti-commuting property on one of the vertices. This gives
where \(\beta \) is \(\left| \left| X^{\prime }_{v}Z^{\prime }_{v} \left| \, \psi ^{\prime } \right\rangle + Z^{\prime }_{v}X^{\prime }_{v} \left| \, \psi ^{\prime } \right\rangle \right| \right| _{2}\), \(v\) being neighbouring vertex. We may apply Lemma 2 along paths from vertices in the induced cycle in \(G\). Let \(l\) be the length (number of edges) of the longest path. Then for any vertex \(u\) we find, at worst,
Lastly, for Lemma 5, we multiply \(|V^{\prime }|\) operators, and apply the anti-commuting relation \(|E^{\prime }|\) times. Thus
We are now ready to analyze the proof of the main theorem for reference experiment 1. To arrive at Eq. 46 we apply the anti-commutation relation. This happens once for each 1 appearing in \(x\), for each possible \(x\), for a total of \(n 2^{n-1}\) times. We may find this by pairing values \(x\) and \(x \oplus 111\dots 1\). There are \(2^{n-1}\) such pairs and each pair contains \(n\) 1s all together. We find
For Eq. 47 we use Lemma 5, once for each possible value of \(x\). Again, the estimate depends on the number of 1s in \(x\), summed over all possible \(x\)s. As well, it depends on the number of edges in the induced subgraph. An edge \((u,v)\) will be counted only when \(x_{u} = x_{v} = 1\). This occurs for \(1/4\) of all \(x\)s. Summed over all possible \(x\)s and edges, then, the number of times edges are counted is \(2^{n-2}|E|\). This gives our final estimate:
where \(e(x)\) is the number of edges in the induced subgraph on the set \(V_{x} = \{v \in V | x_{v} = 1\}\).
Note that when calculating \(\varPhi \left( X^{\prime }_{u} \left| \, \psi ^{\prime } \right\rangle \right) \) etc. we did not use any more estimations, we simply rearrange when Lemma 5 is applied. Thus the same robustness applies. For \(\varPhi \left( Z^{\prime }_{v} \left| \, \psi ^{\prime } \right\rangle \right) \) we use \((I + (-1)^{x_{v}} Z^{\prime }_{v}) Z^{\prime }_{v} = -(I + (-1)^{x_{v}} Z^{\prime }_{v})\), which does not involve an estimation, so again the same robustness applies.
As a last estimation, we note that \(l\) and \(c\) cannot be larger than \(n\), and \(|E| \le n^{2}\). We may thus set \(\delta = (5n^{2} + 11n + 4)n2^{n-2}\sqrt{2\epsilon }\).
Note that we may make much better estimates if some properties of the graph are known. For example, if every vertex lies in a triangle and the max degree is \(6\), as in the case of a lattice of triangles, we may instead set \(\delta = 17n2^{n-1} \sqrt{2\epsilon }\).
Proof of Robustness for Reference Experiment 2
Much of the same analysis may be used for experiment 2. Indeed, since the only difference in the proofs for the non-robust results is how the anti-commuting property is proved, we may simply replace the estimation for Lemma 3 with that of Lemma 4.
We begin, then, with \(\epsilon \)-simulation and prove a robust version of Lemma 4. First we wish to estimate \(\alpha = \left| \left| D^{\prime }_{u} \left| \, \psi \right\rangle - \frac{X^{\prime }_{u} + Z^{\prime }_{u}}{\sqrt{2}}\left| \, \psi \right\rangle \right| \right| _{2}\). Using techniques from the previous section, we have
These along with the triangle inequality give an upper bound for \(\alpha \) of
Expanding the second term, we get
Since \(\left| \left| Z^{\prime }_{u} \left| \, \psi ^{\prime } \right\rangle - X^{\prime }_{v} Z^{\prime N_{v} \setminus u}\left| \, \psi ^{\prime } \right\rangle \right| \right| _{2} \le 2 \sqrt{\epsilon }\) and \(\left| \left| Z^{\prime N_{u}}\left| \, \psi ^{\prime } \right\rangle \right| \right| _{2} = 1\) we find
By hypothesis, \(\left| \left\langle \psi ^{\prime } \, \right| Z^{\prime N_{u}}Z^{\prime }_{u} \left| \, \psi ^{\prime } \right\rangle \right| \le \epsilon \), so \(\left| \left\langle \psi ^{\prime } \, \right| Z^{\prime N_{u}}X^{\prime }_{v} Z^{\prime N_{v} \setminus u}\left| \, \psi ^{\prime } \right\rangle \right| \le 2 \sqrt{\epsilon } + \epsilon \).
Meanwhile \(\beta ^{2} = \left| \left| \frac{Z^{\prime N_{u}} +X^{\prime }_{v} Z^{\prime N_{v} \setminus u}}{\sqrt{2}} \left| \, \psi ^{\prime } \right\rangle \right| \right| _{2}^{2} = 1 + \text {Re} \left\langle \psi ^{\prime } \, \right| Z^{\prime N_{u}} X^{\prime }_{v} Z^{\prime N_{v} \setminus u} \left| \, \psi ^{\prime } \right\rangle \), so \(|1- \beta ^{2}| \le 2\sqrt{\epsilon } + \epsilon \).
Finally, by hypothesis \(\left| \left\langle \psi ^{\prime } \, \right| D^{\prime }_{u}Z^{\prime N_{u}} \left| \, \psi ^{\prime } \right\rangle + \left\langle \psi ^{\prime } \, \right| D^{\prime }_{u} X^{\prime }_{v}Z^{\prime N_{v} \setminus u} \left| \, \psi ^{\prime } \right\rangle - \sqrt{2}\right| \le 2\epsilon \). Combining these facts we find \(\alpha \le 2\sqrt{2 \epsilon } + \sqrt{2 \sqrt{\epsilon } + (1 + 2\sqrt{2}) \epsilon }\).
Now we wish to estimate
By the fact \(\left| \left| D^{\prime }_{u}\right| \right| _{\infty } = 1\) we have \(\left| \left| (D_{u}^{\prime })^{2}\left| \, \psi ^{\prime } \right\rangle - D^{\prime }_{u}\frac{X^{\prime }_{u} +Z^{\prime }_{u}}{\sqrt{2}} \left| \, \psi ^{\prime } \right\rangle \right| \right| _{2} \le \alpha \). Similarly, since \(\left| \left| X^{\prime }_{u} + Z^{\prime }_{u}\right| \right| _{\infty } \le 2\) we find \(\left| \left| D_{u}^{\prime }\frac{X^{\prime }_{u} Z^{\prime }_{u}}{\sqrt{2}}\left| \, \psi ^{\prime } \right\rangle - \frac{\left( X^{\prime }_{u} + Z^{\prime }_{u}\right) ^{2}}{2} \left| \, \psi ^{\prime } \right\rangle \right| \right| _{2} \le \sqrt{2} \alpha \). Using these facts, the triangle inequality, and \((D^{\prime }_{u})^{2} = I\), we obtain
with the last inequality valid for \(\epsilon \le 1\).
Using this estimate, and working through the estimations as in the previous section, we find that we may set
For a simpler expression, we may use \(l \le n\) and \(|E| \le n^{2}\), obtaining
Again, we may find a better estimate with more information about the graph. For cluster states, which have a square lattice graph, we have \(|E| \le 4n\). We may also perform \(D_{u}\) measurements on all vertices and set \(l=0\). In this case we may set \(\delta =n 2^{n-2}\left( 156 \epsilon ^{\frac{1}{4}} + 2 \sqrt{2 \epsilon }\right) \).
Classical Hidden Variable Model for Bipartite Graph States with \(X\) and \(Z\) Measurements
Let \(G\) be a bipartite graph and \(\left| \, \psi \right\rangle \) the corresponding graph state. We give a local hidden variable model that is consistent will all measurements which are tensor products of \(X\) and \(Z\) on this state.
We construct a local hidden variable model by randomly choosing a value \(\pm 1\) for \(Z^{\prime }_{v}\) for each \(v\) in the graph. We then set \(X^{\prime }_{v}\) to be
Now we show that this is consistent with all possible tensor product \(X\) and \(Z\) measurements on \(\left| \, \psi \right\rangle \). Let \(M = X^{S}Z^{T}\), \(S \cap T = \emptyset \) be such a measurement. First, suppose that \(\pm M\) can be written as a product of stabilizers of \(\left| \, \psi \right\rangle \). Using Lemma 1 we have
Note that, by assumption, \(M\) has only \(X\) and \(Z\) factors, so each \(v \in S\) must have an even number of neighbours in \(S\). Then the induced subgraph on \(S\) is Eulerian and we can partition the edges of the subgraph into cycles with no common edges (see Diestel [Die10] for a proof). Suppose that \(|E(S)|\) is odd. Then there must be at least one odd cycle in this partition and then \(S\) has an odd cycle and so does \(G\). Since \(G\) is bipartite this must not be the case and in fact \(|E(S)|\) is even. Hence \(M = \prod _{x \in S} S_{v}\) and \(\left\langle \psi \, \right| M\left| \, \psi \right\rangle = 1\). By construction \(M^{\prime } = X^{\prime S} Z^{\prime N(S)} = \prod _{v \in S} X^{\prime }_{v} Z^{\prime N_{v}} = 1\) and the expected value of \(M^{\prime }\) matches that of \(M\).
Now suppose that \(M\) is not a product of stabilizers of \(\left| \, \psi \right\rangle \). Then \(M\) must anti-commute with at least one stabilizer and hence \(\left\langle \psi \, \right| M\left| \, \psi \right\rangle =0\). Meanwhile, by construction
If \(N(S) = T\) then \(M\) is in fact a product of stabilizers. This is not the case, so there is at least one \(Z^{\prime }_{v}\) in the above equation which is not cancelled. Since all the \(Z^{\prime }_{v}\)s are chosen randomly, the product of the \(Z^{\prime }_{v}\)s not cancelled will also be uniformly random. Thus the expected value of \(M^{\prime }\) is 0.
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McKague, M. (2014). Self-Testing Graph States. In: Bacon, D., Martin-Delgado, M., Roetteler, M. (eds) Theory of Quantum Computation, Communication, and Cryptography. TQC 2011. Lecture Notes in Computer Science(), vol 6745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54429-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-54429-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54428-6
Online ISBN: 978-3-642-54429-3
eBook Packages: Computer ScienceComputer Science (R0)