Current NIQST machines have a relatively small number of qubits and a limited circuit depth. In this regard, a class of quantum variational algorithms (VQAs) have been developed to be able to split the computational cost between classical and quantum hardware. In this study, the VQE algorithm has been used in order to solve the problem of propagation modes in rectangular waveguides described analytically by the Helmholtz partial differential equation. The IBM quantum device called manila was used in these calculations to provide noise present in physical hardware. In order to implement the VQE, IBM's proprietary framework called Qiskit has been used. The results show good agreement between calculations run on simulated quantum hardware and those run on real quantum hardware. This agreement between theory and experiment is evidence that high fidelity modeling of electromagnetic fields utilizing quantum hardware is possible.
Current NIQST machines have a relatively small number of qubits and a limited circuit depth. In this regard, a class of quantum variational algorithms (VQAs) have been developed to be able to split the computational cost between classical and quantum hardware. In this study, the VQE algorithm has been used in order to solve the problem of propagation modes in rectangular waveguides described analytically by the Helmholtz partial differential equation. The IBM quantum device called manila was used in these calculations to provide noise present in physical hardware. In order to implement the VQE, IBM's proprietary framework called Qiskit has been used. The results show good agreement between calculations run on simulated quantum hardware and those run on real quantum hardware. This agreement between theory and experiment is evidence that high fidelity modeling of electromagnetic fields utilizing quantum hardware is possible.
Current quantum computers (QCs) belong to the noisy intermediate-scale quantum (NISQ) class, characterized by noisy qubits, limited qubit capabilities, and limited circuit depth. These limitations have led to the development of hybrid quantum-classical algorithms that split the computational cost between classical and quantum hardware. Among the hybrid algorithms, the variational quantum eigensolver (VQE) is mentioned. The VQE is a variational quantum algorithm designed to estimate the eigenvalues and eigenvectors of a system on universal-gate quantum architectures. A canonical problem in electromagnetics is the computation of eigenmodes within waveguides. Following the finite difference method, the wave equation can be recast as an eigenvalue problem. This work exploits the quantum superposition and entanglement in quantum computing to solve the square waveguide mode problem. This algorithm is expected to demonstrate exponentially efficiency over classical computational techniques as the qubit count increases. The simulations were performed on IBM’s three-qubit quantum simulator, Qasm IBM Simulator. A shot-based simulation was performed considering computationally based measurements of the quantum hardware. The results of the probabilistic read-out, reported in terms of 2-D eigenmode field distributions, are close to ideal values with a few number of qubits, confirming the possibility to exploit the quantum advantage to formulate innovative eigensolvers.
The advent of noisy intermediate-scale quantum (NISQ) systems signifies an important stage in quantum computing development. Despite the constraints due to their limited qubit numbers and noise susceptibility, NISQ devices exhibit substantial potential to tackle complex computational challenges via hybrid classical-quantum algorithms. Among the various hybrid algorithms, variational quantum algorithms (VQAs) are gaining increasing attention due to their ability to solve highly complex, large-scale problems where classical algorithms fail. In particular, the variational quantum eigensolver (VQE) shows its potential in calculating the energies and ground states of large systems, where the complexity of solving such problems grows exponentially and becomes intractable for classical computers. At this regard, the aim of this paper is to extend the use of VQE for solving circular waveguide modes to verify their applicability to mathematically complex EM problems. In particular, we propose to calculate the fundamental and the some higher order modes for both transverse electric and transverse magnetic cases in circular waveguides. This is mathematically challenging due to the nature of geometry and the associated boundary conditions of circular structures. The results confirm the possibility of applying VQE for mathematically complex EM problems, announcing its potential to scale up and solve high-dimensional, large-scale EM problems where classical algorithms can fail.
Variational quantum algorithms (VQAs) are one of the most promising methods that can be implemented on noisy intermediate-scale quantum (NISQ) machines to achieve a quantum advantage over classical computers. This article describes the use of a VQA in conjunction with the finite difference method for the calculation of propagation modes of an electromagnetic wave in a hollow metallic waveguide. The two-dimensional (2-D) waveguide problem, described by the Helmholtz equation, is approximated by a system of linear equations, whose solutions are expressed in terms of simple quantum expectation values that can be evaluated efficiently on quantum hardware. Numerical examples are presented to validate the proposed method for solving 2-D waveguide problems.
High Resolution Image Download MS PowerPoint Slide We investigate the variational quantum eigensolver (VQE) for estimating the ground-state energy of the BeH 2 molecule, emphasizing practical implementation and performance on current quantum hardware. Our research presents a comparative study of HEA and UCCSD ansätze on noiseless and noisy simulations and implements VQE on recent IBM quantum computer noise models and a real quantum computer, IBM Fez, providing a fully functional code employing Qiskit 1.2 . Our experiments confirm UCCSD’s reliability in ideal conditions, while the HEA demonstrates greater robustness to hardware noise, achieving chemical accuracy on state-vector simulation (SVS). The results reveal that achieving ground-state energy within chemical accuracy is feasible without error mitigation during VQE convergence. We demonstrate that current quantum devices effectively optimize circuit parameters despite misestimating simulated energies. The SVS-evaluated energies provide a more accurate representation of the solution quality compared to QPU-estimated energy values, indicating that VQE converges to the correct ground state despite quantum noise. Our study also applies noise mitigation as a postprocessing technique, using zero-noise extrapolation (ZNE) on a real quantum computer. The detailed methodologies presented in this study, including Hamiltonian construction and Fermionic-to-qubit transformations, facilitate flexible adaptation of the VQE approach for various algorithm variants and across different levels of algorithmic implementation.
Variational Quantum Eigensolvers (VQEs) are a powerful class of hybrid quantum-classical algorithms designed to approximate the ground state of a quantum system described by its Hamiltonian. VQEs hold promise for various applications, including lattice field theory. However, the inherent noise of Noisy Intermediate-Scale Quantum (NISQ) devices poses a significant challenge for running VQEs as these algorithms are particularly susceptible to noise, e.g., measurement shot noise and hardware noise. In a recent work, it was proposed to enhance the classical optimization of VQEs with Gaussian Processes (GPs) and Bayesian Optimization, as these machine-learning techniques are well-suited for handling noisy data. In these proceedings, we provide additional insights into this new algorithm and present further numerical experiments. In particular, we examine the impact of hardware noise and error mitigation on the algorithm's performance. We validate the algorithm using classical simulations of quantum hardware, including hardware noise benchmarks, which have not been considered in previous works. Our numerical experiments demonstrate that GP-enhanced algorithms can outperform state-of-the-art baselines, laying the foundation for future research on deploying these techniques to real quantum hardware and lattice field theory setups.
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization algorithm. The appeal of VQAs lies in their versatility, resistance to noise, and ability to demonstrate some results even with circuits of small depth. We primarily focus on the algorithm called variational quantum eigensolver (VQE), which takes a qubit Hamiltonian and returns its approximate ground state. We first present our numerical findings regarding VQE applied to two spin models and a variant of the Hubbard model. Next, we briefly touch the topic of quantum machine learning by developing a quantum classifier to partition quantum data. We further study the phenomenon of vanishing derivatives in VQAs, also known as barren plateaus phenomenon. We derive a new lower bound on variance of the derivatives, which depends on the causal structure of the ansatz circuit and the individual terms entering the Pauli decomposition of the problem Hamiltonian. In the final chapter of the thesis, we present our results on bounding the fidelity of experimentally prepared Clifford states using their parent Hamiltonians.