Parameter-Parallel Distributed Variational Quantum Algorithm
arXiv:2208.00450 · doi:10.21468/SciPostPhys.14.5.132
Abstract
Variational quantum algorithms (VQAs) have emerged as a promising near-term technique to explore practical quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, the inefficient parameter training process due to the incompatibility with backpropagation and the cost of a large number of measurements, posing a great challenge to the large-scale development of VQAs. Here, we propose a parameter-parallel distributed variational quantum algorithm (PPD-VQA), to accelerate the training process by parameter-parallel training with multiple quantum processors. To maintain the high performance of PPD-VQA in the realistic noise scenarios, a alternate training strategy is proposed to alleviate the acceleration attenuation caused by noise differences among multiple quantum processors, which is an unavoidable common problem of distributed VQA. Besides, the gradient compression is also employed to overcome the potential communication bottlenecks. The achieved results suggest that the PPD-VQA could provide a practical solution for coordinating multiple quantum processors to handle large-scale real-word applications.
References in corpus (38)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithm for solving linear systems of equations
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- Quantum computational advantage using photons
- The theory of variational hybrid quantum-classical algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Circuit Learning
- Quantum Convolutional Neural Networks
- Strong quantum computational advantage using a superconducting quantum processor
- Evaluating analytic gradients on quantum hardware
- Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training
- A Survey on Distributed Machine Learning
- Hartree-Fock on a superconducting qubit quantum computer
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum generative adversarial learning
- Global entanglement in multiparticle systems
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- Quantum chemistry calculations on a trapped-ion quantum simulator
- Superconducting Quantum Computing: A Review
- Realization of an Error-Correcting Surface Code with Superconducting Qubits
- Hybrid Quantum-Classical Convolutional Neural Networks
- Experimental Quantum Generative Adversarial Networks for Image Generation
- Demonstration of Shor's quantum factoring algorithm using photonic qubits
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Experimental Quantum Computing to Solve Systems of Linear Equations
- Phase matching in quantum searching
- Experimental Blind Quantum Computing for a Classical Client
- Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
- Demonstration of Topological Data Analysis on a Quantum Processor
- Quantum Neuronal Sensing of Quantum Many-Body States on a 61-Qubit Programmable Superconducting Processor
- FedILC: Weighted Geometric Mean and Invariant Gradient Covariance for Federated Learning on Non-IID Data