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 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.
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.
We study a hardware-efficient variational quantum algorithm ansatz tailored for the trapped-ion quantum simulator, HEA-TI. We leverage programmable single-qubit rotations and global spin-spin interactions among all ions, reducing the dependence on resource-intensive two-qubit gates in conventional gate-based methods. We apply HEA-TI to state engineering of cluster states and analyze the scaling of required quantum resources. We also apply HEA-TI to solve the ground state problem of chemical molecules H2, LiH and F2. We numerically analyze the quantum computing resources required to achieve chemical accuracy and examine the performance under realistic experimental noise and statistical fluctuation. The efficiency of this ansatz is shown to be comparable to other commonly used variational ansatzes like UCCSD, with the advantage of substantially easier implementation in the trapped-ion quantum simulator. This approach showcases the hardware-efficient ansatz as a powerful tool for the application of the near-term quantum computer.
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.
Hybrid quantum-classical algorithms have begun to leverage quantum devices to efficiently represent many-electron wavefunctions, enabling early demonstrations of molecular simulations on real hardware. A key prerequisite for scalable quantum chemistry, however, is size consistency: the energy of non-interacting subsystems must scale linearly with system size. While many algorithms are theoretically size-consistent, noise on quantum devices may couple nominally independent subsystems and degrade this fundamental property. Here, we systematically evaluate size consistency on quantum hardware by simulating systems composed of increasing numbers of non-interacting H2 molecules using optimally shallow unitary circuits. We find that molecular energies remain size-consistent within chemical accuracy for an estimated 118 and 71 H2 subsystems for one- and two-qubit unitary designs, respectively, demonstrating that current quantum devices preserve size consistency over chemically relevant system sizes and supporting the feasibility of scalable, noise-resilient simulation of strongly correlated molecules and materials.
We present a variational quantum framework for finite-horizon quantum control based on hardware-efficient ansätze. The objective is to steer a quantum system from a given initial state to a desired target state over a fixed time horizon by minimizing a terminal cost defined in terms of state fidelity. Instead of explicitly synthesizing time-dependent control fields or enforcing Hamiltonian reachability constraints, the proposed method reformulates the control objective as a variational optimization problem in which a hardware-efficient parameterized quantum circuit provides a surrogate parameterization of the terminal evolution. The circuit consists of alternating layers of single-qubit rotations and entangling gates, whose parameters are optimized using classical routines to minimize the terminal infidelity. This formulation avoids reliance on problem-specific or physics-inspired ansätze, providing a flexible and implementation-friendly approach compatible with near-term quantum devices. Numerical experiments on multi-qubit state-transfer benchmarks demonstrate high-fidelity state transfer while highlighting the trade-off between ansatz expressivity, optimization complexity, and scalability with respect to system size and circuit depth.
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.