- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper introduces C-QOBRA, a conditional quantum variational autoencoder for molecular generation that injects property conditions into parameterized quantum circuits without adding extra qubits. The experiments are conducted on the QM9 dataset.
Critical strengths
The paper is generally easy to understand, and experimental settings are described relatively clearly.
Critical weaknesses
-
The methodological novelty is quite limited. Most components are adopted from existing quantum autoencoders, data re-uploading, and standard Transformer decoding, while the main new element is a relatively small modification of how conditions are injected into the circuit.
-
The main hybrid model may not be feasible on the hardware as intended. The Transformer requires the full decoder statevector, which is not directly available on real quantum hardware and would require costly state reconstruction or tomography.
-
The core experimental design may have a serious confounding problem. The register-readout and Transformer models use different qubit counts and are trained separately, while conditioning also enters through a learned classical prior, so the experiments do not cleanly isolate either the decoder effect or the quantum conditioning effect.
-
The evaluation fails to establish a convincing quantum advantage. There is no parameter-matched classical baseline, the classical parameter accounting is incomplete, and the analysis largely equates fewer trainable parameters with better quantum efficiency without measuring the actual quantum computational cost. The experiments are conducted only on the toy dataset QM9. The generation performance appears to be much lower than that reported by published classical methods.
-
The conditional generation results are too weak to support the proposed method. The fully quantum readout provides little or no control for several properties, and the paper does not demonstrate simultaneous multi-property conditioning despite presenting fixed-width multi-condition control as a key advantage.
-
There might be serious issues in the model formulation. The latent-space argument relies on problematic assumptions about qubit degrees of freedom and distributions, and directly encoding categorical token IDs as amplitudes introduces an arbitrary numerical ordering into the molecular representation.
Questions for authors
-
What is the actual novelty of this paper?
-
Is the proposed method actually correct and feasible to implement?
-
What is the motivation for using quantum computing? Does the proposed method truly effective and provide any real advantage?
Weakness 1 response: The reviewer is very keen on noticing the standard components of our construction, though the final product does present novelty compared to before. For instance, the fixed-width conditioning mechanism removes the need for extra qubits to embed chemical property conditions, as was done in QVAE-Mole.
Weakness 2 response: We thank the reviewer and separate the three settings the submission conflated. (i) Statevector simulation: the published slopes. (ii) Finite-shot simulation: the same checkpoints decoded from N simulated measurements per molecule; 1,000 shots is where reconstruction comes within 1% of exact (logP slope 0.736 ± 0.025), a criterion chosen on reconstruction because the slope is non-monotone in N. (iii) Noisy simulation at Quantinuum H1-1/H2-1/H2-2 published error rates: the Transformer arm retains 0.93–0.97 of its slope, and the register arm 0.39–0.63. State preparation is training-only, since generation samples from the prior and never runs the encoder; generation costs ~1,000 shots/molecule (4.4 QPU-min per 1,000) for the transformer head against a median of 33,618 (2.4 h) for the register readout.
Weakness 3 response: Both confounds are now measured. For the prior, freezing it showed little effect (logP 0.886 ± 0.025 vs. 0.879 ± 0.028), while the opposite is true for freezing the circuit, so the conditioning passes through the circuit. On the other hand, for the width and readout, a transformer arm at ten qubits gives a logP slope of 0.729 ± 0.026 against 0.742 ± 0.015 at eight, and a frozen register-trained circuit read by a newly trained head reaches 0.728 ± 0.011 against 0.374 ± 0.094 under the register readout. The register arm's weak control comes from the readout, not the circuit or the width.
Weakness 4 response: We thank the reviewer. The register arm’s “0 classical parameters” omitted the prior MLP (458) and the log-variance head (32): the correct count is 490 classical / 204 quantum, so the defensible claim is no trainable classical readout, not a quantum core alone. The same omission affects every arm, and the corrected table gives per-block counts. We withdraw the claims of superior generation and efficiency over QVAE-Mole, whose margins fall inside our seed spread and whose representation differs. What survives is circuit-level: 82 compiled CX against 366, and 14.9× less two-qubit depth, with both methods reading the same amplitude-magnitude vector, so readout is at parity. Published classical rows are not parameter-matched, and our absolute generation quality is lower.
Weakness 5 response: Thanks to the reviewer for noticing one request we did not address in our original response. A single model conditioned on logP and Fsp3 simultaneously (one 8-qubit circuit, no added width) retains most of its single-property control: sweeping logP at pinned Fsp3 gives slopes of 0.76-0.86 (vs. 0.879 single-property), and sweeping Fsp3 at pinned logP gives 0.85-0.91 (vs. 0.963). These two conditions are not fully independent: while pinned Fsp3 is essentially undisturbed by the logP target (cross-slope <= 0.01), pinned logP does drift with the Fsp3 target (cross-slope up to 0.32). Joint hit rates are 12-26% across 5 seeds. We will add this experiment and state the asymmetry as a limitation rather than claiming clean joint control.
Weakness 6 response: We thank the reviewer; both points are correct and neither changes a reported number. The purity penalty encourages purity in transformer arms (0.963–0.980) and the register (0.985–0.993), so we will state the one-coordinate-per-qubit description as approximate, not exact. For real quantum states, the density is arcsine, so we withdraw that derivation while keeping the prior itself. θ = arccos(tanh z) confines each latent qubit to a half great circle on which ⟨Z⟩ ↦ θ is a bijection. Relabelling token IDs 1–24 before amplitude encoding gives a logP slope of 0.726 ± 0.007 against 0.742 ± 0.015 over 5 training seeds—a mean shift of 0.016, with permutation spread 0.45× the seed spread; reconstruction and NUVR are unchanged.
Question 1 response: (1) Conditional embedding does not require auxiliary qubits to enlarge the circuit. A parameter-free readout keeps a condition's direction but not its scale, and reading the same circuit with a head restores the scale, so the information is in the circuit; (2) about 1,000 classical parameters recover most of the attainable control, as they do for an equally small classical bottleneck.
Question 2 response: Neither changes a reported number. On feasibility, we now measure what the paper lacked: 1,000 shots per molecule for the head and 93–97% of the slope retained under trapped-ion noise. All results will be reproducible from the released code.
Question 3 response: The compact circuit effectively allows condition information to pass through the circuit; it is as effective as an equally small classical bottleneck but not more, and its readout costs ~1,000 shots per molecule.