arXiv:2008.01098 · Physical Review Research

Quantum-optimal-control-inspired ansatz for variational quantum algorithms

Alexandre Choquette, Agustín Di Paolo, Panagiotis Kl. Barkoutsos, David Sénéchal, Ivano Tavernelli, Alexandre Blais

Published May 3, 2021• 85 citations

Abstract

The authors propose a quantum circuit, inspired by the theory of quantum optimal control, to prepare the ground state of the few-body Hubbard model and the water molecule with high-fidelity in a quantum computer.

DOI: 10.1103/physrevresearch.3.023092

Related papers

Progress towards practical quantum variational algorithms

Dave Wecker, Matthew B. Hastings, Matthias Troyer

The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be executed without quantum error correction. Such quantum state preparation can be used in variational approaches, optimizing parameters in the circuit to minimize the energy of the constructed quantum state for a given problem Hamiltonian. For this purpose we propose a simple-to-implement class of quantum states motivated by adiabatic state preparation. We test its accuracy and determine the required circuit depth for a Hubbard model on ladders with up to 12 sites (24 spin orbitals), and for small molecules. We find that this ansatz converges faster than previously proposed schemes based on unitary coupled clusters. While the required number of measurements is astronomically large for quantum chemistry applications to molecules, applying the variational approach to the Hubbard model (and related models) is found to be far less demanding and potentially practical on small quantum computers. We also discuss another application of quantum state preparation using short quantum circuits, to prepare trial ground states of models faster than using adiabatic state preparation.

arXiv:1507.08969Physical Review AOct 2, 2015716 citations

Feedback-based quantum algorithms for ground state preparation

James B. Larsen, Matthew Grace, Andrew Baczewski +1 more

The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one class of ground state algorithms that has received significant attention in recent years. These algorithms utilize a hybrid quantum-classical computing framework to prepare ground states on quantum computers. However, this requires solving a classical optimization problem that can become prohibitively expensive in high dimensions. Here, we develop formulations of feedback-based quantum algorithms for ground state preparation that can be used to address this challenge for two broad classes of Hamiltonians: Fermi-Hubbard Hamiltonians, and molecular Hamiltonians represented in second quantization. Feedback-based quantum algorithms are optimization-free; in place of classical optimization, quantum circuit parameters are set according to a deterministic feedback law derived from quantum Lyapunov control principles. This feedback law guarantees a monotonic improvement in solution quality with respect to the depth of the quantum circuit. A variety of numerical illustrations are provided that analyze the convergence and robustness of feedback-based quantum algorithms for these problem classes. Published by the American Physical Society 2024

arXiv:2303.02917Physical Review ResearchSep 25, 202418 citations

Quantum-optimal-control-inspired ansätze for variational quantum algorithms

Alexandre Choquette, Agustín Di Paolo, Panagiotis Kl. Barkoutsos +3 more

Bulletin of the American Physical SocietyMar 17, 20210 citations

Fast-forwarding molecular ground state preparation with optimal control on analog quantum simulators

Davide Castaldo, Marta Rosa, Stefano Corni

We show that optimal control of the electron dynamics is able to prepare molecular ground states, within chemical accuracy, with evolution times approaching the bounds imposed by quantum mechanics. We propose a specific parameterization of the molecular evolution only in terms of interaction already present in the molecular Hamiltonian. Thus, the proposed method solely utilizes quantum simulation routines, retaining their favorable scalings. Due to the intimate relationships between variational quantum algorithms and optimal control, we compare, when possible, our results with state-of-the-art methods in the literature. We found that the number of parameters needed to reach chemical accuracy and algorithmic scaling is in line with compact adaptive strategies to build variational Ansätze. The algorithm, which is also suitable for quantum simulators, is implemented by emulating a digital quantum processor (up to 16 qubits) and tested on different molecules and geometries spanning different degrees of electron correlation.

arXiv:2402.11667The Journal of Chemical PhysicsJul 1, 20240 citations

Variational Quantum Information Processing

Jhonathan Romero Fontalvo

Traditional quantum algorithms with guaranteed performance generally require fully coherent quantum computers to operate, making error-correction a necessity. In contrast, variational quantum algorithms seek to remove this requirement by formulating the computation as the approximate optimization of a functional. This optimization is carried out in the space of heuristic functions defined by a parameterized (variational) quantum circuit. Taking advantage of the flexibility in the definition of these heuristics, we can expand the operability of variational algorithms within the regime of coherence times of noisy intermediate-scale quantum devices, avoiding the necessity of error-correction. In this dissertation, we present the application of the variational quantum computing approach to problems in quantum simulation, quantum state preparation, quantum error-correction, and generative modeling.\nIn the first part, we investigate the use of the variational quantum eigensolver (VQE) for simulating the ground state of fermionic systems. We start by studying the implementation of VQE using the unitary coupled cluster (UCC) ansatz and propose strategies to reduce its cost. We use these insights to carry out some of the first experimental quantum computations of molecular energies using simplified versions of this ansatz. We also propose an extension of UCC to study problems in condensed matter physics, along with a new low-depth circuit ansatz for preparing non-gaussian fermionic states on quantum computers. We show the potential of our approach to describe strongly correlated fermionic systems.\nIn the second part, we develop three new variational quantum algorithms for problems in quantum computing and machine learning, namely: 1) the quantum autoencoder, to compress ensembles of quantum states, 2) the variational quantum error corrector, to find device-tailored quantum encoding and recovery circuits for quantum error correction, and 3) the variational quantum generator, to generate classical probability distributions. These techniques offer efficient ways to design new quantum circuits for state preparation, to find more effective error-correcting codes and to perform generative modeling with quantum computers. Our work provides insights into the design of variational quantum algorithms and establishes practical guidelines to implement these methods on near-term quantum computers, as well as some future research directions for this field.

May 8, 20191 citation

Insights from an adaptive variational wave function study of the Fermi-Hubbard Model

Gaurav Gyawali, Michael J. Lawler

Approximating the ground states of strongly interacting electron systems in quantum chemistry and condensed matter physics is expected to be one of the earliest applications of quantum computers. In this paper, we prepare highly accurate ground states of the Fermi-Hubbard model for small grids up to 6 sites (12 qubits) by using an interpretable, adaptive variational quantum eigensolver(VQE) called ADAPT-VQE. In contrast with non-adaptive VQE, this algorithm builds a system-specific ansatz by adding an optimal gate built from one-body or two-body fermionic operators at each step. We show this adaptive method outperforms the non-adaptive counterpart in terms of fewer variational parameters, short gate depth, and scaling with the system size. The fidelity and energy of the prepared state appear to improve asymptotically with ansatz depth. We also demonstrate the application of adaptive variational methods by preparing excited states and Green functions using a proposed ADAPT-SSVQE algorithm. Lower depth, asymptotic convergence, noise tolerance of a variational approach, and a highly controllable, system-specific ansatz make the adaptive variational methods particularly well-suited for NISQ devices.

Sep 24, 20211 citation