- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper, “Overcoming the Representational Limitations of Amplitude Encoding for Quantum Neural Networks,” investigates a fundamental limitation of conventional amplitude encoding in variational quantum circuits (VQCs). Although amplitude encoding represents high-dimensional classical data using only qubits, its normalization procedure eliminates information about input magnitude, making inputs that differ only by a nonzero scaling factor physically indistinguishable. This restricts the representational capacity of downstream quantum neural networks, regardless of their circuit architecture. The paper's main contributions are twofold. First, it provides a theoretical analysis of normalization-induced scale invariance and establishes conditions under which deterministic preprocessing can eliminate this ambiguity. Second, it proposes a fixed, non-trainable nonlinear feature map, , which preserves distinctions between real-valued inputs after amplitude encoding. The proposed approach retains logarithmic qubit scaling without introducing additional trainable parameters.
Critical strengths
-
Rigorous Theoretical Characterization of the Representational Limitations of Amplitude Encoding.:The paper provides a mathematically grounded analysis of the scale invariance induced by amplitude normalization, establishing that inputs differing by nonzero real scaling factors become physically indistinguishable regardless of the subsequent quantum circuit architecture. More importantly, the authors formulate a general condition under which deterministic preprocessing can eliminate this ambiguity and demonstrate why nonlinearity alone is insufficient. This analysis is particularly valuable because it identifies an intrinsic limitation of the encoding mechanism rather than an architecture-dependent weakness, providing a theoretical foundation for understanding and improving the expressive capacity of quantum neural networks.
-
Theoretically Motivated Feature Mapping with Preserved Qubit Efficiency: The proposed feature map combines linear, quadratic, and trigonometric components to distinguish arbitrary real-valued inputs after amplitude encoding. Its principal theoretical advantage lies in addressing the loss of radial information without introducing additional trainable parameters or sacrificing the logarithmic scaling of qubit requirements. This establishes a meaningful connection between representational fidelity and quantum resource efficiency. The construction is consequential because it offers a mathematically motivated approach to improving quantum data representations while preserving one of the fundamental advantages of amplitude encoding for high-dimensional inputs.
Critical weaknesses
-
Limited Theoretical Novelty and Insufficient Analysis of Quantum Resource Complexity: Although the proposed feature map addresses the scale invariance of amplitude encoding, its underlying construction relies on a relatively straightforward concatenation of linear, quadratic, and trigonometric transformations. The paper establishes its injectivity under amplitude normalization but provides limited analysis of whether this construction offers substantive theoretical advantages over simpler alternatives, such as appending a constant component to the original feature vector. Furthermore, the claimed computational efficiency is primarily justified through logarithmic qubit scaling, without adequately examining the gate complexity and circuit depth required for quantum state preparation. These omissions are consequential because they leave both the theoretical novelty and the practical resource advantages of the proposed encoding insufficiently established.
-
Insufficient Experimental Evidence to Support the Claimed Representational Improvements: The experimental evaluation does not adequately isolate the benefits of recovering scale information from those arising from increased feature dimensionality and nonlinear feature expansion. In particular, the absence of ablation studies comparing individual feature-map components and simpler injective encodings makes it difficult to determine which properties of the proposed construction are responsible for the observed improvements. Additionally, the experiments rely exclusively on noiseless state-vector simulations, leaving the method's robustness under realistic quantum noise and finite-shot measurements unexplored. These limitations are particularly important because the paper's central contribution concerns encoding effectiveness and resource efficiency, yet the current validation does not sufficiently establish whether the proposed construction offers advantages beyond those achievable through simpler preprocessing strategies.
Questions for authors
Q1: The proposed feature map is designed to eliminate the scaling ambiguity introduced by amplitude normalization. However, a simpler construction, such as augmenting the input with a constant component, (\Phi(x)=(x,1)), appears to provide the same injectivity property while requiring a smaller feature space. Could the authors clarify whether their construction offers any additional theoretical guarantees or representational advantages over such simpler alternatives? A rigorous comparison would help establish whether the proposed combination of polynomial and trigonometric features is theoretically necessary and constitutes a sufficiently substantive methodological contribution.
Q2: The paper emphasizes that the proposed encoding preserves logarithmic qubit scaling despite increasing the feature dimensionality. However, qubit efficiency does not necessarily imply efficient quantum state preparation. Could the authors specify the gate complexity and circuit depth required to prepare the proposed amplitude-encoded states and compare these costs with conventional amplitude encoding? This clarification is important for assessing whether the claimed resource efficiency extends beyond qubit count and remains meaningful as input dimensionality increases.
Q3: The proposed method simultaneously restores scale information and introduces additional nonlinear features. Consequently, the reported improvements may arise from either mechanism or their combination. Could the authors provide controlled comparisons using simpler injective mappings, such as ((x,1)), and reduced feature maps, such as ((x,x^{\circ 2})) or ((x,\cos(x)))? Such comparisons would help determine whether the observed improvements are primarily attributable to resolving scale ambiguity or to the additional nonlinear feature expansion.
Response to Reviewer bdo2
We thank the reviewer for the time devoted to evaluating our work and for the thoughtful, detailed feedback. Your comments have helped us clarify the contribution and strengthen the experimental and resource analyses. We have conducted a major revision of the manuscript, changes are highlighted in red.
We also note the ethics-review flag. As no specific ethical concern could be identified after careful studying of the Code of Ethics, we have added an ethics statement as a precaution. If the flag concerned disclosure of AI use, we have also added the AI-use statement, which we inadvertently omitted from the initial submission. We apologize for this oversight and would appreciate clarification if any further concern remains.
We agree that (x, 1) already removes the normalization ambiguity with a smaller feature space. We do not claim a stronger injectivity guarantee for the full map. We have added the (x, 1) map and a strictly radial dataset to the experiment. (x, x^{circ2}, cos(x)) performs best on the Radial benchmark, suggesting it removes the scale ambiguity most effectively, whereas (x, 1) performs best on the real-world datasets. We have revised the Results and Conclusion accordingly, recommending (x, 1) as a lightweight practical default, especially in light of the gate complexity.
We have added gate-count and circuit-depth estimates to the Appendix, referenced in Section 5 (lines 500–504):
The revised discussion makes the preparation overhead explicit and supports the practical recommendation of the simpler constant-anchor map.
We have expanded the ablation study to include (x, 1), (x, x^{circ2}), (x, cos(x)), and (x, x^{circ2}, 1), alongside the initially proposed map. We have also added a Radial benchmark whose labels depend exclusively on scale. Because constant appending introduces no input-dependent nonlinear coordinates before normalization, the improvement (x, 1) demonstrates on the Radial dataset and the other benchmarks suggests that the gains do not arise solely from the added squared and cosine features.