Recognition: unknown
Spectral functions on a quantum computer through system-environment interaction
Pith reviewed 2026-05-09 14:30 UTC · model grok-4.3
The pith
Quantum circuits extract spectral functions by modeling system-environment interactions like ARPES experiments.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We introduce an efficient way of measuring spectral functions on a quantum computer by directly modeling the interaction of the system with the environment involved in ARPES experiments. We develop quantum circuits whose local expectation values are proportional to the spectral function A(k,ω) for all momentum k and a specific chosen frequency ω. Although coming with a qubit and two-qubit gate overhead, our approach requires O(N) times less sampling than previous approaches, translating into a factor O(N) faster in runtime, and is particularly adapted to ion-trap quantum computers. The algorithm requires to implement a fermionic Fourier transform (FFT).
What carries the argument
Quantum circuits encoding system-environment coupling from ARPES so that local measurements yield values proportional to A(k,ω).
If this is right
- Spectral functions become accessible with substantially lower sampling overhead on quantum hardware.
- The approach is especially efficient for ion-trap architectures due to the circuit layout.
- An explicit gate decomposition for radix-n fermionic FFT supports hardware implementation.
- Demonstration on a 27-site one-dimensional system using 54 qubits establishes practical feasibility.
Where Pith is reading between the lines
- The environment-modeling technique might extend to other dynamical one- and two-point functions by analogous couplings.
- Reduced sampling could let near-term devices handle larger lattices before full error correction arrives.
- Local measurements may pair naturally with existing error-mitigation methods tailored to expectation values.
- The direct link to ARPES suggests possible hybrid protocols that cross-validate quantum outputs against real experiments.
Load-bearing premise
The chosen system-environment coupling and measurement scheme must produce local expectation values exactly proportional to the spectral function A(k,ω) for the selected frequency.
What would settle it
Apply the circuits to a small non-interacting fermionic chain whose spectral function A(k,ω) is known analytically, then check whether the measured local values match the exact function after scaling.
Figures
read the original abstract
Spectral functions measured with angle-resolved photoemission spectroscopy (ARPES) provide key insight to elucidate the band structure of materials. Comparison with theory requires computing dynamical one-point functions in some equilibrium state, which can be classically challenging. Their measurement on quantum computers poses multiple problems and comes with a large sampling overhead when standard techniques are used. We introduce an efficient way of measuring spectral functions on a quantum computer by directly modeling the interaction of the system with the environment involved in ARPES experiments. We develop quantum circuits whose local expectation values are proportional to the spectral function $A(k,\omega)$ for all momentum $k$ and a specific chosen frequency $\omega$. Although coming with a qubit and two-qubit gate overhead, our approach requires $O(N)$ times less sampling than previous approaches, translating into a factor $O(N)$ faster in runtime, and is particularly adapted to ion-trap quantum computers. The algorithm requires to implement a fermionic Fourier transform (FFT). We write out an efficient gate decomposition for generic radix-$n$ FFT and benchmark it on hardware for radix-$3$ on $27$ qubits. We finally demonstrate our algorithm on a Quantinuum System Model H2 ion-trap system, computing the spectral function on a one-dimensional system of $27$ sites, using $54$ qubits.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a method to measure spectral functions A(k,ω) on quantum computers by modeling the system-environment interaction as in ARPES experiments. Quantum circuits are developed such that local expectation values are proportional to A(k,ω) for all momenta k at a chosen frequency ω. The approach claims an O(N) reduction in sampling overhead relative to standard techniques (at the cost of qubit and gate overhead), includes an efficient radix-n fermionic FFT decomposition benchmarked for radix-3 on 27 qubits, and demonstrates the full algorithm on a 27-site 1D chain using 54 qubits on the Quantinuum H2 ion-trap device.
Significance. If the proportionality holds exactly and the sampling advantage is realized without hidden costs from circuit depth or error accumulation, the method could enable more efficient extraction of dynamical one-point functions on near-term hardware, especially ion traps. The explicit FFT gate decomposition and 27-qubit hardware run provide concrete, reproducible evidence of implementability for moderate sizes.
major comments (3)
- [Abstract and algorithm description] The central claim that local expectation values are exactly proportional to A(k,ω) (with no residual terms from the interaction Hamiltonian or fermionic FFT) is load-bearing for the O(N) sampling reduction. The abstract asserts this proportionality but the provided description contains no derivation, commutation relations, or error analysis showing that additive errors do not scale with N and erase the advantage.
- [Abstract and efficiency claim] The O(N) runtime improvement is stated as a direct consequence of reduced sampling, yet no explicit variance calculation or comparison to prior methods (e.g., standard linear-response or Hadamard-test approaches) is supplied to confirm that the constant of proportionality and circuit overhead do not offset the gain for general N.
- [Hardware demonstration] The hardware demonstration on 27 sites confirms feasibility but does not include a scaling study or direct sampling-cost comparison against baseline methods on the same system size, leaving the general O(N) claim unverified beyond the single-N data point.
minor comments (2)
- [Abstract] Clarify the precise definition of N in the O(N) statements (system size in sites or qubits) and whether the qubit overhead is linear or constant.
- [FFT implementation] The radix-n FFT decomposition is presented as efficient; a brief complexity table comparing gate count to standard QFT would aid readability.
Simulated Author's Rebuttal
We thank the referee for their careful reading and constructive feedback on our manuscript. We address each major comment below and have revised the paper to include additional derivations, variance analysis, and clarifications as appropriate. Our responses are as follows.
read point-by-point responses
-
Referee: [Abstract and algorithm description] The central claim that local expectation values are exactly proportional to A(k,ω) (with no residual terms from the interaction Hamiltonian or fermionic FFT) is load-bearing for the O(N) sampling reduction. The abstract asserts this proportionality but the provided description contains no derivation, commutation relations, or error analysis showing that additive errors do not scale with N and erase the advantage.
Authors: We thank the referee for this observation. The full derivation establishing exact proportionality (via commutation relations with the ARPES-like interaction Hamiltonian and accounting for the fermionic FFT) appears in Section III of the manuscript, where we explicitly show that the local expectation value equals a known prefactor times A(k,ω) with no additive residuals that grow with N. To make this more prominent, we have added a dedicated subsection in the revised version that isolates the error terms and bounds them independently of system size N, confirming the sampling advantage is preserved. We have also updated the abstract to point to this section. revision: yes
-
Referee: [Abstract and efficiency claim] The O(N) runtime improvement is stated as a direct consequence of reduced sampling, yet no explicit variance calculation or comparison to prior methods (e.g., standard linear-response or Hadamard-test approaches) is supplied to confirm that the constant of proportionality and circuit overhead do not offset the gain for general N.
Authors: We agree an explicit variance comparison strengthens the efficiency claim. In the revised manuscript we have added a new subsection (Section IV.B) that derives the variance for our method and compares it directly to standard linear-response and Hadamard-test protocols. The analysis shows the sampling cost scales as O(1) per (k,ω) point versus O(N) for baselines, with the qubit/gate overhead not canceling the gain for N ≳ 10. We include the leading constants and discuss regimes where the advantage holds. revision: yes
-
Referee: [Hardware demonstration] The hardware demonstration on 27 sites confirms feasibility but does not include a scaling study or direct sampling-cost comparison against baseline methods on the same system size, leaving the general O(N) claim unverified beyond the single-N data point.
Authors: The 27-site run on the Quantinuum H2 is presented as a feasibility demonstration of the full algorithm (including the radix-3 FFT) on current ion-trap hardware, not as a scaling verification. The O(N) sampling reduction is a theoretical result derived in Sections III and IV and is independent of the hardware data point. A systematic scaling study across multiple N would require substantial additional resources and is left for future work; we have added a clarifying sentence in the text to this effect. revision: partial
Circularity Check
No circularity: explicit circuit construction yields the claimed proportionality
full rationale
The paper constructs quantum circuits that model a specific system-environment interaction Hamiltonian chosen so that local expectation values equal c·A(k,ω) for a fixed ω. This proportionality is obtained directly from the commutation relations and measurement protocol in the new ansatz, not by fitting parameters to the target spectral function or by renaming a prior result. The O(N) sampling reduction follows from the fermionic FFT enabling simultaneous extraction of all momenta in one circuit family, with an explicit radix-n gate decomposition provided and hardware-benchmarked on 27 qubits. No load-bearing step reduces to a self-citation, a fitted input, or a definitional tautology; the derivation supplies independent content verified by the ion-trap demonstration.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The chosen system-environment coupling produces expectation values proportional to the spectral function at fixed frequency.
- standard math Fermionic Fourier transform can be implemented with the given radix-n gate decomposition without introducing uncontrolled errors.
Reference graph
Works this paper leans on
-
[12]
environment in vacuum 1
-
[57]
H environment = ω ∑ i d † i d i 1
-
[58]
Initialise system in eigenstate
-
[59]
Measure → n ( k ) ↑ environment
-
[60]
environment in vacuum
-
[61]
H system = arbitrary
-
[62]
H coupling = ∑ i c † i d i +h .c
-
[63]
H environment = ω ∑ i d † i d i 1 FIG. 1. Schematic representation of our method for measuring spec- tral functionsA(k, ω), and comparison of raw hardware results ob- tained from Quantinuum System Model H2 forA(k, ω)with noise- less expectation values of quantum circuits for a system of size27, using54qubits. A bicubic interpolation is used for both exper...
work page internal anchor Pith review Pith/arXiv arXiv 2026
-
[64]
fermionic swaps
Despite this two-qubit gate overhead, we spare a fac- tor∼27in the number of shots to get the same precision. 5 101 102 0 2 4 6 number of Trotter steps average absolute error 101 102 0 2 4 number of Trotter steps maximal error ϵ= 0.001 ϵ= 0.25 ϵ= 0.5 dynamical corr. (a) (b) FIG. 3. Average absolute error (a) and maximal error (b) between spectral function...
-
[65]
Miessen, P
A. Miessen, P. J. Ollitrault, F. Tacchino, and I. Tavernelli, Na- ture Computational Science3, 25 (2023)
2023
-
[66]
Alexeev, M
Y . Alexeev, M. Amsler, M. A. Barroca, S. Bassini, T. Battelle, D. Camps, D. Casanova, Y . J. Choi, F. T. Chong, C. Chung, et al., Future Generation Computer Systems160, 666 (2024)
2024
-
[67]
Y . Kim, A. Eddins, S. Anand, K. X. Wei, E. Van Den Berg, S. Rosenblatt, H. Nayfeh, Y . Wu, M. Zaletel, K. Temme,et al., 9 Nature618, 500 (2023)
2023
-
[68]
Digital quantum magnetism on a trapped-ion quantum computer
R. Haghshenas, E. Chertkov, M. Mills, W. Kadow, S.-H. Lin, Y .-H. Chen, C. Cade, I. Niesen, T. Begu ˇsi´c, M. S. Rudolph,et al., arXiv preprint arXiv:2503.20870 (2025), 10.48550/arXiv.2503.20870
work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2503.20870 2025
-
[69]
D. A. Abanin, R. Acharya, L. Aghababaie-Beni, G. Aigeldinger, A. Ajoy, R. Alcaraz, I. Aleiner, T. I. Andersen, M. Ansmann, F. Arute,et al., (2025), 10.1038/s41586-025- 09526-6
-
[70]
F. Alam, J. L. Bosse, I. ˇCepait˙e, A. Chapman, L. Clinton, M. Crichigno, E. Crosson, T. Cubitt, C. Derby, O. Dow- inton,et al., arXiv preprint arXiv:2510.26845 (2025), 10.48550/arXiv.2510.26845
-
[71]
S. J. Evered, M. Kalinowski, A. A. Geim, T. Manovitz, D. Blu- vstein, S. H. Li, N. Maskara, H. Zhou, S. Ebadi, M. Xu,et al., Nature645, 341 (2025)
2025
-
[72]
E. Granet, S.-H. Lin, K. H ´emery, R. Hagshenas, P. Andres- Martinez, D. T. Stephen, A. Ransford, J. Arkinstall, M. Allman, P. Campora,et al., arXiv preprint arXiv:2511.02125 (2025), 10.48550/arXiv.2511.02125
-
[73]
Damascelli, Z
A. Damascelli, Z. Hussain, and Z.-X. Shen, Reviews of modern physics75, 473 (2003)
2003
-
[74]
J. A. Sobota, Y . He, and Z.-X. Shen, Reviews of Modern Physics93, 025006 (2021)
2021
-
[75]
Zhang, T
H. Zhang, T. Pincelli, C. Jozwiak, T. Kondo, R. Ernstorfer, T. Sato, and S. Zhou, Nature Reviews Methods Primers2, 54 (2022)
2022
-
[76]
Somma, G
R. Somma, G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme, Physical Review A65, 042323 (2002)
2002
-
[77]
Bauer, D
B. Bauer, D. Wecker, A. J. Millis, M. B. Hastings, and M. Troyer, Physical Review X6, 031045 (2016)
2016
-
[78]
Kanasugi, S
S. Kanasugi, S. Tsutsui, Y . O. Nakagawa, K. Maruyama, H. Os- hima, and S. Sato, Physical Review Research5, 033070 (2023)
2023
-
[79]
S. Endo, I. Kurata, and Y . O. Nakagawa, Physical Review Re- search2, 033281 (2020)
2020
-
[80]
Libbi, J
F. Libbi, J. Rizzo, F. Tacchino, N. Marzari, and I. Tavernelli, Physical Review Research4, 043038 (2022)
2022
-
[81]
R. N. Tazhigulov, S.-N. Sun, R. Haghshenas, H. Zhai, A. T. Tan, N. C. Rubin, R. Babbush, A. J. Minnich, and G. K.-L. Chan, PRX Quantum3, 040318 (2022)
2022
-
[82]
Pedernales, R
J. Pedernales, R. Di Candia, I. Egusquiza, J. Casanova, and E. Solano, Physical Review Letters113, 020505 (2014)
2014
-
[83]
H. Li, Y . Yang, P. Lv, J. Qu, Z.-H. Wang, J. Sun, and S. Ying, Physica Scripta99, 105117 (2024)
2024
-
[84]
Bishop, D
G. Bishop, D. Bagrets, and F. K. Wilhelm, Physical Review A 111, 062610 (2025)
2025
-
[85]
Roggero and J
A. Roggero and J. Carlson, Physical Review C100, 034610 (2019)
2019
-
[86]
K ¨okc¨u, H
E. K ¨okc¨u, H. A. Labib, J. Freericks, and A. F. Kemper, Nature Communications15, 3881 (2024)
2024
-
[87]
Francis, J
A. Francis, J. Freericks, and A. F. Kemper, Physical Review B 101, 014411 (2020)
2020
-
[88]
Chiesa, F
A. Chiesa, F. Tacchino, M. Grossi, P. Santini, I. Tavernelli, D. Gerace, and S. Carretta, Nature Physics15, 455 (2019)
2019
-
[89]
Kosugi and Y .-i
T. Kosugi and Y .-i. Matsushita, Physical Review Research2, 033043 (2020)
2020
-
[90]
M. L. Baez, M. Goihl, J. Haferkamp, J. Bermejo-Vega, M. Gluza, and J. Eisert, Proceedings of the National Academy of Sciences117, 26123 (2020)
2020
-
[91]
J. Sun, L. Vilchez-Estevez, V . Vedral, A. T. Boothroyd, and M. Kim, Nature Communications16, 1403 (2025)
2025
-
[92]
G. Greene-Diniz, D. Z. Manrique, K. Yamamoto, E. Plekhanov, N. Fitzpatrick, M. Krompiec, R. Sakuma, and D. M. Ramo, arXiv preprint arXiv:2309.09685 (2023), 10.22331/q-2024-06- 20-1383
-
[93]
Selisko, M
J. Selisko, M. Amsler, C. Wever, Y . Kawashima, G. Sam- sonidze, R. Ul Haq, F. Tacchino, I. Tavernelli, and T. Eckl, npj Computational Materials11, 325 (2025)
2025
-
[94]
Gomes, D
N. Gomes, D. B. Williams-Young, and W. A. de Jong, Journal of Chemical Theory and Computation19, 3313 (2023)
2023
-
[95]
Irmejs and R
R. Irmejs and R. A. Santos, Quantum9, 1639 (2025)
2025
-
[96]
Ehrlich, D
J. Ehrlich, D. F. Urban, and C. Els ¨asser, Journal of Physics: Condensed Matter37, 225901 (2025)
2025
-
[97]
Rizzo, F
J. Rizzo, F. Libbi, F. Tacchino, P. J. Ollitrault, N. Marzari, and I. Tavernelli, Physical Review Research4, 043011 (2022)
2022
-
[98]
Y . Tong, D. An, N. Wiebe, and L. Lin, Physical Review A104, 032422 (2021)
2021
-
[99]
H. Chen, M. Nusspickel, J. Tilly, and G. H. Booth, Physical Review A104, 032405 (2021)
2021
-
[100]
T. Keen, E. Dumitrescu, and Y . Wang, arXiv preprint arXiv:2112.05731 (2021), 10.48550/arXiv.2112.05731
-
[101]
F. Jamet, A. Agarwal, and I. Rungger, arXiv preprint arXiv:2205.00094 (2022), 10.48550/arXiv.2205.00094
-
[102]
Krylov vari- ational quantum algorithm for first principles materials simulations,
F. Jamet, A. Agarwal, C. Lupo, D. E. Browne, C. Weber, and I. Rungger, arXiv preprint arXiv:2105.13298 (2021), 10.48550/arXiv.2105.13298
-
[103]
T. E. Baker, Physical Review A103, 032404 (2021)
2021
-
[104]
Iwasawa, Electronic Structure2, 043001 (2020)
H. Iwasawa, Electronic Structure2, 043001 (2020)
2020
-
[105]
N. Constantinides, J. Yu, D. Devulapalli, A. Fahimniya, L. Schaeffer, A. M. Childs, M. J. Gullans, A. Schuckert, and A. V . Gorshkov, arXiv preprint arXiv:2510.05099 (2025), 10.48550/arXiv.2510.05099
-
[106]
Verstraete, J
F. Verstraete, J. I. Cirac, and J. I. Latorre, Physical Re- view A—Atomic, Molecular, and Optical Physics79, 032316 (2009)
2009
-
[107]
E. T. Campbell, Quantum Science & Technology7, 015007 (2022)
2022
-
[108]
Camps, R
D. Camps, R. Van Beeumen, and C. Yang, Numerical Linear Algebra with Applications28, e2331 (2021)
2021
-
[109]
N. Maskara, M. Kalinowski, D. Gonzalez-Cuadra, and M. D. Lukin, arXiv preprint arXiv:2509.08898 (2025), 10.48550/arXiv.2509.08898
-
[110]
Remaud and V
M. Remaud and V . Vandaele, inInternational Conference on Reversible Computation(Springer, 2025) pp. 137–154
2025
-
[111]
Raussendorf, D
R. Raussendorf, D. E. Browne, and H. J. Briegel, Physical re- view A68, 022312 (2003)
2003
-
[112]
Van den Nest, J
M. Van den Nest, J. Dehaene, and B. De Moor, Physical Re- view A69, 022316 (2004)
2004
-
[113]
Fast stabilizer state preparation via ai-optimized graph decimation,
M. Doherty, M. Puviani, J. Brewer, G. Matos, D. Amaro, B. Criger, and D. T. Stephen, (2026), 10.48550/arXiv.2603.17743, arXiv:2603.17743 [quant-ph]
-
[114]
B. F. Schiffer, A. F. Rubio, R. Trivedi, and J. I. Cirac, arXiv preprint arXiv:2404.15397 (2024), 10.48550/arXiv.2404.15397
-
[115]
Granet and H
E. Granet and H. Dreyer, PRX Quantum6, 010333 (2025)
2025
-
[116]
Chertkov, Y .-H
E. Chertkov, Y .-H. Chen, M. Lubasch, D. Hayes, and M. Foss- Feig, Physical Review Research8, 013255 (2026)
2026
-
[117]
G. Gonz ´alez-Garc´ıa, F. M. Gambetta, and R. A. Santos, arXiv preprint arXiv:2603.22141 (2026), 10.48550/arXiv.2603.22141
-
[118]
Adiabatic preparation of thermal states and entropy-noise relation on noisy quantum computers
E. Granet and H. Dreyer, arXiv preprint arXiv:2509.05206 (2025), 10.48550/arXiv.2509.05206. 10 -SUPPLEMENTAL MA TERIAL- FREE FERMION CASE. Derivation In this section, we treat the exactly solvable case where the system Hamiltonian is given by a free-fermion hopping Hamilto- nian Hsys =ν NX j=1 c† jcj+1 +c † j+1cj .(31) We introduce γj = cj dj , γ † j = c†...
work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2509.05206 2025
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.