- Rating
- 4
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper use Fourier analysis to direct the circuit design of PQC, especially the arrangement of single-qubit rotation and entangling gates. While data encoding determines the possible Fourier frequencies of the circuit, the paper prove that the Fourier coefficients is determined by the projection of effective quantum state and observable. Based on this theory, the author proposed a circuit architecture composed of local rotations and entangling gates, as well as a circuit construction algorithm based on qubit interaction graph. In experiments, authors verified their circuit deigns on Fourier function fitting, advection equation, Burgers equation and Physics-informed wave equation. Results showed their circuit can use less two-qubit gates to get lower prediction error. Placement ablation study shows that even the number of sage stays the same, the arrangement of gate would affect reachable Fourier frequencies.
Critical strengths
- Good combination of theory and algorithm design. The paper provided the expression of Fourier coefficients, derived gate placement condition, and proved the correlation of reachable frequencies and measured qubit degree. The paper establishes the connection between Fourier coefficients and circuit structure, and further derived gate placement rules.
- Comprehensive experiments. The experiments include Fourier function approximation, supervised PDE regression and physics-informed learning, while also comrade with existing PQC architectures. The placement ablation study validated the theoretical Fourier reachability.
- Considered the constraints of real quantum hardware and noise robustness. Though still based on classical simulation, the consideration of qubit connectivity, two-qubit gate costs and depolarizing noise, damping and finite-shot noise contributed to the completeness of the work.
Critical weaknesses
- The theoretical analysis focuses on the reachability of individual Fourier coefficients. However, this does not guarantee that multiple coefficients can be simultaneously adjusted to match a target function. Therefore, the connection between Fourier reachability and practical approximation capability remains unclear. (see question 2)
Questions for authors
- Data re-uploading can also increase Fourier bandwidth. In the meantime, it may also activate Fourier coefficients that are structurally zero in a single-upload circuit. Could the author clarify whether increasing the number of data re-uploading layers can achieve similar effect as the entanglement placement?
- In Table 3, the proposed architecture has a best possible MSE of 0.013, but the trained MSE is 0.628. Though the reduced training budget might be able to explain part of the difference, this also lead to a question: Is the performance of the circuit constrained by optimization, or is it constricted by the dependence of Fourier coefficients? Is it possible the further distinguish the two factors by better training or by analysis of learned Fourier coefficients?
2 comments
Thank you for the detailed response and additional experiments. The new results help clarify the roles of data re-uploading, gate placement, optimization, and Fourier coefficient controllability, and address my main concerns. Given the substantial improvement from the full training protocol, I encourage the authors to update Table 3 using a sufficient training budget across the compared architectures, and incorporate the additional analysis into the revised paper. I will maintain my original rating.
Response Letter for Reviewer wnee
We thank the reviewer for these insightful questions. We conducted additional experiments on re-uploading, gate placement, optimization, and coefficient controllability. Due to the response limit, we summarize our evidence below.
Q1. We agree that data re-uploading can expand the Fourier bandwidth and activate previously inaccessible coefficients. We repeated each 14-qubit circuit block twice and identified reachable Fourier pairs numerically, without training.
As the reviewer anticipated, No Align reaches all 841 pairs after two uploads, demonstrating that extra encoding layers can recover Fourier components absent from the single-upload circuit. The proposed placement also reaches all 841 pairs, while the other placements produce different accessible supports at the same depth. This clarifies their complementary roles: re-uploading increases bandwidth through encoding depth, whereas gate placement determines which frequencies become accessible at each depth.
We further tested four-layer re-uploading (Appendix C.2). Proposed (γ) achieves a held-out MSE of 0.104, compared with 0.169 for the closest encoding-matched baseline, using only 48 two-qubit gates versus 96–329 for the entangling templates. This supports our placement strategy for accurate, gate-efficient learning with re-uploading. We will incorporate the new numerical results and distinguish the existing single-upload analytical guarantees from the multi-upload experiments.
Q2. We appreciate the reviewer's question about the difference between the Fourier-support approximation bound of 0.013 and the trained MSE of 0.628 in Table 3. To investigate optimization and coefficient dependence, we conducted: longer training, coefficient-Jacobian analysis, and target-specific approximation experiments.
First, the original Table 3 experiment used both a smaller training subset and a reduced optimization budget. We compared it with the full Table 2 protocol and a doubled step budget:
The marked improvement with the full training protocol demonstrates that training data coverage and optimization budget account for a substantial part of the original gap. The doubled budget further improves accuracy.
Second, we computed the Jacobian of the Fourier-coefficient vector with respect to circuit parameters. The fixed-CZ Proposed architecture reaches all 225 Fourier frequency pairs, with a coefficient-Jacobian rank of 58; allowing trainable entangling strengths increases this rank to 84. The Jacobian rank quantifies locally independently adjustable coefficient directions, rather than the number of reachable frequencies. Thus, the additional entangling parameters enlarge the set of coefficient combinations that can be tuned jointly. The Fourier-support LS bound permits independent choices of coefficients across all reachable frequencies; the trained PQC instead uses a structured coefficient parameterization.
To connect this observation to function approximation, we tested targets with different Fourier coefficient matrix ranks:
The 73/77 successful low-rank fits demonstrate strong approximation capability for structured coefficient patterns. These results motivate trainable entangling strengths. On an additional Advection instance, the fixed-CZ circuit attains 0.365 MSE, close to the best rank-3 Fourier approximation (0.33). A rank-5 Fourier approximation reaches 0.020, and Proposed (γ) reduces the trained MSE to 0.033. This shows how additional coefficient flexibility can translate into a substantial accuracy improvement.
Finally, we assessed optimization on targets generated independently from the same circuit family. The fixed-CZ model successfully recovers 19/20 realizable 8-qubit targets, providing evidence that the optimizer can learn functions represented by its architecture. This test directly examines optimization on targets known to be realizable by the circuit family.
Taken together, these experiments provide a clearer explanation of the original error gap: a fuller training protocol substantially improves accuracy, while Fourier-coefficient structure explains why trainable entangling strengths further improve approximation on demanding targets. We will clarify these distinct mechanisms in the revision.