Pith. sign in

REVIEW 3 major objections 4 minor 48 references

Certifying Quantum States with Uniform Measurements

T0 review · 3 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Uniform, global measurements—no qubit-resolved addressing—can certify certain graph states with a sample-efficient algorithm and a proved guarantee.

desk verdict Fresh and practically motivated idea for certifying graph states with global measurements, but the key uniqueness proof is unreadable in this version—needs a clean copy before I can trust the guarantee. read the letter →

arxiv 2508.09259 v2 pith:HACODE2X submitted 2025-08-12 quant-ph cond-mat.quant-gas

Liang Mao , Yifei Wang , Yingfei Gu , Chengshu Li This is my paper
classification quant-phcond-mat.quant-gas
keywords quantumstatecertificationuniformmeasurementsgraphstatesglobalrotationsRydbergatomarrayssampleefficiencystabilizermeasurement-basedcomputation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper tries to establish that a single class of operations—uniform measurements, where the same rotation is applied to every qubit before a computational-basis readout—is enough to certify a family of graph states. Graph states are many-body entangled states used as resources for measurement-based quantum computing, and their verification usually relies on demanding per-qubit stabilizer measurements. The authors give a certification algorithm whose sample count is bounded by a proved guarantee and that uses only global, site-independent rotations, plus an experimental implementation scheme based on Rydberg atom arrays. If correct, this means such states can be verified on platforms that cannot or prefer not to address individual qubits.

What carries the argument

The central object is the uniform measurement: a single-qubit measurement in the basis defined by one global rotation $U$, applied identically to every qubit before measuring in the computational basis. Equivalently, it produces outcome statistics $p(\mathbf{s}|U)$ for bitstrings $\mathbf{s}$. The argument works because for graph states the outcome statistics over chosen global rotations carry enough information to distinguish the target state; the uniqueness conditions (S18)–(S21) formalize which states are consistent with the observed probabilities. The sample-efficient certification algorithm is driven by this identifiability.

What would settle it

Search for an 8-qubit state other than the target graph state that satisfies conditions (S18)–(S21) and reproduces the same outcome probabilities for the uniform-measurement directions used in the proof (the configuration in Fig. S1). If such a state exists, the uniqueness step fails and the certification algorithm could accept a wrong state. Equivalently, in experiment, prepare a convex mixture of the graph state with a local perturbation and check whether the certifier ever accepts a state with fidelity below its promised threshold.

Watch

Extended reading notes

Core claim

The central claim is that uniform measurements alone suffice to certify certain graph states. A uniform measurement is a projection of every qubit onto the same rotated basis, realized experimentally as one global pulse before the measurement. The paper shows that, for graph states on lattices admitting a bipartite construction (and smooth-boundary lattices via a tripartite division), the probability distribution of outcomes over a finite set of global rotations uniquely identifies the target graph state; the supplementary analysis (conditions S18–S21) rules out all other states consistent with the observed statistics. On this uniqueness the authors build a sample-efficient certification alg

Load-bearing premise

The algorithm's correctness depends on the uniqueness premise: the statistics of the chosen uniform measurements identify the target graph state and no other quantum state; the paper defends this via conditions (S18)–(S21), though the presented text leaves part of that proof unreadable due to OCR corruption.

Editorial extensions

If this is right

  • Graph-state verification on atom- and ion-based platforms can be performed with a single global laser pulse, removing the need for spatial pulse shaping or individual addressing.
  • The proved sample-complexity bound means the protocol's overhead can be compared directly with stabilizer-based verification, giving a concrete resource tradeoff.
  • The experimental scheme for analog-mode Rydberg atom arrays gives a near-term route to testing the protocol.
  • The paper's 'uniformity' rubric offers a new axis for designing quantum information protocols: minimizing the amount of site-resolved control rather than total number of measurements.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper leaves open a natural extension: for graph states with more symmetry, the same uniform-measurement argument may certify other stabilizer states or output states of measurement-based computations, since many such states are locally equivalent to graph states.
  • The finite set of rotations in the uniqueness proof suggests a characterization problem: which graphs admit uniform certification, and can the set of rotations be minimized? The bipartite and tripartite lattice constructions are partial answers.
  • If uniform measurements can certify graph states, they may also certify the resource states generated by Rydberg analog simulations in the presence of realistic noise; a numerical study of the protocol's tolerance to measurement error would be a direct test.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper claims that uniform measurements—single-qubit measurements preceded by a global, site-independent rotation—can certify a family of graph states, and that this can be done with a sample-efficient algorithm carrying a proved performance guarantee. It also proposes an experimental implementation in analog-mode Rydberg atom arrays and suggests 'uniformity' as a resource rubric. The version provided for review, however, contains only the introduction, references, and two supplementary figure captions; the derivations, algorithm, theorem statements, and the uniqueness proof (conditions S18–S21) are not readable in the provided text. The central claim is stated but its technical support is missing from the supplied material.

