Papers › Machine learning enables completely automatic tuning of a quantum device faster than...

Machine learning enables completely automatic tuning of a quantum device faster than human experts

8 Jan 2020arXiv:2001.02589archive 2025-07-28

H. Moon, D. T. Lennon, J. Kirkpatrick, N. M. van Esbroeck, L. C. Camenzind, Liuqi Yu, F. Vigneau, D. M. Zumbühl, G. A. D. Briggs, M. A. Osborne, D. Sejdinovic, E. A. Laird, N. Ares

Device variability is a bottleneck for the scalability of semiconductor quantum devices. Increasing device control comes at the cost of a large parameter space that has to be explored in order to find the optimal operating conditions. We demonstrate a statistical tuning algorithm that navigates this entire parameter space, using just a few modelling assumptions, in the search for specific electron transport features. We focused on gate-defined quantum dot devices, demonstrating fully automated tuning of two different devices to double quantum dot regimes in an up to eight-dimensional gate voltage space. We considered a parameter space defined by the maximum range of each gate voltage in these devices, demonstrating expected tuning in under 70 minutes. This performance exceeded a human benchmark, although we recognise that there is room for improvement in the performance of both humans and machines. Our approach is approximately 180 times faster than a pure random search of the parameter space, and it is readily applicable to different material systems and device architectures. With an efficient navigation of the gate voltage space we are able to give a quantitative measurement of device variability, from one device to another and after a thermal cycle of a device. This is a key demonstration of the use of machine learning techniques to explore and optimise the parameter space of quantum devices and overcome the challenge of device variability.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2001.02589")

Code

Syntology Ran 1 of 19 code samples harvested from 2 repositories linked to this paper; 18 have no recorded run. Of those that ran: 1 ran · fixture could not drive it.

By repository: community (archive-listed): 19 samples from 2 repositories, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

oxquantum-repo/AutoDot mentioned on GitHub report
oxquantum-repo/Tuning_old mentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

19 samples harvested; 1 ran; 0 honoured the contract we drafted; 18 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · fixture could not drive it
18unverified

Licence: 0 of the 19 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

bool_cond oxquantum-repo/AutoDot/Investigation/Investigation_factory.py community (archive-listed) ran · fixture could not drive it fingerprinted MIT (permissive) · 4ae8899c0321bc7a · report
EI oxquantum-repo/Tuning_old/BO_common.py community (archive-listed) unverified MIT (permissive) · 25d62f0dddf3e169 · report
L1_norm oxquantum-repo/Tuning_old/config_model.py community (archive-listed) unverified MIT (permissive) · ae1213c30b4f0ddd · report
L2_norm oxquantum-repo/Tuning_old/config_model.py community (archive-listed) unverified MIT (permissive) · 44eb9fe4552c529b · report
augmented_EI oxquantum-repo/Tuning_old/BO_common.py community (archive-listed) unverified MIT (permissive) · ed38534b68cfa269 · report
calc_estimates oxquantum-repo/Tuning_old/Bayesian_stat2.py community (archive-listed) unverified MIT (permissive) · 3b584e07a29de162 · report
convert_2D_format oxquantum-repo/Tuning_old/GP_interface.py community (archive-listed) unverified MIT (permissive) · aa0fb1b89906176d · report
convert_lengthscale oxquantum-repo/Tuning_old/GP_interface.py community (archive-listed) unverified MIT (permissive) · eae8b5fcd5cd7030 · report
find_peaks oxquantum-repo/Tuning_old/score_driver.py community (archive-listed) unverified MIT (permissive) · 85bc74da10b91fad · report
gaussian_kernel oxquantum-repo/Tuning_old/registration_core.py community (archive-listed) unverified MIT (permissive) · a2f01c3070ff282f · report
initialize_sigma2 oxquantum-repo/Tuning_old/registration_core.py community (archive-listed) unverified MIT (permissive) · 966f5b2465c7dd6a · report
make_length_one oxquantum-repo/Tuning_old/config_model.py community (archive-listed) unverified MIT (permissive) · 9a6c98b005409a2d · report
mv_to_shape_scale oxquantum-repo/Tuning_old/GPflow_wrapper.py community (archive-listed) unverified MIT (permissive) · 78661960c49d0b2f · report
ress_1line oxquantum-repo/Tuning_old/score_helper.py community (archive-listed) unverified MIT (permissive) · b9ec54dada2a43a8 · report
ress_2line oxquantum-repo/Tuning_old/score_helper.py community (archive-listed) unverified MIT (permissive) · 13944c961b8a658f · report
ress_2line_pm oxquantum-repo/Tuning_old/score_helper.py community (archive-listed) unverified MIT (permissive) · 253406ca31c3a8fe · report
scaler oxquantum-repo/Tuning_old/score_driver.py community (archive-listed) unverified MIT (permissive) · 7df6355441fd2c3f · report
tune_with_playground_from_file oxquantum-repo/AutoDot/tune.py community (archive-listed) unverified MIT (permissive) · fa79b52462f506ac · report
tune_with_pygor_from_file oxquantum-repo/AutoDot/tune.py community (archive-listed) unverified MIT (permissive) · 305c193cbeb71603 · report

Tasks

BIG-bench Machine Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Random Search

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections