Revision History for: Measurement-Only Verifiable Universal Blind Quantum Computation

• 2026-04-06 at 14:08 by kimworrall
  Show/Hide Content

  implements Secure Verifiable Client-Server Delegated Quantum Computation

  Introduction

  ---

  The protocol [1] achieves the functionality of Secure Verifiable Delegated Quantum 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 blind delegated quantum computing with high probability. Here, the server prepares and sends a universal resource quantum state to the client, and the client performs measurements on the resource state to carry out the quantum computation. Using this method, it is easy to verify with high probability whether the server is honest. The computation here remains perfectly private from the server and this protocol can implement any quantum computation.

  Related Paper(s)

  ---

  Verification for measurement-only blind quantum computing [1]

  Outline

  ---

  This protocol is based on MBQC and is mainly derived from Measurement-Only Universal Blind Quantum Computation. In this protocol, the server prepares and sends the resource state to the client, whereas the client performs measurements on the received states. The server is considered to be a general adversary and any computational deviations can be detected in this method by the client.

  By performing measurements, the client creates the final state to be a mixture of resource state and trap qubits, in a random distribution. If the measurement of all the trap qubits matches the expected outcome, then it shows with high probability that the server is honest and has not deviated from the protocol.

  This protocol is dived into two stages: Servers’ preparation and Client’s measurement.

  • Server’s preparation: Server prepares the resource graph state required for MBQC by the Client. The server sends each qubit of this state to the Client, one by one.
  • Client’s Measurement
    • The client receives the qubits from the server and measures them in order to finally create an n-qubit state with the server, following the principle of MBQC. This n-qubit state comprises of randomly distributed resource state of measurement-based quantum computation and trap qubits. Following from the no-signaling principle, the server can never find out about the random distribution pattern.
    • On receiving the final n-qubit state, the client performs the measurement on these states with certain corrections. If the measurement of all the traps matches the expected outcome, the results are accepted otherwise the protocol is aborted.

  Assumptions

  ---

  • The protocol assumes perfect state preparation, transmissions and measurements.
  • There is no communication channel from the client to the server.
  • The quantum channel from the server to the client should not be too lossy.

  Requirements

  ---

  • Quantum computation resources for the server.
  • A quantum channel from the server to the client to transfer the quantum states.
  • Measurement device for the client.
  • No channel is required from client to the server.

   

  Notation

  ---

  • $G_{m\\\times n}$: Resource state
  • $m\\\times n$: Resource state size
  • $|\\\psi\\\rangle_P$: $P(|R\\\rangle\\\otimes |+\\\rangle^{\\\otimes \\\frac{N}{3}} \\\otimes |0\\\rangle^{\\\otimes \\\frac{N}{3}})$, this is the $n$-qubit state left with the server which contains the trap qubits ($|0\\\rangle$, $|+\\\rangle$) and resource state.
  • $|R\\\rangle$: $\\\frac{n}{3}$-qubit resource state
  • $P$: $n$-qubit permutation, which keeps the order of qubits in $|R\\\rangle$
  • $|+\\\rangle$: $\\\frac{1}{\\\sqrt{2}} (|0\\\rangle + |1\\\rangle)$
  • q: $(x_1, …, x_n, z_1, …, z_n) \\\in {0,1}^{2n}$
  • $\\\sigma_q$: $\\\bigotimes^n_{j=1}X^{x_j}_jZ^{z_j}_j$

  Properties

  ---

  • This protocol detects a cheating server with high probability.
  • Universality: This protocol is universal in nature. The resource state used is universal and thus can implement any quantum computation.
  • Correctness: The correctness of the protocol is implied from the measurement based quantum computing used.
  • Blindness: As there exists no quantum channel from the client to the server, the no-signaling theorem ensures that no information about the states is sent to the server using just the measurements.
  • The security of this protocol is device independent, which means client does not need to trust their measurement device in order to guarantee the security.
  • One advantage of this protocol is that no random number generators are required.

  Technical Description

  ---

  Stage 1: Server’s preparation
  Input: Dimensions of the resource state.
  Output: Client: receives all qubits

  • Server creates $G_{m\\\times n}$ and sends each qubit to Client

  Stage 2 : Client’s measurement

  Input : Resource state qubits

  Output : Final outcome

  • For $i = 1, 2, … m-1$:
    • For $j = 1, 2, …n$:
      • Client receives resource state qubit $|\\\psi\\\rangle_{i,j,0}$ from server.
      • Client performs measurement on $|\\\psi\\\rangle_{i,j,0}$ according to the measurement pattern.
    • Through the measurements, Client creates the state $\\\sigma_q|\\\psi\\\rangle_P$ in the server’s possession, where

  $$ |\\\psi\\\rangle_P = P(|R\\\rangle\\\otimes |+\\\rangle^{\\\otimes \\\frac{N}{3}} \\\otimes |0\\\rangle^{\\\otimes \\\frac{N}{3}}) $$

  • For $i = 1, 2, …n$: (for every qubit of $\\\sigma_q|\\\psi\\\rangle_P$)
    • Client receives $\\\sigma_q{|\\\psi\\\rangle_P}_i$ from the server.
    • Measurement is done after applying the correction $\\\sigma^{\\\dagger}_q$ on the qubit received.
    • If result obtained is $|1\\\rangle$ (for trap qubit $|0\\\rangle$) or $|-\\\rangle$(for trap qubit $|+\\\rangle$):
      • Protocol is aborted.
    • else:
      • Protocol is continued and accepted if all trap qubits show expected outcome ($|0\\\rangle$ or $|+\\\rangle$).

  Experimental Implementations

  ---

  No content has been added to this section, yet!

  Further Information

  ---

  A second protocol exists which uses the
  property of the topological code, and does not use any
  trap qubits. Here, after the $\\\sigma_q|\\\psi\\\rangle_P$ state is prepared, client does topological measurement-based quantum computation with a correcting factor. If any error is detected, the protocol is aborted.

  References

  ---

  1. Morimae, Tomoyuki. ‘Verification for Measurement-Only Blind Quantum Computing’. arXiv [Quant-Ph], 2014. arXiv. http://arxiv.org/abs/1208.1495.
