Classical Splitting of Parametrized Quantum Circuits

Abstract

Barren plateaus appear to be a major obstacle to using variational quantum algorithms to simulate large-scale quantum systems or replace traditional machine learning algorithms. They can be caused by multiple factors such as expressivity, entanglement, locality of observables, or even hardware noise. We propose classical splitting of ansätze or parametrized quantum circuits to avoid barren plateaus. Classical splitting is realized by splitting an $N$ qubit ansatz to multiple ansätze that consists of $\mathcal{O}(\log N)$ qubits. We show that such an ansatz can be used to avoid barren plateaus. We support our results with numerical experiments and perform binary classification on classical and quantum datasets. Then, we propose an extension of the ansatz that is compatible with variational quantum simulations. Finally, we discuss a speed-up for gradient-based optimization and hardware implementation, robustness against noise and parallelization, making classical splitting an ideal tool for noisy intermediate scale quantum (NISQ) applications.

main text 11 pages, 5 figures; supplementary material 10 pages, 11 figures

References in corpus (2)

• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations

Cited by in corpus (7)

• Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices
• Networked Quantum Services
• Symmetry breaking in geometric quantum machine learning in the presence of noise
• Variational quantum eigensolver with linear depth problem-inspired ansatz for solving portfolio optimization in finance
• Splitting and Parallelizing of Quantum Convolutional Neural Networks for Learning Translationally Symmetric Data
• Distributed quantum machine learning via classical communication
• Improving the trainability of VQE on NISQ computers for solving portfolio optimization using convex interpolation