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.

arXiv commentmain text 11 pages, 5 figures; supplementary material 10 pages, 11 figures

References in corpus (33)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• Quantum Circuit Learning
• Quantum Convolutional Neural Networks
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Data re-uploading for a universal quantum classifier
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Hierarchical quantum classifiers
• Trading classical and quantum computational resources
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Effect of barren plateaus on gradient-free optimization
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Doubling the size of quantum simulators by entanglement forging
• Linear growth of quantum circuit complexity
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Large gradients via correlation in random parameterized quantum circuits
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Entanglement Devised Barren Plateau Mitigation
• Avoiding barren plateaus using classical shadows
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Symbolic integration with respect to the Haar measure on the unitary group
• Computable and operationally meaningful multipartite entanglement measures
• Quantum Circuit Cutting with Maximum Likelihood Tomography
• Mitigating Barren Plateaus with Transfer-learning-inspired Parameter Initializations
• $i$-QER: An Intelligent Approach towards Quantum Error Reduction

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