Analyzing complex quantum systems using quantum computational algorithms is one of the most promising applications of quantum computers. This study focuses on evaluating the performance of a custom variational ansatz in the Variational Quantum Eigensolver (VQE) algorithm compared to predefined ansatzes. To achieve this, we employ the evaporating black hole model as a test bed for our analysis. Using the VQE approach, which integrates quantum and classical computing techniques, we aim to minimize the energy expectation value of the Hamiltonian. By training the circuit parameters of a trial wave function as a parameterized quantum circuit, we determine the upper bound for the ground state energy and assess the optimal variational form. We define a custom ansatz for the VQE protocol and compare its performance with other predefined ansatzes. Additionally, we test the performance of three different classical optimizers to further understand their impact on the VQE algorithm’s efficiency and accuracy.
Analyzing complex quantum systems using quantum computational algorithms is one of the most promising applications of quantum computers. This study focuses on evaluating the performance of a custom variational ansatz in the Variational Quantum Eigensolver (VQE) algorithm compared to predefined ansatzes. To achieve this, we employ the evaporating black hole model as a test bed for our analysis. Using the VQE approach, which integrates quantum and classical computing techniques, we aim to minimize the energy expectation value of the Hamiltonian. By training the circuit parameters of a trial wave function as a parameterized quantum circuit, we determine the upper bound for the ground state energy and assess the optimal variational form. We define a custom ansatz for the VQE protocol and compare its performance with other predefined ansatzes. Additionally, we test the performance of three different classical optimizers to further understand their impact on the VQE algorithm’s efficiency and accuracy.
Quantum computers have an exponential speed-up advantage over classical computers. One of the most prominent utilities of quantum computers is their ability to study complex quantum systems in various fields using quantum computational algorithms. Quantum computational algorithms can be used to study cosmological systems and how they behave with variations in the different parameters of the system. Here, we use the variational quantum eigensolver (VQE) algorithm to simulate the Hawking radiation phenomenon. VQE algorithm is a combination of quantum and classical computation methods used to obtain the minimum energy eigenvalue for a given Hamiltonian. Three different custom ansatzes are used in the VQE algorithm from which the results for the case with minimum errors are studied. We obtain the plots for temperature and power from the minimum energy eigenvalue recorded for different values of mass and distance from the center of the black hole. The final result is then analyzed and compared against already existing data on Hawking radiation.
The Variational Quantum Eigensolver (VQE) is a hybrid algorithm that combines quantum and classical computing to determine the ground-state energy of molecular systems. In this context, this study applies VQE to investigate the ground state of protocatechuic acid, analyzing its performance with various Ansatzes and active spaces. Subsequently, all VQE results were compared to those obtained with the CISD and FCI methods. The results demonstrate that Ansatzes, like Unitary Coupled Cluster Singles and Doubles (UCCSD) and variations of Hardware-Efficient Ansatzes, generally achieve accuracy close to that of FCI. In conclusion, this study highlights the effectiveness of VQE as a robust method for investigating molecular ground-state energies. Additionally, the findings emphasize the pivotal role of Ansatz design and active space selection in optimizing VQE performance, offering meaningful insights into its capabilities and constraints.
To understand the properties and interactions of materials, and determining the ground state energies is one of the important challenges in quantum chemistry, materials science, and quantum mechanics, where quantum computing can play an important role for studying the properties of materials. In this study, we have explored the quantum processor application to compute the He molecule ground state energy which utilizes the Variational Quantum Eigensolver (VQE) algorithm. In here, we have implemented VQE on a state-of-the-art quantum processor, optimizing a parameterized quantum circuit to minimize the energy expectation value of the He molecule's Hamiltonian on the four qubits processor. The obtained results of this work show a significant improvement in accuracy compared to classical computational methods, such as Hartree-Fock and density functional theory, which demonstrate the compute potential of quantum algorithms in quantum many-body problems. Thus, these results demonstrate the advantages of quantum computing in achieving high accuracy in simulations of molecular and material properties, and pave the way for future applications in more complex systems. This work highlights the potential of quantum processors in the fields of quantum chemistry, computational physics, and data science.
Abstract To understand the properties and interactions of materials, and determining the ground state energies is one of the important challenges in quantum chemistry, materials science, and quantum mechanics, where quantum computing can play an important role for studying the properties of materials. In this study, we have explored the quantum processor application to compute the He molecule ground state energy which utilizes the Variational Quantum Eigensolver (VQE) algorithm. In here, we have implemented VQE on a state-of-the-art quantum processor, optimizing a parameterized quantum circuit to minimize the energy expectation value of the He molecule's Hamiltonian on the four qubits processor. The obtained results of this work show a significant improvement in accuracy compared to classical computational methods, such as Hartree-Fock and density functional theory, which demonstrate the compute potential of quantum algorithms in quantum many-body problems. Thus, these results demonstrate the advantages of quantum computing in achieving high accuracy in simulations of molecular and material properties, and pave the way for future applications in more complex systems. This work highlights the potential of quantum processors in the fields of quantum chemistry, computational physics, and data science.
Quantum computers promise a great computational advantage over classical computers, which might help solve various computational challenges such as the simulation of complicated quantum systems, finding optimum in large optimization problems, and solving large-scale linear algebra problems. Current available quantum devices have only a limited amount of qubits and a high level of noise, limiting the size of problems that can be solved accurately with those devices. Variational quantum algorithms (VQAs) have emerged as a leading strategy to address these limitations by optimizing cost function based on measurement results of shallow depth circuits. Recently, various pulse engineering methods were suggested in order to improve VQA results, including optimizing pulse parameters instead of gate angles as part of the VQA optimization process. In this paper, we suggest a novel pulse-based ansatz, which is parameterized mainly by pulses’ duration of pre-defined pulse structures. This ansatz structure provides relatively low amounts of optimization parameters while maintaining high expressibility, allowing fast convergence. In addition, the ansatz has structured adaptivity to the entanglement level required by the problem, allowing low noise and accurate results. We tested this ansatz against quantum chemistry problems. Specifically, finding the ground-state energy associated with the electron configuration problem, using the variational quantum eigensolver (VQE) algorithm for several different molecules. We manage to achieve chemical accuracy both in simulation for several molecules and on one of IBM’s NISQ devices for the H2 molecule in the STO-3G basis, without the need for extensive error mitigation. Our results are compared to a common gate-based ansatz and show better accuracy and significant latency reduction—up to 7× shorter ansatz schedules.
Abstract Quantum computing is a technology that utilizes the principles of quantum mechanics to perform complex computational processes. In this work, we use Qiskit Module from IBM to do quantum computational calculation using Variational Quantum Eigensolver (VQE) algorithm. VQE is a hybrid quantum-classical method that combines a quantum computer to measure energies and a classical computer to process the measurement results and update the parameters of the quantum computer. The purpose of VQE is to find the ground state energy of a chemical system. In the previous study, many of the VQE calculations have been done on simple molecules. So, in this study, we would like to use Hydrazine molecule as our object of VQE calculation. Furthermore, these results will be compared with the results from the classical calculation (MP2, CCSD(T), QCISD(T), and CASSCF) methods for testing the effectiveness of VQE using Unitary Coupled-Cluster Single and Double excitations (UCCSD) Ansatz. The quantum algorithm based on the UCCSD Ansatz led to a simplification of the algorithm by reducing the circuit depth. Then, the possibility to use active space approximation, can be used to reduce the quantum gates while trying to keep a good level of accuracy. In this study, we chose (2,2) and (4,4) active spaces. Based on the results, as we increase the size of the active space during the evaluation of the single-point energy, the estimated ground states obtained from the VQE algorithm yield nearly identical values. Conversely, in CASSCF calculations, expanding the active space introduces more energy corrections, thus making it more sensitive. Additionally, when examining potential energy surfaces, VQE demonstrates results that gradually align with CCSD(T) and QCISD(T) methods.