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:2511.03870

On universality of hardware-efficient ansatzes

Hokuto Iwakiri, Keita Kanno

quant-phSubmitted Nov 5, 2025• Announced Nov 7, 2025• 2 citations• Revised Nov 13, 2025 (v2)
v1 · Nov 5, 2025v2 · Nov 13, 2025
arXivHTMLPDF

Abstract

The hardware-efficient ansatz (HEA) is one of the most important class of parametrized quantum circuits for near-term applications of quantum computing. We show that the problem of simulating some major classes of the HEA is BQP-complete by explicitly demonstrating that any relevant quantum circuit can be efficiently represented as an HEA circuit of those classes.

Comments
22+10 pages, 21 figures

Related papers

Hardware-efficient ansatz without barren plateaus in any depth

Chae-Yeun Park, Minhyeok Kang, Joonsuk Huh

Variational quantum circuits have recently gained much interest due to their relevance in real-world applications, such as combinatorial optimizations, quantum simulations, and modeling a probability distribution. Despite their huge potential, the practical usefulness of those circuits beyond tens of qubits is largely questioned. One of the major problems is the so-called barren plateaus phenomenon. Quantum circuits with a random structure often have a flat cost-function landscape and thus cannot be trained efficiently. In this paper, we propose two novel parameter conditions in which the hardware-efficient ansatz (HEA) is free from barren plateaus for arbitrary circuit depths. In the first condition, the HEA approximates to a time-evolution operator generated by a local Hamiltonian. Utilizing a recent result by [Park and Killoran, Quantum 8, 1239 (2024)], we prove a constant lower bound of gradient magnitudes in any depth both for local and global observables. On the other hand, the HEA is within the many-body localized (MBL) phase in the second parameter condition. We argue that the HEA in this phase has a large gradient component for a local observable using a phenomenological model for the MBL system. By initializing the parameters of the HEA using these conditions, we show that our findings offer better overall performance in solving many-body Hamiltonians. Our results indicate that barren plateaus are not an issue when initial parameters are smartly chosen, and other factors, such as local minima or the expressivity of the circuit, are more crucial.

arXiv:2403.04844•Mar 7, 2024•43 citations

Physics-Constrained Hardware-Efficient Ansatz on Quantum Computers That Is Universal, Systematically Improvable, and Size-Consistent

Xiaoxiao Xiao, Hewang Zhao, Jiajun Ren +2 more

Variational wave function ansätze are at the heart of solving quantum many-body problems in physics and chemistry. Previous designs of hardware-efficient ansatz (HEA) on quantum computers are largely based on heuristics and lack rigorous theoretical foundations. In this work, we introduce a physics-constrained approach for designing HEA with rigorous theoretical guarantees by imposing a few fundamental constraints. Specifically, we require that the target HEA to be universal, systematically improvable, and size-consistent, which is an important concept in quantum many-body theories for scalability but has been overlooked in previous designs of HEA. We extend the notion of size-consistency to HEA and present a concrete realization of HEA that satisfies all these fundamental constraints while only requiring linear qubit connectivity. The developed physics-constrained HEA is superior to other heuristically designed HEA in terms of both accuracy and scalability, as demonstrated numerically for the Heisenberg model and some typical molecules. In particular, we find that restoring size-consistency can significantly reduce the number of layers needed to reach a certain accuracy. In contrast, the failure of other HEA to satisfy these constraints severely limits their scalability to larger systems with more than 10 qubits. Our work highlights the importance of incorporating physical constraints into the design of HEA for efficiently solving many-body problems on quantum computers.

arXiv:2307.03563•Journal of Chemical Theory and Computation•Feb 14, 2024•21 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

Two-dimensional physics-constrained hardware-efficient ansatz on quantum computers

Xiaoxiao Xiao, Wei‐Hai Fang, Zhendong Li

