Engineering Fault-tolerant Bosonic Codes with Quantum Lattice Gates

• URL: http://arxiv.org/abs/2410.17069v2
• Date: Thu, 07 Nov 2024 17:18:38 GMT
• Title: Engineering Fault-tolerant Bosonic Codes with Quantum Lattice Gates
• Authors: Lingzhen Guo, Tangyou Huang, Lei Du,
• Abstract summary: Bosonic codes offer a hardware-efficient approach to encoding and protecting quantum information with a single continuous-variable bosonic system. We introduce a new universal quantum gate set composed of only one type of gate element, which we call the quantum lattice gate, to engineer bosonic code states for fault-tolerant quantum computing.
• Score: 1.1982127665424678
• License:
• Abstract: Bosonic codes offer a hardware-efficient approach to encoding and protecting quantum information with a single continuous-variable bosonic system. In this paper, we introduce a new universal quantum gate set composed of only one type of gate element, which we call the quantum lattice gate, to engineer bosonic code states for fault-tolerant quantum computing. We develop a systematic framework for code state engineering based on the Floquet Hamiltonian engineering, where the target Hamiltonian is constructed directly from the given target state(s). We apply our method to three basic code state engineering processes, including single code state preparation, code space embedding and code space transformation. Furthermore, we explore the application of our method to automatic quantum error correction against single-photon loss with four-legged cat codes. Our proposal is particularly well-suited for superconducting circuit architectures with Josephson junctions, where the full nonlinearity of Josephson junction potential is harnessed as a quantum resource and the quantum lattice gate can be implemented on a sub-nanosecond timescale.

Related papers

• Hardware-Efficient Fault Tolerant Quantum Computing with Bosonic Grid States in Superconducting Circuits [0.0]
  This perspective manuscript describes how bosonic codes, particularly grid state encodings, offer a pathway to scalable fault-tolerant quantum computing. By leveraging the large Hilbert space of bosonic modes, quantum error correction can operate at the single physical unit level. We argue that it offers the shortest path to achieving fault tolerance in gate-based quantum computing processors with a MHz logical clock rate.
  arXiv  Detail & Related papers  (2024-09-09T17:20:06Z)
• Universal quantum computation using atoms in cross-cavity systems [0.0]
  We theoretically investigate a single-step implementation of both a universal two- (CNOT) and three-qubit (quantum Fredkin) gates in a cross-cavity setup. Within a high-cooper regime, the system exhibits an atomic-state-dependent $pi$-phase gate involving the two-mode single-photon bright and dark states.
  arXiv  Detail & Related papers  (2023-08-28T20:09:54Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Re-QGAN: an optimized adversarial quantum circuit learning framework [0.0]
  We propose a quantum generative adversarial network design that uses real Hilbert spaces as the framework for the generative model. We encode classical information by the stereographic projection, which allows us to use the entire classical domain without normalization procedures. This architecture improves state-of-the-art quantum generative adversarial performance while maintaining a shallow-depth quantum circuit.
  arXiv  Detail & Related papers  (2022-08-03T15:52:27Z)
• Fault-tolerant circuit synthesis for universal fault-tolerant quantum computing [0.0]
  We present a quantum circuit synthesis algorithm for implementing universal fault-tolerant quantum computing based on geometricd codes. We show how to synthesize the set of universal fault-tolerant protocols for $[[7,1,3]]$ Steane code and the syndrome measurement protocol of $[[23, 1, 7]]$ Golay code.
  arXiv  Detail & Related papers  (2022-06-06T15:43:36Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• 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)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• 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.