Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code

• URL: http://arxiv.org/abs/2006.05416v1
• Date: Tue, 9 Jun 2020 17:30:41 GMT
• Title: Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code
• Authors: Hayata Yamasaki, Kosuke Fukui, Yuki Takeuchi, Seiichiro Tani, Masato Koashi
• Abstract summary: 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.
• Score: 3.6748639131154315
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Scalability of flying photonic quantum systems in generating quantum entanglement offers a potential for implementing large-scale fault-tolerant quantum computation, especially by means of measurement-based quantum computation (MBQC). However, existing protocols for MBQC inevitably impose a polynomial overhead cost in implementing quantum computation due to geometrical constraints of entanglement structures used in the protocols, and the polynomial overhead potentially cancels out useful polynomial speedups in quantum computation. To implement quantum computation without this cancellation, we construct a protocol for photonic MBQC that achieves as low as poly-logarithmic overhead, by introducing an entanglement structure for low-overhead qubit permutation. Based on this protocol, we design a fault-tolerant photonic MBQC protocol that can be performed by experimentally tractable homodyne detection and Gaussian entangling operations combined with the Gottesman-Kitaev-Preskill (GKP) quantum error-correcting code, which we concatenate with the $7$-qubit code. Our fault-tolerant protocol achieves the threshold $7.8$ dB in terms of the squeezing level of the GKP code, outperforming $8.3$ dB of the best existing protocol for fault-tolerant quantum computation with the GKP surface code. Thus, bridging a gap between theoretical progress on MBQC and photonic experiments towards implementing MBQC, our results open a new way towards realization of a large class of quantum speedups including those polynomial.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Computation Using Large Spin Qudits [0.0]
  dissertation explores quantum computation using qudits encoded into large spins. First, we delve into the generation of high-fidelity universal gate sets for quantum computation with qudits. Next, we analyze schemes to encode a qubit in the large spin qudits for fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2024-05-13T16:19:31Z)
• 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)
• 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)
• An improvement on the versatility of secure multi-party quantum computation protocol: exploitation of triorthogonal quantum error-correcting codes [1.827510863075184]
  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.
  arXiv  Detail & Related papers  (2022-11-01T22:37:43Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum Volume for Photonic Quantum Processors [15.3862808585761]
  Defining metrics for near-term quantum computing processors has been an integral part of the quantum hardware research and development efforts. Most metrics such as randomized benchmarking and quantum volume were originally introduced for circuit-based quantum computers. We present a framework to map physical noises and imperfections in MBQC processes to logical errors in equivalent quantum circuits.
  arXiv  Detail & Related papers  (2022-08-24T18:05:16Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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.