Properly designed control has been shown to be particularly advantageous for improving adiabatic quantum computation (AQC) accuracy and time complexity scaling. Here, an in situ quantum control optimization protocol is developed to indirectly optimize state fidelity without knowledge of the instantaneous spectral gap or the computational solution. The protocol is shown to converge to analytically derived time-optimal controls for Grover's search algorithm. Furthermore, the protocol is utilized to explore optimized control trajectories for the maximum two-bit satisfiability problem, where appreciable improvement in fidelity and the minimum spectral gap over a linear schedule is observed. The approach is also shown to be robust against system model uncertainties (unitary control errors). This method is designed to enable robust control optimization on existing quantum annealing hardware and future AQC processors.
Properly designed control has been shown to be particularly advantageous for improving adiabatic quantum computation (AQC) accuracy and time complexity scaling. Here, an in situ quantum control optimization protocol is developed to indirectly optimize state fidelity without knowledge of the instantaneous spectral gap or the computational solution. The protocol is shown to converge to analytically derived time-optimal controls for Grover's search algorithm. Furthermore, the protocol is utilized to explore optimized control trajectories for the maximum two-bit satisfiability problem, where appreciable improvement in fidelity and the minimum spectral gap over a linear schedule is observed. The approach is also shown to be robust against system model uncertainties (unitary control errors). This method is designed to enable robust control optimization on existing quantum annealing hardware and future AQC processors.
Motivation• In adiabatic quantum computation (AQC), the system is kept in the instantaneous ground state |φ 0 (t) of a slowly varying Hamiltonian H(t), which provides inherent protection against dephasing and relaxation in the energy eigenstate basis.• However, this protection does not guarantee full fault tolerance, since there still exist some types of noise, which can drive undesirable transitions out of the ground state.• Therefore, it would be desirable to try decreasing the accumulation of errors by performing a computation in a shorter time.However, how to reconcile faster evolution with the requirement of adiabaticity?• Our approach: (1) consider Hamiltonians containing multiple control functions and (2) use quantum optimal control theory (QOCT) to find control sets which achieve the target state with a high fidelity while simultaneously maximizing the degree of adiabaticity.• Exploring properties of optimal adiabatic trajectories in few-qubit model systems elucidates the dynamic mechanisms which suppress unwanted excitations from the ground state.
Adiabatic pulses are used extensively to enable robust control of quantum operations. We introduce an approach to adiabatic control that uses the superadiabatic quality factor as a performance metric to design robust, high-fidelity pulses. This approach permits the systematic design of quantum control schemes to maximize the adiabaticity of a unitary operation in a particular time interval given the available control resources. The interplay between adiabaticity, fidelity, and robustness of the resulting pulses is examined for the case of single-qubit inversion, and superadiabatic pulses are demonstrated to have improved robustness to control errors. A numerical search strategy is developed to find a broader class of adiabatic operations, including multiqubit adiabatic unitaries. We illustrate the utility of this search strategy by designing control waveforms that adiabatically implement a two-qubit entangling gate for a model NMR system.
Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the evolution time is finite, the degree of adiabaticity (quantified in this work as the average ground-state population during evolution) depends on the particulars of a dynamic trajectory associated with a given set of control functions. We use quantum optimal control theory with a composite objective functional to numerically search for controls that achieve the target final state with a high fidelity while simultaneously maximizing the degree of adiabaticity. Exploring the properties of optimal adiabatic trajectories in model systems elucidates the dynamic mechanisms that suppress unwanted excitations from the ground state. Specifically, we discover that the use of multiple control functions makes it possible to access a rich set of dynamic trajectories, some of which attain a significantly improved performance (in terms of both fidelity and adiabaticity) through the increase of the energy gap during most of the evolution time.
We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with O (κ poly(log (κ ε))) runtime, where κ is the condition number, and ε is the target accuracy. This is near optimal with respect to both κ and ε, and is achieved without relying on complicated amplitude amplification procedures that are difficult to implement. Our method is applicable to general non-Hermitian matrices, and the cost as well as the number of qubits can be reduced when restricted to Hermitian matrices, and further to Hermitian positive definite matrices. The success of the time-optimal AQC implies that the quantum approximate optimization algorithm (QAOA) with an optimal control protocol can also achieve the same complexity in terms of the runtime. Numerical results indicate that QAOA can yield the lowest runtime compared to the time-optimal AQC, vanilla AQC, and the recently proposed randomization method.
The ability to engineer high-fidelity gates on quantum processors in the presence of systematic errors remains the primary barrier to achieving quantum advantage. Quantum optimal control methods have proven effective in experimentally realizing high-fidelity gates, but they require exquisite calibration to be performant. We apply robust trajectory optimization techniques to suppress gate errors arising from system parameter uncertainty. We propose a derivative-based approach that maintains computational efficiency by using forward-mode differentiation. Additionally, the effect of depolarization on a gate is typically modeled by integrating the Lindblad master equation, which is computationally expensive. We employ a computationally efficient model and utilize time-optimal control to achieve high-fidelity gates in the presence of depolarization. We apply these techniques to a fluxonium qubit and suppress simulated gate errors due to parameter uncertainty below ${10}^{\ensuremath{-}7}$ for static parameter deviations of the order of 1%.
Quantum adiabatic optimization (QAO) is performed using a time-dependent Hamiltonian H(s) with spectral gap γ(s). Assuming the existence of an oracle Γ such that $γ_\min = Θ\left(\min_sΓ(s)\right)$, we provide an algorithm that reliably performs QAO in time $O\left(γ_\min^{-1}\right)$ with $O\left(\log(γ_\min^{-1})\right)$ oracle queries, where $γ_\min = \min_s γ(s)$. Our strategy is not heuristic and does not require guessing time parameters or annealing paths. Rather, our algorithm naturally produces an annealing path such that ∥dH/ds∥≈γ(s) and chooses its own runtime to be as close as possible to optimal while promising convergence to the ground state. We then demonstrate the feasibility of this approach in practice by explicitly constructing a gap oracle Γ for the problem of finding the minimum point m=argminuW(u) of the cost function W:V⟶[0,1], restricting ourselves to computational basis measurements and driving Hamiltonian H(0)=I−∣V∣−1∑u,v∈V∣u⟩⟨v∣. Requiring only that W have a constant lower bound on its spectral gap and upper bound κ on its spectral ratio, our QAO algorithm returns m with probability (1−ε)(1−e−1/ε) in time O(ε−1[∣V∣+(κ−1)2/3∣V∣2/3]). This achieves a quantum advantage for all κ, and recovers Grover scaling up to logarithmic factors when κ≈1. We implement the algorithm as a subroutine in an optimization procedure that produces m with exponentially small failure probability and expected runtime O(ε−1[∣V∣+(κ−1)2/3∣V∣2/3]) even when κ is not known beforehand.