We present a cascaded variational quantum eigensolver algorithm that only requires the execution of a set of quantum circuits once rather than at every iteration during the parameter optimization process, thereby increasing the computational throughput. This algorithm uses a quantum processing unit to probe the needed probability mass functions and a classical processing unit perform the remaining calculations, including the energy minimization. The ansatz form does not restrict the Fock space and provides full control over the trial state, including the implementation of symmetry and other physically motivated constraints. Published by the American Physical Society 2024
We demonstrate how the cascaded variational quantum eigensolver (CVQE) can be applied to study molecular systems for the family of Jastrow ansatzes. Specifically, we applied CVQE to the water molecule. We find that CVQE has a number of advantages. In particular, our results show that CVQE requires 2 to 3 orders of magnitude fewer quantum computing (QC) executions than VQE for the water molecule. Furthermore, our results indicate that CVQE might provide some robustness against two-qubit gate errors given that the number of CNOT gates used in our calculation was ∼300 and the errors in the QC calculations are still comparable to those obtained by VQE.
We explore the relationship between entropy and quantum measurements and present a variational algorithm for preparing statistical ensembles on quantum computers using mid-circuit measurements. This algorithm optimizes both the entropy and variational parameters describing the state to obtain the minimum free energy of quantum systems in thermal equilibrium with some external heat bath. We demonstrate our algorithm on IBM-Q Lagos.
We propose an amplitude encoding of the traveling salesperson problem along with a method for calculating the cost function using a probability distribution obtained on a quantum computer. Our encoding requires a number of qubits that grows logarithmically with the number of cities. We propose to calculate the cost function using a nonlinear function of expectation values of quantum operators. This is in contrast to the typical method of evaluating the cost function by summing expectation values of quantum operators. We demonstrate our method using a variational quantum eigensolver algorithm to find the shortest route for a given graph. We find that there is a broad range in the hyperparameters of the optimization procedure for which the best route is found.
We propose a hybrid variational quantum algorithm that has variational parameters used by both the quantum circuit and the subsequent classical optimization. Similar to the variational quantum eigensolver, this algorithm applies a parameterized unitary operator to the qubit register. We generate this operator using diabatic state preparation. The quantum measurement results then inform the classical optimization procedure used by the cascaded variational quantum eigensolver. We demonstrate the algorithm on a system of interacting electrons and show how it can be used on long-term error-corrected as well as short-term intermediate-scale quantum computers. Our simulations performed on IBM Brisbane produced energies well within chemical accuracy.
We propose an amplitude encoding of the traveling salesperson problem along with a method for calculating the cost function. Our encoding requires a number of qubits which grows logarithmically with the number of cities. We propose to calculate the cost function classically based on the probability distribution extracted from measuring the quantum computer. This is in contrast from the typical method of evaluating the cost function by taking the expectation value of a quantum operator. We demonstrate our method using a variational quantum eigensolver algorithm to find the shortest route for a given graph. We find that there is a broad range in the hyperparameters of the optimization procedure for which the best route is found.