arxiv: 2604.26226 · v1 · submitted 2026-04-29 · ✦ hep-ph · hep-lat· quant-ph

Recognition: unknown

Exponentially improved quantum simulation of scalar QFT

Qing-Hong Cao , Ying-Ying Li , Xiaohui Liu , Liang-Qi Zhang , Ke Zhao

Authors on Pith no claims yet

Pith reviewed 2026-05-07 13:13 UTC · model grok-4.3

classification ✦ hep-ph hep-latquant-ph

keywords quantum simulationscalar QFTcircuit depthPauli decompositionoccupation basisTrotter errorenergy-energy correlator2+1 dimensional field theory

0 comments

The pith

Diagonalizing field operators before Pauli decomposition exponentially reduces circuit depth for scalar QFT simulations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that scalar quantum field theories can be simulated on quantum computers with exponentially shallower circuits by first diagonalizing the field operators. This allows their later decomposition into Pauli strings to avoid the deep circuits typical of direct occupation-basis methods. The authors demonstrate the technique in a 2+1 dimensional scalar theory, reporting lower circuit depth and fewer CNOT gates for time evolution. Benchmarking with the Lorentzian energy-energy correlator reveals faster convergence under local truncation than the amplitude-basis approach in some regimes. If the reduction holds, it would make quantum simulations of field theory observables practical on near-term hardware.

Core claim

Diagonalizing field operators prior to their decomposition into Pauli strings achieves exponential reductions in circuit depth and significantly mitigates Trotter errors. For scalar QFT in 2+1 dimensions this produces substantially lower circuit depth and CNOT counts for time evolution. The Lorentzian energy-energy correlator serves as benchmark, and occupation-basis digitization converges more rapidly with local truncation than the amplitude-basis approach in the tested parameter regimes.

What carries the argument

Diagonalization of field operators before decomposing them into Pauli strings, which simplifies the quantum circuit representation of the time-evolution operator.

If this is right

Time-evolution circuits require exponentially fewer gates.
Trotter errors decrease for fixed computational resources.
Occupation-basis simulations converge faster than amplitude-basis ones for the energy-energy correlator.
Light-ray observables become accessible on near-term quantum devices.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same diagonalization step could reduce depth in gauge theories or higher dimensions if operator spectra remain manageable.
Longer-time simulations might become feasible before accumulated errors dominate.
Digitization choice may be tuned per observable rather than fixed across all quantities.
The technique offers a template for other many-body Hamiltonians expressed in occupation bases.

Load-bearing premise

Diagonalizing the field operators prior to Pauli decomposition produces a net exponential reduction in circuit depth and CNOT count without introducing offsetting errors or overhead that would negate the advantage for the targeted observables and truncation schemes.

What would settle it

A side-by-side execution of the diagonalized method and the standard occupation-basis method on the same 2+1D scalar QFT model, truncation level, and evolution time step, followed by direct measurement of gate counts and accuracy on the Lorentzian energy-energy correlator.

Figures

Figures reproduced from arXiv: 2604.26226 by Ke Zhao, Liang-Qi Zhang, Qing-Hong Cao, Xiaohui Liu, Ying-Ying Li.

**Figure 1.** Figure 1: FIG. 1 view at source ↗

**Figure 2.** Figure 2: FIG. 2. Same plot as Fig. ( view at source ↗

**Figure 3.** Figure 3: FIG. 3. Same plot as Fig. ( view at source ↗

**Figure 4.** Figure 4: FIG. 4. Realization of operator view at source ↗

**Figure 5.** Figure 5: FIG. 5 view at source ↗

read the original abstract

Quantum simulations of scalar quantum field theories (QFT) provide important benchmarks for demonstrating quantum advantage. We revisit digitization in the occupation basis, which is typically hindered by unfavorable circuit depth scaling. We present an approach that achieves exponential reductions in circuit depth and significantly mitigates Trotter errors by diagonalizing field operators prior to their decomposition into Pauli strings. Focusing on a scalar QFT in 2+1 dimensions, we show that this method substantially reduces circuit depth and CNOT gate counts for time evolution. Using the Lorentzian energy-energy correlator as a benchmark observable, we find parameter regimes in which occupation-basis digitization converges more rapidly with respect to local truncation than the amplitude-basis approach of Jordan, Lee, and Preskill. These results provide both algorithmic advances and phenomenological benchmarks for studies of light-ray observables on near-term quantum devices.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper's diagonalization trick claims exponential circuit depth savings for scalar QFT, but repeated unitary overhead may cancel it out.

read the letter

The punchline is that this paper proposes diagonalizing the field operators locally before breaking them down into Pauli strings, which they say produces exponential improvements in circuit depth and helps control Trotter errors for simulating scalar quantum field theory. They focus on 2+1 dimensions and use the Lorentzian energy-energy correlator to show that their occupation-basis method can converge better with local truncation than the amplitude-basis method from Jordan, Lee, and Preskill. This is genuinely new in the way it combines the diagonalization with the decomposition step. The paper does a good job of making the comparison to existing work direct and showing a practical benchmark for light-ray observables. That kind of concrete example is helpful for people thinking about what can be done on current quantum hardware. The soft spot is exactly the one in the stress-test note. Because the Hamiltonian has kinetic and potential terms, each Trotter step requires applying the diagonalizing unitary and its inverse many times. The cost of synthesizing those unitaries could scale with the local dimension, and without a full breakdown of the total gate count that includes this overhead, it is not clear whether the exponential reduction holds up in practice. The abstract mentions reduced CNOT counts but does not detail how the overhead is handled. The math appears sound and there is no circular reasoning in the claims. The citations are appropriate. This paper is for people in quantum simulation of field theories who are already familiar with digitization techniques and Trotterization. A reader working on near-term algorithms would get value from the specific improvement and the benchmark. It deserves a serious referee because the algorithmic idea is fresh and the evidence is presented in a way that can be checked, even if revisions will likely be needed to address the overhead.

Referee Report

2 major / 0 minor

Summary. The paper proposes digitizing scalar QFT simulations in the occupation basis by first diagonalizing local field operators before decomposing them into Pauli strings. This is claimed to deliver exponential reductions in circuit depth and CNOT counts for Trotterized time evolution in 2+1 dimensions while mitigating Trotter errors. The Lorentzian energy-energy correlator is used as a benchmark observable, with the claim that occupation-basis truncation converges faster than the amplitude-basis approach of Jordan, Lee, and Preskill in some regimes.

Significance. If the net exponential depth reduction holds after all costs are included, the work would constitute a meaningful algorithmic improvement for quantum simulation of QFTs on near-term hardware and supply concrete benchmarks for light-ray observables.

major comments (2)

[Abstract] Abstract: the claim of exponential reductions in circuit depth and CNOT count is load-bearing for the central result, yet the abstract provides no accounting of the gate cost of synthesizing and applying the diagonalizing unitaries U and U† at every Trotter slice across the many kinetic and potential terms; if this cost scales as O(2^k) or worse with local truncation k, the net scaling may not remain exponential.
The manuscript does not supply explicit error bounds on the combined Trotter-plus-diagonalization error or numerical tables of circuit depth versus truncation level that would allow verification that the claimed improvement survives implementation details.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback on our manuscript. We address each major comment below and have revised the manuscript to strengthen the presentation of gate costs, error analysis, and supporting data.

read point-by-point responses

Referee: [Abstract] Abstract: the claim of exponential reductions in circuit depth and CNOT count is load-bearing for the central result, yet the abstract provides no accounting of the gate cost of synthesizing and applying the diagonalizing unitaries U and U† at every Trotter slice across the many kinetic and potential terms; if this cost scales as O(2^k) or worse with local truncation k, the net scaling may not remain exponential.

Authors: We agree that the abstract would benefit from explicit context on this point. The diagonalizing unitaries U are strictly local (one per lattice site) and are synthesized once for a chosen truncation level k. Standard unitary synthesis for a k-dimensional operator requires O(k^2) gates, which is polynomial in k and independent of system size or the number of Trotter steps. Because k is fixed by the desired accuracy (typically small, e.g., 4–8), this overhead is a constant factor per site. The exponential depth reduction originates from the subsequent Pauli decomposition of the now-diagonal operator, which contains far fewer non-trivial terms than the original field operator. We have added a clarifying sentence to the abstract and a dedicated paragraph in Section III that tabulates the full gate count (including all U and U† applications) and confirms the net scaling remains exponentially improved. revision: yes
Referee: The manuscript does not supply explicit error bounds on the combined Trotter-plus-diagonalization error or numerical tables of circuit depth versus truncation level that would allow verification that the claimed improvement survives implementation details.

Authors: We acknowledge that explicit combined error bounds and tabulated circuit-depth data would improve verifiability. The diagonalization step is exact for the chosen local basis, so it introduces no additional approximation error beyond the truncation itself; the total error is therefore bounded by the standard Trotter error plus the local truncation error. In the revised manuscript we have added a short subsection deriving the combined bound and included a new table that reports circuit depth and CNOT counts versus truncation level k for both our occupation-basis method and the Jordan–Lee–Preskill amplitude-basis baseline, explicitly demonstrating that the exponential improvement persists after all overheads are included. revision: yes

Circularity Check

0 steps flagged

No circularity: algorithmic construction is independent of benchmarks

full rationale

The paper's core contribution is a constructive procedure—diagonalizing local field operators before Pauli-string decomposition—to reduce Trotter depth and CNOT count. This step is defined by explicit unitary transformations on the digitization basis and does not presuppose the numerical values of the Lorentzian correlator or any fitted truncation parameter. The comparison to Jordan-Lee-Preskill is to an external prior result, not to a quantity defined inside the present work. No self-citation chain, ansatz smuggling, or renaming of known results is required for the claimed exponential depth reduction. The derivation chain therefore remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Review performed from abstract only; no explicit free parameters, axioms, or invented entities are stated in the provided text. The work relies on standard quantum-simulation primitives and the existing occupation-basis framework.

pith-pipeline@v0.9.0 · 5449 in / 1174 out tokens · 57904 ms · 2026-05-07T13:13:12.069715+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

41 extracted references · 27 canonical work pages

[1]

Ground state preparation For a gapped system defined on a finite lattice, the interacting ground state |Ω⟩ can be prepared via adia- batic evolution by gradually turning on the interaction term. If the spectral gap between the ground state and first excited state remains finite along this interpolation path, the adiabatic theorem guarantees preparation of...
[2]

Quantum circuits for measuring Lorentzian observables After preparing the interacting ground state|Ω⟩, we compute physical observables by evaluating expectation values in this state. For example, one may extract time- dependent quantities such asM(t), or correlation func- tions of the form ⟨Ω|ϕ†(0)T 0i(t1,n 1r1)T 0j(t2,n 2r2)ϕ(0)|Ω⟩, which enter, for inst...
[3]

It is proved thatNMCM = ⌈log2 K⌉ ancillae is optimal, where K is the number of the operators in the multiplication

can be used to reduce the number of ancilla qubits in LCU. It is proved thatNMCM = ⌈log2 K⌉ ancillae is optimal, where K is the number of the operators in the multiplication. The core component of the MCM circuit is the unitary block Ui for the i-th operator in the multiplication, with Ui consists of two subcircuits:
[4]

The first subcircuit acts onNMCM ancilla qubits, mapping the initial state|0NMCM ⟩ to the computa- tional basis state|i⟩(withi= 0,1, . . . , K)
[5]

The second subcircuit acts jointly on theNLCU + NMCM ancilla qubits, and implements a controlled operation: whenever the NLCU ancillas are in the state |0NLCU ⟩, the state of the NMCM qubits is mapped back from|i⟩to|0 NMCM ⟩. This construction ensures that, when allNLCU +NMCM ancilla registers are in the zero state, the effective ac- tion on the data regi...
[6]

As a representative example, we evaluate the expectation value ⟨Ω|ϕ†(0)T 0,{0,1}→{1,1}(t)ϕ(0)|Ω⟩

Numerical results We construct the quantum circuit following the algo- rithm described above and perform numerical simulations. As a representative example, we evaluate the expectation value ⟨Ω|ϕ†(0)T 0,{0,1}→{1,1}(t)ϕ(0)|Ω⟩. The initial state is prepared via adiabatic evolution with total evolution timeT = 3and time step δt = 0.05, which results in a tot...
[7]

M. C. Bañuls, R. Blatt, J. Catani, A. Celi, J. I. Cirac, M. Dalmonte, L. Fallani, K. Jansen, M. Lewenstein, S. Montangero, C. A. Muschik, B. Reznik, E. Rico, L. Tagliacozzo, K. Van Acoleyen, F. Verstraete, U.-J. Wiese, M. Wingate, J. Zakrzewski, and P. Zoller, Simu- lating lattice gauge theories within quantum technologies, Eur. Phys. J. D74, 165 (2020), ...

work page arXiv 2020
[8]

C. W. Baueret al., Quantum Simulation for High- Energy Physics, PRX Quantum4, 027001 (2023), arXiv:2204.03381 [quant-ph]

work page arXiv 2023
[9]

Funcke, T

L. Funcke, T. Hartung, K. Jansen, and S. Kühn, Review on quantum computing for lattice field theory (2023), arXiv:2302.00467 [hep-lat]

work page arXiv 2023
[10]

Di Meglioet al., PRX Quantum5, 037001 (2024), arXiv:2307.03236 [quant-ph]

A. Di Meglioet al., Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group (2023), arXiv:2307.03236 [quant-ph]

work page arXiv 2023
[11]

Y. Fang, C. Gao, Y.-Y. Li, J. Shu, Y. Wu, H. Xing, B. Xu, L. Xu, and C. Zhou, Quantum frontiers in high energy physics, Sci. China Phys. Mech. Astron.68, 260301 (2025), arXiv:2411.11294 [hep-ph]

work page arXiv 2025
[12]

S. P. Jordan, K. S. M. Lee, and J. Preskill, Quantum Com- putation of Scattering in Scalar Quantum Field Theories, Quant. Inf. Comput.14, 1014 (2014), arXiv:1112.4833 [hep-th]

work page Pith review arXiv 2014
[13]

S. P. Jordan, K. S. M. Lee, and J. Preskill, Quantum Algorithms for Quantum Field Theories, Science336, 1130 (2012), arXiv:1111.3633 [quant-ph]

work page Pith review arXiv 2012
[14]

M. A. Nielsen and I. L. Chuang,Quantum Computation and Quantum Information(Cambridge University Press, Cambridge, UK, 2000)

2000
[15]

R. D. Somma, Quantum simulations of one dimensional quantum systems, (2015), arXiv:1503.06319 [quant-ph]

work page arXiv 2015
[16]

Macridin, P

A. Macridin, P. Spentzouris, J. Amundson, and R. Harnik, Electron-Phonon Systems on a Universal Quantum Computer, Phys. Rev. Lett.121, 110504 (2018), arXiv:1802.07347 [quant-ph]

work page arXiv 2018
[17]

Digital quantum computation of fermion-boson interacting systems

A. Macridin, P. Spentzouris, J. Amundson, and R. Harnik, Digital quantum computation of fermion-boson in- teracting systems, Phys. Rev. A98, 042312 (2018), arXiv:1805.09928 [quant-ph]

work page Pith review arXiv 2018
[18]

Digitization of Scalar Fields for Quantum Computing

N. Klco and M. J. Savage, Digitization of scalar fields for quantum computing, Phys. Rev. A99, 052335 (2019), arXiv:1808.10378 [quant-ph]

work page Pith review arXiv 2019
[19]

Yeter-Aydeniz, E

K. Yeter-Aydeniz, E. F. Dumitrescu, A. J. McCaskey, R. S. Bennink, R. C. Pooser, and G. Siopsis, Scalar quantum field theories as a benchmark for near-term quantum com- puters, Phys. Rev. A99, 032306 (2019), arXiv:1811.12332 [quant-ph]

work page arXiv 2019
[20]

C. L. Basham, L. S. Brown, S. D. Ellis, and S. T. Love, En- ergy correlations in electron-positron annihilation: Test- ing quantum chromodynamics, Phys. Rev. Lett.41, 1585 (1978)

1978
[21]

C. L. Basham, L. S. Brown, S. D. Ellis, and S. T. Love, Electron-positron annihilation energy pattern in quan- tum chromodynamics: Asymptotically free perturbation theory, Phys. Rev. D17, 2298 (1978)

1978
[22]

C. L. Basham, L. S. Brown, S. D. Ellis, and S. T. Love, Energy correlations in electron-positron annihilation in quantum chromodynamics: EEC, Phys. Rev. D19, 2018 (1979)

2018
[23]

D. M. Hofman and J. Maldacena, Conformal col- lider physics: Energy and charge correlations (2008), arXiv:0803.1467 [hep-th]

work page Pith review arXiv 2008
[24]

Kravchuk and D

P. Kravchuk and D. Simmons-Duffin, Light-ray operators in conformal field theory (2018), arXiv:1805.00098 [hep- th]

work page arXiv 2018
[25]

Koloğlu, P

M. Koloğlu, P. Kravchuk, D. Simmons-Duffin, and A. Zhi- boedov, The light-ray ope and conformal colliders, JHEP 01, 128, arXiv:2005.08993 [hep-th]

work page arXiv 2005
[26]

Neill, G

D. Neill, G. Vita, I. Vitev, and H. X. Zhu, Energy-energy correlators for precision qcd (2022), arXiv:2203.07113 [hep-ph]

work page arXiv 2022
[27]

Moult and H

I. Moultet al., Energy correlators: A journey from theory to experiment (2025), arXiv:2506.09119 [hep-ph]

work page arXiv 2025
[28]

K. Lee, F. Turro, and X. Yao, Quantum computing for energy correlators, Phys. Rev. D111, 054514 (2025), arXiv:2409.13830 [hep-ph]

work page arXiv 2025
[29]

Barata, N

J. Barata, N. Mueller, A. Tarasov, and R. Venugopalan, Single-particle digitization strategy for quantum computa- tion of aϕ4 scalar field theory, Phys. Rev. A103, 042410 (2021), arXiv:2012.00020 [hep-th]

work page arXiv 2021
[30]

Hardyet al., Scattering Processes from Quantum Simulation Algorithms for Scalar Field Theories, PRX Quantum7, 010343 (2026), arXiv:2407.13819 [quant-ph]

A. Hardyet al., Optimized Quantum Simulation Al- gorithms for Scalar Quantum Field Theories, (2024), arXiv:2407.13819 [quant-ph]

work page arXiv 2024
[31]

Ingoldby, M

J. Ingoldby, M. Spannowsky, T. Sypchenko, S. Williams, and M. Wingate, Real-Time Scattering on Quan- tum Computers via Hamiltonian Truncation, (2025), arXiv:2505.03878 [quant-ph]. 11

work page arXiv 2025
[32]

A.M.ChildsandN.Wiebe,HamiltonianSimulationUsing Linear Combinations of Unitary Operations, Quant. Inf. Comput.12, 0901 (2012), arXiv:1202.5822 [quant-ph]

work page arXiv 2012
[33]

N.Grzesiaket al.,Efficientarbitrarysimultaneouslyentan- gling gates on a trapped-ion quantum computer, Nature Commun.11, 2963 (2020), arXiv:1905.09294 [quant-ph]

work page arXiv 2020
[34]

Browaeys and T

A. Browaeys and T. Lahaye, Many-body physics with individually controlled Rydberg atoms, Nature Phys.16, 132 (2020)

2020
[35]

Ebadi, T

S. Ebadi, T. T. Wang, H. Levine, A. Keesling, G. Semegh- ini, A. Omran, D. Bluvstein, R. Samajdar, H. Pichler, W. W. Ho, S. Choi, S. Sachdev, M. Greiner, V. Vuletić, and M. D. Lukin, Quantum phases of matter on a 256- atom programmable quantum simulator, Nature595, 227 (2021)

2021
[36]

Bluvstein, H

D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, V. Vuletić, and M. D. Lukin, A quantum processor based on coherent transport of en- tangled atom arrays, Nature604, 451 (2022)

2022
[37]

Suzuki, Generalized Trotter’s Formula and System- atic Approximants of Exponential Operators and Inner Derivations with Applications to Many Body Problems, Commun

M. Suzuki, Generalized Trotter’s Formula and System- atic Approximants of Exponential Operators and Inner Derivations with Applications to Many Body Problems, Commun. Math. Phys.51, 183 (1976)

1976
[38]

S. Jain, V. Iyer, R. D. Somma, N. Bao, and S. P. Jor- dan, Efficient Quantum Hermite Transform, (2025), arXiv:2510.04929 [quant-ph]

work page arXiv 2025
[39]

Cao, Z.-Y

Q.-H. Cao, Z.-Y. Hou, Y.-Y. Li, X. Liu, Z.-Y. Song, L.-Q. Zhang, S. Zhang, and K. Zhao, Scalable Quantum State Preparation via Large-Language-Model-Driven Discovery, (2025), arXiv:2505.06347 [quant-ph]

work page arXiv 2025
[40]

Lecture notes on quantum algorithms for scientific computation.arXiv preprint arXiv:2201.08309, 2022

L. Lin, Lecture Notes on Quantum Algorithms for Scien- tific Computation, (2022), arXiv:2201.08309 [quant-ph]

work page arXiv 2022
[41]

Vasconcelos and A

F. Vasconcelos and A. Gilyén, Methods for Reduc- ing Ancilla-Overhead in Block Encodings, (2025), arXiv:2507.07900 [quant-ph]

work page arXiv 2025