CAFQA: Clifford Ansatz For Quantum Accuracy

02/25/2022
by   Gokul Subramanian Ravi, et al.
0

Variational Quantum Algorithms (VQAs) rely upon the iterative optimization of a parameterized unitary circuit with respect to an objective function. Since quantum machines are noisy and expensive resources, it is imperative to choose a VQA's ansatz appropriately and its initial parameters to be close to optimal. This work tackles the problem of finding initial ansatz parameters by proposing CAFQA, a Clifford ansatz for quantum accuracy. The CAFQA ansatz is a hardware-efficient circuit built with only Clifford gates. In this ansatz, the initial parameters for the tunable gates are chosen by searching efficiently through the Clifford parameter space via classical simulation, thereby producing a suitable stabilizer state. The stabilizer states produced are shown to always equal or outperform traditional classical initialization (e.g., Hartree-Fock), and often produce high accuracy estimations prior to quantum exploration. Furthermore, the technique is classically suited since a) Clifford circuits can be exactly simulated classically in polynomial time and b) the discrete Clifford space, while scaling exponentially in the number of qubits, is searched efficiently via Bayesian Optimization. For the Variational Quantum Eigensolver (VQE) task of molecular ground state energy estimation up to 20 qubits, CAFQA's Clifford Ansatz achieves a mean accuracy of near 99 over Hartree-Fock. Notably, the scalability of the approach allows for preliminary ground state energy estimation of the challenging Chromium dimer with an accuracy greater than Hartree-Fock. With CAFQA's initialization, VQA convergence is accelerated by a factor of 2.5x. In all, this work shows that stabilizer states are an accurate ansatz initialization for VQAs. Furthermore, it highlights the potential for quantum-inspired classical techniques to support VQAs.

READ FULL TEXT

page 1

page 3

page 4

page 6

page 8

research
04/29/2021

Optimal training of variational quantum algorithms without barren plateaus

Variational quantum algorithms (VQAs) promise efficient use of near-term...
research
02/19/2019

Variational Quantum Circuit Model for Knowledge Graphs Embedding

In this work, we propose the first quantum Ansätze for the statistical r...
research
10/15/2022

TopGen: Topology-Aware Bottom-Up Generator for Variational Quantum Circuits

Variational Quantum Algorithms (VQA) are promising to demonstrate quantu...
research
07/22/2021

QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits

Quantum noise is the key challenge in Noisy Intermediate-Scale Quantum (...
research
08/06/2023

Enabling High Performance Debugging for Variational Quantum Algorithms using Compressed Sensing

Variational quantum algorithms (VQAs) can potentially solve practical pr...
research
09/25/2022

Navigating the dynamic noise landscape of variational quantum algorithms with QISMET

Transient errors from the dynamic NISQ noise landscape are challenging t...
research
05/05/2022

LAWS: Look Around and Warm-Start Natural Gradient Descent for Quantum Neural Networks

Variational quantum algorithms (VQAs) have recently received significant...

Please sign up or login with your details

Forgot password? Click here to reset