Same Spectrum, Harder First-Order Training: Phase-Locking in Single- versus Multi-Qubit Re-Uploading Circuits

Michael Poppel, David Bucher, Maximilian Zorn, Markus Baumann, Sebastian Wölckert, Claudia Linnhoff-Popien, Philipp Altmann, Jonas SteinarXiv 2026 · arXiv

TL;DR

While single-qubit quantum circuits can theoretically represent the same functions as multi-qubit ones, they are significantly harder to train using standard first-order optimizers. This "training tax" is caused by a structural constraint called phase-locking, where all parameters are forced to move the quantum state in only one direction at any given input, leaving no "spare" directions to navigate the optimization landscape.

What Problem Does This Paper Address?

In Variational Quantum Circuits (VQCs), "data re-uploading" is a popular technique for function approximation. For one-dimensional inputs, there is a known theoretical equivalence: you can swap "width" (more qubits) for "depth" (more layers on a single qubit) without losing expressive power.

However, researchers have observed that these deep, single-qubit "serial" circuits often perform poorly in practice. This paper investigates the root cause of this gap, proving that the geometry of a single qubit's state space creates a fundamental bottleneck for optimization that multi-qubit circuits easily avoid.

Methods

The authors compared three circuit architectures with the same "encoding budget" $E$ (the total number of data-dependent rotations):

  1. Serial: A single qubit with $E$ layers.
  2. Ancilla Control: Two qubits, where data is encoded on one and the result is read from the other.
  3. Parallel: Two qubits with data encoded on both across $E/2$ layers.
The architectures compared (a) and the concept of phase-locking (b).

They mathematically proved a property called phase-locking: for a single qubit, the derivative of the state at any input $x$ is restricted to a single complex direction on the Bloch sphere. They also counted "tangent directions"—the independent ways parameters can move the state across all inputs. To ensure absolute correctness, the authors formalized their proofs in the Lean 4 theorem prover.

Datasets

The study evaluated performance on both synthetic and real-world data:

  • Synthetic Fourier Series: Random trigonometric polynomials with "flat" and "1/k" power spectra.
  • Poisson-kernel targets: Smooth functions used to test optimization on targets that the model cannot represent exactly.
  • Real-world Time Series: Three datasets representing different complexities:
  • nottem: Monthly air temperatures at Nottingham (1920–1939).
  • gasprice: Weekly US gasoline prices.
  • ibmclose: Daily IBM closing prices.

Key Insights and Ideas

  • The "No Spare Directions" Problem: A serial circuit has exactly $2E+2$ independent tangent directions. Since it needs $2E+1$ directions just to define its Fourier coefficients, it has virtually no "room" left to navigate around local minima. Multi-qubit circuits have several times more directions ($6E+6$ for the two-qubit control), providing many "spare" directions to bypass optimization hurdles.
  • Phase-Locking as a Bottleneck: Because all parameters share a single complex factor at each input, gradient updates are highly constrained. It’s like trying to paint a complex picture but being forced to move your brush in only one specific direction for every point on the canvas.
  • Conditioning Recovery: Serial circuits start with much worse mathematical "conditioning" than multi-qubit ones. Crucially, while multi-qubit circuits "recover" and become better conditioned during training, serial circuits often remain stuck in an ill-conditioned state.

Key Results

The training gap is stark, especially as the encoding budget $E$ increases.

Figure 2. Share of converged runs (final loss ≤10−6) against the encoding budget E, for flat targets and the three optimisers. Bars: 95% Wilson intervals; 100 runs per point.
  • Convergence Failure: On flat targets with $E=32$, Gradient Descent reached the optimum in only 3 out of 100 runs for the serial circuit, compared to 99 out of 100 for the multi-qubit control.
  • Adam Shortfall: Even with the popular Adam optimizer, the serial circuit reached the optimum in only 53% of runs at $E=32$, while the control hit 100%.
  • Real-World Performance: On the gasprice dataset at $E=32$, the serial circuit never reached the training optimum within the budget, resulting in a test error roughly 1.5 times higher than the multi-qubit control.
  • Second-Order Help: The Levenberg–Marquardt algorithm (a second-order method) narrowed the gap significantly, but the serial circuit still failed to converge in about 10–20% of cases at high $E$, whereas multi-qubit circuits converged every time.

Limitations and Future Work

  • 1D Restriction: The theoretical equivalence between serial and parallel circuits only holds for one-dimensional inputs. For multi-dimensional data, multi-qubit circuits are inherently more expressive.
  • Hardware Noise: The study used noise-free simulations. In real quantum hardware, the two-qubit gates required for the multi-qubit circuits would introduce more noise, potentially offsetting their optimization advantages.
  • Optimization vs. Expressivity: The paper shows that training is harder, but if the optimum is found (e.g., via expensive second-order methods), the single-qubit circuit predicts just as well as the multi-qubit one.
  • Future Directions: Future research could explore whether hardware-native parameterizations or different encoding schemes can mitigate the phase-locking bottleneck.

Summary updated

Abstract

Angle-encoded variational quantum circuits implement truncated Fourier series. For one-dimensional inputs, a single-qubit re-uploading (serial) circuit represents every function that a multi-qubit circuit with the same encoding budget $E$ can; we find that this exchange of width for depth is not free in first-order training. Because its state lives on the Bloch sphere, all parameters of the serial circuit move the state, at each input, along one complex direction, which we call \emph{phase-locking}. We prove that this costs no Fourier direction but leaves no direction to spare: however many parameters it has, the serial circuit has at most $2E+2$ tangent directions, one more than its $2E+1$ Fourier coefficients need, while a two-qubit control with the same encoding budget and model class generically has at least $6E+6$. The cost in training is measured against this control, as the number of runs out of 100 that reach the optimum within a fixed step budget. On an exact loss with flat-spectrum targets the gap grows with $E$; at $E=32$ the serial circuit converges in 3, 53 and 83 runs under gradient descent, Adam and Levenberg--Marquardt, the control in 99, 100 and 100. On three real-world series, at matched parameter counts, the serial circuit reaches the least-squares optimum in at most 9 runs under Adam and in 32 to 93 under Levenberg--Marquardt, the control in at least 98 and in all 100; its held-out error is up to about $1.5$ times that of the control under Adam, but no larger in the typical run under Levenberg--Marquardt.
BibTeX
@misc{poppel2026same,
  author = {Michael Poppel and David Bucher and Maximilian Zorn and Markus Baumann and Sebastian Wölckert and Claudia Linnhoff-Popien and Philipp Altmann and Jonas Stein},
  title = {{Same Spectrum, Harder First-Order Training: Phase-Locking in Single- versus Multi-Qubit Re-Uploading Circuits}},
  year = {2026},
  eprint = {2610.21778},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.21778},
}
Figure