pith. sign in

arxiv: 2604.23258 · v1 · submitted 2026-04-25 · 🪐 quant-ph

Introducing the Correlation Concentration Ratio (CCR): Quantitative Framework for Comparing Quantum Cluster States

Amin Ahadi , Saman Sarshar This is my paper

Pith reviewed 2026-05-08 08:10 UTC · model grok-4.3

classification 🪐 quant-ph
keywords Correlation Concentration Ratiocluster statescontinuous-variablemeasurement-based quantum computationcovariance matrixentanglement distributiongraph topologyMBQC
0
0 comments X

The pith

The Correlation Concentration Ratio quantifies how cluster state topologies concentrate entanglement along graph edges for MBQC use.

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

This paper simulates four-mode continuous-variable cluster states in linear, square, and T-shaped topologies using the symplectic representation and covariance matrices. It shows that the graph structure directly shapes the pattern of quadrature correlations, with higher squeezing strengthening the target off-diagonal elements while suppressing unwanted ones. The central contribution is the introduction of the Correlation Concentration Ratio, a metric that measures the share of effective correlations located on the intended graph edges relative to all correlations in the system. A sympathetic reader would care because this supplies a concrete numerical basis for ranking topologies by their entanglement distribution efficiency, which matters for choosing resource-efficient graphs in measurement-based quantum computation.

Core claim

Numerical simulations reproduce the theoretical nullifier relations in the covariance matrices of the three topologies; the newly defined CCR then ranks them by how tightly the effective correlations concentrate on the graph connections, revealing a stronger central correlation in the T-shaped case that resembles continuous-variable GHZ behavior.

What carries the argument

The Correlation Concentration Ratio (CCR), which computes the concentration of effective correlations on the graph edges relative to the total correlations extracted from the simulated covariance matrix.

If this is right

  • Topologies can be ranked and selected by CCR to maximize entanglement concentration for MBQC.
  • Higher squeezing increases CCR by strengthening on-edge correlations and reducing off-edge noise.
  • The T-shaped topology shows GHZ-like central correlation, suggesting it may suit star-like MBQC tasks.
  • CCR provides a scalable design tool for choosing graph structures in larger or more complex clusters.
  • Covariance patterns directly encode the cluster graph, confirming that topology choice controls correlation layout.

Where Pith is reading between the lines

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

  • CCR could be tested on discrete-variable cluster states to check whether the same concentration principle applies across variable types.
  • Linking CCR values to concrete MBQC algorithm performance, such as error correction thresholds, would turn the metric into a predictive design rule.
  • Comparing CCR against other entanglement quantifiers like logarithmic negativity could reveal whether concentration alone captures resource quality.
  • The metric might help optimize hybrid continuous-variable/discrete-variable networks by predicting how entanglement flows across topology boundaries.

Load-bearing premise

That the CCR value derived from covariance-matrix simulations accurately reflects the computational efficiency or resource quality of a given cluster topology without independent checks against other metrics or real experiments.

What would settle it

An MBQC experiment in which a topology with higher simulated CCR produces lower gate fidelity or higher error rates than a topology with lower CCR would falsify the metric's claimed usefulness.

Figures

Figures reproduced from arXiv: 2604.23258 by Amin Ahadi, Saman Sarshar.

Figure 1
Figure 1. Figure 1: schematic cluster for linear, square, and T-shaped cluster states view at source ↗
Figure 2
Figure 2. Figure 2: Covariance matrix for the four-mode linear cluster with squeezing parameter 3-16dB view at source ↗
Figure 3
Figure 3. Figure 3: Covariance matrix for the four-mode square cluster with squeezing parameter 3-16dB view at source ↗
Figure 4
Figure 4. Figure 4: Covariance matrix for the four-mode T-shaped cluster with parameter 3-16dB view at source ↗
Figure 5
Figure 5. Figure 5: CCR as a function of squeezing level (2–16 dB) for linear, square, and T-shaped cluster view at source ↗
read the original abstract

In this paper, numerical simulations of four-mode continuous-variable cluster states with different topologies in the framework of measurement-based quantum computation are presented. By utilizing the symplectic representation and covariance matrix, the process of generating cluster states with linear, square, and T-shaped topologies has been systematically modeled. The simulation results show that the cluster graph structure is directly reflected in the pattern of quadrature correlations; in other words, the theoretical nullifier relations of the cluster states are reproduced in the final covariance matrices. Increasing the squeezing parameter leads to the strengthening of the target correlations and the suppression of unwanted components arising from anti-squeezing; such that the off-diagonal elements of the covariance matrix in the linear and square topologies increase to significant values, and in the T-shaped topology a stronger central correlation (similar to GHZ-like behavior in the continuous-variable domain) is observed. In order to quantitatively analyze these structural differences, a metric titled CCR (Correlation Concentration Ratio) is introduced that quantifies the concentration of effective correlations on the graph edges relative to the total correlations of the system. This index enables direct comparison of different topologies from the perspective of structural entanglement distribution and provides a framework for evaluating the efficiency of cluster graphs in MBQC architectures. The results show that CCR can be used as a practical tool for designing and selecting optimal topologies in larger clusters and more complex structures.

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.

Referee Report

2 major / 2 minor

Summary. The paper reports numerical simulations of four-mode continuous-variable cluster states in linear, square, and T-shaped topologies, using the symplectic formalism to generate covariance matrices that reproduce the expected nullifier relations. It observes that increasing squeezing strengthens target off-diagonal correlations while suppressing unwanted components, with the T-shaped graph exhibiting GHZ-like central correlations. To quantify these differences, the authors define the Correlation Concentration Ratio (CCR) as the ratio of edge-targeted correlations to total system correlations and claim that this index enables direct comparison of topologies from the standpoint of structural entanglement distribution and provides a practical framework for evaluating cluster-graph efficiency in measurement-based quantum computation (MBQC) architectures.

Significance. If the CCR metric can be shown to correlate with concrete MBQC performance indicators (e.g., logical error rates or resource overhead under realistic noise), it would supply a compact, topology-sensitive figure of merit that complements existing nullifier-based diagnostics. The present simulations correctly recover the expected covariance structure for the three graphs, which is a modest but reproducible technical contribution; however, the absence of any explicit mapping from CCR values to MBQC outcomes leaves the claimed utility for design and selection of optimal topologies unsupported.

major comments (2)
  1. [Abstract / Conclusion] Abstract and concluding discussion: the assertion that CCR 'provides a framework for evaluating the efficiency of cluster graphs in MBQC architectures' is not substantiated. No derivation, analytic argument, or additional simulation connects a higher CCR value to lower logical error rates, improved fault-tolerance thresholds, or reduced resource overhead in any MBQC protocol; the manuscript stops after reporting topology-dependent correlation patterns.
  2. [Results / Simulations] Simulation section (covariance-matrix results): the quantitative statements about correlation strengthening lack reported squeezing-parameter values, statistical uncertainties, or error bars on the off-diagonal elements. Without these, it is impossible to assess whether the observed differences between linear, square, and T-shaped topologies are statistically significant or merely qualitative.
minor comments (2)
  1. [Methods] The definition of CCR (ratio of edge-targeted to total correlations) should be stated explicitly with an equation number and the precise summation limits over the covariance-matrix elements.
  2. [Discussion] The manuscript would benefit from a brief comparison of CCR against at least one existing entanglement or graph-state metric (e.g., the nullifier variance or the Schmidt measure) to clarify its added value.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We respond to each major point below and will revise the manuscript to address the concerns raised.

