REVIEW
Exact and approximate continuous-variable gate decompositions
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
Exact and approximate continuous-variable gate decompositions
read the original abstract
We gather and examine in detail gate decomposition techniques for continuous-variable quantum computers and also introduce some new techniques which expand on these methods. Both exact and approximate decomposition methods are studied and gate counts are compared for some common operations. While each having distinct advantages, we find that exact decompositions have lower gate counts whereas approximate techniques can cover decompositions for all continuous-variable operations but require significant circuit depth for a modest precision.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.