Refitting DF-THC Weights on a Fixed Angle Table: the Problem, a Deterministic Method, and Open Questions

Many public chemistry gains in the Verifiable Quantum Circuit Compilation competition (Google Quantum AI, Kaggle) are weights-only refits: the QROM angle loaders stay fixed, so qubits and Toffolis are fixed, and new DF-THC weights lower λeff within the two accuracy limits and the Egap floor. This note states the problem exactly from the official verifier, describes a deterministic method (a constrained projected refit alternated with an exact Jacobi column gauge), explains three details that decide whether a refit moves on published weights (deliberate tiny weights, kinks from near-zero eigenvalues of h1′, and consistent targets), reports a reproduction test against public refits, and lists open questions. It is a local method on a non-convex problem; no optimality claim is made. The tool is the Apache-2.0 Kaggle utility script dfthc_refit. Thanks to the competitors whose public notebooks and Apache-2.0 circuits made this work possible. AI-assistance statement: code, analysis and the first draft of the text were produced with Claude, an AI model (Anthropic), under the author's direction; the author reviewed and approved the content.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-03
DOI
https://doi.org/10.5281/zenodo.23930465
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Refitting DF-THC Weights on a Fixed Angle Table: the Problem, a Deterministic Method, and Open Questions

James Michael Barlow
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
article

Refitting DF-THC Weights on a Fixed Angle Table: the Problem, a Deterministic Method, and Open Questions

James Michael Barlow
article en

Abstract

Many public chemistry gains in the Verifiable Quantum Circuit Compilation competition (Google Quantum AI, Kaggle) are weights-only refits: the QROM angle loaders stay fixed, so qubits and Toffolis are fixed, and new DF-THC weights lower λeff within the two accuracy limits and the Egap floor. This note states the problem exactly from the official verifier, describes a deterministic method (a constrained projected refit alternated with an exact Jacobi column gauge), explains three details that decide whether a refit moves on published weights (deliberate tiny weights, kinks from near-zero eigenvalues of h1′, and consistent targets), reports a reproduction test against public refits, and lists open questions. It is a local method on a non-convex problem; no optimality claim is made. The tool is the Apache-2.0 Kaggle utility script dfthc_refit. Thanks to the competitors whose public notebooks and Apache-2.0 circuits made this work possible. AI-assistance statement: code, analysis and the first draft of the text were produced with Claude, an AI model (Anthropic), under the author's direction; the author reviewed and approved the content.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 16%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon