Accelerating variational quantum algorithms with multiple quantum processors
arXiv:2106.12819
Abstract
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 scheme, called QUDIO, to address this issue. Specifically, in QUDIO, a classical central server partitions the learning problem into multiple subproblems and allocate them to multiple local nodes where each of them consists of a quantum processor and a classical optimizer. During the training procedure, all local nodes proceed parallel optimization and the classical server synchronizes optimization information among local nodes timely. In doing so, we prove a sublinear convergence rate of QUDIO in terms of the number of global iteration under the ideal scenario, while the system imperfection may incur divergent optimization. Numerical results on standard benchmarks demonstrate that QUDIO can surprisingly achieve a superlinear runtime speedup with respect to the number of local nodes. Our proposal can be readily mixed with other advanced VQAs-based techniques to narrow the gap between the state of the art and applications with quantum advantage.
References in corpus (34)
- PyTorch: An Imperative Style, High-Performance Deep Learning Library
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- A Quantum Approximate Optimization Algorithm
- Quantum machine learning in feature Hilbert spaces
- Quantum Circuit Learning
- Evaluating analytic gradients on quantum hardware
- Quantum Computational Supremacy
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Efficient Learning for Deep Quantum Neural Networks
- Robust data encodings for quantum classifiers
- Information-theoretic bounds on quantum advantage in machine learning
- Learning-based quantum error mitigation
- PennyLane: Automatic differentiation of hybrid quantum-classical computations
- Efficient Distributed Quantum Computing
- Training of Quantum Circuits on a Hybrid Quantum Computer
- Variational Quantum State Diagonalization
- Quantum noise protects quantum classifiers against adversaries
- Optimization for deep learning: theory and algorithms
- Filtering variational quantum algorithms for combinatorial optimization
- Efficient measure for the expressivity of variational quantum algorithms
- Measurement reduction in variational quantum algorithms
- Calculating energy derivatives for quantum chemistry on a quantum computer
- Towards understanding the power of quantum kernels in the NISQ era
- Experimental Estimation of Quantum State Properties from Classical Shadows
- Neural Predictor based Quantum Architecture Search
- Variational Quantum Algorithm for Estimating the Quantum Fisher Information
- Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
- Mitigating Coherent Noise Using Pauli Conjugation
- A Grover-search Based Quantum Learning Scheme for Classification
- Accelerating lattice quantum field theory calculations via interpolator optimization using NISQ-era quantum computing
- Quantum Differentially Private Sparse Regression Learning
- Portfolio rebalancing experiments using the Quantum Alternating Operator Ansatz
- The dilemma of quantum neural networks