We perform a functional expansion of the fidelity between two unitary matrices in order to find necessary conditions for the robust implementation of a target gate. Comparison of these conditions with those obtained from the the Magnus expansion and Dyson series shows that they are equivalent in the first order. By exploiting techniques from robust design optimization , we account for issues of experimental feasibility by introducing an additional criterion to the search for control pulses. This search is accomplished by exploring the competition between the multiple objectives in the implementation of the NOT gate by means of evolutionary multi-objective optimization.
We perform a functional expansion of the fidelity between two unitary matrices in order to find necessary conditions for the robust implementation of a target gate. Comparison of these conditions with those obtained from the the Magnus expansion and Dyson series shows that they are equivalent in the first order. By exploiting techniques from robust design optimization , we account for issues of experimental feasibility by introducing an additional criterion to the search for control pulses. This search is accomplished by exploring the competition between the multiple objectives in the implementation of the NOT gate by means of evolutionary multi-objective optimization.
We study the robustness of the evolution of a quantum system against small uncontrolled variations in parameters in the Hamiltonian. We show that the fidelity susceptibility, which quantifies the perturbative error to leading order, can be expressed in superoperator form and use this to derive control pulses that are robust to any class of systematic unknown errors. The proposed optimal control protocol is equivalent to searching for a sequence of unitaries that mimics the first-order moments of the Haar distribution, i.e., it constitutes a 1-design. We highlight the power of our results for error-resistant single- and two-qubit gates.
Abstract A robust pulse is traditionally obtained by optimizing the fidelity of one target gate at a time, each gate on its own landscape, so a robust gate family appears only as a sequence of separately optimized pulses. Here we define a target-independent quantum control robustness landscape (QCRL) from the Magnus expansion of the noise propagator in the toggling frame. Robust controls of every gate in a parametric family lie on the same zero set of this landscape, at regular points a smooth local branch of dimension p − r for p control parameters and r independent constraints, and traversing it produces the family: robustness-invariant pulse variation (RIPV), the predictor–corrector continuation we use, varies one optimized seed pulse along the branch at a constraint residual of 10−10. For Rx(θ) under quasistatic dephasing one branch spans the full family at first and at first-plus-second order, with exact-propagation fidelity above 0.999 for every pulse up to relative detunings of 4.7% and 10.5%; the same construction yields a dual-control family robust to three-axis noise. By shifting from optimizing target-dependent fidelity to maintaining target-independent robustness, we unify the synthesis of robust gate families into a single geometric traversal.
Generating a unitary transformation in the shortest possible time is of practical importance to quantum information processing because it helps to reduce decoherence effects and improve robustness to additive control field noise. Many analytical and numerical studies have identified the minimum time necessary to implement a variety of quantum gates on coupled-spin qubit systems. This work focuses on exploring the Pareto front that quantifies the tradeoff between the competitive objectives of maximizing the gate fidelity F and minimizing the control time T. In order to identify the critical time T∗ below which the target transformation is not reachable, as well as to determine the associated Pareto front, we introduce a numerical method of Pareto front tracking (PFT). We consider closed two- and multiqubit systems with constant interqubit coupling strengths and each individual qubit controlled by a separate time-dependent external field. Our analysis demonstrates that unit fidelity (to a desired numerical accuracy) can be achieved at any $T\ensuremath{\ge}{T}^{*}$ in most cases. However, the optimization search effort rises superexponentially as T decreases and approaches T∗. Furthermore, a small decrease in control time incurs a significant penalty in fidelity for T<T∗, indicating that it is generally undesirable to operate below the critical time. We investigate the dependence of the critical time T∗ on the coupling strength between qubits and the target gate transformation. Practical consequences of these findings for laboratory implementation of quantum gates are discussed.
External controls are necessary to enact quantum logic operations, and the inevitable control noise will result in gate errors in a realistic quantum circuit. We investigate the robustness of quantum gates to the random noise in an optimal control field, by utilizing properties of the quantum control landscape that relates the physical objective (in the present case, the quantum gate fidelity) to the applied controls. An approximate result obtained for the statistical expectation value of the gate fidelity in the weak noise regime is shown to be in excellent agreement with direct Monte Carlo sampling over noise process realizations for fidelity values relevant for practical quantum information processing. Using this approximate result, we demonstrate that maximizing the robustness to additive/multiplicative white noise is equivalent to minimizing the total control time/fluence. Also, a genetic optimization algorithm is used to identify controls with improved robustness to a colored noise characterized by its autocorrelation function.
High-fidelity quantum gates are crucial for achieving fault-tolerant quantum computing; however, decoherence significantly reduces gate fidelities during long operation times. Although optimal control techniques can theoretically minimize these operation times, they often neglect realistic uncertainties in system parameters. In this work, we demonstrate that by using robust optimal control strategies, the cross-resonance gate in superconducting systems can be operated within 64 ns, achieving fidelities of [Formula: see text] while maintaining robustness against up to 10% uncertainty in a single parameter. Alternatively, by extending the control time to 71 ns, we achieve fidelities of [Formula: see text] with robustness against up to 3% uncertainty. Our results identify the minimal control times attainable with experimentally feasible pulses and system parameters, as well as the maximum allowable static parameter error for high-fidelity operations. Furthermore, we demonstrate simultaneous robustness against both static and time-dependent errors by generating 100 ns control pulses ([Formula: see text]) that maintain robustness against 10% static parameter error and time-dependent parameter fluctuations two orders of magnitude stronger than typical experimental noise. These findings demonstrate a viable open-loop strategy for implementing fast, high-fidelity quantum gates in the presence of realistic system uncertainties that would otherwise degrade conventional control pulses.
This paper presents a comparative study regarding the evolutionary design of quantum operators in the form of unitary matrices. Three different techniques allowing the generation of unitary matrices are investigated whose parameters are tuned by means of evolutionary algorithms. Such problem may be considered as a numerical optimisation task because the unitary matrices are represented by complex numbers with real-valued coefficients. Specifically, Genetic Algorithm and Evolution Strategy are applied, each in four different setups, and evaluated on three case studies: the 2-qubit Controlled-NOT gate, 3-qubit entanglement operator and 4-qubit detector of an element with the maximum amplitude. The evolutionary algorithms in combination with the given representation techniques are evaluated in order to determine the abilities of various experimental setups to solve the given tasks. The main contribution is the utilisation of QR decomposition, a technique for generating unitary matrices from theoretically any sequence of complex numbers, that has been applied for the first time in this paper for the evolution of quantum operators. It will be demonstrated that the QR decomposition exhibits a good performance especially in solving more complex quantum operators in comparison with other representations.