Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2307.12323 · New Journal of Physics

Single entanglement connection architecture between multi-layer bipartite hardware efficient ansatz

Shikun Zhang, Zheng Qin, Zhou Yang, Rui Li, Chunxiao Du, Zhisong Xiao

Published Jul 1, 2024• 9 citations
arXivHTMLPDF

Abstract

Abstract Variational quantum algorithms are among the most promising algorithms to achieve quantum advantages in the noisy intermediate-scale quantum (NISQ) era. One important challenge in implementing such algorithms is to construct an effective parameterized quantum circuit (also called an ansatz). In this work, we propose a single entanglement connection architecture (SECA) for a bipartite hardware efficient ansatz (HEA) by balancing its expressibility, entangling capability, and trainability. Numerical simulations with a one-dimensional Heisenberg model and quadratic unconstrained binary optimization (QUBO) issues were conducted. Our results indicate the superiority of SECA over the common full entanglement connection architecture in terms of computational performance. Furthermore, combining SECA with gate-cutting technology to construct distributed quantum computation (DQC) can efficiently expand the size of NISQ devices under low overhead. We also demonstrated the effectiveness and scalability of the DQC scheme. Our study is a useful indication for understanding the characteristics associated with an effective training circuit.

DOI
10.1088/1367-2630/ad64fb

Related papers

Quantum Circuit Architecture Optimization for Variational Quantum Eigensolver via Monto Carlo Tree Search

Fan‐Xu Meng, Ze‐Tong Li, Xutao Yu +1 more

The advent of Noisy Intermediate-Scale Quantum (NISQ) devices provides crucial promise for the development of quantum algorithms. Variational quantum algorithms have emerged as one of the best hopes to utilize NISQ devices. Among these is the famous Variational Quantum Eigensolver (VQE), where one trains a parameterized and fixed quantum circuit (or an ansatz) to accomplish the task. However, VQE also suffers from some serious challenges, which are training difficulty and accuracy reduction due to deep quantum circuit and hardware noise. To be motivated by these issues, we propose a runtime and resource efficient scheme, monto-carlo tree (MCT) search based quantum circuit architecture optimization, where the ansatz is built in the variable form. Our approach first models the search space with a MCT and regards it as a supernet, where we make use of layers dependence to reduce the size of the search space . Second, a two-stage scheme is proposed for the search space training where weight sharing and warm-up strategies are employed to avoid huge computation cost. Training results are stored in nodes of the MCT for future decisions and a hierarchical node selection is presented to obtain an optimal ansatz. As a proof of principle, we carry out a series of numerical experiments for condensed matter and quantum chemistry in the quantum simulator with and without noise. Consequently, our scheme can be efficient to mitigate trainability and accuracy issues by minimizing the ansatz depth and the number of entanglement gates.

IEEE Transactions on Quantum Engineering•Jan 1, 2021•27 citations

Quantum Circuit Architecture Search on a Superconducting Processor

Kehuan Linghu, Yang Qian, Ruixia Wang +14 more

Variational quantum algorithms (VQAs) have shown strong evidence to gain provable computational advantages in diverse fields such as finance, machine learning, and chemistry. However, the heuristic ansatz exploited in modern VQAs is incapable of balancing the trade-off between expressivity and trainability, which may lead to degraded performance when executed on 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 toward classification tasks. Compared with heuristic ansätze, the ansatz designed by QAS improves the test accuracy from 31% to 98%. We further explain this superior performance by visualizing the loss landscape and analyzing effective parameters of all ansätze. Our work provides concrete guidance for developing variable ansätze to tackle various large-scale quantum learning problems with advantages.

arXiv:2201.00934•Entropy•Nov 26, 2024•17 citations

Entanglement-variational hardware-efficient ansatz for eigensolvers

Xin Wang, Bo Qi, Yabo Wang +1 more

