Solutions to many-body problem instances often involve an intractable number of degrees of freedom and admit no known approximations in general form. In practice, representing quantum-mechanical states of a given Hamiltonian using available numerical methods, in particular those based on variational Monte Carlo simulations, become exponentially more challenging with increasing system size. Recently quantum algorithms implemented as variational models have been proposed to accelerate such simulations. The variational ansatz states are characterized by a polynomial number of parameters devised in a way to minimize the expectation value of a given Hamiltonian, which is emulated by local measurements. In this study, we develop a means to certify the termination of variational algorithms. We demonstrate our approach by applying it to three models: the transverse field Ising model, the model of one-dimensional spinless fermions with competing interactions, and the Schwinger model of quantum electrodynamics. By means of comparison, we observe that our approach shows better performance near critical points in these models. We hence take a further step to improve the applicability and to certify the results of variational quantum simulators.
Solutions to many-body problem instances often involve an intractable number of degrees of freedom and admit no known approximations in general form. In practice, representing quantum-mechanical states of a given Hamiltonian using available numerical methods, in particular those based on variational Monte Carlo simulations, become exponentially more challenging with increasing system size. Recently quantum algorithms implemented as variational models have been proposed to accelerate such simulations. The variational ansatz states are characterized by a polynomial number of parameters devised in a way to minimize the expectation value of a given Hamiltonian, which is emulated by local measurements. In this study, we develop a means to certify the termination of variational algorithms. We demonstrate our approach by applying it to three models: the transverse field Ising model, the model of one-dimensional spinless fermions with competing interactions, and the Schwinger model of quantum electrodynamics. By means of comparison, we observe that our approach shows better performance near critical points in these models. We hence take a further step to improve the applicability and to certify the results of variational quantum simulators.
The numerical emulation of quantum physics and quantum chemistry often involves an intractable number of degrees of freedom and admits no known approximation in the general form. In practice, representing quantum-mechanical states using available numerical methods becomes exponentially more challenging with increasing system size. Recently, quantum algorithms implemented as variational models have been proposed to accelerate such simulations. Here, we study the effect of noise on the quantum phase transition in the Schwinger model within a variational framework. The experiments are built using a free space optical scheme to realize a pair of polarization qubits and enable any two-qubit state to be experimentally prepared up to machine tolerance. We specifically exploit the possibility to engineer noise and decoherence for polarization qubits to explore the limits of variational algorithms for noisy intermediate-scale quantum architectures in identifying and quantifying quantum phase transitions with noisy qubits. We find that despite the presence of noise, one can detect the phase transition of the Schwinger Hamiltonian even for a two-qubit system using variational quantum algorithms.
The Variational Quantum Eigensolver (VQE) is a leading hybrid quantum-classical algorithm for simulating many-body systems in the NISQ era. Its effectiveness, however, depends on the faithful preparation of eigenstates, which becomes challenging in degenerate and strongly entangled regimes. We study this problem using the transverse-field Ising model (TFIM) with periodic boundary conditions in one, two, and three dimensions, considering systems of up to 27 qubits. We employ different ansatzes: the hardware-efficient EfficientSU2 from Qiskit, the physics-inspired Hamiltonian Variational Ansatz (HVA) and HVA with symmetry breaking, and benchmark their performance using energy variance, entanglement entropy, spin correlations, and magnetization.
Abstract Variational quantum algorithms have the potential for significant impact on high-dimensional optimization, with applications in classical combinatorics, quantum chemistry, and condensed matter. Nevertheless, the optimization landscape of these algorithms is generally nonconvex, leading the algorithms to converge to local, rather than global, minima and the production of suboptimal solutions. In this work, we introduce a variational quantum algorithm that couples classical Markov chain Monte Carlo techniques with variational quantum algorithms, allowing the former to provably converge to global minima and thus assure solution quality. Due to the generality of our approach, it is suitable for a myriad of quantum minimization problems, including optimization and quantum state preparation. Specifically, we devise a Metropolis–Hastings method that is suitable for variational quantum devices and use it, in conjunction with quantum optimization, to construct quantum ensembles that converge to Gibbs states. These performance guarantees are derived from the ergodicity of our algorithm’s state space and enable us to place analytic bounds on its time-complexity. We demonstrate both the effectiveness of our technique and the validity of our analysis through quantum circuit simulations for MaxCut instances, solving these problems deterministically and with perfect accuracy, as well as large-scale quantum Ising and transverse field spin models of up to 50 qubits. Our technique stands to broadly enrich the field of variational quantum algorithms, improving and guaranteeing the performance of these promising, yet often heuristic, methods.
Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization that challenge classical computational methods due to their volume-law entanglement content. In this work, we explore the potential of variational quantum algorithms to approximate such states. We propose an adaptive variational quantum eigensolver (VQE) for excited states (X) that self-generates a variational ansatz for arbitrary eigenstates of a many-body Hamiltonian H by attempting to minimize the energy variance with respect to H. We benchmark the method by applying it to an Ising spin chain with integrable and nonintegrable regimes, where we calculate various quantities of interest, including the total energy, magnetization density, and entanglement entropy. We also compare the performance of adaptive VQE-X to an adaptive variant of the folded-spectrum method. For both methods, we find a strong dependence of the algorithm's performance on the choice of operator pool used for the adaptive construction of the ansatz. In particular, an operator pool including long-range two-body gates accelerates the convergence of both algorithms in the nonintegrable regime. We also study the scaling of the number of variational parameters with system size, finding that an exponentially large number of parameters may be necessary to approximate individual highly excited states. Nevertheless, we argue that these methods lay a foundation for the use of quantum algorithms to study finite-energy-density properties of many-body systems.
One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog sense, adiabatic evolution has been proposed to slowly evolve a simple Hamiltonian, initialized in its ground state, to the Hamiltonian of interest such that the final state becomes the desired ground state. Recently, variational methods have also been proposed and realized in quantum simulators for emulating the ground state of many-body systems. Here, we first provide a quantitative comparison between the adiabatic and variational methods with respect to required quantum resources on digital quantum simulators, namely the depth of the circuit and the number of two-qubit quantum gates. Our results show that the variational methods are less demanding with respect to these resources. However, they need to be hybridized with a classical optimization which can converge slowly. Therefore, as the second result of the paper, we provide two different approaches for speeding the convergence of the classical optimizer by taking a good initial guess for the parameters of the variational circuit. We show that these approaches are applicable to a wide range of Hamiltonian and provide significant improvement in the optimization procedure.
Modern day quantum devices are in the NISQ era, meaning that the effects of size restrictions and noise are essential considerations when developing practical quantum algorithms. Recent developments have demonstrated that Variational Quantum Algorithms (VQAs) are an appropriate choice for current era quantum devices. VQAs make use of classical computation to iteratively optimize parameters of a quantum circuit, referred to as the ansatz. These parameters are usually chosen such that a given objective function is minimized. Generally, the cost function to be minimized is computed on a quantum device, and then the parameters are updated using a classical optimizer. One of the most promising VQAs for practical hardware is the Variational Quantum Eigensolver (VQE). VQE uses the expectation value of a given Hamiltonian as the cost function, and the minimal value of this particular cost function corresponds to the minimal eigenvalue of the Hamiltonian.Because evaluating quantum circuits is currently very noisy, developing classical bootstraps that help minimize the number of times a given circuit has to be evaluated is a powerful technique for improving the practicality of VQE. One possible such bootstrapping method is creating an ansatz which can be efficiently simulated on classical computers for restricted parameter values. Once the optimal set of restricted parameters is determined, they can be used as initial parameters for a VQE optimization which has access to the full parameter space. Stabilizer states are states which are generated by a particular group of operators called the Clifford Group. Because of the underlying structure of these operators, circuits consisting of only Clifford operators can be simulated efficiently on classical computers. Clifford Ansatz For Quantum Algorithms (CAFQA) is a proposed classical bootstrap for VQAs that uses ansatzes which reduce to clifford operators for restricted parameter values [1].CAFQA has been shown to produce fairly accurate initialization for VQE applied to molecular Hamiltonians. Motivated by this result, in this paper we seek to analyze the Clifford states that optimize the cost function for a new type of Hamiltonian, namely Transverse Field Ising Hamiltonians. Our primary result is contained in theorem IV.1 which connects the problem of finding the optimal CAFQA initialization to a submodular minimization problem which in turn can be solved in polynomial time.