The impact of quantum circuit architecture and hyperparameters on variational quantum algorithms exemplified in the electronic structure of the GaAs crystal
Variational Quantum Algorithms (VQAs) provide a promising framework for solving electronic structure problems using the computational capabilities of quantum computers to explore high-dimensional Hilbert spaces efficiently. This research investigates the performance of VQAs in electronic structure calculations of gallium arsenide (GaAs), a semiconductor with a zinc-blende structure. Utilizing a tight-binding Hamiltonian and a Jordan-Wigner-like transformation, we map the problem to a 10-qubit Hamiltonian. We analyze the impact of quantum circuit architectures, algorithm hyperparameters, and optimization methods on two VQAs: Variational Quantum Deflation (VQD) and Subspace Search Variational Quantum Eigensolver (SSVQE). We observed that while both algorithms offer promising results, the choice of ansatz and hyperparameter tuning were especially critical in achieving reliable outcomes, particularly for higher energy states. Adjusting the hyperparameters in VQD significantly enhanced the accuracy of higher energy state calculations, reducing the error by an order of magnitude, whereas tuning the hyperparameters in SSVQE had minimal impact. Our findings provide insights into optimizing VQAs for electronic structure problems, paving the way for their application to more complex systems on near-term quantum devices.
Variational Quantum Algorithms (VQAs) provide a promising framework for solving electronic structure problems using the computational capabilities of quantum computers to explore high-dimensional Hilbert spaces efficiently. This research investigates the performance of VQAs in electronic structure calculations of gallium arsenide (GaAs), a semiconductor with a zinc-blende structure. Utilizing a tight-binding Hamiltonian and a Jordan-Wigner-like transformation, we map the problem to a 10-qubit Hamiltonian. We analyze the impact of quantum circuit architectures, algorithm hyperparameters, and optimization methods on two VQAs: Variational Quantum Deflation (VQD) and Subspace Search Variational Quantum Eigensolver (SSVQE). We observed that while both algorithms offer promising results, the choice of ansatz and hyperparameter tuning were especially critical in achieving reliable outcomes, particularly for higher energy states. Adjusting the hyperparameters in VQD significantly enhanced the accuracy of higher energy state calculations, reducing the error by an order of magnitude, whereas tuning the hyperparameters in SSVQE had minimal impact. Our findings provide insights into optimizing VQAs for electronic structure problems, paving the way for their application to more complex systems on near-term quantum devices.
Abstract Variational Quantum Eigensolver (VQE) and its extension, Variational Quantum Deflation (VQD), have emerged as promising algorithms for computing ground and excited state energy eigenvalues of Hamiltonians, particularly in quantum physics, chemistry, and materials science. Recently, the VQE and VQD algorithms were implemented to calculate the electronic band structure described by the tight-binding Hamiltonian. Despite their success for simple models, scalability remains a challenge due to the need for a large number of circuit executions, limited qubit coherence times, and low gate fidelities. In this work, we implemented the VQE and VQD algorithms for tight-binding models of diamond and zincblende crystal structures (Sn, C, Si, Ge, AlP, AlAs, AlSb, and GaP) using a quantum computer simulator. We investigate the scalability challenges, focusing on the significant overhead caused by a large number of quantum circuit executions required to find the energy eigenvalues. Our analysis highlights the substantial amount of both measurement and optimization overheads in VQD, particularly as the number of excited states increases. Based on our findings, we critically discuss the implications of implementing VQD on current noisy intermediate-scale quantum (NISQ) devices.
In recent years, Variational Quantum Algorithms (VQAs) have emerged as a promising approach for solving optimization problems on quantum computers in the NISQ era. However, one limitation of VQAs is their reliance on fixed-structure circuits, which may not be taylored for specific problems or hardware configurations. A leading strategy to address this issue are Adaptative VQAs, which dynamically modify the circuit structure by adding and removing gates, and optimize their parameters during the training. Several Adaptative VQAs, based on heuristics such as circuit shallowness, entanglement capability and hardware compatibility, have already been proposed in the literature, but there is still lack of a systematic comparison between the different methods. In this paper, we aim to fill this gap by analyzing three Adaptative VQAs: Evolutionary Variational Quantum Eigensolver (EVQE), Variable Ansatz (VAns), already proposed in the literature, and Random Adapt-VQE (RA-VQE), a random approach we introduce as a baseline. In order to compare these algorithms to traditional VQAs, we also include the Quantum Approximate Optimization Algorithm (QAOA) in our analysis. We apply these algorithms to QUBO problems and study their performance by examining the quality of the solutions found and the computational times required. Additionally, we investigate how the choice of the hyperparameters can impact the overall performance of the algorithms, highlighting the importance of selecting an appropriate methodology for hyperparameter tuning. Our analysis sets benchmarks for Adaptative VQAs designed for near-term quantum devices and provides valuable insights to guide future research in this area.
Quantum computing is currently emerging as a useful paradigm for solving highly complex computational problems.Current quantum computers are unfortunately too noisy to provide sufficient accuracy, and quantumclassical hybrid algorithms emerged as a solution.Variational Quantum Deflation (VQD) has gained significant attention for addressing challenges in quantum chemistry, material science, etc. VQDs typically use multiple optimization methods, and the correct choice of optimization method can significantly impact performance.In our study, we focused on the comparison of multiple optimization methods used in VQD when applied to the electronic structure of crystals.The quantum part of VQD ran on a classical simulator with imported noise models from real quantum computers from the IBM Quantum Platform.
Variational quantum algorithms (VQAs) offer a promising path toward using near-term quantum hardware for applications in academic and industrial research. These algorithms aim to find approximate solutions to quantum problems by optimizing a parametrized quantum circuit using a classical optimization algorithm. A successful VQA requires fast and reliable classical optimization algorithms. Understanding and optimizing how off-the-shelf optimization methods perform in this context is important for the future of the field. In this work, we study the performance of four commonly used gradient-free optimization methods [sequential least-squares quadratic programming, constrained optimization by linear approximations, the covariance matrix adaptation evolutionary strategy (CMA-ES), and the simultaneous perturbation stochastic approximation (SPSA)] to find ground-state energies of a range of small chemistry and material science problems. We test a telescoping sampling scheme (where the accuracy of the cost-function estimate provided to the optimizer is increased as the optimization converges) for all methods, demonstrating mixed results across our range of optimizers and problems chosen. We further hyperparameter tune two of the four optimizers (CMA-ES and SPSA) across a large range of models and demonstrate that with appropriate hyperparameter tuning, CMA-ES is competitive with and sometimes outperforms SPSA (which is not observed in the absence of hyperparameter tuning). Finally, we investigate the ability of an optimizer to beat the ``sampling-noise floor'' given by the sampling noise of each cost-function estimate provided to the optimizer. Our results demonstrate the necessity for tailoring and hyperparameter tuning known optimization techniques for inherently noisy variational quantum algorithms and that the variational landscape that one finds in a VQA is highly problem and system dependent. This provides guidance for future implementations of these algorithms in experiments.
Over the last decade, researchers have been working to improve a crucial aspect of quantum computing to predict Hamiltonian energy of solids. Quantum algorithms such as Variational Quantum Eigensolver (VQE) and Variational Quantum Deflation (VQD) have been used to study the molecular systems. However, there is growing interest in adapting and applying these methods to periodic solid-state materials. In this work, we have integrated first-principles density functional theory with VQE and VQD algorithms and utilizing the Wannier Tight-Binding Hamiltonian (WTBH) method to predict the electronic characteristics of solids. We demonstrate that VQE and VQD algorithms can be used to accurately predict electronic characteristics in a variety of multi-component prototype solid-state materials such as - Silicon (semiconductor), Gold (metallic), Boron Nitrile (insulator), Graphene (semi-metal). Efficient SU2 performs well among all the predefined ansatz used in the study. COBYLA is the fastest optimizer among the classical optimizers with minimum number of iterations for convergence. Results of noise models help to understand the band structure when calculated on real quantum hardware. As quantum hardware advances, our method might be a starting point for using quantum computers to study materials and could help make material discovery more automatic in the future.
Quantum computing is currently emerging as a new computational technology for solving complex computational problems.Current quantum computers are unfortunately too noisy to provide sufficient accuracy, and quantum-classical hybrid algorithms emerged as a solution.Variational Quantum Algorithms are currently showing promising results at overcoming noise introduced by the current level of quantum hardware.Variational Quantum Deflation (VQD) has gained significant attention when computing the full spectrum of eigenvalues in quantum chemistry and solid-state physics.The noise in the VQD calculations performed on the current noisy quantum computers, or their simulators, can be partly suppressed by methods available in the Qiskit Python package provided by IBM.In our study, several error suppression and mitigation methods have been tested, and our results offer a unique comparison in the case of calculations on the electronic structure of crystals, where performance is sensitive to the actual point in the reciprocal space.