Variational quantum eigensolvers (VQEs) are one of the most important and effective applications of quantum computing, especially in the current noisy intermediate-scale quantum (NISQ) era. There are two main approaches for VQEs: problem-agnostic and problem-specific. For problem-agnostic methods, they often suffer from trainability issues. For problem-specific methods, their performance usually relies upon the choice of initial reference states, which are often hard to determine. In this paper, we propose an entanglement-variational hardware-efficient ansatz (EHA), and numerically compare it with some widely used ansatzes by solving benchmark problems in quantum many-body systems and quantum chemistry. Our EHA is problem-agnostic and hardware-efficient, is especially suitable for NISQ devices, and has potential for wide applications. Our EHA can achieve a higher level of accuracy in finding ground states and their energies in most cases, even compared with problem-specific methods. The performance of the EHA is robust to the choice of initial states and to parameter initialization, and it has the ability to quickly adjust the entanglement to the required amount, which is also the fundamental reason for its superiority.

arXiv:2311.01120•Physical Review Applied•Mar 27, 2024•18 citations

On the practical usefulness of the Hardware Efficient Ansatz

Lorenzo Leone, Salvatore F. E. Oliviero, Łukasz Cincio +1 more

Variational Quantum Algorithms (VQAs) and Quantum Machine Learning (QML) models train a parametrized quantum circuit to solve a given learning task. The success of these algorithms greatly hinges on appropriately choosing an ansatz for the quantum circuit. Perhaps one of the most famous ansatzes is the one-dimensional layered Hardware Efficient Ansatz (HEA), which seeks to minimize the effect of hardware noise by using native gates and connectives. The use of this HEA has generated a certain ambivalence arising from the fact that while it suffers from barren plateaus at long depths, it can also avoid them at shallow ones. In this work, we attempt to determine whether one should, or should not, use a HEA. We rigorously identify scenarios where shallow HEAs should likely be avoided (e.g., VQA or QML tasks with data satisfying a volume law of entanglement). More importantly, we identify a Goldilocks scenario where shallow HEAs could achieve a quantum speedup: QML tasks with data satisfying an area law of entanglement. We provide examples for such scenario (such as Gaussian diagonal ensemble random Hamiltonian discrimination), and we show that in these cases a shallow HEA is always trainable and that there exists an anti-concentration of loss function values. Our work highlights the crucial role that input states play in the trainability of a parametrized quantum circuit, a phenomenon that is verified in our numerics.

arXiv:2211.01477•Quantum•Jul 3, 2024•139 citations

Benchmarking PQC Ansatze in Realistic Device Topologies

Oleksa Hryniv, Vladyslav Los, Yuriy Pryyma +3 more

Parameterized quantum circuits (PQCs) serve as a flexible framework for implementing various quantum algorithms, particularly in quantum machine learning and optimization tasks. However, their training is challenging due to both theoretical constraints and the inherent limitations in current quantum hardware. A judicious choice of PQC architecture is crucial for accurately representing the solution space, and for ensuring convergence in training. Several works introduced measures of expressibility and entangling capability for PQCs, and compared these metrics across different circuit structures, providing insights into how they impact performance and efficiency. However, these investigations often assumed idealized all-to-all qubit connectivity, which is not applicable to most hardware architectures. In practice, additional transpilation steps are performed prior to execution on hardware. The potential impact of better alignment of the PQC structure with the underlying native topology has in fact motivated introduction of hardware-efficient ansatze. In our work, we extend the methodology of measuring PQC efficiency to include more realistic quantum hardware models. We examine several popular hardware topologies, including hexagonal, square, circular, linear, and all-to-all. We evaluate the expressibility and entangling capability of circuits with different connectivity types and various arrangements of rotation gates. We assess the training performance of these PQC types in the context of a variational compiling procedure and identify the preferred gate patterns. This approach provides a more realistic evaluation of PQC performance, thus offering practical insights into their applications on existing quantum devices.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

Quantum circuit architecture search for variational quantum algorithms

Yuxuan Du, Tao Huang, Shan You +2 more