read point-by-point responses

  1. Referee: [Abstract / Conclusion] Abstract and concluding discussion: the assertion that CCR 'provides a framework for evaluating the efficiency of cluster graphs in MBQC architectures' is not substantiated. No derivation, analytic argument, or additional simulation connects a higher CCR value to lower logical error rates, improved fault-tolerance thresholds, or reduced resource overhead in any MBQC protocol; the manuscript stops after reporting topology-dependent correlation patterns.

    Authors: We agree that the manuscript does not contain an explicit derivation or simulation that maps CCR values to concrete MBQC performance indicators such as logical error rates or resource overhead. The original phrasing was intended to highlight the metric's utility for comparing structural entanglement distributions across topologies, which we view as a necessary first step toward topology optimization. However, to address the referee's valid concern, we will revise the abstract and conclusion to remove the unsubstantiated claim about directly evaluating MBQC efficiency and instead state that CCR enables quantitative comparison of correlation concentration, with potential relevance to MBQC design left as a direction for future work. revision: partial

  2. Referee: [Results / Simulations] Simulation section (covariance-matrix results): the quantitative statements about correlation strengthening lack reported squeezing-parameter values, statistical uncertainties, or error bars on the off-diagonal elements. Without these, it is impossible to assess whether the observed differences between linear, square, and T-shaped topologies are statistically significant or merely qualitative.

    Authors: We accept this criticism. The simulations were performed using the symplectic formalism with specific (but previously unreported) squeezing parameters to illustrate the trends. We will revise the Results section to state the exact squeezing values employed for each topology and covariance matrix, note that the computations are deterministic within the model (hence no statistical error bars), and explicitly discuss the magnitude of the observed off-diagonal changes to allow readers to judge the significance of the topology-dependent differences. revision: yes

Circularity Check

0 steps flagged

No circularity: CCR is a direct definition from covariance matrix elements with no reduction to inputs by construction

full rationale

The paper's derivation consists of symplectic simulations that reproduce standard nullifier relations in the covariance matrices for linear, square, and T-shaped topologies, followed by the explicit introduction of CCR as the ratio of edge-targeted off-diagonal correlations to total system correlations. This definition stands alone without any fitted parameter, self-citation chain, or ansatz that collapses the claimed utility back onto the input data. The assertion that CCR thereby supplies a framework for MBQC efficiency is presented as an interpretive claim rather than a derived prediction equivalent to the simulations by construction, leaving the central result self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on standard assumptions of continuous-variable quantum optics and the validity of the symplectic representation for cluster-state generation; the CCR itself is a newly postulated ratio without independent external calibration.

axioms (1)
  • domain assumption The symplectic representation and covariance matrix formalism accurately capture the quadrature correlations of generated cluster states.
    Invoked throughout the simulation description to link graph topology to observed correlation patterns.
invented entities (1)
  • Correlation Concentration Ratio (CCR) no independent evidence
    purpose: To quantify the fraction of total correlations that lie on the desired graph edges for comparing cluster topologies.
    Newly defined metric introduced to enable direct numerical comparison; no external falsifiable prediction or calibration is provided.

