Changhao Li

Dr. Changhao Li

Unitary Fund, Berkeley, California, USA
orcid
Researcher in quantum science and engineering; MIT PhD 23'

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 May 2024 in Science Advances
Verified
Journal Article
Open access
RSRuslan Shaydulin
Ruslan Shaydulin
CLChanghao Li
Changhao Li
SCShouvanik Chakrabarti
Shouvanik Chakrabarti
MDMatthew DeCross
Matthew DeCross
DHDylan Herman
Dylan Herman
MPMarco Pistoia
Marco Pistoia
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.

27 January 2021 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
CLChanghao Li
Changhao Li
TLTianyi Li
Tianyi Li
YLYi-Xiang Liu
Yi-Xiang Liu
PCPaola Cappellaro
Paola Cappellaro
Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network’s capabilities, the solution to which calls for delicate network design and is currently at the primitive stage. In this study we propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations on a quantum lattice network with finite edge capacities. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification. The routing scheme is highly modularized with a flexible nature, embedding quantum operations within the algorithmic workflow, whose performance is evaluated from multiple perspectives. In particular, three algorithms are proposed and compared for the scheduling of capacity allocation on the edges of quantum network. Embodying the ideas of proportional share and progressive filling that have been well-studied in classical routing problems, we design another scheduling algorithm, the propagatory update method, which in certain aspects overrides the two algorithms based on classical heuristics in scheduling performances. The general solution scheme paves the road for effective design of efficient routing and flow control protocols on applicational quantum networks.

16 December 2021 in Nano Letters
Verified
Journal Article
Closed access
CLChanghao Li
Changhao Li
RSRouhollah Soleyman
Rouhollah Soleyman
MKMohammad Kohandel
Mohammad Kohandel
PCPaola Cappellaro
Paola Cappellaro

27 November 2023 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
ZHZichang He
Zichang He
RSRuslan Shaydulin
Ruslan Shaydulin
SCShouvanik Chakrabarti
Shouvanik Chakrabarti
DHDylan Herman
Dylan Herman
CLChanghao Li
Changhao Li
MPMarco Pistoia
Marco Pistoia
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 ≤ 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.

4 March 2022 in Science
Verified
Journal Article
Closed access
MCMo Chen
Mo Chen
CLChanghao Li
Changhao Li
GPGiandomenico Palumbo
Giandomenico Palumbo
YZYan-Qing Zhu
Yan-Qing Zhu
NGNathan Goldman
Nathan Goldman
PCPaola Cappellaro
Paola Cappellaro
Magnetic monopoles play a central role in areas of physics that range from electromagnetism to topological matter. String theory promotes conventional vector gauge fields of electrodynamics to tensor gauge fields and predicts the existence of more exotic tensor monopoles. Here, we report the synthesis of a tensor monopole in a four-dimensional parameter space defined by the spin degrees of freedom of a single solid-state defect in diamond. Using two complementary methods, we characterized the tensor monopole by measuring its quantized topological charge and its emanating Kalb-Ramond field. By introducing a fictitious external field that breaks chiral symmetry, we further observed an intriguing spectral transition, characterized by spectral rings protected by mirror symmetries. Our work demonstrates the possibility of emulating exotic topological structures inspired by string theory.

8 May 2024 in Quantum Science and Technology
Verified
Journal Article
Open access
CLChanghao Li
Changhao Li
NKNiraj Kumar
Niraj Kumar
ZSZhixin Song
Zhixin Song
SCShouvanik Chakrabarti
Shouvanik Chakrabarti
MPMarco Pistoia
Marco Pistoia
Distributed quantum computing, particularly distributed quantum machine learning, has gained substantial prominence for its capacity to harness the collective power of distributed quantum resources, transcending the limitations of individual quantum nodes. Meanwhile, the critical concern of privacy within distributed computing protocols remains a significant challenge, particularly in standard classical federated learning (FL) scenarios where data of participating clients is susceptible to leakage via gradient inversion attacks by the server. This paper presents innovative quantum protocols with quantum communication designed to address the FL problem, strengthen privacy measures, and optimize communication efficiency. In contrast to previous works that leverage expressive variational quantum circuits or differential privacy techniques, we consider gradient information concealment using quantum states and propose two distinct FL protocols, one based on private inner-product estimation and the other on incremental learning. These protocols offer substantial advancements in privacy preservation with low communication resources, forging a path toward efficient quantum communication-assisted FL protocols and contributing to the development of secure distributed quantum machine learning, thus addressing critical privacy concerns in the quantum computing era.