Abstract Variational quantum algorithms (VQAs) are expected to be a path to quantum advantages on noisy intermediate-scale quantum devices. However, both empirical and theoretical results exhibit that the deployed ansatz heavily affects the performance of VQAs such that an ansatz with a larger number of quantum gates enables a stronger expressivity, while the accumulated noise may render a poor trainability. To maximally improve the robustness and trainability of VQAs, here we devise a resource and runtime efficient scheme termed quantum architecture search (QAS). In particular, given a learning task, QAS automatically seeks a near-optimal ansatz (i.e., circuit architecture) to balance benefits and side-effects brought by adding more noisy quantum gates to achieve a good performance. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks. In the problems studied, numerical and experimental results show that QAS cannot only alleviate the influence of quantum noise and barren plateaus but also outperforms VQAs with pre-selected ansatze.

arXiv:2010.10217•npj Quantum Information•May 23, 2022•279 citations
Abstract Variational quantum algorithms are among the most promising algorithms to achieve quantum advantages in the noisy intermediate-scale quantum (NISQ) era. One important challenge in implementing such algorithms is to construct an effective parameterized quantum circuit (also called an ansatz). In this work, we propose a single entanglement connection architecture (SECA) for a bipartite hardware efficient ansatz (HEA) by balancing its expressibility, entangling capability, and trainability. Numerical simulations with a one-dimensional Heisenberg model and quadratic unconstrained binary optimization (QUBO) issues were conducted. Our results indicate the superiority of SECA over the common full entanglement connection architecture in terms of computational performance. Furthermore, combining SECA with gate-cutting technology to construct distributed quantum computation (DQC) can efficiently expand the size of NISQ devices under low overhead. We also demonstrated the effectiveness and scalability of the DQC scheme. Our study is a useful indication for understanding the characteristics associated with an effective training circuit.
The advent of Noisy Intermediate-Scale Quantum (NISQ) devices provides crucial promise for the development of quantum algorithms. Variational quantum algorithms have emerged as one of the best hopes to utilize NISQ devices. Among these is the famous Variational Quantum Eigensolver (VQE), where one trains a parameterized and fixed quantum circuit (or an ansatz) to accomplish the task. However, VQE also suffers from some serious challenges, which are training difficulty and accuracy reduction due to deep quantum circuit and hardware noise. To be motivated by these issues, we propose a runtime and resource efficient scheme, monto-carlo tree (MCT) search based quantum circuit architecture optimization, where the ansatz is built in the variable form. Our approach first models the search space with a MCT and regards it as a supernet, where we make use of layers dependence to reduce the size of the search space . Second, a two-stage scheme is proposed for the search space training where weight sharing and warm-up strategies are employed to avoid huge computation cost. Training results are stored in nodes of the MCT for future decisions and a hierarchical node selection is presented to obtain an optimal ansatz. As a proof of principle, we carry out a series of numerical experiments for condensed matter and quantum chemistry in the quantum simulator with and without noise. Consequently, our scheme can be efficient to mitigate trainability and accuracy issues by minimizing the ansatz depth and the number of entanglement gates.
Variational quantum algorithms (VQAs) have shown strong evidence to gain provable computational advantages in diverse fields such as finance, machine learning, and chemistry. However, the heuristic ansatz exploited in modern VQAs is incapable of balancing the trade-off between expressivity and trainability, which may lead to degraded performance when executed on 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 toward classification tasks. Compared with heuristic ansätze, the ansatz designed by QAS improves the test accuracy from 31% to 98%. We further explain this superior performance by visualizing the loss landscape and analyzing effective parameters of all ansätze. Our work provides concrete guidance for developing variable ansätze to tackle various large-scale quantum learning problems with advantages.
Variational quantum eigensolvers (VQEs) are one of the most important and effective applications of quantum computing, especially in the current noisy intermediate-scale quantum (NISQ) era. There are two main approaches for VQEs: problem-agnostic and problem-specific. For problem-agnostic methods, they often suffer from trainability issues. For problem-specific methods, their performance usually relies upon the choice of initial reference states, which are often hard to determine. In this paper, we propose an entanglement-variational hardware-efficient ansatz (EHA), and numerically compare it with some widely used ansatzes by solving benchmark problems in quantum many-body systems and quantum chemistry. Our EHA is problem-agnostic and hardware-efficient, is especially suitable for NISQ devices, and has potential for wide applications. Our EHA can achieve a higher level of accuracy in finding ground states and their energies in most cases, even compared with problem-specific methods. The performance of the EHA is robust to the choice of initial states and to parameter initialization, and it has the ability to quickly adjust the entanglement to the required amount, which is also the fundamental reason for its superiority.
Variational Quantum Algorithms (VQAs) and Quantum Machine Learning (QML) models train a parametrized quantum circuit to solve a given learning task. The success of these algorithms greatly hinges on appropriately choosing an ansatz for the quantum circuit. Perhaps one of the most famous ansatzes is the one-dimensional layered Hardware Efficient Ansatz (HEA), which seeks to minimize the effect of hardware noise by using native gates and connectives. The use of this HEA has generated a certain ambivalence arising from the fact that while it suffers from barren plateaus at long depths, it can also avoid them at shallow ones. In this work, we attempt to determine whether one should, or should not, use a HEA. We rigorously identify scenarios where shallow HEAs should likely be avoided (e.g., VQA or QML tasks with data satisfying a volume law of entanglement). More importantly, we identify a Goldilocks scenario where shallow HEAs could achieve a quantum speedup: QML tasks with data satisfying an area law of entanglement. We provide examples for such scenario (such as Gaussian diagonal ensemble random Hamiltonian discrimination), and we show that in these cases a shallow HEA is always trainable and that there exists an anti-concentration of loss function values. Our work highlights the crucial role that input states play in the trainability of a parametrized quantum circuit, a phenomenon that is verified in our numerics.
Parameterized quantum circuits (PQCs) serve as a flexible framework for implementing various quantum algorithms, particularly in quantum machine learning and optimization tasks. However, their training is challenging due to both theoretical constraints and the inherent limitations in current quantum hardware. A judicious choice of PQC architecture is crucial for accurately representing the solution space, and for ensuring convergence in training. Several works introduced measures of expressibility and entangling capability for PQCs, and compared these metrics across different circuit structures, providing insights into how they impact performance and efficiency. However, these investigations often assumed idealized all-to-all qubit connectivity, which is not applicable to most hardware architectures. In practice, additional transpilation steps are performed prior to execution on hardware. The potential impact of better alignment of the PQC structure with the underlying native topology has in fact motivated introduction of hardware-efficient ansatze. In our work, we extend the methodology of measuring PQC efficiency to include more realistic quantum hardware models. We examine several popular hardware topologies, including hexagonal, square, circular, linear, and all-to-all. We evaluate the expressibility and entangling capability of circuits with different connectivity types and various arrangements of rotation gates. We assess the training performance of these PQC types in the context of a variational compiling procedure and identify the preferred gate patterns. This approach provides a more realistic evaluation of PQC performance, thus offering practical insights into their applications on existing quantum devices.
Abstract Variational quantum algorithms (VQAs) are expected to be a path to quantum advantages on noisy intermediate-scale quantum devices. However, both empirical and theoretical results exhibit that the deployed ansatz heavily affects the performance of VQAs such that an ansatz with a larger number of quantum gates enables a stronger expressivity, while the accumulated noise may render a poor trainability. To maximally improve the robustness and trainability of VQAs, here we devise a resource and runtime efficient scheme termed quantum architecture search (QAS). In particular, given a learning task, QAS automatically seeks a near-optimal ansatz (i.e., circuit architecture) to balance benefits and side-effects brought by adding more noisy quantum gates to achieve a good performance. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks. In the problems studied, numerical and experimental results show that QAS cannot only alleviate the influence of quantum noise and barren plateaus but also outperforms VQAs with pre-selected ansatze.