- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces F2, an offline reinforcement learning framework which reduces compilation cost in quantum simulation by targeting free-fermionic structure. The method applies trajectory-reversal data generation to efficiently generate successful traces without environment interaction, and designs geometric potential function and regularizer to shape the training. The experiments show an average reduction of 28.8% compared with industrial baselines on a benchmark spanning Hamiltonians of different families and qubit ranges.
Critical strengths
The overall problem formulation and framework design is natural. Techniques such as reversal data generation and potential reward shaping are established methods but well applied here.
Reducing compilation cost for Hamiltonian simulation is an important research problem in quantum computing. The framework achieves relatively strong empirical performance. It is interesting that optimizing the classcially tractable part of Free Fermionic structure can produce such improvements.
Critical weaknesses
I have concerns about the scalability for system size of F2. It is confusing to say " where N is the number of free-fermionic modes" in Section 2.1, but "the trained policy is reused across all benchmark instances and domains, without per-instance or per-family retraining" in Section 3.1, because the benchmark covers instances of different qubit sizes. The authors should have made windowing for larger systems explicit in the main text. The windowing strategy shows F2's limitation in directly handling systems with large qubit size. The experimental results further amplifies this concern, as 2D Hamiltonians are only benchmarked at qubit number = 12, while omitted at 72 or 144.
Other experiments clarification. (1) The authors specify that baselines such as IBM-base uses first-order trotter. Does F2 use first-order trotter as well? (2) The result table only includes gate count. The authors should also present the simulation error for each case as well, as error budget significantly influences the gate count. (3) The experimental setup didn't specify the coupling values, boundary conditions, evolution time, and other parameters for the benchmark Hamiltonians. (4) There's a small peak of probability mass at , suggesting the method does not reliably achieves error around as claimed. What happens when a compilation exceeds the error threshold and is rejected? How to obtain a valid compilation then? (5) The paper reports three to four orders of magnitude of compilation time overhead despite running on one A100, which limits its practicality.
Questions for authors
- Could you conduct experiments for 2D Hamiltonians with qubit number 72 and 144?
- Could you address the concerns about experiments in the second part of weaknesses?
- Some references seem to be considerably wrong. For example, Practical and Efficient Quantum Circuit Synthesis and Transpiling with Reinforcement Learning is by Kremer et al.