Pith. sign in

REVIEW 3 cited by

The Snake Optimizer for Learning Quantum Processor Control Parameters

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 2006.04594 v1 pith:GHFMXIF4 submitted 2020-06-08 quant-ph

classification quant-ph
keywords quantumsnakeoptimizationoptimizerproblemssystemcontrollearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

High performance quantum computing requires a calibration system that learns optimal control parameters much faster than system drift. In some cases, the learning procedure requires solving complex optimization problems that are non-convex, high-dimensional, highly constrained, and have astronomical search spaces. Such problems pose an obstacle for scalability since traditional global optimizers are often too inefficient and slow for even small-scale processors comprising tens of qubits. In this whitepaper, we introduce the Snake Optimizer for efficiently and quickly solving such optimization problems by leveraging concepts in artificial intelligence, dynamic programming, and graph optimization. In practice, the Snake has been applied to optimize the frequencies at which quantum logic gates are implemented in frequency-tunable superconducting qubits. This application enabled state-of-the-art system performance on a 53 qubit quantum processor, serving as a key component of demonstrating quantum supremacy. Furthermore, the Snake Optimizer scales favorably with qubit number and is amenable to both local re-optimization and parallelization, showing promise for optimizing much larger quantum processors.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Remote entanglement generation via enhanced quantum state transfer

    quant-ph 2025-06 conditional novelty 7.0 of 10

    A zig-zag frequency pattern suppresses population on intermediate qubits and reduces error in remote Bell state generation on a superconducting processor.

  2. The Threshold Theorem in Watts: Fault Tolerance as a Question About Objective Probability

    quant-ph 2026-07 conditional novelty 6.0 of 10

    Fault-tolerant quantum computing is reframed as an empirical question about watts per decade of suppressed logical error, with a concrete two-measurement protocol proposed.

  3. Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors

    quant-ph 2026-01 reject novelty 5.0 of 10

    The Snake optimizer is identified with block coordinate descent, and a nearest-neighbor heuristic over a sequence-dependent TSP is proposed to order blocks and reduce calibration cost; the SD-TSP cost is not specified.

Pith tools