Quantum computation capability verification protocol for NISQ devices with dihedral coset problem

• URL: http://arxiv.org/abs/2202.06984v3
• Date: Mon, 4 Jul 2022 10:51:30 GMT
• Title: Quantum computation capability verification protocol for NISQ devices with dihedral coset problem
• Authors: Ruge Lin and Weiqiang Wen
• Abstract summary: We propose an interactive protocol for one party (the verifier) holding a quantum computer to verify the quantum computation power of another party's (the prover) device via a one-way quantum channel. We conduct a 4-qubit experiment on one of IBM Q devices.
• Score: 0.4061135251278187
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this article, we propose an interactive protocol for one party (the verifier) holding a quantum computer to verify the quantum computation power of another party's (the prover) device via a one-way quantum channel. This protocol is referred to as the dihedral coset problem (DCP) challenge. The verifier needs to prepare quantum states encoding secrets (DCP samples) and send them to the prover. The prover is then tasked with recovering those secrets with a certain accuracy. Numerical simulation demonstrates that this accuracy is sensitive to errors in quantum hardware. Additionally, the DCP challenge serves as benchmarking protocol for locally fully connected (LFC) quantum architecture and aims to be performed on current and near-future quantum resources. We conduct a 4-qubit experiment on one of IBM Q devices.

Related papers

• 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)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• 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)
• Testing quantum computers with the protocol of quantum state matching [0.0]
  The presence of noise in quantum computers hinders their effective operation. We suggest the application of the so-called quantum state matching protocol for testing purposes. For systematically varied inputs we find that the device with the smaller quantum volume performs better on our tests than the one with larger quantum volume.
  arXiv  Detail & Related papers  (2022-10-18T08:25:34Z)
• 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)
• Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes [2.915868985330569]
  MPQC protocol is a cryptographic primitive allowing error-free distributed quantum computation. We suggest a modified MPQC protocol that adopts unconventional quantum error-correcting codes.
  arXiv  Detail & Related papers  (2022-06-10T04:43:11Z)
• Classical verification of quantum depth [1.8613536568358358]
  We present two protocols for classical verification of quantum depth. Our first protocol certifies the depth of the target machine with information theoretic security and nearly optimal separation. Our second protocol certifies the quantum depth of a single device based on quantum hardness of learning with errors.
  arXiv  Detail & Related papers  (2022-05-10T03:55:24Z)
• Benchmarking of Quantum Protocols [0.9176056742068812]
  We consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols.
  arXiv  Detail & Related papers  (2021-11-03T21:17:04Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum information processing with bosonic qubits in circuit QED [1.2891210250935146]
  We review recent developments in the theory and implementation of quantum error correction with bosonic codes. We report the progress made towards realizing fault-tolerant quantum information processing with cQED devices.
  arXiv  Detail & Related papers  (2020-08-31T10:27:06Z)

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.