• Corpus ID: 235624149

Accelerating variational quantum algorithms with multiple quantum processors

  title={Accelerating variational quantum algorithms with multiple quantum processors},
  author={Yuxuan Du and Yan Qian and Dacheng Tao},
Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages over classical methods. Nevertheless, modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large-volume data. As such, to better exert the superiority of VQAs, it is of great significance to improve their runtime efficiency. Here we devise an efficient distributed optimization… 

CAFQA: A classical simulation bootstrap for variational quantum algorithms

This work proposes CAFQA, a Clifford Ansatz For Quantum Accuracy, a hardware-efficient circuit built with only Clifford gates that is well-suited to classical computation and allows for preliminary ground state energy estimation of the challenging chromium dimer (Cr 2 ) molecule.

QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines

It is proved that the merging process in MaxCut can be further cast into a new MaxCut problem and thus be addressed by QAOAs or other MaxCut solvers, and it is proven that the approximation ratio of QAOA 2 is lower bounded by 1 / 2.

Toward Trainability of Deep Quantum Neural Networks

This work provides the first viable solution to the vanishing gradient problem for deep QNNs with theoretical guarantees and proves that for circuits with controlled-layer architectures, the expectation of the gradient norm can be lower bounded by a value that is independent of the qubit number and the circuit depth.



Variational Quantum Algorithms

An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed.

Variational quantum state diagonalization

Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate

Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem

It is found that QAOA can amortize the training cost by optimizing on batches of problems instances, and can exceed the performance of the classical polynomial time Goemans-Williamson algorithm with modest circuit depth, and that performance with fixed circuit depth is insensitive to problem size.

Noisy intermediate-scale quantum (NISQ) algorithms

A thorough summary of NISQ computational paradigms and algorithms, which discusses the key structure of these algorithms, their limitations, and advantages, and a comprehensive overview of various benchmarking and software tools useful for programming and testing NISZ devices.

From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter.

Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices

An in-depth study of the performance of QAOA on MaxCut problems is provided by developing an efficient parameter-optimization procedure and revealing its ability to exploit non-adiabatic operations, illustrating that optimization will be important only for problem sizes beyond numerical simulations, but accessible on near-term devices.

Neural predictor based quantum architecture search

It is demonstrated a neural predictor guided QAS can discover powerful quantum circuit ansatz, yielding state-of-the-art results for various examples from quantum simulation and quantum machine learning.

Evaluating analytic gradients on quantum hardware

This paper shows how gradients of expectation values of quantum measurements can be estimated using the same, or almost the same the architecture that executes the original circuit, and proposes recipes for the computation of gradients for continuous-variable circuits.

Hybrid Quantum-Classical Algorithms and Quantum Error Mitigation

The basic results for hybrid quantum-classical algorithms and quantum error mitigation techniques are reviewed and it is expected that this review to be a useful basis for future studies.

Efficient Measure for the Expressivity of Variational Quantum Algorithms.

The superiority of variational quantum algorithms (VQAs) such as quantum neural networks (QNNs) and variational quantum eigensolvers (VQEs) heavily depends on the expressivity of the employed