paper-with-me

홈 › Papers

From Reachability to Learnability: Geometric Design Principles for Quantum Neural Networks

2026-03-03 · Vishal S. Ngairangbam, Michael Spannowsky arxiv

Classical deep networks are effective because depth enables adaptive geometric deformation of data representations. In quantum neural networks (QNNs), however, depth or state reachability alone does not guarantee this feature-learning capability. We study this question in the pure-state setting by viewing encoded data as an embedded manifold in $\mathbb{C}P^{2^n-1}$ and analysing infinitesimal unitary actions through Lie-algebra directions. We introduce Classical-to-Lie-algebra (CLA) maps and the criterion of almost Complete Local Selectivity (aCLS), which combines directional completeness with data-dependent local selectivity. Within this framework, we show that data-independent trainable unitaries are complete but non-selective, i.e. learnable rigid reorientations, whereas pure data encodings are selective but non-tunable, i.e. fixed deformations. Hence, geometric flexibility requires a non-trivial joint dependence on data and trainable weights. We further show that accessing high-dimensional deformations of many-qubit state manifolds requires parametrised entangling directions; fixed entanglers such as CNOT alone do not provide adaptive geometric control. Numerical examples validate that aCLS-satisfying data re-uploading models outperform non-tunable schemes while requiring only a quarter of the gate operations. Thus, the resulting picture reframes QNN design from state reachability to controllable geometry of hidden quantum representations.

📄 PDF Abstract BibTeX arXiv:2603.03071

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Learnability and Complexity of Quantum Samples

2020-10-22 · Murphy Yuezhen Niu, Andrew M. Dai, Li Li, Augustus Odena 외

Given a quantum circuit, a quantum computer can sample the output distribution exponentially faster in the number of bits than classical computers. A similar exponential separation has yet to be established in generative…

Benchmarking

Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness

2024-05-20 · Chirag Wadhwa, Mina Doosti

In this work, we study the learnability of quantum circuits in the near term. We demonstrate the natural robustness of quantum statistical queries for learning quantum processes, motivating their use as a theoretical too…

Quantum Adversarial Machine Learning and Defense Strategies: Challenges and Opportunities

2024-12-16 · Eric Yocam, Anthony Rizi, Mahesh Kamepalli, Varghese Vaidyan 외

As quantum computing continues to advance, the development of quantum-secure neural networks is crucial to prevent adversarial attacks. This paper proposes three quantum-secure design principles: (1) using post-quantum c…

A single $T$-gate makes distribution learning hard

2022-07-07 · Marcel Hinsche, Marios Ioannou, Alexander Nietner, Jonas Haferkamp 외

The task of learning a probability distribution from samples is ubiquitous across the natural sciences. The output distributions of local quantum circuits form a particularly interesting class of distributions, of key im…

Quantum Machine Learning

On the Quantum versus Classical Learnability of Discrete Distributions

2020-07-28 · Ryan Sweke, Jean-Pierre Seifert, Dominik Hangleiter, Jens Eisert

Here we study the comparative power of classical and quantum learners for generative modelling within the Probably Approximately Correct (PAC) framework. More specifically we consider the following task: Given samples fr…