Prepare-and-Send Verifiable Universal Blind Quantum Computation

The example protocol achieves the functionality of Delegated Computation which is the task of assigning quantum computation to an untrusted device while maintaining privacy of the computation. This protocol allows the Client to verify the correctness of the Prepare-and-Send Universal Blind Quantum Computation. Here, the server carries out the quantum computation for the client without having known Client's inputs/outputs/computation, and also giving the Client an ability to verify with whether the server has followed the instructions of the protocol and also check if Server tried to deviate from the protocol, resulting in an incorrect output state.

Tags: Two Party,Universal Task, Quantum Functionality, Quantum Offline communication, Classical Online communication, Measurement Based Quantum Computation (MBQC), Measurement Only UBQC, Pseudo-Secret Random Qubit Generator (PSQRG), Prepare-and-Send Universal Blind Quantum Computation.

Assumptions

• The protocol assumes perfect state preparation, transmissions, and measurements.
• The client never deviates from the protocol.
• The position of the trap qubit always remains hidden from the server.

Outline

This protocol is a modified version of prepare and send universal blind quantum computation, which is based on MBQC. An adversarial server is taken into consideration here and any computational deviations are detected with a high probability. This is achieved by insertion of randomly prepared and blindly isolated single qubits in the computation, which act as traps (trap qubits), hence assisting the client in verification.

The original brickwork state used in prepare and send universal blind quantum computation is modified to a cylinder brickwork state which allows client to embed a trap qubit surrounded by multiple dummy qubits without disrupting the computation. This state is universal and maintains privacy of client's preparation.

The dummy qubits here do not take part in the actual computation as they are disentangled from the rest of the qubits of the graph state. Hence by adding them to the neighbouring nodes of the trap qubits, they are blindly isolated and thus do not interfere with the actual computation. The dummy qubits are added next to the trap qubit in a tape format.

This protocol is dived into four stages: Client's preparation, server's preparation, interaction and measurement, verification.

• Client's preparation: The partially quantum client prepares the quantum states with embedded traps qubits and sends them to the server for creation of the cylinder brickwork state.
  • For the server to create a cylinder brickwork state, the client prepares $m*n$ single qubit states. The $n$ qubit input states are specially encoded and all the other non-input qubits except the trap qubit are prepared with randomly chosen local phase angles.
  • During this preparation, the client randomly selects one qubit as the trap qubit and corresponding to the graph of cylinder brickwork state, all the other qubits in the tape are set as the dummy qubits. The trap qubit is prepare with the local phase angle set to $0$.
  • The client then sends all the prepared qubits in the respective order so the graph state can be constructed by the server.
    
    

• Server's Preparation: The server receives the qubits in the order of $m$ rows and $n$ columns and entangles them according to the cylinder brickwork state (using CZ gate).
  
  
• Interaction and Measurement: This step is exactly the same as for Prepare and Send-Universal Blind Quantum Computation.
  • The client sends the measurement angle to the server for every single qubit. This measurement angle includes the parameters like correction sets obtained from flow construction, input state's random local phase and a $\pi$ rotation to hide the output. Thus it reveals no information about the underlying computation.
  • The server sends the classical output of each non-input qubit's measurement to the client. The client considers the $\pi$ rotation to get the corrected output. The client also uses this to calculate the measurement angle and thus repeats the process until the last output qubits are reached.
    
    
• Verification: The verification is carried on by the client by comparing the outcome of the trap qubit measurements with the expected outcome.

Quantum outputs:

• • The server sends all the output qubits to the client.
  • From these output qubits, the client performs a measurement on the trap qubit. If the output is equal to the expected outcome, the computation is verified. Otherwise, it is rejected.
  • If the computation is accepted, output correction is performed on the other output qubits (except the trap qubit).

Classical outputs:

• • The server continues performing measurements on the output qubits with the measurement angles sent by the server.
  • The client compares the output of the trap qubit with the expected output. If it is equal, computation is verified. Otherwise, it is rejected. If the computation is accepted, the client accepts the other output measurement results as the computation result.

Notation

