Quantum circuit architecture search on a superconducting processor
- URL: http://arxiv.org/abs/2201.00934v1
- Date: Tue, 4 Jan 2022 01:53:42 GMT
- Title: Quantum circuit architecture search on a superconducting processor
- Authors: Kehuan Linghu, Yang Qian, Ruixia Wang, Meng-Jun Hu, Zhiyuan Li,
Xuegang Li, Huikai Xu, Jingning Zhang, Teng Ma, Peng Zhao, Dong E. Liu,
Min-Hsiu Hsieh, Xingyao Wu, Yuxuan Du, Dacheng Tao, Yirong Jin, and Haifeng
Yu
- Abstract summary: 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 ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability.
We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
- Score: 56.04169357427682
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Reinforcement learning-assisted quantum architecture search for variational quantum algorithms [0.0]
This thesis focuses on identifying functional quantum circuits in noisy quantum hardware.
We introduce a tensor-based quantum circuit encoding, restrictions on environment dynamics to explore the search space of possible circuits efficiently.
In dealing with various VQAs, our RL-based QAS outperforms existing QAS.
arXiv Detail & Related papers (2024-02-21T12:30:39Z) - Influence of HW-SW-Co-Design on Quantum Computing Scalability [6.2543855067453675]
We investigate how key figures - circuit depth and gate count - required to solve four NP-complete problems vary with tailored hardware properties.
Our results reveal that achieving near-optimal performance and properties does not necessarily require optimal quantum hardware.
arXiv Detail & Related papers (2023-06-07T08:36:33Z) - Classical-to-Quantum Transfer Learning Facilitates Machine Learning with Variational Quantum Circuit [62.55763504085508]
We prove that a classical-to-quantum transfer learning architecture using a Variational Quantum Circuit (VQC) improves the representation and generalization (estimation error) capabilities of the VQC model.
We show that the architecture of classical-to-quantum transfer learning leverages pre-trained classical generative AI models, making it easier to find the optimal parameters for the VQC in the training stage.
arXiv Detail & Related papers (2023-05-18T03:08:18Z) - QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks.
Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture.
We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
arXiv Detail & Related papers (2023-04-14T08:03:20Z) - Error mitigation in variational quantum eigensolvers using tailored
probabilistic machine learning [5.630204194930539]
We present a novel method that employs parametric Gaussian process regression (GPR) within an active learning framework to mitigate noise in quantum computations.
We demonstrate the effectiveness of our method on a 2-site Anderson impurity model and a 8-site Heisenberg model, using the IBM open-source quantum computing framework, Qiskit.
arXiv Detail & Related papers (2021-11-16T22:29:43Z) - Efficient measure for the expressivity of variational quantum algorithms [72.59790225766777]
We exploit an advanced tool in statistical learning theory, i.e., covering number, to study the expressivity of variational quantum algorithms.
We first exhibit how the expressivity of VQAs with an arbitrary ansatze is upper bounded by the number of quantum gates and the measurement observable.
We then explore the expressivity of VQAs on near-term quantum chips, where the system noise is considered.
arXiv Detail & Related papers (2021-04-20T13:51:08Z) - Neural Predictor based Quantum Architecture Search [15.045985536395479]
Variational quantum algorithms (VQAs) are widely speculated to deliver quantum advantages for practical problems under the quantum-classical hybrid computational paradigm in the near term.
In this work, we propose to use a neural network based predictor as the evaluation policy for quantum architecture search (QAS)
arXiv Detail & Related papers (2021-03-11T08:26:12Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.