Equivalence of Single-server and Multiple-servers Blind Quantum Computation Protocols

• URL: http://arxiv.org/abs/2106.05547v2
• Date: Sat, 28 May 2022 12:54:45 GMT
• Title: Equivalence of Single-server and Multiple-servers Blind Quantum Computation Protocols
• Authors: Yuichi Sano
• Abstract summary: The protocol of delegating a calculation while hiding information about the calculation from the server is called sl blind quantum computation protocol. There are no known single-server blind quantum computation protocols with a classical user and multiple-servers blind quantum computation protocols that allows servers to communicate freely with each other.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Because quantum computers are expensive, it is envisaged that individuals who want to utilize them would do so by delegating their calculations to someone who has a quantum computer. When quantum computer users delegate computations to quantum servers, they wish to keep information about their calculations hidden from the servers. The protocol of delegating a calculation while hiding information about the calculation from the server is called {\sl blind quantum computation protocol}. Prior research on single-server's blind quantum computation protocol required users to have quantum capabilities. Prior research on multiple-servers' blind quantum computation protocols required users to have just classical capabilities but imposed limits on the server-to-server communication. There are no known single-server blind quantum computation protocols with a classical user and multiple-servers blind quantum computation protocols that allows servers to communicate freely with each other. We show that the existence of these protocols is equivalence.

Related papers

• Towards practical secure delegated quantum computing with semi-classical light [0.0]
  We present an SDQC protocol which drastically reduces the technological requirements of both the client and the server. More precisely, the client only manipulates an attenuated laser pulse, while the server only handles interacting quantum emitters with a structure capable of generating spin-photon entanglement.
  arXiv  Detail & Related papers  (2024-09-18T16:24:07Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Two-Server Oblivious Transfer for Quantum Messages [71.78056556634196]
  We propose two-server oblivious transfer protocols for quantum messages. Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network.
  arXiv  Detail & Related papers  (2022-11-07T05:12:24Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Quantum autoencoders for communication-efficient quantum cloud computing [10.158186323912291]
  We propose quantum autoencoders for quantum gates (QAEGate) as a method for compressing quantum computations. A bonus of our method is it does not reveal any information about the server's computation other than the information present in the output.
  arXiv  Detail & Related papers  (2021-12-23T05:32:38Z)
• Multi-server Blind Quantum Computation Protocol With Limited Classical Communication Among Servers [0.0]
  We propose a protocol, by extend this two-server protocol to multiple servers, which remains secure even if some servers communicate with each other after the computation. Dummy gates and a circuit modeled after brickwork states play a crucial role in the new protocol.
  arXiv  Detail & Related papers  (2021-06-10T06:58:22Z)
• Blind Quantum Computation Using a Circuit-Based Quantum Computer [0.0]
  We put forward a protocol that achieves blindness using the quantum one-time pad for encryption and a T-like gate, and while verifying computation using trap qubits.
  arXiv  Detail & Related papers  (2020-06-11T08:37:45Z)
• Communication Cost of Quantum Processes [49.281159740373326]
  A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
  arXiv  Detail & Related papers  (2020-02-17T08:51:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.