Pith. sign in

REVIEW

QSweep: Pulse-Optimal Single-Qudit Synthesis

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

arxiv 2312.09990 v1 pith:GAO6RPGT submitted 2023-12-15 quant-ph

QSweep: Pulse-Optimal Single-Qudit Synthesis

classification quant-ph
keywords solutionsqsweepsingle-quditanalyticalnumericalpulse-optimalququartresulting
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

The synthesis of single-qudit unitaries has mainly been understudied, resulting in inflexible and non-optimal analytical solutions, as well as inefficient and impractical numerical solutions. To address this challenge, we introduce QSweep, a guided numerical synthesizer that produces pulse-optimal single-qudit decompositions for any subspace gateset, outperforming all prior solutions. When decomposing ququart gates, QSweep created circuits 4100x (up to 23500x) faster than QSearch with an average of 7.9 fewer pulses than analytical solutions, resulting in an overall 1.54x and 2.36x improvement in experimental single-qutrit and ququart gate fidelity as measured by randomized benchmarking.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.