Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Spectral invariance and maximality properties of the frequency spectrum of quantum neural networks (2402.14515v2)

Published 22 Feb 2024 in quant-ph, cs.LG, and stat.ML

Abstract: Quantum Neural Networks (QNNs) are a popular approach in Quantum Machine Learning due to their close connection to Variational Quantum Circuits, making them a promising candidate for practical applications on Noisy Intermediate-Scale Quantum (NISQ) devices. A QNN can be expressed as a finite Fourier series, where the set of frequencies is called the frequency spectrum. We analyse this frequency spectrum and prove, for a large class of models, various maximality results. Furthermore, we prove that under some mild conditions there exists a bijection between classes of models with the same area $A = RL$ that preserves the frequency spectrum, where $R$ denotes the number of qubits and $L$ the number of layers, which we consequently call spectral invariance under area-preserving transformations. With this we explain the symmetry in $R$ and $L$ in the results often observed in the literature and show that the maximal frequency spectrum depends only on the area $A = RL$ and not on the individual values of $R$ and $L$. Moreover, we extend existing results and specify the maximum possible frequency spectrum of a QNN with arbitrarily many layers as a function of the spectrum of its generators. If the generators of the QNN can be further decomposed into 2-dimensional sub-generators, then this specification follows from elementary number-theoretical considerations. In the case of arbitrary dimensional generators, we extend existing results based on the so-called Golomb ruler and introduce a second novel approach based on a variation of the turnpike problem, which we call the relaxed turnpike problem.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. Machine learning with quantum computers. Springer, 2021.
  2. Variational quantum algorithms. Nature Reviews Physics, 3:625 – 644, 2020.
  3. Challenges and opportunities in quantum machine learning. Nature Computational Science, 2:567 – 576, 2022.
  4. John Preskill. Quantum computing in the nisq era and beyond. Quantum, 2018.
  5. Noisy intermediate-scale quantum algorithms. Reviews of Modern Physics, 94(1):015004, 2022.
  6. From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms, 12:34, 2017.
  7. The variational quantum eigensolver: A review of methods and best practices. Physics Reports, 2021.
  8. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. Nature, 549:242–246, 2017.
  9. An exponentially-growing family of universal quantum circuits. Machine Learning: Science and Technology, 4, 2022.
  10. Effect of data encoding on the expressive power of variational quantum-machine-learning models. Physical Review A, 2020.
  11. The theory of variational hybrid quantum-classical algorithms. New Journal of Physics, 18, 2015.
  12. Variational quantum generators: Generative adversarial quantum machine learning for continuous distributions. Advanced Quantum Technologies, 4, 2019.
  13. Quantum circuit learning. Physical Review A, 2018.
  14. Classification with quantum neural networks on near term processors. arXiv: Quantum Physics, 2018.
  15. Barren plateaus in quantum neural network training landscapes. Nature Communications, 9, 2018.
  16. Parameterized quantum circuits as machine learning models. Quantum Science and Technology, 4, 2019.
  17. Training deep quantum neural networks. Nature Communications, 11, 2019.
  18. Training quantum neural networks on nisq devices. 2021.
  19. Learning capability of parametrized quantum circuits. 2022.
  20. Input redundancy for parameterized quantum circuits. In Frontiers of Physics, 2019.
  21. Demonstrating quantum advantage in hybrid quantum neural networks for model capacity. In 2022 IEEE International Conference on Rebooting Computing (ICRC), pages 36–44, 2022.
  22. Fock state-enhanced expressivity of quantum machine learning models. EPJ Quantum Technology, 9, 2021.
  23. Multidimensional fourier series with quantum circuits. Physical Review A, 2023.
  24. Exponential data encoding for quantum supervised learning. Physical Review A, 2022.
  25. Data re-uploading for a universal quantum classifier. Quantum, 4:226, 2019.
  26. Evaluating analytic gradients on quantum hardware. Physical Review A, 2018.
  27. Generalization despite overfitting in quantum machine learning models. 2022.
  28. Multilayer feedforward networks are universal approximators. Neural Networks, 2:359–366, 1989.
  29. S. Sidon. Ein satz über trigonometrische polynome und seine anwendung in der theorie der fourier-reihen. Mathematische Annalen, 106:536–539, 1932.
  30. Some new possibilities of optimum synthetic linear arrays for radioastronomy. Astronomy and Astrophysics, 41:409–411, 1975.
  31. W. C. Babcock. Intermodulation interference in radio systems frequency of occurrence and control by channel selection. Bell System Technical Journal, 32:63–73, 1953.
  32. Integer sets with distinct sums and differences and carrier frequency assignments for nonlinear repeaters. IEEE Trans. Commun., 34:614–617, 1986.
  33. A class of binary recurrent codes with limited error propagation. IEEE Trans. Inf. Theory, 13:106–113, 1967.
  34. Apostolos Dimitromanolakis. Analysis of the golomb ruler and the sidon set problems, and determination of large, near-optimal golomb rulers. Master’s Thesis, Department of Electronic and Computer Engineering, Technical University of Crete, 2002.
  35. A conjecture on a continuous optimization model for the golomb ruler problem. RAIRO Oper. Res., 55:2241–2246, 2021.
  36. Tamara Dakic. On the turnpike problem. Simon Fraser University BC, Canada, 2000.
  37. Errors between sites in restriction site mapping. Computer applications in the biosciences : CABIOS, 4 1:117–23, 1988.
  38. A. L. Patterson. A direct method for the determination of the components of interatomic distances in crystals. Zeitschrift für Kristallographie - Crystalline Materials, 90:517 – 542, 1935.
  39. A. L. Patterson. Ambiguities in the x-ray analysis of crystal structures. Physical Review, 65:195–201, 1944.
  40. Reconstructing sets from interpoint distances. In Proceedings of the sixth annual symposium on Computational geometry, pages 332–339, 1990.
  41. On the complexity of inverting the autocorrelation function of a finite integer sequence, and the problem of locating n points on a line, given the (n atop 2t) unlabelled distances between them. 1988.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com