SnCQA: A hardware-efficient equivariant quantum convolutional circuit architecture
arXiv:2211.12711 · doi:10.1109/QCE57702.2023.00034
Abstract
We propose SnCQA, a set of hardware-efficient variational circuits of equivariant quantum convolutional circuits respective to permutation symmetries and spatial lattice symmetries with the number of qubits . By exploiting permutation symmetries of the system, such as lattice Hamiltonians common to many quantum many-body and quantum chemistry problems, Our quantum neural networks are suitable for solving machine learning problems where permutation symmetries are present, which could lead to significant savings of computational costs. Aside from its theoretical novelty, we find our simulations perform well in practical instances of learning ground states in quantum computational chemistry, where we could achieve comparable performances to traditional methods with few tens of parameters. Compared to other traditional variational quantum circuits, such as the pure hardware-efficient ansatz (pHEA), we show that SnCQA is more scalable, accurate, and noise resilient (with better performance on square lattice and resource savings in various lattice sizes and key criterions such as the number of layers, parameters, and times to converge in our cases), suggesting a potentially favorable experiment on near-time quantum devices.
arXiv comment10 pages, many figures. IEEE QCE 2023, 1st best paper award in quantum algorithms
References in corpus (40)
- Very Deep Convolutional Networks for Large-Scale Image Recognition
- Quantum Computing in the NISQ era and beyond
- Quantum Machine Learning
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- A Quantum Approximate Optimization Algorithm
- Quantum computational chemistry
- Quantum Convolutional Neural Networks
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Reliable Quantum Computers
- Universal Quantum Computation with the Exchange Interaction
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- The effect of data encoding on the expressive power of variational quantum machine learning models
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- A rigorous and robust quantum speed-up in supervised machine learning
- A Theory of Trotter Error
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
- Decoherence-Free Subspaces and Subsystems
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Exploiting symmetry in variational quantum machine learning
- Theory of overparametrization in quantum neural networks
- Digital Quantum Simulation of the Schwinger Model and Symmetry Protection with Trapped Ions
- Universal Variational Quantum Computation
- Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
- Faster Digital Quantum Simulation by Symmetry Protection
- Representation Learning via Quantum Neural Tangent Kernels
- Applications of coherent classical communication and the Schur transform to quantum information theory
- Learning the ground state of a non-stoquastic quantum Hamiltonian in a rugged neural network landscape
- Variational Quantum-Neural Hybrid Eigensolver
- Analytic theory for the dynamics of wide quantum neural networks
- A decoherence-free subspace in a charge quadrupole qubit
- Building spatial symmetries into parameterized quantum circuits for faster training
- An efficient high dimensional quantum Schur transform
- Representation Theory for Geometric Quantum Machine Learning
- Preparation of Decoherence Free Cluster States with Optical Superlattices
- A Practical Quantum Algorithm for the Schur Transform
- Symmetric Pruning in Quantum Neural Networks
- Toward Super-polynomial Quantum Speedup of Equivariant Quantum Algorithms with SU() Symmetry
- Quantum Kerr Learning