Papers
Topics
Authors
Recent
Search
2000 character limit reached

Qubit-oscillator-based gate implementations for approximate Gottesman-Kitaev-Preskill codes

Published 19 Sep 2025 in quant-ph | (2509.15707v1)

Abstract: We consider hybrid qubit-oscillator systems together with Gaussian, multi-qubit as well as qubit-controlled Gaussian unitaries. We propose implementations of logical gates for approximate Gottesman-Kitaev-Preskill codes in this model using two oscillators and three qubits. We show that these gate implementations become exact in the limit of large squeezing: The logical gate error is upper bounded by a linear function of the squeezing parameter, and depends polynomially on the number of encoded qubits. For certain Cliffords, our constructions overcome a shortcoming of well-known Gaussian implementations which have a constant logical gate error even in the absence of noise.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 2 likes about this paper.