Oblivious Quantum Computation and Delegated Multiparty Quantum Computation

• URL: http://arxiv.org/abs/2211.00962v4
• Date: Thu, 11 May 2023 11:03:59 GMT
• Title: Oblivious Quantum Computation and Delegated Multiparty Quantum Computation
• Authors: Masahito Hayashi
• Abstract summary: 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.
• Score: 61.12008553173672
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a new concept, oblivious quantum computation, which requires performing oblivious transfer with respect to the computation outcome of the quantum computation, where the 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, which realizes an exponential improvement for the communication complexity over the simple application of two-server (quantum) oblivious transfer to the sending of the computation result. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications. We propose a two-server protocol for the latter task as well.

Related papers

• Distributed Quantum Computation via Entanglement Forging and Teleportation [13.135604356093193]
  Distributed quantum computation is a practical method for large-scale quantum computation on quantum processors with limited size. In this paper, we demonstrate the methods to implement a nonlocal quantum circuit on two quantum processors without any quantum correlations.
  arXiv  Detail & Related papers  (2024-09-04T08:10:40Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Harnessing Coding Theory for Reliable Network Quantum Communication [7.469588051458094]
  We review repeater-based quantum networks, emphasizing the roles of coding theory and fault-tolerant quantum operations. We highlight that fault-tolerant implementation of the Bell measurement enables reliable quantum communication without requiring a universal set of quantum gates.
  arXiv  Detail & Related papers  (2024-02-29T17:32:08Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• 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)
• 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 reservoir neural network implementation on coherently coupled quantum oscillators [1.7086737326992172]
  We propose an implementation for quantum reservoir that obtains a large number of densely connected neurons. We analyse a specific hardware implementation based on superconducting circuits. We obtain state-of-the-art accuracy of 99 % on benchmark tasks.
  arXiv  Detail & Related papers  (2022-09-07T15:24:51Z)
• Quantum design for advanced qubits: plasmonium [4.51227657808872]
  We demonstrate variational quantum eigensolvers to simulate superconducting quantum circuits with varying parameters covering a plasmon-transition regime. We fabricate an advanced post-transmon qubit, "plasmonium", which exhibits high single- and two-qubit gate fidelities. Our work opens the way to designing advanced quantum processors using existing quantum computing resources.
  arXiv  Detail & Related papers  (2021-09-02T14:48:39Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.