Significance. If correct, the claimed result would be meaningful: certification via global, site-independent rotations would remove the need for qubit-resolved local addressing on atom- and ion-based platforms, potentially reducing classical control overhead and improving fidelity. The proposed experimental scheme and the broader rubric of 'uniformity' as a resource are also of interest. However, because the proof and algorithm are not present in readable form, the significance cannot be assessed from the submitted text. The available fragment (Fig. S1) suggests a finite-case uniqueness check, which is not sufficient to establish the general performance guarantee advertised in the abstract.

major comments (3)
  1. [Abstract / main text] The central claim of a 'proved performance guarantee' is stated, but no theorem, algorithm, or proof appears in the provided text. The narrative refers to 'conditions (S18–S21)' and 'analysis in the main text,' yet none of these are readable, and no sample-complexity bound or formal uniqueness statement is given. This is a missing-support problem, not a demonstrated error, but it blocks verification of the paper's main contribution. The complete, uncorrupted main text and supplementary material with precise statements and proofs are required.
  2. [Fig. S1 / conditions S18–S21] The uniqueness of the target graph state among all states compatible with uniform-measurement statistics is the logical core of the certification guarantee. The only evidence provided is a finite enumeration for n=8, and the caption asserts that the last two configurations violate condition (S21) without showing the violation or providing a general argument. A finite check cannot establish the claimed infinite-family result. The derivation of conditions S18–S21 and a general uniqueness theorem must be supplied.
  3. [Fig. S2 / main text] The bipartite and tripartite constructions for rough- and smooth-boundary 2D lattices are mentioned but not defined in the visible text. Similarly, the experimental scheme based on analog-mode Rydberg atom arrays is referenced but not described. These elements are needed to support the claimed breadth of the certified graph-state family and the experimental feasibility. Without them, the scope and practical impact of the result cannot be evaluated.
minor comments (4)
  1. [Throughout] The provided text suffers from severe OCR corruption (e.g., author names, affiliations, parts of the reference list, Fig. 1). A clean, typeset version is required for proper review.
  2. [Fig. S1 caption] The caption states 'the two circles represent ...', but the relevant Pauli-string labels are missing due to corruption. Please provide explicit operator labels and define the solid/empty circle notation in the main text.
  3. [Introduction] Figures 1(a) and 1(b) are referenced but not included in the provided text. They are presumably the main illustration of the uniform-measurement protocol and should be present in any complete version.
  4. [References] Several references are garbled or incomplete (e.g., [19], [29], [39], [40]). Full bibliographic entries should be verified.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the certification guarantee rests on the paper's own uniqueness analysis (conditions S18–S21) and sample-complexity argument, not on fitted inputs or self-citation.

full rationale

The paper's central claim is that uniform (site-independent) measurements suffice to certify certain graph states, with a sample-efficient algorithm and a proved performance guarantee. The derivation has two independent load-bearing components: (i) a statistical bound on how many measurement shots are needed to estimate the relevant outcome probabilities, and (ii) a uniqueness statement—conditions S18–S21—showing that the observed uniform-measurement statistics uniquely identify the target graph state among all possible states. Neither component is shown to be assumed in the input. The uniqueness conditions are presented as the paper's own derivation, not imported from a prior self-citation. No parameter is fitted to the target state and then renamed as a prediction; no equation in the excerpt defines the certification target in terms of the algorithm's output. The visible n=8 case in Fig. S1 is supporting evidence, not an assumption smuggled in via citation. The citations to hardware-efficient learning [39,40] and to randomized measurement toolbox [38] are contextual and are not used to replace the proof. The OCR corruption that hides the general proof of S18–S21 is a verifiability gap in the provided text, not evidence of circularity. Under the rule that missing support and correctness concerns are distinct from circularity, I find no significant circularity and score 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

I could not fully read the manuscript due to text corruption. The listed axioms are the standard assumptions for quantum state certification from the abstract and common practice. The central identifiability condition (that uniform measurement statistics uniquely determine the graph state) appears to be proven in the paper, so I do not list it as an axiom.

