Streamlined quantum computing with macronode cluster states

• URL: http://arxiv.org/abs/2109.04668v3
• Date: Tue, 4 Jan 2022 02:41:14 GMT
• Title: Streamlined quantum computing with macronode cluster states
• Authors: Blayney W. Walshe, Rafael N. Alexander, Nicolas C. Menicucci, Ben Q. Baragiola
• Abstract summary: We show that a Clifford gate and GKP error correction can be simultaneously implemented in a single teleportation step. We find that logical error rates of $10-2$-$10-3$, compatible with the thresholds of topological codes, can be achieved with squeezing of 11.9-13.7 dB.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Continuous-variable cluster states allow for fault-tolerant measurement-based quantum computing when used in tandem with the Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode. For quad-rail-lattice macronode cluster states, whose construction is defined by a fixed, low-depth beam splitter network, we show that a Clifford gate and GKP error correction can be simultaneously implemented in a single teleportation step. We give explicit recipes to realize the Clifford generating set, and we calculate the logical gate-error rates given finite squeezing in the cluster-state and GKP resources. We find that logical error rates of $10^{-2}$-$10^{-3}$, compatible with the thresholds of topological codes, can be achieved with squeezing of 11.9-13.7 dB. The protocol presented eliminates noise present in prior schemes and puts the required squeezing for fault tolerance in the range of current state-of-the-art optical experiments. Finally, we show how to produce distillable GKP magic states directly within the cluster state.

Related papers

• Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits [0.0]
  In superconducting circuits, all the required two-qubit gates can be implemented with a single piece of hardware. We analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder can reduce the gate infidelity by multiple orders of magnitude.
  arXiv  Detail & Related papers  (2024-03-04T19:00:04Z)
• A complete continuous-variable quantum computation architecture based on the 2D spatiotemporal cluster state [5.00127829918438]
  Continuous repetition-based quantum computation is a promising candidate for practical, scalable, universal, and fault-tolerant quantum computation. In this work, a complete architecture including cluster state preparation, gate implementations, and error correction is demonstrated.
  arXiv  Detail & Related papers  (2023-12-21T14:21:33Z)
• Error Correcting States in Ultracold Atoms [0.0]
  We demonstrate a method for encoding Gottesman-Kitaev-Preskill (GKP) error-correcting qubits with single ultracold atoms trapped in individual sites of a deep optical lattice. Using quantum optimal control protocols, we demonstrate the generation of GKP qubit states with 10 dB squeezing.
  arXiv  Detail & Related papers  (2023-12-12T21:32:29Z)
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
  Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
  arXiv  Detail & Related papers  (2023-05-03T18:00:02Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• 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)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Low overhead fault-tolerant quantum error correction with the surface-GKP code [60.44022726730614]
  We propose a highly effective use of the surface-GKP code, i.e., the surface code consisting of bosonic GKP qubits instead of bare two-dimensional qubits. We show that a low logical failure rate $p_L 10-7$ can be achieved with moderate hardware requirements.
  arXiv  Detail & Related papers  (2021-03-11T23:07:52Z)
• A fault-tolerant continuous-variable measurement-based quantum computation architecture [0.9786690381850356]
  Continuous variable measurement-based quantum computation on cluster states has great potential for scalable, universal, and fault-tolerant quantum computation. No complete fault-tolerant architecture exists that includes everything from cluster state generation with finite squeezing to gate implementations with realistic noise and error correction. We propose a simple architecture for the preparation of a cluster state in three dimensions in which gates by gate teleportation can be efficiently implemented.
  arXiv  Detail & Related papers  (2021-01-08T14:01:05Z)
• Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate [0.1759008116536278]
  In some applications access to a non-Clifford two-qubit gate can result in more optimal circuit decompositions. We demonstrate calibration of a low error non-Clifford Controlled-$fracpi2$ phase (CS) gate on a cloud based IBM Quantum computing.
  arXiv  Detail & Related papers  (2020-07-16T18:00:02Z)
• 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.