arXiv:quant-ph/0103123AbstractReferencesReviewsResources
Quantum message authentication codes
Published 2001-03-21, updated 2001-11-05Version 3
This paper has been withdrawn because of an error in the proof of Lemma 1. Without Lemma 1, the result of the main theorem (with the same proof, but omitting the use of Lemma 1 to extend things to general attacks) only holds for attacks in which the attacker applies a tensor product of Pauli matrices (for qubits) or generalized Pauli matrices. The resulting theorem is still relevant for quantum message authentication, but the very strong result claimed in earlier versions of this paper does not hold. These matters will be addressed further in joint work with Claude Crepeau, Daniel Gottesman, Adam Smith, and Alain Tapp. Thanks to them and to Debbie Leung for spotting the error.
Comments: Withdrawn due to error in proof of Lemma 1, and collaborative work which renders it obsolete
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:2301.00560 [quant-ph] (Published 2023-01-02)
PauliComposer: Compute Tensor Products of Pauli Matrices Efficiently
arXiv:quant-ph/0208190 (Published 2002-08-30)
Cartan Calculus via Pauli Matrices
arXiv:1308.2493 [quant-ph] (Published 2013-08-12)
On quantum circuits employing roots of the Pauli matrices