量子訊息認證是個基本的量子通訊問題。它使得接收者不但收到量子訊息還有額外的資訊提供他們做決策，例如，中斷目前的通訊，解決干擾源。但量子訊息和數位訊息是不同的資料形態，有非常不同的特性，例如，量子訊息具有非局域性、不可複製性等性質。對於額外資訊該具備的特性，也就是保密性要求，直接由數位訊息的特性引入是不適當。本文將會針對量子訊息的特性，主要是不可複製性，引入合適的保密性要求。
首先我們討論何謂量子通道的保真度，來量化量子通道的可靠性。得知可以設想傳送糾纏比特的保真度，當此量子通道的品質。因此我們討論某類通訊協定，提供了簡明的方式計算此類通訊協定的保真度。接著探討如何結合數個此類通訊協定成為一個完整的量子認證方案，用以完成我們在保密性上的要求。而上述的協定是建立於量子穩定碼，它的編碼器和解碼器已經在文獻中被廣為研究，所以實現這樣的量子通訊系統，不會顯地特別困難。我們稱此類方案為穩定量子認證方案。
最後我們探討實際的例子。給出符合保密性要求的穩定量子認證方案，所需要滿足的條件。同時我們了解到穩定量子認證方案的侷限性。但有太廣泛的方法針對保密性要求而設計方案，因而提供另一個較為簡單的設計準則，在此準則下存在有良好的穩定量子認證方案。

[1] I. Devetak, A. Harrow, and A. Winter, “A resource framework for quantum shannon theory,” Information Theory, IEEE Transactions on, vol. 10, pp. 4587 – 4618, 2008.

[2] P. O. Boykin and V. Roychowdhury, “Optimal encryption of quantum bits,” Phys. Rev. A, vol. 67, 042317, 2003.

[3] H. Barnum, C. Crepeau, D. Gottesman, A. Smith, and A. Tapp, “Authentication of quantum messages,” in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 449 – 458, 2002.

[4] B. A. Forouzan, Cryptography and Network Security. McFRAW.HILL, 2008.

[5] D. Aharonov, M. Ben-Or, and E. Eban, “Interactive proofs for quantum computations,” arXiv:0810.5375, 2008.

[6] J. Bell, “On the einstein-podolsky-rosen paradox,” Physics (Long Island City, N.Y.), vol. 1, p. 195, 1964.

[7] W. K. Wootters and W. H. Zurek, “A single quantum cannot be cloned,” Nature, vol. 299, pp. 802 – 803, 1982.

[8] H. Barnum, E. Knill, and M. A. Nielsen, “On quantum fidelities and channel ca- pacities,” Information Theory, IEEE Transactions on, vol. 46, pp. 1317 – 1329, 2000.

[9] B. Schumacher, “Sending entanglement through noisy quantum channels,” Phys. Rev. A, vol. 54, pp. 2614 – 2628, 1996.

[10] Y. Yeo and W. K. Chua, “Teleportation and dense coding with genuine multipartite entanglement,” Phys. Rev. Lett., vol. 96, 060502, 2006.

[11] C.-Y. Lai and C.-C. Lu, “A construction of quantum stabilizer codes based on syndrome assignment by classical parity-check matrices,” arXiv:0712.0103, 2007.

[12] D. Poulin, “Stabilizer formalism for operator quantum error correction,” Phys. Rev. Lett., vol. 95, 230504, 2005.

[13] R. Cleve and D. Gottesman, “Efficient computations of encodings for quantum error correction,” Phys. Rev. A, vol. 56, pp. 76 – 82, 1997.

[14] D. Poulin and Y. Chun, “On the iterative decoding of sparse quantum codes,” Quantum Information and Computation, vol. 8 (10), p. 1000, 2008.

[15] R. Matsumoto, “Conversion of a general quantum stabilizer code to an entanglement distillation protocol,” J. Phys. A: Math. Gen., vol. 36, p. 8113, 2003.

[16] M. Grassl, T. Beth, and T. Pellizzari, “Codes for the quantum erasure channel,” Phys. Rev. A, vol. 56, pp. 33 – 38, 1997.

[17] C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin, “Capacities of quantum erasure channels, ” Phys. Rev. Lett., vol. 78, pp. 3217 – 3220, 1997.