Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits

• URL: http://arxiv.org/abs/2403.02396v2
• Date: Fri, 5 Apr 2024 16:06:48 GMT
• Title: Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits
• Authors: Mackenzie H. Shaw, Andrew C. Doherty, Arne L. Grimsmo,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Gottesman-Kitaev-Preskill (GKP) code is an exciting route to fault-tolerant quantum computing since Gaussian resources and GKP Pauli-eigenstate preparation are sufficient to achieve universal quantum computing. In this work, we provide a practical proposal to perform Clifford gates and state read-out in GKP codes implemented with active error correction in superconducting circuits. We present a method of performing Clifford circuits without physically implementing any single-qubit gates, reducing the potential for them to spread errors in the system. 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 following the implementation of each gate can reduce the gate infidelity by multiple orders of magnitude. Moreover, we develop a simple analytical technique to estimate the effect of loss and dephasing on GKP codes that matches well with numerics. Finally, we consider the effect of homodyne measurement inefficiencies on logical state read-out and present a scheme that implements a measurement with a $0.1\%$ error rate in $630$ ns assuming an efficiency of just~$75\%$.

Related papers

• Efficient fault-tolerant code switching via one-way transversal CNOT gates [0.0]
  We present a code scheme that respects the constraints of FT circuit design by only making use of switching gates. We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors. We discuss how the scheme can be implemented with a large degree of parallelization, provided that logical auxiliary qubits can be prepared reliably enough.
  arXiv  Detail & Related papers  (2024-09-20T12:54:47Z)
• Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code [0.0]
  We observe improved performance for encoded circuits implementing non-Clifford gates. Our results illustrate the potential of using codes with quantum gates to implement non-trivial algorithms.
  arXiv  Detail & Related papers  (2023-09-15T18:00:02Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• 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)
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era [0.0]
  Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way. In FTQC, a quantum circuit is decomposed into universal gates that can be fault-tolerantly implemented. In this paper, we propose that the Clifford+$T$ decomposition error for a given quantum circuit can be modeled as the depolarizing noise.
  arXiv  Detail & Related papers  (2023-01-10T19:00:01Z)
• Single-shot error mitigation by coherent Pauli checks [6.992823294269743]
  We show how to generate samples from the output distribution of a quantum circuit without full-blown error correction. Our approach is based on Coherent Pauli Checks that detect errors in a Clifford circuit.
  arXiv  Detail & Related papers  (2022-12-07T20:03:07Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
  bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing. In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
  arXiv  Detail & Related papers  (2021-05-28T15:20:21Z)
• Error mitigation for universal gates on encoded qubits [5.774786149181392]
  We show how to implement Clifford+T circuits with a number of T-gates inversely proportional to the physical noise rate. We argue that such circuits can be out of reach for state-of-the-art classical simulation algorithms.
  arXiv  Detail & Related papers  (2021-03-08T17:27:04Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

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.