15 February 2022 in Reviews of Modern Physics
A universal fault-tolerant quantum computer that can efficiently solve problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement toward realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e., qubits that are not error corrected, and therefore perform imperfect operations within a limited coherence time. In the search for achieving quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry, and combinatorial optimization. The overarching goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, a thorough summary of NISQ computational paradigms and algorithms is provided. The key structure of these algorithms and their limitations and advantages are discussed. A comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices is additionally provided.
15 February 2022 in Chemical Society Reviews
This review presents a comprehensive overview of the Unitary Coupled Cluster (UCC) ansatz and related ansätze which are used to solve the electronic structure problem on quantum computers.
28 May 2021 in PRX Quantum
We present the meta-variational quantum eigensolver (VQE), an algorithm capable of learning the ground-state energy profile of a parameterized Hamiltonian. If the meta-VQE is trained with a few data points, it delivers an initial circuit parameterization that can be used to compute the ground-state energy of any parameterization of the Hamiltonian within a certain trust region. We test this algorithm with an XXZ spin chain, an electronic Hamiltonian, and a single-transmon quantum simulation. In all cases, the meta-VQE is able to learn the shape of the energy functional and, in some cases, it results in improved accuracy in comparison with individual VQE optimization. The meta-VQE algorithm introduces both a gain in efficiency for parameterized Hamiltonians in terms of the number of optimizations and a good starting point for the quantum circuit parameters for individual optimizations. The proposed algorithm can be readily mixed with other improvements in the field of variational algorithms to shorten the distance between the current state of the art and applications with quantum advantage.
27 January 2021 in Chemical Science
We develop computationally affordable and encoding independent gradient evaluation procedures for unitary coupled-cluster type operators, applicable on quantum computers. We show that, within our framework, the gradient of an expectation value with respect to a parameterized n-fold fermionic excitation can be evaluated by four expectation values of similar form and size, whereas most standard approaches, based on the direct application of the parameter-shift-rule, come with an associated cost of expectation values. For real wavefunctions, this cost can be further reduced to two expectation values. Our strategies are implemented within the open-source package Tequila and allow blackboard style construction of differentiable objective functions. We illustrate initial applications through extended adaptive approaches for electronic ground and excited states.
9 March 2021 in Quantum Science and Technology
Variational quantum algorithms are currently the most promising class of algorithms for deployment on near-term quantum computers. In contrast to classical algorithms, there are almost no standardized methods in quantum algorithmic development yet, and the field continues to evolve rapidly. As in classical computing, heuristics play a crucial role in the development of new quantum algorithms, resulting in a high demand for flexible and reliable ways to implement, test, and share new ideas. Inspired by this demand, we introduce tequila, a development package for quantum algorithms in python, designed for fast and flexible implementation, prototyping and deployment of novel quantum algorithms in electronic structure and other fields. tequila operates with abstract expectation values which can be combined, transformed, differentiated, and optimized. On evaluation, the abstract data structures are compiled to run on state of the art quantum simulators or interfaces.
1 July 2021 in Quantum Science and Technology
Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. We believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.