pith-pipeline@v0.9.0 · 5537 in / 1362 out tokens · 34378 ms · 2026-05-08T08:10:52.869499+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    Raussendorf& Briegel, H. J. A One-Way Quantum Computer.Phys. Rev. Lett.86, 5188–5191 (2001)

    work page 2001

  2. [2]

    Menicucciet al.Universal Quantum Computation with Continuous-Variable Cluster States. Phys. Rev. Lett.97, 110501 (2006)

    work page 2006

  3. [3]

    V.et al.Fault-Tolerant Continuous-Variable Measurement-Based Quantum Com- putation Architecture.PRX Quantum2, 030325 (2021)

    Larsen, M. V.et al.Fault-Tolerant Continuous-Variable Measurement-Based Quantum Com- putation Architecture.PRX Quantum2, 030325 (2021)

    work page 2021

  4. [4]

    Yukawa, M.et al.Experimental generation of four-mode continuous-variable cluster states. Phys. Rev. A78, 012301 (2008)

    work page 2008

  5. [5]

    Hao, S.et al.Quantum computation and error correction based on continuous variable cluster states.Chin. Phys. B30, 060312 (2021)

    work page 2021

  6. [6]

    González, C.et al.Cluster States from Gaussian States: Essential Diagnostic Tools for Continuous-Variable One-Way Quantum Computing.PRX Quantum2, 030343 (2021)

    work page 2021

  7. [7]

    Flow conditions for continuous variable measurement-based quantum computing.Quantum7, 1146 (2023)

    Booth& Markham, D. Flow conditions for continuous variable measurement-based quantum computing.Quantum7, 1146 (2023)

    work page 2023

  8. [8]

    Express31, 7535–7544 (2023)

    Duet al.Generation of large-scale continuous-variable cluster states multiplexed both in time and frequency domains.Opt. Express31, 7535–7544 (2023)

    work page 2023

  9. [9]

    Eaton, M.et al.Measurement-based generation and preservation of cat and grid states within a continuous-variable cluster state.Quantum6, 769 (2022)

    work page 2022

  10. [10]

    Gu, M.et al.Quantum computing with continuous-variable clusters.Phys. Rev. A79, 062318 (2009)

    work page 2009

  11. [11]

    Solodovnikova & Neergaard-Nielsen, J. S. Fast simulations of continuous-variable circuits using the coherent state decomposition. Preprint at https://arxiv.org/abs/2508.06175 (2025). 16

    work page arXiv 2025

  12. [12]

    Zhang& Braunstein, S. L. Continuous-variable Gaussian analog of cluster states.Phys. Rev. A73, 032318 (2006)

    work page 2006

  13. [13]

    Weedbrook, C.et al.Gaussian quantum information.Rev. Mod. Phys.84, 621–669 (2012)

    work page 2012

  14. [14]

    & Illuminati, F

    Adesso, G., Serafini, A. & Illuminati, F. Extremal entanglement and mixedness in continuous variable systems.Phys. Rev. A70, 022318 (2004)

    work page 2004

  15. [15]

    Peres-Horodecki separability criterion for continuous variable systems.Phys

    Simon, R. Peres-Horodecki separability criterion for continuous variable systems.Phys. Rev. Lett.84, 2726 (2000)

    work page 2000

  16. [16]

    & Goyal, K

    Raussendorf, R., Harrington, J. & Goyal, K. A fault-tolerant one-way quantum computer. Ann. Phys.321, 2242–2270 (2006)

    work page 2006

  17. [17]

    Cerf, N. J. & Adami, C. Quantum mutual information.Phys. Rev. Lett.79(1997)

    work page 1997

  18. [18]

    & Zurek, W

    Ollivier, H. & Zurek, W. H. Quantum discord.Phys. Rev. Lett.88, 017901 (2002)

    work page 2002

  19. [19]

    & Vedral, V

    Henderson, L. & Vedral, V. Classical and quantum correlations.J. Phys. A34, 6899–6905 (2001)

    work page 2001

  20. [20]

    L., Angelo, R

    Moraes, G. L., Angelo, R. M. & Costa, A. C. S. Axiomatic approach to measures of total correlations.Entropy26, 238 (2024)

    work page 2024

  21. [21]

    Laurell, P.et al.Witnessing entanglement and quantum correlations in condensed matter. Adv. Quantum Technol.7(2024)

    work page 2024

  22. [22]

    Modi, K.et al.The classical-quantum boundary for correlations.Rev. Mod. Phys.84, 1655– 1707 (2012)

    work page 2012

  23. [23]

    & Illuminati, F

    Adesso, G. & Illuminati, F. Gaussian measures of entanglement versus negativities: the order- ing of two-mode Gaussian states.Phys. Rev. A72, 032334 (2005)

    work page 2005

  24. [24]

    Scalable multipartite entanglement criteria for continuous variables

    Chen, X. Scalable multipartite entanglement criteria for continuous variables. Preprint at https://arxiv.org/abs/2411.03083 (2024). 17

    work page arXiv 2024