Restricting to the chip architecture maintains the quantum neural network accuracy

Abstract

In the era of noisy intermediate-scale quantum devices, variational quantum algorithms (VQAs) stand as a prominent strategy for constructing quantum machine learning models. These models comprise both a quantum and a classical component. The quantum facet is characterized by a parametrization $U$, typically derived from the composition of various quantum gates. On the other hand, the classical component involves an optimizer that adjusts the parameters of $U$ to minimize a cost function $C$. Despite the extensive applications of VQAs, several critical questions persist, such as determining the optimal gate sequence, devising efficient parameter optimization strategies, selecting appropriate cost functions, and understanding the influence of quantum chip architectures on the final results. This article aims to address the last question, emphasizing that, in general, the cost function tends to converge towards an average value as the utilized parameterization approaches a $2$-design. Consequently, when the parameterization closely aligns with a $2$-design, the quantum neural network model's outcome becomes less dependent on the specific parametrization. This insight leads to the possibility of leveraging the inherent architecture of quantum chips to define the parametrization for VQAs. By doing so, the need for additional swap gates is mitigated, consequently reducing the depth of VQAs and minimizing associated errors.

References in corpus (25)

• Quantum Machine Learning
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• The Variational Quantum Eigensolver: a review of methods and best practices
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• The effect of data encoding on the expressive power of variational quantum machine learning models
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• 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
• The Future of Quantum Computing with Superconducting Qubits
• Layerwise learning for quantum neural networks
• Hybrid Quantum-Classical Convolutional Neural Networks
• Effect of barren plateaus on gradient-free optimization
• Quantum circuit architecture search for variational quantum algorithms
• Hardware-efficient variational quantum algorithms for time evolution
• Large gradients via correlation in random parameterized quantum circuits
• Entanglement Devised Barren Plateau Mitigation
• Quantum circuit optimizations for NISQ architectures
• Avoiding Barren Plateaus with Classical Deep Neural Networks
• The quantum cost function concentration dependency on the parametrization expressivity
• Evolution strategies: Application in hybrid quantum-classical neural networks

Cited by in corpus (2)

• Learning to learn with an evolutionary strategy applied to variational quantum algorithms
• Barren plateaus are amplified by the dimension of qudits