Quantum circuit growth algorithms don't follow predictable scaling laws with training data size, and theoretical generalization bounds, while valid, have weak predictive power for practical circuit design decisions.
This paper investigates whether quantum circuit complexity and training data requirements follow predictable scaling laws. Researchers reimplemented Q-FLAIR, an algorithm that grows quantum circuits gate-by-gate, and tested it on MNIST classification with varying dataset sizes.