• 2026-04-06 at 14:08 by kimworrall
  Show/Hide Content

  implements Secure Verifiable Client-Server Delegated Quantum Computation

  Introduction

  ---

  The protocol [1] achieves the functionality of Secure Verifiable Delegated Quantum 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 blind delegated quantum computing with high probability. Here, the server prepares and sends a universal resource quantum state to the client, and the client performs measurements on the resource state to carry out the quantum computation. Using this method, it is easy to verify with high probability whether the server is honest. The computation here remains perfectly private from the server and this protocol can implement any quantum computation.

  Related Paper(s)

  ---

  Verification for measurement-only blind quantum computing [1]

  Outline

  ---

  This protocol is based on MBQC and is mainly derived from Measurement-Only Universal Blind Quantum Computation. In this protocol, the server prepares and sends the resource state to the client, whereas the client performs measurements on the received states. The server is considered to be a general adversary and any computational deviations can be detected in this method by the client.

  By performing measurements, the client creates the final state to be a mixture of resource state and trap qubits, in a random distribution. If the measurement of all the trap qubits matches the expected outcome, then it shows with high probability that the server is honest and has not deviated from the protocol.

  This protocol is dived into two stages: Servers’ preparation and Client’s measurement.

  • Server’s preparation: Server prepares the resource graph state required for MBQC by the Client. The server sends each qubit of this state to the Client, one by one.
  • Client’s Measurement
    • The client receives the qubits from the server and measures them in order to finally create an n-qubit state with the server, following the principle of MBQC. This n-qubit state comprises of randomly distributed resource state of measurement-based quantum computation and trap qubits. Following from the no-signaling principle, the server can never find out about the random distribution pattern.
    • On receiving the final n-qubit state, the client performs the measurement on these states with certain corrections. If the measurement of all the traps matches the expected outcome, the results are accepted otherwise the protocol is aborted.

  Assumptions

  ---

  • The protocol assumes perfect state preparation, transmissions and measurements.
  • There is no communication channel from the client to the server.
  • The quantum channel from the server to the client should not be too lossy.

  Requirements

  ---

  • Quantum computation resources for the server.
  • A quantum channel from the server to the client to transfer the quantum states.
  • Measurement device for the client.
  • No channel is required from client to the server.

   

  Notation

  ---

  • $G_{m\\\times n}$: Resource state
  • $m\\\times n$: Resource state size
  • $|\\\psi\\\rangle_P$: $P(|R\\\rangle\\\otimes |+\\\rangle^{\\\otimes \\\frac{N}{3}} \\\otimes |0\\\rangle^{\\\otimes \\\frac{N}{3}})$, this is the $n$-qubit state left with the server which contains the trap qubits ($|0\\\rangle$, $|+\\\rangle$) and resource state.
  • $|R\\\rangle$: $\\\frac{n}{3}$-qubit resource state
  • $P$: $n$-qubit permutation, which keeps the order of qubits in $|R\\\rangle$
  • $|+\\\rangle$: $\\\frac{1}{\\\sqrt{2}} (|0\\\rangle + |1\\\rangle)$
  • q: $(x_1, …, x_n, z_1, …, z_n) \\\in {0,1}^{2n}$
  • $\\\sigma_q$: $\\\bigotimes^n_{j=1}X^{x_j}_jZ^{z_j}_j$

  Properties

  ---

  • This protocol detects a cheating server with high probability.
  • Universality: This protocol is universal in nature. The resource state used is universal and thus can implement any quantum computation.
  • Correctness: The correctness of the protocol is implied from the measurement based quantum computing used.
  • Blindness: As there exists no quantum channel from the client to the server, the no-signaling theorem ensures that no information about the states is sent to the server using just the measurements.
  • The security of this protocol is device independent, which means client does not need to trust their measurement device in order to guarantee the security.
  • One advantage of this protocol is that no random number generators are required.

  Technical Description

  ---

  Stage 1: Server’s preparation
  Input: Dimensions of the resource state.
  Output: Client: receives all qubits

  • Server creates $G_{m\\\times n}$ and sends each qubit to Client

  Stage 2 : Client’s measurement

  Input : Resource state qubits

  Output : Final outcome

  • For $i = 1, 2, … m-1$:
    • For $j = 1, 2, …n$:
      • Client receives resource state qubit $|\\\psi\\\rangle_{i,j,0}$ from server.
      • Client performs measurement on $|\\\psi\\\rangle_{i,j,0}$ according to the measurement pattern.
    • Through the measurements, Client creates the state $\\\sigma_q|\\\psi\\\rangle_P$ in the server’s possession, where

  $$ |\\\psi\\\rangle_P = P(|R\\\rangle\\\otimes |+\\\rangle^{\\\otimes \\\frac{N}{3}} \\\otimes |0\\\rangle^{\\\otimes \\\frac{N}{3}}) $$

  • For $i = 1, 2, …n$: (for every qubit of $\\\sigma_q|\\\psi\\\rangle_P$)
    • Client receives $\\\sigma_q{|\\\psi\\\rangle_P}_i$ from the server.
    • Measurement is done after applying the correction $\\\sigma^{\\\dagger}_q$ on the qubit received.
    • If result obtained is $|1\\\rangle$ (for trap qubit $|0\\\rangle$) or $|-\\\rangle$(for trap qubit $|+\\\rangle$):
      • Protocol is aborted.
    • else:
      • Protocol is continued and accepted if all trap qubits show expected outcome ($|0\\\rangle$ or $|+\\\rangle$).

  Experimental Implementations

  ---

  No content has been added to this section, yet!

  Further Information

  ---

  A second protocol exists which uses the
  property of the topological code, and does not use any
  trap qubits. Here, after the $\\\sigma_q|\\\psi\\\rangle_P$ state is prepared, client does topological measurement-based quantum computation with a correcting factor. If any error is detected, the protocol is aborted.

  References

  ---

  1. Morimae, Tomoyuki. ‘Verification for Measurement-Only Blind Quantum Computing’. arXiv [Quant-Ph], 2014. arXiv. http://arxiv.org/abs/1208.1495.

← Back to post