Projective squeezing for translation symmetric bosonic codes

2024/03/21 by Suguru Endo, Endo, Suguru, Keitaro Anai +7 · 3 citations
Computer Science · #Coding theory and cryptography #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2403.14218

openalex publication_date 2024/03/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The design of translation symmetric bosonic codes, e.g., Gottesmann-Kitaev-Preskill and squeezed cat codes, is robust against photon loss, but the computation accuracy is limited by the available squeezing level. Here, we introduce the projective squeezing (PS) method for computing outcomes for a higher squeezing level by revealing that a linear combination of displacement operators with periodic displacement values constitutes the smeared projector onto the better code space; we also show the analytical relationship between the increased squeezing level and the projection probability. We introduce concrete implementation methods for PS based on linear-combination-of-unitaries and virtual quantum error detection. We also numerically verify our analytical arguments and show that our protocol can mitigate the effect of photon loss.

Cited by

• Trade-offs between Quantum and Classical Resources in the Linear Combination of Unitaries
• Exploiting Translational Symmetry for Quantum Computing with Squeezed Cat Qubits
• Circuit Knitting for Continuous-Variable Quantum States

Related

• Squeezed-vacuum bosonic codes
• Unitary-transformed projective squeezing: applications for circuit-knitting and state-preparation of non-Gaussian states
• Exploiting Translational Symmetry for Quantum Computing with Squeezed Cat Qubits
• Quantum Error Correction with Superpositions of Squeezed Fock States
• Bosonic quantum error correction using squeezed Fock states