Search

Arrays of gate-defined semiconductor quantum dots are among the leading candidates for building scalable quantum processors. High-fidelity initialization, control, and readout of spin qubit registers require exquisite and targeted control over key Hamiltonian parameters that define the electrostatic environment. However, due to the tight gate pitch, capacitive crosstalk between gates hinders independent tuning of chemical potentials and interdot couplings. While virtual gates offer a practical solution, determining all the required cross-capacitance matrices accurately and efficiently in large quantum dot registers is an open challenge. Here, we establish a Modular Automated Virtualization System (MAViS) -- a general and modular framework for autonomously constructing a complete stack of multi-layer virtual gates in real time. Our method employs machine learning techniques to rapidly extract features from two-dimensional charge stability diagrams. We then utilize computer vision and regression models to self-consistently determine all relative capacitive couplings necessary for virtualizing plunger and barrier gates in both low- and high-tunnel-coupling regimes. Using MAViS, we successfully demonstrate accurate virtualization of a dense two-dimensional array comprising ten quantum dots defined in a high-quality Ge/SiGe heterostructure. Our work offers an elegant and practical solution for the efficient control of large-scale semiconductor quantum dot systems., Comment: 14 pages, 5 figures, 8 pages of supplemental material

Disorder in the heterogeneous material stack of semiconductor spin qubit systems introduces noise that compromises quantum information processing, posing a challenge to coherently control large-scale quantum devices. Here, we exploit low-disorder epitaxial strained quantum wells in Ge/SiGe heterostructures grown on Ge wafers to comprehensively probe the noise properties of complex micron-scale devices comprising of up to ten quantum dots and four rf-charge sensors arranged in a two-dimensional array. We demonstrate an average charge noise of $\sqrt{S_{0}}=0.3(1)$ $\mu\mathrm{eV}/\sqrt{\mathrm{Hz}}$ at 1 Hz across different locations on the wafer, providing a benchmark for quantum confined holes. We then establish hole-spin qubit control in these heterostructures and extend our investigation from electrical to magnetic noise through spin echo measurements. Exploiting dynamical decoupling sequences, we quantify the power spectral density components arising from the hyperfine interaction with $^{73}$Ge spinful isotopes and identify coherence modulations associated with the interaction with the $^{29}$Si nuclear spin bath near the Ge quantum well. We estimate an integrated hyperfine noise amplitude $\sigma_f$ of 180(8) kHz from $^{73}$Ge and of 47(5) kHz from $^{29}$Si, underscoring the need for full isotopic purification of the qubit host environment.

Semiconductor quantum dot arrays are a leading architecture for the development of quantum technologies. Over the years, the constant capacitance model has served as a fundamental framework for simulating, understanding, and navigating the charge stability diagrams of small quantum dot arrays. However, while the size of the arrays keeps growing, solving the constant capacitance model becomes computationally prohibitive. This paper presents an open-source software package able to compute a $100 \times 100$ pixels charge stability diagram of a 16-dot array in less than a second. Smaller arrays can be simulated in milliseconds - faster than they could be measured experimentally, enabling the creation of diverse datasets for training machine learning models and the creation of digital twins that can interface with quantum dot devices in real-time. Our software package implements its core functionalities in the systems programming language Rust and the high-performance numerical computing library JAX. The Rust implementation benefits from advanced optimisations and parallelisation, enabling the users to take full advantage of multi-core processors. The JAX implementation allows for GPU acceleration.

Spanning over two decades, the study of qubits in semiconductors for quantum computing has yielded significant breakthroughs. However, the development of large-scale semiconductor quantum circuits is still limited by challenges in efficiently tuning and operating these circuits. Identifying optimal operating conditions for these qubits is complex, involving the exploration of vast parameter spaces. This presents a real 'needle in the haystack' problem, which, until now, has resisted complete automation due to device variability and fabrication imperfections. In this study, we present the first fully autonomous tuning of a semiconductor qubit, from a grounded device to Rabi oscillations, a clear indication of successful qubit operation. We demonstrate this automation, achieved without human intervention, in a Ge/Si core/shell nanowire device. Our approach integrates deep learning, Bayesian optimization, and computer vision techniques. We expect this automation algorithm to apply to a wide range of semiconductor qubit devices, allowing for statistical studies of qubit quality metrics. As a demonstration of the potential of full automation, we characterise how the Rabi frequency and g-factor depend on barrier gate voltages for one of the qubits found by the algorithm. Twenty years after the initial demonstrations of spin qubit operation, this significant advancement is poised to finally catalyze the operation of large, previously unexplored quantum circuits.