One of the most significant challenges in quantum chemistry simulations is the accurate and efficient treatment of strongly correlated systems using classical computers. Quantum computational chemistry is an emerging field that has grown alongside the development of quantum computers, aiming to tackle challenges beyond the reach of traditional computational chemistry methods. Given the current limitations of quantum hardware, hybrid quantum-classical algorithms have become the dominant approach in quantum computational chemistry, with the Variational Quantum Eigensolver (VQE) serving as a representative example. In the realm of variational quantum algorithms, the design of the ansatz plays a pivotal role, as it directly determines both the accuracy of the results and the optimization efficiency of the algorithm, making it a central component in achieving success in quantum computational chemistry. However, existing ansätze often fails to strike a balance between precision and hardware efficiency, posing a major bottleneck for practical applications. In our previous work, we proposed a novel strategy for designing hardware-efficient ansätze with built-in physical constraints (PCHEA). This approach demonstrated outstanding performance in simulating one-dimensional Heisenberg models and several typical molecular systems. By embedding physical insights into the design, PCHEA not only improved computational accuracy but also significantly enhanced hardware compatibility, making it a promising candidate for near-term quantum devices. Nevertheless, challenges remain. When applying the one-dimensional PCHEA to two-dimensional systems, the circuit costs increase significantly. To address this challenge, in this work, we simplify the implementation of the physics-constrained hardware-efficient ansatz, using fSim gates arranged in hardware-efficient linear and brickwall layouts to construct one-dimensional fSim linear and fSim brickwall ansätze. This modification substantially reduces both the number of two-qubit gates and the circuit depth. These ansätze ensure universality, systematic improvement, and size consistency within a particle-number-conserving Hilbert space, with significant improvements observed in the simulation of the one-dimensional Heisenberg model. Furthermore, building on the advancements in quantum hardware connectivity, we extend the one-dimensional PCHEA to a two-dimensional version by arranging it in a grid pattern. The two-dimensional PCHEA not only retains the physical constraints of the one-dimensional PCHEA but also exploits hardware connectivity to further reduce circuit costs. Simulations on two-dimensional Heisenberg models show that the two-dimensional PCHEA achieves chemical accuracy with considerably lower circuit depth, fewer parameters, and fewer two-qubit gates compared to the one-dimensional PCHEA. This work reinforces the effectiveness of designing hardware-efficient ansätze with embedded physical constraints, presenting a promising approach to advancing the practical application of quantum computers for simulating two-dimensional systems. Such progress brings us closer to achieving more efficient and scalable quantum simulations while addressing key challenges in quantum computational chemistry.

Chinese Science Bulletin (Chinese Version)•Jan 23, 2025•0 citations

Truncated Variational Hamiltonian Ansatz: efficient quantum circuit design for quantum chemistry and material science

Clemens Possel, Walter Hahn, Shirazi, Reza +4 more

Quantum computing has the potential to revolutionize quantum chemistry and material science by offering solutions to complex problems unattainable with classical computers. However, the development of efficient quantum algorithms that are efficient under noisy conditions remains a major challenge. This paper introduces the truncated Variational Hamiltonian Ansatz (tVHA), a novel circuit design for conducting quantum calculations on Noisy Intermediate-Scale Quantum (NISQ) devices. tVHA provides a promising approach for a broad range of applications by utilizing principles from the adiabatic theorem in solid state physics. Our proposed ansatz significantly reduces the parameter count and can decrease circuit size substantially, with a trade-off in accuracy. Thus, tVHA facilitates easier convergence within the variational quantum eigensolver framework compared to state-of-the-art ansätze such as Unitary Coupled Cluster (UCC) and Hardware-Efficient Ansatz (HEA). While this paper concentrates on the practical applications of tVHA in quantum chemistry, demonstrating its suitability for both weakly and strongly correlated systems and its compatibility with active space calculations, its underlying principles suggest a wider applicability extending to the broader field of material science computations on quantum computing platforms.

arXiv:2505.19772•May 26, 2025•4 citations

Accelerating Noise Error Calculation in Hardware Efficient Ansatz Circuits with OpenMP for Scalable Quantum Simulation

Rohit Bantupalli, Kartick Sutradhar, Bheemappa Halavar

