Towards Efficient Ansatz Architecture for Variational Quantum Algorithms
arXiv:2111.13730
Abstract
Variational quantum algorithms are expected to demonstrate the advantage of quantum computing on near-term noisy quantum computers. However, training such variational quantum algorithms suffers from gradient vanishing as the size of the algorithm increases. Previous work cannot handle the gradient vanishing induced by the inevitable noise effects on realistic quantum hardware. In this paper, we propose a novel training scheme to mitigate such noise-induced gradient vanishing. We first introduce a new cost function of which the gradients are significantly augmented by employing traceless observables in truncated subspace. We then prove that the same minimum can be reached by optimizing the original cost function with the gradients from the new cost function. Experiments show that our new training scheme is highly effective for major variational quantum algorithms of various tasks.
References in corpus (12)
- A variational eigenvalue solver on a quantum processor
- The theory of variational hybrid quantum-classical algorithms
- A Quantum Approximate Optimization Algorithm
- Quantum computational chemistry
- Quantum Convolutional Neural Networks
- Characterizing Quantum Supremacy in Near-Term Devices
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
- Quantum-assisted quantum compiling
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
- Recurrent Quantum Neural Networks