• $n$: Total number of input qubits. Also total number of output qubits in quantum outputs.
• 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 m} : Total number of qubits in the graph state.
• 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 |I\rangle} : $n$ qubit input state.
• $|e\rangle$: Encoded $n$ qubit input state.
• $x$: Set of random bits used in encoding 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 |I\rangle} via quantum one time pad.
• $t$: Trap qubit position vertex in the graph state.
• $D$: Set of all position vertices in the tape of the cylinder brickwork state.
• $\theta _{i}$: Random local phase angles for qubit $i$.
• $|+\rangle _{\theta _{i}}$: ${\frac {1}{\sqrt {2}}}(|0\rangle +e^{i\theta _{i}}|1\rangle )$
• $\phi _{i}$: True measurement angle for qubit $i$.
• $\phi _{i}^{'}$: Updated version of measurment angle for qubit $i$.
• $r\in \{0,1\}$: randomly chosen parameter for $\pi$ rotation in order to hide classical output.
• $\delta _{i}$: Final measurement angle for qubit $i$.
• $b_{i}$: Measurement output by the server.
• $s$: Sequence of length m describing the result of the nonoutput measurements. $s_{i}\in \{0,1\}$

Hardware Requirements

• Quantum computation resources for the server.
• A quantum channel from client to server to transfer initial quantum states.
• Classical channel from client to server to tranfer measurement angles and outputs.
• Measurement devices for the server and the client in case of quantum outputs.

Properties

• The client is partially quantum and should be able to prepare the given initial quantum states.
• This protocol is secure against malicious adversary setting and also detects a cheating server.
• This protocol is universal in nature. The universality of the cylinder brickwork state guarantees that server’s knowledge about the graph does not reveal anything about the underlying computation.
• This protocol requires no quantum memory for the client.
• This protocol is blind in nature, only revealing $n$ and $m$.
• This protocol is $1-{\frac {1}{2m}}$ verifiable in quantum output case.
• This protocol is $1-{\frac {1}{m}}$ verifiable in classical output case.
• The trap qubit in the tape format of the cylinder brickwork state remains disentangled from the rest of the graph.
• Every qubit of the underlying graph could potentially be an isolated trap qubit.

Pseudo-Code

Protocol for quantum output case:

Stage 1: Client's preparation:

Input: Input quantum states, prepared non-input qubits, a trap qubit and dummy qubits.
Output: The server receives all the quantum states in order of the labeling of the vertices of the graph state.

• The client encodes and prepares the first $n$-input state.

$|e\rangle =X_{1}^{x1}Z_{1}(\theta _{1})\otimes ...\otimes X_{n}^{xn}Z_{n}(\theta _{n})|I\rangle$

• Client randomly chooses the $t$ to be the trap qubit, where $t\in D$.
• For $i=n+1,n+2,....m$:
  • if $i\in D$:
    • if $i$ == dummy qubit:
      • State $|0\rangle$ or $|1\rangle$ is prepared
    • if $i$ == trap qubit:
      • $|+\rangle _{\theta _{i}}$ is prepared
  • if $i$ == non-input qubit:
    • $|+\rangle _{\theta _{i}}$ is prepared
• For $l=1,2,...n$:
  • The client sends the qubits to the server.

Stage 2: Server's preparation:
Output: Cylinder brickwork state which has a disentangled trap qubit.

• Server creates an entangled state from all received qubits using CZ operations according to their indices and creates the cylinder brickwork state.

Stage 3: Interaction and Measurement:
Input: $\delta _{i}$
Output: $b_{i}$

• For $i=1,2,...m-n$:
  • Client computes $\phi _{i}$.
    • if $i==t$:
      • \item $\phi _{i}=0$
  • Client randomly selects $r_{i}$.
  • Client then computes the angle $\delta _{i}$ and sends this to the server.

$\delta _{i}=\phi _{i}^{'}+\theta _{i}+r_{i}\pi$

• • Server measures $b_{i}$ and sends it to client.
  • Client sets the value of $s_{i}$ in $s$ to be $b_{i}\oplus r_{i}$.

Stage 4: Verification:
Input: Output qubits $m-n+1$ to $m$
Output: Verification result

• For $i=m-n+1,...m$:
  • Server sends output qubit $i$ to client.
• Client measures the output trap qubit $t$ (which was disentangled) with angle $\delta _{t}=\phi _{t}+r_{t}\pi$.
  • Client obtains the result $b_{t}$.
    • If $b_{t}==r_{t}$:
      • Computation is accepted.
    • else:
      • Computation is rejected.

*contributed by Rhea Parekh