Charge sensing is a sensitive technique for probing quantum devices, of particular importance for spin qubit readout. To achieve good readout sensitivities, the proximity of the charge sensor to the device to be measured is a necessity. However, this proximity also means that the operation of the device affects, in turn, the sensor tuning and ultimately the readout sensitivity. We present an approach for compensating for this cross-talk effect allowing for the gate voltages of the measured device to be swept in a 1 V x 1 V window while maintaining a sensor configuration chosen by a Bayesian optimiser. Our algorithm is a key contribution to the suite of fully automated solutions required for the operation of large quantum device architectures.

The encoding of qubits in semiconductor spin carriers has been recognised as a promising approach to a commercial quantum computer that can be lithographically produced and integrated at scale. However, the operation of the large number of qubits required for advantageous quantum applications will produce a thermal load exceeding the available cooling power of cryostats at millikelvin temperatures. As the scale-up accelerates, it becomes imperative to establish fault-tolerant operation above 1 kelvin, where the cooling power is orders of magnitude higher. Here, we tune up and operate spin qubits in silicon above 1 kelvin, with fidelities in the range required for fault-tolerant operation at such temperatures. We design an algorithmic initialisation protocol to prepare a pure two-qubit state even when the thermal energy is substantially above the qubit energies, and incorporate radio-frequency readout to achieve fidelities up to 99.34 per cent for both readout and initialisation. Importantly, we demonstrate a single-qubit Clifford gate fidelity of 99.85 per cent, and a two-qubit gate fidelity of 98.92 per cent. These advances overcome the fundamental limitation that the thermal energy must be well below the qubit energies for high-fidelity operation to be possible, surmounting a major obstacle in the pathway to scalable and fault-tolerant quantum computation.

Radio-frequency measurements could satisfy DiVincenzo's readout criterion in future large-scale solid-state quantum processors, as they allow for high bandwidths and frequency multiplexing. However, the scalability potential of this readout technique can only be leveraged if quantum device tuning is performed using exclusively radio-frequency measurements i.e. without resorting to current measurements. We demonstrate an algorithm that automatically tunes double quantum dots using only radio-frequency reflectometry. Exploiting the high bandwidth of radio-frequency measurements, the tuning was completed within a few minutes without prior knowledge about the device architecture. Our results show that it is possible to eliminate the need for transport measurements for quantum dot tuning, paving the way for more scalable device architectures.

Variational quantum algorithms are promising tools for near-term quantum computers as their shallow circuits are robust to experimental imperfections. Their practical applicability, however, strongly depends on how many times their circuits need to be executed for sufficiently reducing shot-noise. We consider metric-aware quantum algorithms: variational algorithms that use a quantum computer to efficiently estimate both a matrix and a vector object. For example, the recently introduced quantum natural gradient approach uses the quantum Fisher information matrix as a metric tensor to correct the gradient vector for the co-dependence of the circuit parameters. We rigorously characterise and upper bound the number of measurements required to determine an iteration step to a fixed precision, and propose a general approach for optimally distributing samples between matrix and vector entries. Finally, we establish that the number of circuit repetitions needed for estimating the quantum Fisher information matrix is asymptotically negligible for an increasing number of iterations and qubits., Comment: 17 pages, 3 figures

Estimating the expectation value of an operator corresponding to an observable is a fundamental task in quantum computation. It is often impossible to obtain such estimates directly, as the computer is restricted to measuring in a fixed computational basis. One common solution splits the operator into a weighted sum of Pauli operators and measures each separately, at the cost of many measurements. An improved version collects mutually commuting Pauli operators together before measuring all operators within a collection simultaneously. The effectiveness of doing this depends on two factors. Firstly, we must understand the improvement offered by a given arrangement of Paulis in collections. In our work, we propose two natural metrics for quantifying this, operating under the assumption that measurements are distributed optimally among collections so as to minimise the overall finite sampling error. Motivated by the mathematical form of these metrics, we introduce SORTED INSERTION, a collecting strategy that exploits the weighting of each Pauli operator in the overall sum. Secondly, to measure all Pauli operators within a collection simultaneously, a circuit is required to rotate them to the computational basis. In our work, we present two efficient circuit constructions that suitably rotate any collection of $k$ independent commuting $n$-qubit Pauli operators using at most $kn-k(k+1)/2$ and $O(kn/\log k)$ two-qubit gates respectively. Our methods are numerically illustrated in the context of the Variational Quantum Eigensolver, where the operators in question are molecular Hamiltonians. As measured by our metrics, SORTED INSERTION outperforms four conventional greedy colouring algorithms that seek the minimum number of collections., Comment: 19 pages, journal version