Changhao Li

Quantum counterdiabatic driving with local control

Changhao Li [1], Jiayu Shen [1], Ruslan Shaydulin [1], Marco Pistoia [1]

Abstract

Suppression of diabatic transitions in quantum adiabatic evolution stands as a significant challenge for ground state preparations. Counterdiabatic driving has been proposed to compensate for diabatic losses and achieve shortcut to adiabaticity. However, its implementation necessitates the generation of adiabatic gauge potential, which requires knowledge of the spectral gap of instantaneous Hamiltonians and involves highly non-local drivings in many-body systems. In this work, we consider local counterdiabatic (LCD) driving with approximate adiabatic gauge potential. Using transverse-field Ising model as an example, we present an in-depth study of the performance and optimization of LCD protocols. We then propose a novel two-step protocol based on LCD and simple local single-body control to further improve the performance. The optimization of these LCD-based protocols does not require knowledge of instantaneous Hamiltonians, and only additional local driving is involved. To benchmark the performance of LCD and the proposed local control-enhanced LCD technique, we experimentally implement digitized adiabatic quantum evolution in a trapped-ion system. We characterize the quality of the prepared states and explore the scaling behavior with system size up to 14 qubits. Our demonstration of quantum shortcut to adiabaticity opens a path towards preparing ground states of complex systems with accessible local controls.

Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem

Ruslan Shaydulin [1], Changhao Li [1], Shouvanik Chakrabarti [1], Matthew DeCross [2], Dylan Herman [1], Niraj Kumar [1], Jeffrey Larson [3], Danylo Lykov [1,4], Pierre Minssen [1], Yue Sun [1], Yuri Alexeev [4], Joan M. Dreiling [2], John P. Gaebler [2], Thomas M. Gatterman [2], Justin A. Gerber [2], Kevin Gilmore [2], Dan Gresh [2], Nathan Hewitt [2], Chandler V. Horst [2], Shaohan Hu [1], Jacob Johansen [2], Mitchell Matheny [2], Tanner Mengle [2], Michael Mills [2], Steven A. Moses [2], Brian Neyenhuis [2], Peter Siegfried [2], Romina Yalovetzky [1], Marco Pistoia [1]

Abstract

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization

Zichang He [1], Ruslan Shaydulin [1], Shouvanik Chakrabarti [1], Dylan Herman [1], Changhao Li [1], Yue Sun [1], Marco Pistoia [1]

Abstract

Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm, which it can approximate with sufficient depth. However, it is unclear to what extent the lessons from the adiabatic regime apply to QAOA as executed in practice with small to moderate depth. In this paper, we demonstrate that the intuition from the adiabatic algorithm applies to the task of choosing the QAOA initial state. Specifically, we observe that the best performance is obtained when the initial state of QAOA is set to be the ground state of the mixing Hamiltonian, as required by the adiabatic algorithm. We provide numerical evidence using the examples of constrained portfolio optimization problems with both low ($p\leq 3$) and high ($p = 100$) QAOA depth. Additionally, we successfully apply QAOA with XY mixer to portfolio optimization on a trapped-ion quantum processor using 32 qubits and discuss our findings in near-term experiments.

Fast wide-field quantum sensor based on solid-state spins integrated with a SPAD array

Guoqing Wang [1,2], Francesca Madonini [1,3], Boning Li [1,4], Changhao Li [1,2], Jinggang Xiang [1,4], Federica Villa [3], Paola Cappellaro [1,2,4]

Abstract

Achieving fast, sensitive, and parallel measurement of a large number of quantum particles is an essential task in building large-scale quantum platforms for different quantum information processing applications such as sensing, computation, simulation, and communication. Current quantum platforms in experimental atomic and optical physics based on CMOS sensors and CCD cameras are limited by either low sensitivity or slow operational speed. Here we integrate an array of single-photon avalanche diodes with solid-state spin defects in diamond to build a fast wide-field quantum sensor, achieving a frame rate up to 100~kHz. We present the design of the experimental setup to perform spatially resolved imaging of quantum systems. A few exemplary applications, including sensing DC and AC magnetic fields, temperature, strain, local spin density, and charge dynamics, are experimentally demonstrated using an NV ensemble diamond sample. The developed photon detection array is broadly applicable to other platforms such as atom arrays trapped in optical tweezers, optical lattices, donors in silicon, and rare earth ions in solids.