assumptions (3)
  • standard math Born rule: the probability of a measurement outcome is given by the trace of the state with the corresponding projector.
    Fundamental to any quantum certification protocol.
  • domain assumption The measurement rounds are independent and identically distributed copies of the state being certified.
    Required for the sample-complexity analysis.
  • domain assumption The measurement apparatus is trusted: projecting onto the computational basis after a known global rotation gives statistics described by the Born rule.
    Standard in state certification; the paper likely assumes this to prove the algorithm.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Certifying Quantum States with Uniform Measurements." pith.science (2026). https://pith.science/paper/HACODE2X

@misc{pith2026250809259,
  author       = {Pith},
  title        = {Pith review of: Certifying Quantum States with Uniform Measurements},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HACODE2X}},
  note         = {Machine review of arXiv:2508.09259}
}
read the original abstract

Qubit-resolved operations and measurements are required for most current quantum information processing schemes. However, these operations can be experimentally costly due to the need for local addressing, demanding significant classical control. A more resource-efficient alternative to extract information is uniform measurement, where a site-independent rotation of qubits is performed before measuring in the computational basis. This operation can be performed in parallel, or globally, in atom- and ion-based platforms, reducing resource cost and increasing fidelity. In this work, we initiate the exploration of the utility of this operation in quantum information processing. In particular, we demonstrate that uniform measurements can certify certain graph states, a family of highly entangled and broadly useful quantum states. We provide a sample-efficient certification algorithm with a proved performance guarantee, together with an experimental scheme based on analog-mode Rydberg atom arrays. Uniform measurements, therefore, allow direct and efficient characterization of quantum states on quantum platforms in a hitherto unexplored manner.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

48 extracted references · 32 canonical work pages

  1. [15]

    H¨ affner, C

    H. H¨ affner, C. F. Roos, and R. Blatt, Quantum comput- ing with trapped ions, Phys. Rep.469, 155 (2008)

    work page 2008

  2. [16]

    Blatt and C

    R. Blatt and C. F. Roos, Quantum simulations with trapped ions, Nat. Phys.8, 277 (2012)

    2012

  3. [17]

    C. D. Bruzewicz, J. Chiaverini, R. McConnell, and J. M. Sage, Trapped-ion quantum computing: Progress and challenges, Appl. Phys. Rev.6, 021314 (2019)

    2019

  4. [18]

    Huang, R

    H.-Y. Huang, R. Kueng, and J. Preskill, Predicting many properties of a quantum system from very few measure- ments, Nat. Phys.16, 1050 (2020)

    2020

  5. [19]

    S. Aaronson, Shadow tomography of quantum states, in ����������� �� ��� ���� ������ ��� ������ ������ ���� �� ������ �� ���������, STOC 2018 (Association for Computing Machinery, New York, NY, USA, 2018) p. 325–338

    work page 2018

  6. [20]

    Huang, R

    H.-Y. Huang, R. Kueng, G. Torlai, V. V. Albert, and J. Preskill, Provably efficient machine learning for quan- tum many-body problems, Science377, eabk3333 (2022)

    2022

  7. [21]

    A. Zhao, N. C. Rubin, and A. Miyake, Fermionic Par- tial Tomography via Classical Shadows, Phys. Rev. Lett. 127, 110504 (2021)

    work page 2021

  8. [22]

    Y. Wu, C. Wang, J. Yao, H. Zhai, Y.-Z. You, and P. Zhang, Contractive unitary and classical shadow to- mography, npj Quantum Inf. (2026)

    work page 2026

