Polynomial Code based Quantum Authentication: Difference between revisions

Polynomial Code based Quantum Authentication (edit)

633 bytes removed , 24 June 2019

Write, autoreview, editor, reviewer

3,129

edits

@@ Line 6: / Line 6: @@
 *The sender and the receiver share a private (known to only the two of them), classical random key drawn from a probability distribution.
 ==Outline==
-# Preprocessing: A and B agree on some stabilizer purity testing code (<math>Q_k</math>) and some private and random
-binary strings <math>k</math>, <math>x</math>, and <math>y</math>.
-# A q-encrypts ρ as τ using key x. A encodes τ according to Qk for the code Qk with syndrome y to produce
-σ. A sends the result to B.
-#B receives the n qubits. Denote the received state by σ B measures the syndrome y′ of the code Qk on his qubits. B compares y to y′, and aborts if any error is detected. B decodes his n-qubit word according to
-Qk, obtaining τ′. B q-decrypts τ′ using x and obtains ρ′.
-'''Purity Testing Code:'''
 ==Notations==