Precise qubit manipulation is fundamental to quantum computing, yet experimental systems generally have stray coupling between the qubit and the environment, which hinders the necessary high-precision control. Here, we report the first theoretical progress in correcting an important class of errors stemming from fluctuations in the magnetic field gradient, in the context of the singlet–triplet spin qubit in a semiconductor double quantum dot. These errors are not amenable to correction via control techniques developed in other contexts, as here the experimenter has precise control only over the rotation rate about the z axis of the Bloch sphere, and this rate is furthermore restricted to be positive and bounded. Despite these strong constraints, we construct simple electrical pulse sequences that, for small gradients, carry out z axis rotations while cancelling errors up to the sixth order in gradient fluctuations, and for large gradients, carry out arbitrary rotations while cancelling the leading order error.
Nonadiabatic holonomic quantum computation (NHQC) has been developed to shorten the construction times of geometric quantum gates. However, previous NHQC gates require the driving Hamiltonian to satisfy a set of rather restrictive conditions, reducing the robustness of the resulting geometric gates against control errors. Here we show that nonadiabatic geometric gates can be constructed in an extensible way, called , for maintaining both flexibility and robustness against certain types of noises. Consequently, this approach makes it possible to incorporate most of the existing optimal control methods, such as dynamical decoupling, composite pulses, and a shortcut to adiabaticity, into the construction of single-looped geometric gates. Furthermore, this extensible approach of geometric quantum computation can be applied to various physical platforms such as superconducting qubits and nitrogen-vacancy centers. Specifically, we performed numerical simulation to show how the noise robustness in recent experimental implementations [ Phys. Rev. Lett. 119, 140503 (2017); Nat. Photonics 11, 309 (2017)] can be significantly improved by our .approach. These results cover a large class of new techniques combing the noise robustness of both geometric phase and optimal control theory.
Reinforcement learning has been widely used in many problems, including quantum control of qubits. However, such problems can, at the same time, be solved by traditional, non-machine-learning methods, such as stochastic gradient descent and Krotov algorithms, and it remains unclear which one is most suitable when the control has specific constraints. In this work, we perform a comparative study on the efficacy of three reinforcement learning algorithms: tabular Q-learning, deep Q-learning, and policy gradient, as well as two non-machine-learning methods: stochastic gradient descent and Krotov algorithms, in the problem of preparing a desired quantum state. We found that overall, the deep Q-learning and policy gradient algorithms outperform others when the problem is discretized, e.g. allowing discrete values of control, and when the problem scales up. The reinforcement learning algorithms can also adaptively reduce the complexity of the control sequences, shortening the operation time and improving the fidelity. Our comparison provides insights into the suitability of reinforcement learning in quantum control problems.
Dynamical mean-field methods are used to calculate the phase diagram, many-body density of states, relative orbital occupancy, and Fermi-surface shape for a realistic model of -based superlattices. The model is derived from density-functional band calculations and includes oxygen orbitals. The combination of the on-site Hunds interaction and charge transfer between the transition metal and the oxygen orbitals is found to reduce the orbital polarization far below the levels predicted either by band-structure calculations or by many-body analyses of Hubbard-type models which do not explicitly include the oxygen orbitals. The findings indicate that heterostructuring is unlikely to produce one band-model physics and demonstrate the fundamental inadequacy of modeling the physics of late transition-metal oxides with Hubbard-like models.
We present a comprehensive theoretical treatment of supcode, a method for generating dynamically corrected quantum gate operations, which are immune to random noise in the environment, by using carefully designed sequences of soft pulses. supcode enables dynamical error suppression even when the control field is constrained to be positive and uniaxial, making it particularly suited to counteracting the effects of noise in systems subject to these constraints such as singlet-triplet qubits. We describe and explain in detail how to generate supcode pulse sequences for arbitrary single-qubit gates and provide several explicit examples of sequences that implement commonly used gates, including the single-qubit Clifford gates. We develop sequences for noise-resistant two-qubit gates for two exchange-coupled singlet-triplet qubits by cascading robust single-qubit gates, leading to a 35% reduction in gate time compared to previous works. This cascade approach can be scaled up to produce gates for an arbitrary-length spin qubit array and is thus relevant to scalable quantum computing architectures. To more accurately describe real spin qubit experiments, we show how to design sequences that incorporate additional features and practical constraints such as sample-specific charge noise models and finite pulse rise times. We provide a detailed analysis based on randomized benchmarking to show how supcode gates perform under realistic $1/{f}^{$\alpha${}}$ noise and find a strong dependence of gate fidelity on the exponent $$\alpha${}$, with best performance for $$\alpha${}>1$. Our supcode sequences can therefore be used to implement robust universal quantum computation while accommodating the fundamental constraints and experimental realities of singlet-triplet qubits.
Measurement and estimation of parameters are essential for science and engineering, where one of the main quests is to find systematic schemes that can achieve high precision. While conventional schemes for quantum parameter estimation focus on the optimization of the probe states and measurements, it has been recently realized that control during the evolution can significantly improve the precision. The identification of optimal controls, however, is often computationally demanding, as typically the optimal controls depend on the value of the parameter which then needs to be re-calculated after the update of the estimation in each iteration. Here we show that reinforcement learning provides an efficient way to identify the controls that can be employed to improve the precision. We also demonstrate that reinforcement learning is highly generalizable, namely the neural network trained under one particular value of the parameter can work for different values within a broad range. These desired features make reinforcement learning an efficient alternative to conventional optimal quantum control methods.