Weak String Erasure

Weak String Erasure (WSE) is a two-party functionality, say between Alice and Bob, that allows Alice to send a random bit string to Bob, in such a way that Alice is guarantied that a fraction (ideally half) of the bits are lost during the transmission. However, Alice should not know which bits Bob has received, and which bits have been lost. Tags: Universal Cloning, optimal cloning, N to M cloning, symmetric cloning, Asymmetric Cloning, Quantum Cloning, copying quantum states, Quantum Functionality, Specific Task, Probabilistic Cloning Two Party Protocols, weak string erasure,Building Blocks, Bounded Storage Model

Assumptions

• We assume that the adversary has access to a quantum memory that is bounded in size, say the memory is of at most Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle log2(d)} qubits. See Bounded/Noisy Storage Model in ()
• The transmission of qubit is noiseless/lossless.
• The preparation devices (for quantum state) are assumed to be fully characterized and trusted. We assume the same for the measurement devices.

Outline

Alice and Bob first agree on a duration <maths>Delta t</math> that should correspond to an estimation of the time needed to make any known quantum memory decoheres. The protocol can be decomposed into three parts.

• Distribution This step involves preparation, exchange and measurement of quantum states. Alice chooses a random basis among the X or Z bases. She then chooses at random one of the two states of this basis, prepares this state and sends it over to Bob. Upon receiving the state from Alice, Bob will choose a random basis among the X or Z bases, and measure the incoming qubit in this basis. They both record the basis they have used, Bob also records his measurement outcome, and Alice record which state she has sent. Both parties repeat this procedure n times.
• Waiting time Both parties will wait for time <maths>Delta t</math>. This is to force a malicious party to store part his quantum state in his memory. Of course he will be limited by the size of his quantum memory.
• Classical post-processing Alice will send to Bob, the bases she has used to prepare her states. Bob will erase all the measurement outcomes of the rounds where he measured in a different basis than Alice has prepared the state.
  

The losses in the transmission happen in the distribution step when Bob measure the incoming qubit in different basis as the one Alice has chosen for the preparation.

Pseudo Code

Input: j qubits where $R_{j}$ are ancillary and internal states of the QCM.

Stage 1 State preparation

1. Prepare N initial states: $|\psi \rangle ^{\otimes N}$ and $M-N$ blank states: $|0\rangle ^{\otimes M-N}$

Stage 2 Unitary transformation

1. Perform the following unitary transformation on input state $|N\psi \rangle =|\psi \rangle ^{\otimes N}|0\rangle ^{\otimes M-N}|R\rangle$

$U_{N,M}|N\psi \rangle =\sum _{j=0}^{M-N}\alpha _{j}|(M-j)\psi ,j\psi ^{\perp }\rangle \otimes R_{j}(\psi )$
where $\alpha _{j}={\sqrt {\frac {N+1}{M+1}}}{\sqrt {\frac {(M-N)!(M-j)!}{(M-N-j)!M!}}}$
Stage 3: Trace out the QCM state

1. Trace out the state of the QCM in $R_{j}$ states.

Further Information

• The Bounded Storage Model was introduced in (5), (4)
• The Bounded Storage Model can generalized into the Noisy Storage Models (3), (1)
• The security of Weak String Erasure has been analyzed in the presence of noise and losses (2)

References

1. KWW (2012)
2. WCSL (2010)
3. WST (2008)
4. Schaffner(2007)
5. DFSS (2005)

*contributed by Jeremy Ribeiro