Public verifiable measurement-only blind quantum computation based on entanglement witnesses

• URL: http://arxiv.org/abs/2310.02922v1
• Date: Tue, 3 Oct 2023 17:16:15 GMT
• Title: Public verifiable measurement-only blind quantum computation based on entanglement witnesses
• Authors: Wen-Jie Liu, Zi-Xian Li, Wen-Bo Li, Qi Yang
• Abstract summary: A public verifiable protocol for measurement-only blind quantum computation is proposed. The fidelity between arbitrary states and the graph states of 2-colorable graphs is estimated. Our protocol is public verifiable in the true sense by allowing other random clients to execute the public verification.
• Score: 20.207593331052824
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recently, Sato et al. proposed an public verifiable blind quantum computation (BQC) protocol by inserting a third-party arbiter. However, it is not true public verifiable in a sense, because the arbiter is determined in advance and participates in the whole process. In this paper, a public verifiable protocol for measurement-only BQC is proposed. The fidelity between arbitrary states and the graph states of 2-colorable graphs is estimated by measuring the entanglement witnesses of the graph states,so as to verify the correctness of the prepared graph states. Compared with the previous protocol, our protocol is public verifiable in the true sense by allowing other random clients to execute the public verification. It also has greater advantages in the efficiency, where the number of local measurements is O(n^3*log {n}) and graph states' copies is O(n^2*log{n}).

Related papers

• Less is More: One-shot Subgraph Reasoning on Large-scale Knowledge Graphs [49.547988001231424]
  We propose the one-shot-subgraph link prediction to achieve efficient and adaptive prediction. Design principle is that, instead of directly acting on the whole KG, the prediction procedure is decoupled into two steps. We achieve promoted efficiency and leading performances on five large-scale benchmarks.
  arXiv  Detail & Related papers  (2024-03-15T12:00:12Z)
• All graph state verification protocols are composably secure [1.534667887016089]
  Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties. Previous works conjectured that such a property could not be proven within the abstract cryptography framework. We show that all graph state verification protocols can be turned into a composably secure protocol with respect to the natural functionality for graph state preparation.
  arXiv  Detail & Related papers  (2024-02-02T14:37:26Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• QuTE: decentralized multiple testing on sensor networks with false discovery rate control [130.7122910646076]
  This paper designs methods for decentralized multiple hypothesis testing on graphs equipped with provable guarantees on the false discovery rate (FDR) We consider the setting where distinct agents reside on the nodes of an undirected graph, and each agent possesses p-values corresponding to one or more hypotheses local to its node. Each agent must individually decide whether to reject one or more of its local hypotheses by only communicating with its neighbors, with the joint aim that the global FDR over the entire graph must be controlled at a predefined level.
  arXiv  Detail & Related papers  (2022-10-09T19:48:39Z)
• Efficient verification of Affleck-Kennedy-Lieb-Tasaki states [14.158567687044409]
  Affleck-Kennedy-Lieb-Tasaki (AKLT) states are an important class of many-body quantum states. We propose a general approach for constructing efficient verification protocols for AKLT states on arbitrary graphs.
  arXiv  Detail & Related papers  (2022-06-30T14:24:37Z)
• Collaborative likelihood-ratio estimation over graphs [55.98760097296213]
  Graph-based Relative Unconstrained Least-squares Importance Fitting (GRULSIF) We develop this idea in a concrete non-parametric method that we call Graph-based Relative Unconstrained Least-squares Importance Fitting (GRULSIF) We derive convergence rates for our collaborative approach that highlights the role played by variables such as the number of available observations per node, the size of the graph, and how accurately the graph structure encodes the similarity between tasks.
  arXiv  Detail & Related papers  (2022-05-28T15:37:03Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Constant-time one-shot testing of large-scale graph states [5.33024001730262]
  Fault-tolerant measurement-based quantum computation (MBQC) leads to a promising scalable platform for realizing quantum computation. Existing state-of-the-art protocols for graph-state verification by fidelity estimation have required measurements on many copies of the entire graph state. We here construct an efficient alternative framework for testing graph states for fault-tolerant MBQC based on the theory of property testing.
  arXiv  Detail & Related papers  (2022-01-26T19:00:00Z)
• Verification of graph states in an untrusted network [0.0]
  We consider verification of graph states generated by an untrusted source and shared between a network of possibly dishonest parties. This has implications in certifying the application of graph states for various distributed tasks. We present a protocol which is globally efficient for a large family of useful graph states.
  arXiv  Detail & Related papers  (2020-07-26T13:17:21Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19: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.