arXiv subjects

J. Helsen

Publications and source records attributed to J. Helsen.

5 recordsLinked to original sources

arXiv2024

Noise-mitigated randomized measurements and self-calibrating shadow estimation

Randomized measurements are increasingly appreciated as powerful tools to estimate properties of quantum systems, e.g., in the characterization of hybrid classical-quantum computation. On many platforms they constitute natively accessible measurements, serving as the building block of prominent schemes like shadow estimation. In the real world, however, the implementation of the random gates at the core of these schemes is susceptible to various sources of noise and imperfections, strongly limiting the applicability of protocols. To attenuate the impact of this shortcoming, in this work we introduce an error-mitigated method of randomized measurements, giving rise to a robust shadow estimation procedure. On the practical side, we show that error mitigation and shadow estimation can be carried out using the same session of quantum experiments, hence ensuring that we can address and mitigate the noise affecting the randomization measurements. Mathematically, we develop a picture derived from Fourier-transforms to connect randomized benchmarking and shadow estimation. We prove rigorous performance guarantees and show the functioning using comprehensive numerics. More conceptually, we demonstrate that, if properly used, easily accessible data from randomized benchmarking schemes already provide such valuable diagnostic information to inform about the noise dynamics and to assist in quantum learning procedures.

quant-ph↗

arXiv2021

Estimating gate-set properties from random sequences

With quantum computing devices increasing in scale and complexity, there is a growing need for tools that obtain precise diagnostic information about quantum operations. However, current quantum devices are only capable of short unstructured gate sequences followed by native measurements. We accept this limitation and turn it into a new paradigm for characterizing quantum gate-sets. A single experiment - random sequence estimation - solves a wealth of estimation problems, with all complexity moved to classical post-processing. We derive robust channel variants of shadow estimation with close-to-optimal performance guarantees and use these as a primitive for partial, compressive and full process tomography as well as the learning of Pauli noise. We discuss applications to the quantum gate engineering cycle, and propose novel methods for the optimization of quantum gates and diagnosing cross-talk.

quant-ph↗

arXiv2021

Simultaneous single-qubit driving of semiconductor spin qubits at the fault-tolerant threshold

Practical Quantum computing hinges on the ability to control large numbers of qubits with high fidelity. Quantum dots define a promising platform due to their compatibility with semiconductor manufacturing. Moreover, high-fidelity operations above 99.9% have been realized with individual qubits, though their performance has been limited to 98.67% when driving two qubits simultaneously. Here we present single-qubit randomized benchmarking in a two-dimensional array of spin qubits, finding native gate fidelities as high as 99.992(1)%. Furthermore, we benchmark single qubit gate performance while simultaneously driving two and four qubits, utilizing a novel benchmarking technique called N-copy randomized benchmarking, designed for simple experimental implementation and accurate simultaneous gate fidelity estimation. We find two- and four-copy randomized benchmarking fidelities of 99.905(8)% and 99.34(4)% respectively, and that next-nearest neighbour pairs are highly robust to cross-talk errors. These characterizations of single-qubit gate quality are crucial for scaling up quantum information technology.

cond-mat.mes-hall↗

arXiv2018

Benchmarking Gate Fidelities in a Si/SiGe Two-Qubit Device

We report the first complete characterization of single-qubit and two-qubit gate fidelities in silicon-based spin qubits, including cross-talk and error correlations between the two qubits. To do so, we use a combination of standard randomized benchmarking and a recently introduced method called character randomized benchmarking, which allows for more reliable estimates of the two-qubit fidelity in this system. Interestingly, with character randomized benchmarking, the two-qubit CPhase gate fidelity can be obtained by studying the additional decay induced by interleaving the CPhase gate in a reference sequence of single-qubit gates only. This work sets the stage for further improvements in all the relevant gate fidelities in silicon spin qubits beyond the error threshold for fault-tolerant quantum computation.

quant-ph↗

arXiv2017

A Crossbar Network for Silicon Quantum Dot Qubits

The spin states of single electrons in gate-defined quantum dots satisfy crucial requirements for a practical quantum computer. These include extremely long coherence times, high-fidelity quantum operation, and the ability to shuttle electrons as a mechanism for on-chip flying qubits. In order to increase the number of qubits to the thousands or millions of qubits needed for practical quantum information we present an architecture based on shared control and a scalable number of lines. Crucially, the control lines define the qubit grid, such that no local components are required. Our design enables qubit coupling beyond nearest neighbors, providing prospects for non-planar quantum error correction protocols. Fabrication is based on a three-layer design to define qubit and tunnel barrier gates. We show that a double stripline on top of the structure can drive high-fidelity single-qubit rotations. Qubit addressability and readout are enabled by self-aligned inhomogeneous magnetic fields induced by direct currents through superconducting gates. Qubit coupling is based on the exchange interaction, and we show that parallel two-qubit gates can be performed at the detuning noise insensitive point. While the architecture requires a high level of uniformity in the materials and critical dimensions to enable shared control, it stands out for its simplicity and provides prospects for large-scale quantum computation in the near future.

cond-mat.mes-hall↗