skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Award ID contains: 2330909

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. https://doi.org/10.1007/s10623-024-01481-z 
    more » « less
  2. As with classical computers, quantum computers require error-correction schemes to reliably perform useful large-scale calculations. The nature and frequency of errors depends on the quantum computing platform, and although there is a large literature on qubit-based coding, these are often not directly applicable to devices that store information in bosonic systems such as photonic resonators. Here, we introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, and we obtain multimode extensions of the cat codes that can outperform previous constructions but require a similar type of overhead. Our polytope-based cat codes consist of sets of points with large separation that, at the same time, form averaging sets known as spherical designs. We also recast concatenations of Calderbank–Shor–Steane codes with cat codes as quantum spherical codes, which establishes a method to autonomously protect against dephasing noise. 
    more » « less
  3. We construct a new family of permutationally invariant codes that correct t Pauli errors for any t 1 . We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes as particular cases, which also admit transversal gates. In many cases, the codes in the new family are shorter than the best previously known explicit permutationally invariant codes for Pauli errors and deletions. Furthermore, our new code family includes a new ( ( 4 , 2 , 2 ) ) optimal single-deletion-correcting code. As a separate result, we generalize the conditions for permutationally invariant codes to correct t Pauli errors from the previously known results for t = 1 to any number of errors. For small t , these conditions can be used to construct new examples of codes by computer. 
    more » « less