We present an efficient method for the characterization of two coupled discrete quantum systems, one of which can be controlled and measured. For two systems with transition frequencies ωq, ωr, and coupling strength g we show how to obtain estimates of g and ωr whose error decreases exponentially in the number of measurement shots rather than as a power law expected in simple approaches. Our algorithm can thereby identify g and ωr simultaneously with high precision in a few hundred measurement shots. This is achieved by adapting measurement settings upon data as it is collected. We also introduce a method to eliminate erroneous estimates with small overhead. Our algorithm is robust against the presence of relaxation and typical noise. Our results are applicable to many candidate technologies for quantum computation, in particular, for the characterization of spurious two-level systems in superconducting qubits or stripline resonators.
We present an efficient method for the characterization of two coupled discrete quantum systems, one of which can be controlled and measured. For two systems with transition frequencies ωq, ωr, and coupling strength g we show how to obtain estimates of g and ωr whose error decreases exponentially in the number of measurement shots rather than as a power law expected in simple approaches. Our algorithm can thereby identify g and ωr simultaneously with high precision in a few hundred measurement shots. This is achieved by adapting measurement settings upon data as it is collected. We also introduce a method to eliminate erroneous estimates with small overhead. Our algorithm is robust against the presence of relaxation and typical noise. Our results are applicable to many candidate technologies for quantum computation, in particular, for the characterization of spurious two-level systems in superconducting qubits or stripline resonators.
Adaptive data collection and analysis, where data are being fed back to update the measurement settings, can greatly increase speed, precision, and reliability of the characterization of quantum systems. However, decoherence tends to make adaptive characterization difficult. As an example, we consider two coupled discrete quantum systems. When one of the systems can be controlled and measured, the standard method to characterize another, with an unknown frequency ${\ensuremath{\omega}}_{\mathrm{r}}$, is swap spectroscopy. Here, adapting measurements can provide estimates whose error decreases exponentially in the number of measurement shots rather than as a power law in conventional swap spectroscopy. However, when the decoherence time is so short that an excitation oscillating between the two systems can only undergo less than a few tens of vacuum Rabi oscillations, this approach can be marred by a severe limit on accuracy unless carefully designed. We adopt machine learning techniques to search for efficient policies for the characterization of decohering quantum systems. We find, for instance, that when the system undergoes more than 2 Rabi oscillations during its relaxation time T1,O(103) measurement shots are sufficient to reduce the squared error of the Bayesian initial prior of the unknown frequency ${\ensuremath{\omega}}_{\mathrm{r}}$ by a factor O(104) or larger. We also develop policies optimized for extreme initial parameter uncertainty and for the presence of imperfections in the readout.
In characterization of quantum systems, adapting measurement settings based on data while it is collected can generally outperform in efficiency conventional measurements that are carried out independently of data. The existing methods for choosing measurement settings adaptively assume that the model, or the number of unknown parameters, is known. We introduce simultaneous adaptive model selection and parameter estimation. We apply our technique for characterization of a superconducting qubit and a bath of incoherent two-level systems, a leading decoherence mechanism in the state-of-the-art superconducting qubits.
Experimental characterizations of a quantum system involve the measurement of expectation values of observables for a preparable state $\ensuremath{\mid}\ensuremath{\psi}⟩$ of the quantum system. Such expectation values can be measured by repeatedly preparing $\ensuremath{\mid}\ensuremath{\psi}⟩$ and coupling the system to an apparatus. For this method, the precision of the measured value scales as N1 for N repetitions of the experiment. For the problem of estimating the parameter $\ensuremath{\phi}$ in an evolution ${e}^{\ensuremath{-}i\ensuremath{\phi}H}$, it is possible to achieve precision N1 [the quantum metrology limit; see Giovannetti et al., Phys. Rev. Lett. 96, 010401 (2006)] provided that sufficient information about H and its spectrum is available. We consider the more general problem of estimating expectations of operators A with minimal prior knowledge of A. We give explicit algorithms that approach precision N1 given a bound on the eigenvalues of A or on their tail distribution. These algorithms are particularly useful for simulating quantum systems on quantum computers because they enable efficient measurement of observables and correlation functions. Our algorithms are based on a method for efficiently measuring the complex overlap of $\ensuremath{\mid}\ensuremath{\psi}⟩$ and $U\ensuremath{\mid}\ensuremath{\psi}⟩$, where U is an implementable unitary operator. We explicitly consider the issue of confidence levels in measuring observables and overlaps and show that, as expected, confidence levels can be improved exponentially with linear overhead. We further show that the algorithms given here can typically be parallelized with minimal increase in resource usage.
We investigate schemes for Hamiltonian parameter estimation of a two-level system using repeated measurements in a fixed basis. The simplest (Fourier based) schemes yield an estimate with a mean-square error (MSE) that decreases at best as a power law $\ensuremath{\sim}{N}^{\ensuremath{-}2}$ in the number of measurements N. By contrast, we present numerical simulations indicating that an adaptive Bayesian algorithm, where the time between measurements can be adjusted based on prior measurement results, yields a MSE which appears to scale close to $\mathrm{exp}(\ensuremath{-}0.3N)$. That is, measurements in a single fixed basis are sufficient to achieve exponential scaling in N.
Two-level systems (TLS) in superconducting quantum devices are a dominant source of decoherence, noise, and device variability, ultimately limiting qubit performance and scalability. Efficient and reliable extraction of TLS parameters from spectroscopy measurements is therefore essential for both device characterization and materials optimization. In this thesis, machine learning methods are developed to accelerate and enhance TLS characterization from superconducting qubit spectroscopy data. The approach combines physics-based simulation of driven qubit–TLS dynamics with supervised learning models trained on synthetic datasets to infer underlying physical parameters from two-dimensional spectroscopy maps. Particular emphasis is placed on understanding how different parameters are encoded in observable features, and on evaluating the extent to which the inverse problem is well-posed. The results demonstrate that machine-learning-assisted inference can significantly reduce the computational cost of parameter estimation compared to conventional fitting-based approaches, while maintaining high accuracy for spectrally encoded parameters such as TLS frequency and coupling strength. In contrast, decoherence parameters are shown to be intrinsically more challenging to extract from short-time spectroscopy data, highlighting fundamental limitations of the measurement protocol rather than the learning model. Overall, this work establishes a data-driven framework for scalable TLS characterization and provides insight into the interplay between physical observability and machine learning-based inference in quantum systems.
The resources required to characterize the dynamics of engineered quantum systems--such as quantum computers and quantum sensors--grow exponentially with system size. Here we adapt techniques from compressive sensing to exponentially reduce the experimental configurations required for quantum process tomography. Our method is applicable to processes that are nearly sparse in a certain basis and can be implemented using only single-body preparations and measurements. We perform efficient, high-fidelity estimation of process matrices of a photonic two-qubit logic gate. The database is obtained under various decoherence strengths. Our technique is both accurate and noise robust, thus removing a key roadblock to the development and scaling of quantum technologies.