English

Quantum circuit architecture search on a superconducting processor

Quantum Physics 2022-01-05 v1

Abstract

Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the heuristic ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability, which may lead to the degraded performance when executed on the noisy intermediate-scale quantum (NISQ) machines. To address this issue, here we demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique, i.e., quantum architecture search (QAS), to enhance VQAs on an 8-qubit superconducting quantum processor. In particular, we apply QAS to tailor the hardware-efficient ansatz towards classification tasks. Compared with the heuristic ansatze, the ansatz designed by QAS improves test accuracy from 31% to 98%. We further explain this superior performance by visualizing the loss landscape and analyzing effective parameters of all ansatze. Our work provides concrete guidance for developing variable ansatze to tackle various large-scale quantum learning problems with advantages.

Keywords

Cite

@article{arxiv.2201.00934,
  title  = {Quantum circuit architecture search on a superconducting processor},
  author = {Kehuan Linghu and Yang Qian and Ruixia Wang and Meng-Jun Hu and Zhiyuan Li and Xuegang Li and Huikai Xu and Jingning Zhang and Teng Ma and Peng Zhao and Dong E. Liu and Min-Hsiu Hsieh and Xingyao Wu and Yuxuan Du and Dacheng Tao and Yirong Jin and Haifeng Yu},
  journal= {arXiv preprint arXiv:2201.00934},
  year   = {2022}
}
R2 v1 2026-06-24T08:39:18.731Z