arXiv subjects

D. Girardi

Publications and source records attributed to D. Girardi.

4 recordsLinked to original sources

arXiv2026

Simultaneous operation of an 18-qubit modular array in germanium

Utility-scale quantum computing requires the integration and operation of a large-scale qubit register. Semiconductor spin qubits are a primary candidate for this, due to the prospects of building integrated hybrid quantum-classical architectures. However, scaling spin-qubit systems while preserving performance and control has remained a challenge. Here, we demonstrate the operation of an 18-qubit array in germanium based on an extendable 2xN architecture. We achieve simultaneous initialization, control, and readout across the entire array, enabled by parallel operation of modular unit cells. Across the array, we achieve average and median single-qubit gate fidelities of 99.8% and 99.9%, respectively. Finally, we characterize the nearest-neighbor exchange couplings throughout the device and implement high-quality controlled-Z gates to generate a three-qubit Greenberger-Horne-Zeilinger (GHZ) state. These results demonstrate that spin-qubit arrays can be scaled while maintaining high-fidelity operation and establish a modular, extendable architecture for planar semiconductor quantum processors.

cond-mat.mes-hall↗

arXiv2012

Dynamical behavior of the Niedermayer algorithm applied to Potts models

In this work we make a numerical study of the dynamic universality class of the Niedermayer algorithm applied to the two-dimensional Potts model with 2, 3, and 4 states. This algorithm updates clusters of spins and has a free parameter, $E_0$, which controls the size of these clusters, such that $E_0=1$ is the Metropolis algorithm and $E_0=0$ regains the Wolff algorithm, for the Potts model. For $-1 0$, spins in different states may be added to the cluster but the dynamic behavior is less efficient than for the Wolff algorithm ($E_0=0$). Therefore, our results show that the Wolff algorithm is the best choice for Potts models, when compared to the Niedermayer's generalization.

cond-mat.stat-mech↗

arXiv2011

Influence of aperiodic modulations on first-order transitions: numerical study of the two-dimensional Potts model

We study the Potts model on a rectangular lattice with aperiodic modulations in its interactions along one direction. Numerical results are obtained using the Wolff algorithm and for many lattice sizes, allowing for a finite-size scaling analyses to be carried out. Three different self-dual aperiodic sequences are employed, which leads to more precise results, since the exact critical temperature is known. We analyze two models, with six and fifteen number of states: both present first-order transitions on their uniform versions. We show that the Harris-Luck criterion, originally introduced in the study of continuous transitions, is obeyed also for first-order ones. Also, we show that the new universality class that emerges for relevant aperiodic modulations depends on the number of states of the Potts model, as obtained elsewhere for random disorder, and on the aperiodic sequence. We determine the occurrence of log-periodic behavior, as expected for models with aperiodic modulated interactions.

cond-mat.stat-mech↗

arXiv2010

Numerical simulation study of the dynamical behavior of the Niedermayer algorithm

We calculate the dynamic critical exponent for the Niedermayer algorithm applied to the two-dimensional Ising and XY models, for various values of the free parameter $E_0$. For $E_0=-1$ we regain the Metropolis algorithm and for $E_0=1$ we regain the Wolff algorithm. For $-1 \widetilde{L}$, the Niedermayer algorithm is equivalent to the Metropolis one, i.e, they have the same dynamic exponent. For $E_0>1$, the autocorrelation time is always greater than for $E_0=1$ (Wolff) and, more important, it also grows faster than a power of $L$. Therefore, we show that the best choice of cluster algorithm is the Wolff one, when compared to the Nierdermayer generalization. We also obtain the dynamic behavior of the Wolff algorithm: although not conclusive, we propose a scaling law for the dependence of the autocorrelation time on $L$.

physics.comp-ph↗