Show all 48 references
  1. [23]

    Aolita, C

    L. Aolita, C. Gogolin, M. Kliesch, and J. Eisert, Reli- able quantum certification of photonic state preparations, Nat. Commun.6, 8498 (2015)

    2015

  2. [24]

    Takeuchi and T

    Y. Takeuchi and T. Morimae, Verification of Many-Qubit States, Phys. Rev. X8, 021060 (2018)

    2018

  3. [25]

    Gluza, M

    M. Gluza, M. Kliesch, J. Eisert, and L. Aolita, Fidelity Witnesses for Fermionic Quantum Simulations, Phys. Rev. Lett.120, 190501 (2018)

    2018

  4. [26]

    Dangniam, Y.-G

    N. Dangniam, Y.-G. Han, and H. Zhu, Optimal verifica- tion of stabilizer states, Phys. Rev. Res.2, 043323 (2020)

    2020

  5. [27]

    Carrasco, A

    J. Carrasco, A. Elben, C. Kokail, B. Kraus, and P. Zoller, Theoretical and Experimental Perspectives of Quantum Verification, PRX Quantum2, 010102 (2021)

    2021

  6. [28]

    Goˇ canin, I

    A. Goˇ canin, I. ˇSupi´ c, and B. Daki´ c, Sample-Efficient Device-Independent Quantum State Verification and Certification, PRX Quantum3, 010317 (2022)

    2022

  7. [29]

    Huang, J

    H.-Y. Huang, J. Preskill, and M. Soleimanifar, Certify- ing Almost All Quantum States with Few Single-Qubit Measurements, in���� ���� ���� ������ ��������� �� ����������� �� �������� ������� ������(2024) pp. 1202–1206

    2024

  8. [30]

    Gupta, W

    M. Gupta, W. He, and R. O’Donnell, Few Single-Qubit Measurements Suffice to Certify Any Quantum State (2025), arXiv:2506.11355 [quant-ph]

    2025 arXiv

  9. [31]

    Li and H

    Y. Li and H. Zhu, Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases, Quantum10, 2011 (2026)

    2011

  10. [32]

    J. R. Garrison and T. Grover, Does a Single Eigenstate Encode the Full Hamiltonian?, Phys. Rev. X8, 021026 (2018)

    2018

  11. [33]

    Qi and D

    X.-L. Qi and D. Ranard, Determining a local Hamilto- nian from a single eigenstate, Quantum3, 159 (2019)

    2019

  12. [34]

    Bairey, I

    E. Bairey, I. Arad, and N. H. Lindner, Learning a Local Hamiltonian from Local Measurements, Phys. Rev. Lett. 122, 020504 (2019)

    2019

  13. [35]

    Z. Li, L. Zou, and T. H. Hsieh, Hamiltonian Tomogra- phy via Quantum Quench, Phys. Rev. Lett.124, 160502 (2020)

    2020

  14. [36]

    Anshu, S

    A. Anshu, S. Arunachalam, T. Kuwahara, and M. Soleimanifar, Sample-efficient learning of interacting quantum systems, Nat. Phys.17, 931 (2021)

    2021

  15. [37]

    J. Haah, R. Kothari, and E. Tang, Optimal learning of quantum Hamiltonians from high-temperature Gibbs states , in���� ���� ���� ������ ��������� �� ����� ������� �� �������� ������� ������(IEEE Computer Society, Los Alamitos, CA, USA, 2022) pp. 135–146

    2022

  16. [38]

    Elben, S

    A. Elben, S. T. Flammia, H.-Y. Huang, R. Kueng, J. Preskill, B. Vermersch, and P. Zoller, The randomized measurement toolbox, Nat. Rev. Phys.5, 9 (2023)

    2023

  17. [39]

    K. V. Kirk, J. Cotler, H.-Y. Huang, and M. D. Lukin, Hardware-efficient learning of quantum many- body states, Phys. Rev. Lett. , (2025)

    2025

  18. [40]

    D. K. Mark, H.-Y. Hu, J. Kwan, C. Kokail, S. Choi, and S. F. Yelin, Efficiently Measuring�-Wave Pairing and Beyond in Quantum Gas Microscopes, Phys. Rev. Lett. 135, 123402 (2025)

    2025

  19. [41]

    Raussendorf, D

    R. Raussendorf, D. E. Browne, and H. J. Briegel, Measurement-based quantum computation on cluster states, Phys. Rev. A68, 022312 (2003)

    2003

  20. [42]

    H. J. Briegel, D. E. Browne, W. D¨ ur, R. Raussendorf, and M. Van den Nest, Measurement-based quantum compu- tation, Nat. Phys.5, 19 (2009)

    2009

  21. [43]

    Schwartz, D

    I. Schwartz, D. Cogan, E. R. Schmidgall, Y. Don, L. Gantz, O. Kenneth, N. H. Lindner, and D. Gershoni, Deterministic generation of a cluster state of entangled photons, Science354, 434 (2016)

    2016

  22. [44]

    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´ c, and M. D. Lukin, A quantum processor based on coherent transport of en- tangled atom arrays, Nature604, 451 (2022)

    2022

  23. [45]

    Thomas, L

    P. Thomas, L. Ruscio, O. Morin, and G. Rempe, Efficient generation of entangled multiphoton graph states from a single atom, Nature608, 677 (2022)

    2022

  24. [46]

    N. S. Jones and N. Linden, Parts of quantum states, Phys. Rev. A71, 012324 (2005)

    2005

  25. [47]

    Huber and O

    F. Huber and O. G¨ uhne, Characterizing Ground and Thermal States of Few-Body Hamiltonians, Phys. Rev. Lett.117, 010403 (2016)

    2016

  26. [48]

    Karuvade, P

    S. Karuvade, P. D. Johnson, F. Ticozzi, and L. Viola, Uniquely determined pure quantum states need not be unique ground states of quasi-local Hamiltonians, Phys. Rev. A99, 062104 (2019)

    2019

  27. [49]

    Yu and T.-C

    N. Yu and T.-C. Wei, Learning marginals suffices! (2023), arXiv:2303.08938 [quant-ph]

    2023 arXiv

  28. [50]

    Cotler and F

    J. Cotler and F. Wilczek, Quantum Overlapping Tomog- raphy, Phys. Rev. Lett.124, 100401 (2020)

    2020

  29. [51]

    Bonet-Monroig, R

    X. Bonet-Monroig, R. Babbush, and T. E. O’Brien, Nearly Optimal Measurement Scheduling for Partial To- mography of Quantum States, Phys. Rev. X10, 031064 (2020)

    2020

  30. [52]

    Garc ´ ıa-P´ erez, M

    G. Garc ´ ıa-P´ erez, M. A. C. Rossi, B. Sokolov, E.-M. Bor- relli, and S. Maniscalco, Pairwise tomography networks for many-body quantum systems, Phys. Rev. Res.2, 023393 (2020)

    2020

  31. [53]

    A. R. Calderbank and P. W. Shor, Good quantum error- correcting codes exist, Phys. Rev. A54, 1098 (1996)

    1996

  32. [54]

    Steane, Multiple-particle interference and quantum er- ror correction, Proc

    A. Steane, Multiple-particle interference and quantum er- ror correction, Proc. R. Soc. London, Ser. A452, 2551 (1996)

    1996

  33. [55]

    W. Son, L. Amico, and V. Vedral, Topological order in 1d cluster state protected by symmetry, Quantum Info. Process.11, 1961 (2012)

    1961

  34. [56]

    Raussendorf and H

    R. Raussendorf and H. J. Briegel, A One-Way Quantum 8 Computer, Phys. Rev. Lett.86, 5188 (2001)

    2001

  35. [57]

    M. V. Larsen, X. Guo, C. R. Breum, J. S. Neergaard- Nielsen, and U. L. Andersen, Deterministic generation of a two-dimensional cluster state, Science366, 369 (2019)

    2019

  36. [58]

    S. Cao, B. Wu, F. Chen, M. Gong, Y. Wu, Y. Ye, C. Zha, H. Qian, C. Ying, S. Guo, Q. Zhu, H.-L. Huang, Y. Zhao, S. Li, S. Wang, J. Yu, D. Fan, D. Wu, H. Su, H. Deng, H. Rong, Y. Li, K. Zhang, T.-H. Chung, F. Liang, J. Lin, Y. Xu, L. Sun, C. Guo, N. Li, Y.-H. Huo, C.-Z. Peng, C....

    2023

  37. [59]

    V. S. Ferreira, G. Kim, A. Butler, H. Pichler, and O. Painter, Deterministic generation of multidimensional photonic cluster states with a single quantum emitter, Nat. Phys.20, 865 (2024)

    2024

  38. [60]

    Watrous, Quantum computational complexity, in��� ���������� �� ���������� ��� ������� �������, edited by R

    J. Watrous, Quantum computational complexity, in��� ���������� �� ���������� ��� ������� �������, edited by R. A. Meyers (Springer New York, New York, NY, 2009) pp. 7174–7201

    2009

  39. [61]

    M. A. Nielsen and I. L. Chuang,������� ����������� ��� ������� ������������ ���� ����������� ������� (Cambridge University Press, 2010)

    2010

  40. [62]

    Montanaro, Learning stabilizer states by Bell sam- pling (2017), arXiv:1707.04012 [quant-ph]

    A. Montanaro, Learning stabilizer states by Bell sam- pling (2017), arXiv:1707.04012 [quant-ph]. 4 ������ �������������������� �������������������� �������������������� ������ ������ ������ ������ ������ ������ ������ ������ ������ �������������������� �������������������� ���...

    2017 arXiv

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.