Quantum computing’s burgeoning influence extends across disciplines such as cryptography, machine learning, and optimization problems, promising computational advantages that surpass the limitations of classical approaches. Despite their theoretical potential, the fidelity of quantum algorithms is compromised by the detrimental effects of noise and decoherence, resulting in substantial errors during the execution of quantum circuits. Although Hardware Efficient Ansatz (HEA) circuits are designed to generate pure quantum states, ideally represented by state vectors, the presence of noise in physical quantum devices transforms these pure states into mixed states, necessitating the use of density matrices and thereby complicating error analysis. Computing noise induced errors in density matrices with high precision remains computationally demanding because of the exponential scaling of the underlying mathematical operations. However, the shallow depth and near term compatibility of HEA circuits make them well suited for variational quantum methods, offering a practical approach within the constraints of current hardware. This paper proposes an OpenMP based parallelization methodology designed to enhance the computational efficiency of noise error estimation in HEA circuits. The integration of classical parallel computing techniques into quantum circuit simulation presents a viable approach to improving the scalability and precision of noise aware quantum computing research. Experimental results indicate an average speedup of approximately 22.34 for pure states and 3.89 for mixed states across varying numbers of qubits.

Supercomputing India (SCI)•Dec 9, 2025•0 citations
The hardware-efficient ansatz (HEA) is one of the most important class of parametrized quantum circuits for near-term applications of quantum computing. We show that the problem of simulating some major classes of the HEA is BQP-complete by explicitly demonstrating that any relevant quantum circuit can be efficiently represented as an HEA circuit of those classes.
Variational quantum circuits have recently gained much interest due to their relevance in real-world applications, such as combinatorial optimizations, quantum simulations, and modeling a probability distribution. Despite their huge potential, the practical usefulness of those circuits beyond tens of qubits is largely questioned. One of the major problems is the so-called barren plateaus phenomenon. Quantum circuits with a random structure often have a flat cost-function landscape and thus cannot be trained efficiently. In this paper, we propose two novel parameter conditions in which the hardware-efficient ansatz (HEA) is free from barren plateaus for arbitrary circuit depths. In the first condition, the HEA approximates to a time-evolution operator generated by a local Hamiltonian. Utilizing a recent result by [Park and Killoran, Quantum 8, 1239 (2024)], we prove a constant lower bound of gradient magnitudes in any depth both for local and global observables. On the other hand, the HEA is within the many-body localized (MBL) phase in the second parameter condition. We argue that the HEA in this phase has a large gradient component for a local observable using a phenomenological model for the MBL system. By initializing the parameters of the HEA using these conditions, we show that our findings offer better overall performance in solving many-body Hamiltonians. Our results indicate that barren plateaus are not an issue when initial parameters are smartly chosen, and other factors, such as local minima or the expressivity of the circuit, are more crucial.
Variational wave function ansätze are at the heart of solving quantum many-body problems in physics and chemistry. Previous designs of hardware-efficient ansatz (HEA) on quantum computers are largely based on heuristics and lack rigorous theoretical foundations. In this work, we introduce a physics-constrained approach for designing HEA with rigorous theoretical guarantees by imposing a few fundamental constraints. Specifically, we require that the target HEA to be universal, systematically improvable, and size-consistent, which is an important concept in quantum many-body theories for scalability but has been overlooked in previous designs of HEA. We extend the notion of size-consistency to HEA and present a concrete realization of HEA that satisfies all these fundamental constraints while only requiring linear qubit connectivity. The developed physics-constrained HEA is superior to other heuristically designed HEA in terms of both accuracy and scalability, as demonstrated numerically for the Heisenberg model and some typical molecules. In particular, we find that restoring size-consistency can significantly reduce the number of layers needed to reach a certain accuracy. In contrast, the failure of other HEA to satisfy these constraints severely limits their scalability to larger systems with more than 10 qubits. Our work highlights the importance of incorporating physical constraints into the design of HEA for efficiently solving many-body problems on quantum computers.
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.
One of the most significant challenges in quantum chemistry simulations is the accurate and efficient treatment of strongly correlated systems using classical computers. Quantum computational chemistry is an emerging field that has grown alongside the development of quantum computers, aiming to tackle challenges beyond the reach of traditional computational chemistry methods. Given the current limitations of quantum hardware, hybrid quantum-classical algorithms have become the dominant approach in quantum computational chemistry, with the Variational Quantum Eigensolver (VQE) serving as a representative example. In the realm of variational quantum algorithms, the design of the ansatz plays a pivotal role, as it directly determines both the accuracy of the results and the optimization efficiency of the algorithm, making it a central component in achieving success in quantum computational chemistry. However, existing ansätze often fails to strike a balance between precision and hardware efficiency, posing a major bottleneck for practical applications. In our previous work, we proposed a novel strategy for designing hardware-efficient ansätze with built-in physical constraints (PCHEA). This approach demonstrated outstanding performance in simulating one-dimensional Heisenberg models and several typical molecular systems. By embedding physical insights into the design, PCHEA not only improved computational accuracy but also significantly enhanced hardware compatibility, making it a promising candidate for near-term quantum devices. Nevertheless, challenges remain. When applying the one-dimensional PCHEA to two-dimensional systems, the circuit costs increase significantly. To address this challenge, in this work, we simplify the implementation of the physics-constrained hardware-efficient ansatz, using fSim gates arranged in hardware-efficient linear and brickwall layouts to construct one-dimensional fSim linear and fSim brickwall ansätze. This modification substantially reduces both the number of two-qubit gates and the circuit depth. These ansätze ensure universality, systematic improvement, and size consistency within a particle-number-conserving Hilbert space, with significant improvements observed in the simulation of the one-dimensional Heisenberg model. Furthermore, building on the advancements in quantum hardware connectivity, we extend the one-dimensional PCHEA to a two-dimensional version by arranging it in a grid pattern. The two-dimensional PCHEA not only retains the physical constraints of the one-dimensional PCHEA but also exploits hardware connectivity to further reduce circuit costs. Simulations on two-dimensional Heisenberg models show that the two-dimensional PCHEA achieves chemical accuracy with considerably lower circuit depth, fewer parameters, and fewer two-qubit gates compared to the one-dimensional PCHEA. This work reinforces the effectiveness of designing hardware-efficient ansätze with embedded physical constraints, presenting a promising approach to advancing the practical application of quantum computers for simulating two-dimensional systems. Such progress brings us closer to achieving more efficient and scalable quantum simulations while addressing key challenges in quantum computational chemistry.
Quantum computing has the potential to revolutionize quantum chemistry and material science by offering solutions to complex problems unattainable with classical computers. However, the development of efficient quantum algorithms that are efficient under noisy conditions remains a major challenge. This paper introduces the truncated Variational Hamiltonian Ansatz (tVHA), a novel circuit design for conducting quantum calculations on Noisy Intermediate-Scale Quantum (NISQ) devices. tVHA provides a promising approach for a broad range of applications by utilizing principles from the adiabatic theorem in solid state physics. Our proposed ansatz significantly reduces the parameter count and can decrease circuit size substantially, with a trade-off in accuracy. Thus, tVHA facilitates easier convergence within the variational quantum eigensolver framework compared to state-of-the-art ansätze such as Unitary Coupled Cluster (UCC) and Hardware-Efficient Ansatz (HEA). While this paper concentrates on the practical applications of tVHA in quantum chemistry, demonstrating its suitability for both weakly and strongly correlated systems and its compatibility with active space calculations, its underlying principles suggest a wider applicability extending to the broader field of material science computations on quantum computing platforms.
Quantum computing’s burgeoning influence extends across disciplines such as cryptography, machine learning, and optimization problems, promising computational advantages that surpass the limitations of classical approaches. Despite their theoretical potential, the fidelity of quantum algorithms is compromised by the detrimental effects of noise and decoherence, resulting in substantial errors during the execution of quantum circuits. Although Hardware Efficient Ansatz (HEA) circuits are designed to generate pure quantum states, ideally represented by state vectors, the presence of noise in physical quantum devices transforms these pure states into mixed states, necessitating the use of density matrices and thereby complicating error analysis. Computing noise induced errors in density matrices with high precision remains computationally demanding because of the exponential scaling of the underlying mathematical operations. However, the shallow depth and near term compatibility of HEA circuits make them well suited for variational quantum methods, offering a practical approach within the constraints of current hardware. This paper proposes an OpenMP based parallelization methodology designed to enhance the computational efficiency of noise error estimation in HEA circuits. The integration of classical parallel computing techniques into quantum circuit simulation presents a viable approach to improving the scalability and precision of noise aware quantum computing research. Experimental results indicate an average speedup of approximately 22.34 for pure states and 3.89 for mixed states across varying numbers of qubits.