REVIEW 1 cited by
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum computing with rotation-symmetric bosonic codes
read the original abstract
Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class--number-phase codes--which includes the well-known cat and binomial codes, among many others. The entangling gate in our scheme is code-agnostic and can be used to interface different rotation-symmetric encodings. In addition to a universal set of operations, we propose a teleportation-based error correction scheme that allows recoveries to be tracked entirely in software. Focusing on cat and binomial codes as examples, we compute average gate fidelities for error correction under simultaneous loss and dephasing noise and show numerically that the error-correction scheme is close to optimal for error-free ancillae and ideal measurements. Finally, we present a scheme for fault-tolerant, universal quantum computing based on concatenation of number-phase codes and Bacon-Shor subsystem codes.
Forward citations
Cited by 1 Pith paper
-
Bosonic quantum error-correcting codes with finite stellar rank
Finite stellar rank creates a trade-off between state-preparation cost and QEC performance for bosonic codes, with rank k=2 optimized encodings surpassing break-even under dephasing.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.