An improvement on the versatility of secure multi-party quantum computation protocol: exploitation of triorthogonal quantum error-correcting codes

• URL: http://arxiv.org/abs/2211.00777v1
• Date: Tue, 1 Nov 2022 22:37:43 GMT
• Title: An improvement on the versatility of secure multi-party quantum computation protocol: exploitation of triorthogonal quantum error-correcting codes
• Authors: Petr A. Mishchenko and Keita Xagawa
• Abstract summary: We propose a modified MPQC protocol based on triorthogonal QECCs. Especially, the variety of available options in the region of a small number of quantum nodes $n$ becomes important in the noisy intermediate-scale quantum (NISQ) era.
• Score: 1.827510863075184
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Secure multi-party quantum computation (MPQC) protocol is a versatile tool that enables error-free distributed quantum computation to a group of $n$ mutually distrustful quantum nodes even when some of the quantum nodes do not follow the instructions of the protocol honestly. However, in case of the MPQC protocols built on top of the quantum error correction technique, the versatility is significantly affected by the fact that one has to choose a particular quantum error-correcting code (QECC), which immediately applies a constraint on the number of quantum nodes $n$. Therefore, in this talk, we suggest a modified MPQC protocol based on triorthogonal QECCs which applies significantly less constraint on the number of quantum nodes $n$ if compared to the previously suggested MPQC protocol based on triply-even QECCs. Especially, the variety of available options in the region of a small number of quantum nodes $n$ becomes important in the noisy intermediate-scale quantum (NISQ) era.

Related papers

• Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
  We address the problem of reliable provision of entangled qubits in quantum computing schemes. We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC) Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
  arXiv  Detail & Related papers  (2023-05-01T17:13:23Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• A Remote Quantum Error-correcting Code Preparation Protocol on Cluster State [5.5534193467961055]
  The blind quantum computation (BQC) protocol allows for privacy-preserving remote quantum computations. We introduce a remote quantum error correction code preparation protocol for BQC using a cluster state and analyze its blindness in the measurement-based quantum computation model.
  arXiv  Detail & Related papers  (2023-01-05T10:13:52Z)
• 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 Neuron with Separable-State Encoding [0.0]
  It is not yet possible to test advanced quantum neuron models on a large scale in currently available quantum processors. We propose a quantum perceptron (QP) model that uses a reduced number of multi-qubit gates. We demonstrate the performance of the proposed model by implementing a few qubits version of the QP in a simulated quantum computer.
  arXiv  Detail & Related papers  (2022-02-16T19:26:23Z)
• Entanglement-assisted concatenated quantum codes [77.34669920414821]
  Entanglement-assistedd quantum codes (EACQCs) constructed by concatenating two quantum codes are proposed. EACQCs show several advantages over the standard quantum codes (CQCs) EACQCs are not only competitive in quantum communication but also applicable in fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2022-02-16T14:14:02Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum Computation and Communication in Bosonic Systems [1.52292571922932]
  I provide an overview of bosonic quantum error correction schemes and present my contributions to the field. I demonstrate that fault-tolerant bosonic QEC is possible by concatenating a single-mode bosonic code with a multi-qubit error-correcting code. I provide explicit bosonic error correction schemes that nearly achieve the fundamental performance limit set by the quantum capacity.
  arXiv  Detail & Related papers  (2021-03-17T05:09:04Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code [3.6748639131154315]
  We develop a fault-tolerant quantum computation protocol for measurement-based quantum computation (MBQC) Our protocol achieves the threshold $7.8$ dB in terms of the squeezing level of the best existing protocol for fault-tolerant quantum computation. Our results open a new way towards realization of a large class of quantum speedups.
  arXiv  Detail & Related papers  (2020-06-09T17:30:41Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.