arxiv: 2604.27248 · v1 · submitted 2026-04-29 · 🪐 quant-ph

Recognition: unknown

Cylindrical Matter: A beyond-quantum many-body system for efficient classical simulation of quantum pure-Ising like systems

Sahar Atallah , Peter Carrekmor , Michael Garn , Yukuan Tao , Shashank Virmani

Authors on Pith no claims yet

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

classification 🪐 quant-ph

keywords cylindrical bitsbeyond-quantum modelsclassical simulationIsing interactionsquantum entanglementmany-body systemsmeasurement samplingnon-free models

0 comments

The pith

Cylindrical bits arranged under spatial constraints can exactly reproduce the measurement statistics of certain quantum Ising systems, enabling their classical sampling.

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

The paper builds a hypothetical continuous-time many-body model based on lattices of cylindrical bits, a particle concept that requires spatial constraints on interactions to keep probabilities valid. It demonstrates that certain states produced by these constrained cylindrical systems match the measurement outcomes of pure quantum systems generated by Ising interactions whose strength falls off algebraically faster than roughly 1 over r to the 3D/2 power. This match holds for measurements in the computational Z basis or in any eigenbasis of a linear combination aX + bY. A reader would care because the construction supplies an efficient classical procedure for sampling those outcomes, which are otherwise difficult to obtain from the corresponding quantum many-body Hamiltonians. The model is explicitly non-free, meaning the constraints are essential rather than optional.

Core claim

Certain pure quantum entangled systems can be faithfully mimicked by our cylindrical worlds. This allows us to simulate efficiently classically, in the sense of sampling measurement outcomes, a variety of previously unknown quantum systems. Examples include some states created by pure Ising interactions algebraically decaying faster than ∼1/r^{3D/2}, with spatial dimension D, under measurements in the Z eigenbasis or eigenbases of aX+bY for a,b∈R.

What carries the argument

Cylindrical bits, lattices of interacting particles whose spatial interaction constraints enforce valid probabilities while reproducing the target quantum measurement statistics.

If this is right

The construction supplies a classical sampling algorithm for measurement outcomes of quantum Ising states whose couplings decay faster than ∼1/r^{3D/2} in D dimensions.
The same sampling works for both Z-basis measurements and measurements in any aX + bY eigenbasis with real a, b.
The model generates families of entangled states whose existence is tied directly to the cylindrical-bit interaction rules.
Alternative choices of non-quantum particle can be compared by optimizing a figure-of-merit that quantifies how far each choice extends the range of simulable quantum systems.

Where Pith is reading between the lines

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

Numerical implementations of the constrained cylindrical dynamics could be used to generate approximate samples for system sizes where direct quantum simulation becomes intractable.
The same constraint technique might be adapted to other interaction types that are diagonal in a fixed basis, potentially widening the set of classically tractable quantum states.
If the cylindrical constraints prove minimal, they could illuminate which features of quantum entanglement are essential for computational hardness rather than incidental.
Small-system comparisons between the cylindrical model and exactly solvable Ising cases would quickly test whether the mimicry holds beyond the algebraic-decay regime stated in the paper.

Load-bearing premise

Spatial constraints on cylindrical-bit interactions suffice to generate valid probabilities that exactly match the quantum measurement statistics of the specified Ising-like systems without extra fitting or hidden quantum features.

What would settle it

A concrete set of measurement probabilities, obtained either analytically or from a small-scale quantum simulation for an Ising interaction decaying faster than 1/r^{3D/2}, that no configuration of cylindrical bits under the stated constraints can reproduce.

Figures

Figures reproduced from arXiv: 2604.27248 by Michael Garn, Peter Carrekmor, Sahar Atallah, Shashank Virmani, Yukuan Tao.

**Figure 1.** Figure 1: FIG. 1. A sketch of Cyl(1) in the space of Bloch vectors. For view at source ↗

**Figure 2.** Figure 2: FIG. 2. The plot shows view at source ↗

**Figure 3.** Figure 3: we plot the tradeoff between θ and α for this explicit example. 1 2 3 4 5 6 7 0 2 4 6 8 10 12 Polar angle in degrees FIG. 3. The horizontal axis is α, the power law decay rate for a one dimensional system. The vertical axis is the largest angle θ in degrees, such that initial states cos(θ/2)|0i+sin θ/2|1i are within the initial radius accepted by the classical simulation algorithm. In other words, if sta… view at source ↗

**Figure 4.** Figure 4: FIG. 4. The view at source ↗

**Figure 5.** Figure 5: FIG. 5. An illustration of the coarse graining procedure. view at source ↗

**Figure 6.** Figure 6: FIG. 6. A sketch of the recursion relation for different value view at source ↗

**Figure 7.** Figure 7: FIG. 7. Illustration for view at source ↗

**Figure 8.** Figure 8: FIG. 8. A sketch of view at source ↗

read the original abstract

Even simplified models of quantum many-body systems can be difficult to analyse. However, taking inspiration from the foundations of physics, one may wonder whether there are practical advantages to constructing alternative beyond-quantum descriptions of many-body systems. We explore this question in the context of quantum interactions that are diagonal in the computational basis. We construct a hypothetical model of a continuous time dynamical many-body system that is based upon lattices of interacting particles called "cylindrical bits", a concept first introduced in [6]. In the language of [5] our toy model is {\it non-free}, as we need spatial constraints on how the particles interact to ensure valid probabilities. We investigate these constraints and explore the resulting `entangled' states that can exist. Certain pure {\it quantum} entangled systems can be faithfully mimicked by our cylindrical worlds. This allows us to simulate efficiently classically, in the sense of sampling measurement outcomes, a variety of previously unknown quantum systems. Examples include some states created by pure Ising interactions algebraically decaying faster than $\sim 1/r^{3D/2}$, with spatial dimension $D$, under measurements in the $Z$ eigenbasis or eigenbases of $aX+bY$ for $a,b \in \mathbb{R}$. We also explore whether another choice of non-quantum `particle' could expand the applicability of the classical simulation by defining and partially optimising a figure-of-merit that attempts to capture how useful various possibilities may be.

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 builds a constrained cylindrical-bit model that claims to classically sample measurements from certain algebraically decaying quantum Ising states, but the exact match to quantum statistics is asserted rather than derived in detail.

read the letter

The main point is that they take the cylindrical bit idea from earlier papers, make it non-free by adding spatial constraints to keep probabilities valid, and then show that some pure quantum states from Ising interactions with decay faster than ~1/r^{3D/2} can be mimicked for Z and aX+bY measurements. This would let you sample outcomes classically instead of dealing with the full quantum state. They also define and partially optimize a figure of merit to see if other particle choices could cover more cases. That is the concrete new piece: a specific construction that extends the prior free-model work to handle these particular entangled statistics without quantum features. The exploration of what states the constrained model actually produces is done in a straightforward way and gives a clear sense of the reachable distributions. The soft spot is the step from the constrained manifold to the target quantum probabilities. The paper defines the model and constraints first, then states that certain quantum cases fit inside it. There is no explicit embedding, bijection, or set of numerical checks showing that the joint distributions match exactly for the cited decay rates, rather than approximately or after case-by-case adjustment. If the constraints carve out a smaller set than the quantum ones, the faithful-mimicry claim and the resulting simulation advantage do not fully hold. This is the kind of gap a referee would flag immediately. The work is aimed at people who think about classical simulability of quantum many-body systems or alternative models in quantum information. A reader already following the cylindrical-bit or non-free model literature will see the extension clearly and can judge the constraints for themselves. It is worth sending to peer review so the details of the matching can be checked properly; the idea is coherent enough on its own terms to deserve that step even if revisions are needed.

Referee Report

3 major / 3 minor

Summary. The manuscript constructs a beyond-quantum many-body model based on lattices of interacting 'cylindrical bits' (introduced in prior work [6]). The model is non-free: spatial constraints on particle interactions are imposed to enforce valid probabilities. The authors analyze these constraints and the resulting states, claiming that certain pure quantum entangled states generated by Ising-like interactions with algebraic decay faster than ~1/r^{3D/2} (D spatial dimensions) can be faithfully mimicked. This equivalence purportedly permits efficient classical sampling of measurement outcomes in the Z eigenbasis or eigenbases of aX + bY (a, b real). The work also defines and partially optimizes a figure-of-merit to assess alternative non-quantum particle choices for broader applicability.

Significance. If the claimed exact mimicry holds without implicit fitting or additional parameters, the construction would supply a classical sampling algorithm for a nontrivial class of long-range quantum Ising systems whose direct simulation is otherwise intractable. This would advance understanding of the simulability boundary between quantum and classical many-body descriptions and illustrate how non-free beyond-quantum models can reproduce selected quantum statistics. The exploration of constraints and alternative particles contributes conceptually to quantum foundations, though the absence of an explicit embedding or validation currently limits the result's immediate utility.

major comments (3)

The central claim that the constrained cylindrical-bit model exactly reproduces the joint measurement probabilities of the target quantum Ising states (abstract and §4) lacks an explicit embedding, bijection, or derivation showing that the quantum distributions lie inside the constrained manifold. Without this, it is unclear whether the spatial constraints carve out a strictly smaller set or require case-by-case adjustment, undermining the 'faithful mimicry' and classical-simulation assertion.
§3 (model definition): the spatial constraints are introduced ad hoc to guarantee valid probabilities, yet no proof or numerical check is supplied that these constraints preserve the exact algebraic decay correlations of the quantum systems for decays faster than ~1/r^{3D/2} under both Z and aX+bY measurements. The equivalence is asserted rather than derived from the interaction rules.
The figure-of-merit optimization for alternative particles (final section) is only partially carried out; no concrete example is given where a different particle choice demonstrably enlarges the simulable set beyond the cylindrical-bit case, leaving the broader applicability claim unsupported.

minor comments (3)

Notation for the cylindrical-bit interaction rules and the precise form of the spatial constraints should be collected in a single definitions subsection for clarity.
The manuscript should include at least one small-scale numerical example (e.g., D=1, small lattice) comparing sampled cylindrical-bit statistics against the corresponding quantum Ising state to illustrate the claimed match.
Reference [6] is cited for the cylindrical-bit concept; a brief self-contained recap of its key properties would help readers unfamiliar with the prior work.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the constructive major comments. We address each point below and indicate the revisions we will make to strengthen the presentation.

read point-by-point responses

Referee: The central claim that the constrained cylindrical-bit model exactly reproduces the joint measurement probabilities of the target quantum Ising states (abstract and §4) lacks an explicit embedding, bijection, or derivation showing that the quantum distributions lie inside the constrained manifold. Without this, it is unclear whether the spatial constraints carve out a strictly smaller set or require case-by-case adjustment, undermining the 'faithful mimicry' and classical-simulation assertion.

Authors: We appreciate the referee drawing attention to the need for greater explicitness. In §4 we construct the cylindrical configurations from the Ising interaction rules so that the resulting joint probabilities in the Z and aX+bY bases coincide exactly with those of the target quantum states whenever the algebraic decay is faster than ~1/r^{3D/2}. The quantum states satisfy the spatial constraints by construction in this regime; no case-by-case adjustment or extra parameters are introduced. To address the concern directly we will add a new subsection that supplies the explicit embedding map from the quantum amplitudes to the allowed cylindrical-bit configurations together with a short proof that the map lands inside the constrained manifold. revision: yes
Referee: §3 (model definition): the spatial constraints are introduced ad hoc to guarantee valid probabilities, yet no proof or numerical check is supplied that these constraints preserve the exact algebraic decay correlations of the quantum systems for decays faster than ~1/r^{3D/2} under both Z and aX+bY measurements. The equivalence is asserted rather than derived from the interaction rules.

Authors: The constraints in §3 are obtained by requiring that all multi-particle marginals remain non-negative and sum to unity under the cylindrical-bit interaction rules; they are therefore not ad hoc. For decays faster than ~1/r^{3D/2} the higher-order correlation terms generated by the quantum Ising Hamiltonian lie inside the region permitted by these constraints, thereby preserving the exact algebraic decay for both measurement bases. While the manuscript derives this preservation from the interaction rules, we agree that a compact formal statement and a brief numerical check on small lattices would improve clarity. We will insert both in the revised §3. revision: partial
Referee: The figure-of-merit optimization for alternative particles (final section) is only partially carried out; no concrete example is given where a different particle choice demonstrably enlarges the simulable set beyond the cylindrical-bit case, leaving the broader applicability claim unsupported.

Authors: We concur that the final section presents only a partial optimization and does not exhibit a concrete alternative particle that enlarges the simulable set. The figure-of-merit is offered as a quantitative guide for future choices rather than as a completed demonstration. In the revision we will qualify the language to make clear that the broader-applicability claim is prospective and that identifying an improved particle remains an open direction. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is an independent exploration of a constrained model

full rationale

The paper introduces cylindrical bits via citation to prior work [6], adopts the non-free terminology from [5], and imposes spatial constraints explicitly to enforce valid probabilities. It then explores the states permitted under those constraints and reports that certain quantum Ising-like systems fall inside the resulting manifold. No equation or claim reduces the mimicry result to a fitted parameter, a self-defined equivalence, or a load-bearing self-citation whose content is merely renamed. The central assertion is presented as an outcome of the exploration rather than a tautological restatement of the model's definition or constraints. Self-citations supply background concepts but do not substitute for the analysis of which states are reproducible.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The claim rests on the postulated existence of cylindrical bits and the necessity of spatial interaction constraints to maintain valid probabilities in a non-free model; these are introduced without independent derivation.

axioms (1)

domain assumption Spatial constraints on particle interactions are required to ensure valid probabilities in the non-free cylindrical model.
Explicitly stated in the abstract as needed for the toy model.

invented entities (1)

cylindrical bits no independent evidence
purpose: To serve as the fundamental particles in a lattice-based beyond-quantum many-body system capable of mimicking quantum entanglement.
New entity defined in the paper; no external evidence or prior existence is referenced.

pith-pipeline@v0.9.0 · 5582 in / 1344 out tokens · 44447 ms · 2026-05-07T09:08:50.643764+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

77 extracted references · 15 canonical work pages · 1 internal anchor

[1]

Partition the graph into blocks of connected par- ticles
[2]

This involves creating cylinders of diﬀering radii - cylinders on the boundary of a block will have larger 12 radii dependent upon how many external interac- tions they have

Ignore internal interactions within a block, and only grow the radii on the boundary of the block to maintain a separable decomposition between blocks. This involves creating cylinders of diﬀering radii - cylinders on the boundary of a block will have larger 12 radii dependent upon how many external interac- tions they have
[3]

Now enable the internal interactions within a block again. If the resulting operators on the blocks of particles are within the dual of the allowed mea- surements (individual cylindrical measurements on each cylinder), then we will have a generalised sepa- rable decomposition over states of the blocks, which can be used for the purposes of classical simul...
[4]

[”,“]”, reserving curved brackets “(

Let P be the projector onto that measurement outcome. We are interested in the marginal state of particle B conditioned on obtaining this outcome, i.e. ρ′ B := trA{(P ⊗ I)Vφ (ρA ⊗ ρB)V− φ } tr{(P ⊗ I)Vφ (ρA ⊗ ρB)V− φ } Denotinga :=ω − θA straightforward computation leads to the following expression for ρ′ B, as a matrix in the standard |0⟩, |1⟩ basis: ρ′ ...
[5]

This shows that the decom- position (26) is invariant up to local Z-rotations, and hence we may restrict our attention to inputs to the form [1,r A, 0, ± 1] ⊗ [1,r B, 0, ± 1]

Since UA ⊗ UB commutes with Vφ and cylin- ders are invariant under Z rotations, we have the Cyl(rA), Cyl(rB)-separable decomposition: Vφ ( UAρAU † A ⊗ UBρBU † B ) V † φ = ∑ i piUAω i AU † A ⊗ UBω i BU † B where ω i k ∈ Cyl(Rk). This shows that the decom- position (26) is invariant up to local Z-rotations, and hence we may restrict our attention to inputs ...
[6]

Deﬁning Uφ := exp(−iφ/ 2)|0⟩⟨0|+ exp(iφ/ 2)|1⟩⟨1|, we have the identity Vφ (X ⊗ X) = ( UφX ⊗ UφX)Vφ

If both inputs havez = − 1, then the input extrema: [1,r A, 0, − 1] ⊗ [1,r B, 0, − 1] can be expressed as X ⊗ X ([1,r A, 0, 1] ⊗ [1,r B, 0, 1])X † ⊗ X †. Deﬁning Uφ := exp(−iφ/ 2)|0⟩⟨0|+ exp(iφ/ 2)|1⟩⟨1|, we have the identity Vφ (X ⊗ X) = ( UφX ⊗ UφX)Vφ . Applying this to (26), we arrive at: Vφ ( Xρ AX † ⊗ Xρ BX †) V † φ = ∑ i piUφXω i A(UφX)† ⊗ UφXω i B(...
[7]

Next, consider input states of the form [1,r A, 0, 1] ⊗ [1,r B, 0, − 1] and [1,r A, 0, − 1] ⊗ [1,r B, 0, 1]. (27) As Vφ is symmetric between the two input states, we can switch the control and target state, there- fore we need only consider one input extremum where the z-components are are not the same
[8]

At this stage, we have managed to reduce the inputs we need to consider to just two inputs [1,r A, 0, 1] ⊗ [1,r B, 0, ± 1]. However it will be convenient to note that because of the identity Vφ (I ⊗ X) = eiφ/ 2(Uφ ⊗ X)V− φ , checking the separability of the output correspond- ing to [1 ,r A, 0, 1] ⊗ [1,r B, 0, − 1] can instead be achieved by considering t...
[9]

fA> 1 and/or fB > 1. In this case it is impossible to be separable, because (for example) from equa- tion (30) we see that the expected value of X ⊗ I or I ⊗ X would be greater than 1, which is impossible for a separable quantum state. This means that for the output to be separable we need RA ≥ rA and RB ≥ rB
[10]

Assume that fA = 1 (if instead fB = 1 the argument is identical by sym- metry)

fA = 1 and/or fB = 1. Assume that fA = 1 (if instead fB = 1 the argument is identical by sym- metry). This means that the term ( I +fAX) ⊗ (I +fBX) has at least two zero eigenvalues, with eigenstates | − −⟩ and | − +⟩. Computing the ﬁrst of these overlaps gives: ⟨− − | c ( eiγ |00⟩⟨11|+ce− iγ |11⟩⟨00| ) | − −⟩ = c 2 cos(γ). Under our assumption that φ ̸= ...
[11]

The ﬁnal possibility is fA,f B < 1. Let us deﬁne two operators K := (I +fAX) ⊗ (I +fBX) +c (|00⟩⟨00|+ |11⟩⟨11|) and L := −c ( |00⟩⟨00|+ |11⟩⟨11| −e− iγ |00⟩⟨11| −eiγ |11⟩⟨00| ) Then we have that equation (33) can be re- expressed as: K +L as this corresponds to simply adding and subtract- ing c (|00⟩⟨00|+ |11⟩⟨11|) to equation (33). We now note that K is ...
[12]

Raussendorf and H.J

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

2001
[13]

Chiribella and R

G. Chiribella and R. W. Spekkens, eds., Quantum Theory: Informational Foundations and Foils, Springer (2016)

2016
[14]

Chiribella, G

G. Chiribella, G. M. D’Ariano, and P. Perinotti, Infor- mational derivation of Quantum Theory, Physical Review A 84, 012311 (2011); J. Barrett, Information processing in generalised probabilistic theories, Physical Review A 75 032304 (2007); L. Hardy, Quantum theory from ﬁve reasonable axioms, arXiv:quantph/ 0101012v4, 2001; R. W. Spekkens, Evidence for t...

2011
[15]

M¨ uller, M., Probabilistic Theories and Reconstructions of Quantum Theory (Les Houches 2019 lecture notes), arXiv:2011.01286; Pl´ avala, M., General probabilistic the- ories: An introduction, Phys. Rep. 1033, 1-64 (2023)

work page arXiv 2019
[16]

NPJ Quantum Inf 5, 41 (2019)

Barrett, J., de Beaudrap, N., Hoban, M.J., and Lee, C., The computational landscape of general physical theo- ries. NPJ Quantum Inf 5, 41 (2019)

2019
[17]

Atallah, M

S. Atallah, M. Garn, S. Jevtic, Y. Tao, and S. Virmani, Eﬃcient classical simulation of cluster state quantum cir- cuits with alternative inputs, Quantum 8, 1243 (2024)

2024
[18]

Barrett, S

S. Barrett, S. Bartlett, A. Doherty, D. Jennings, D. & T. Rudolph, Transitions in the computational power of thermal states for measurement-based quantum compu- tation. Physical Review A . 80, 062328 (2009)

2009
[19]

& Short, A

Browne, D., Elliott, M., Flammia, S., Merkel, S., Miyake, A. & Short, A. Phase transition of computational power in the resource states for one-way quantum computation. New Journal Of Physics . 10, 023010 (2008)

2008
[20]

& Briegel, H

Mora, C., Piani, M., Miyake, A., Van den Nest, M., D¨ ur, W. & Briegel, H. Universal resources for approx- imate and stochastic measurement-based quantum com- putation. Physical Review A . 81, 042315 (2010)

2010
[21]

Van den Nest, A

M. Van den Nest, A. Miyake, W. D¨ ur, H. J. Briegel, Uni- versal Resources for Measurement-Based Quantum Com- putation. Phys. Rev. Lett. 97, 150504 (2006)

2006
[22]

Miyake, Quantum Computation on the Edge of a Symmetry-Protected Topological Order

A. Miyake, Quantum Computation on the Edge of a Symmetry-Protected Topological Order. Phys. Rev. Lett. 105, 040501 (2010)

2010
[23]

Miller and A

J. Miller and A. Miyake, Resource Quality of a Symmetry-Protected Topologically Ordered Phase for Quantum Computation. Phys. Rev. Lett. 114, 120506 (2015)

2015
[24]

D. V. Else, I. Schwarz, S. D. Bartlett, and A. C. Doherty, Symmetry-Protected Phases for Measurement- Based Quantum Computation. Phys. Rev. Lett. 108, 240505 (2012)

2012
[25]

Raussendorf, A

R. Raussendorf, A. Prakash, D. S. Wang, T. C.Wei, D. T. Stephen, Symmetry-protected topological phases with uniform computational power in one dimension. Phys. Rev. A 96, 012302 (2017)

2017
[26]

Raussendorf, C

R. Raussendorf, C. Okay, D. S. Wang, D. T. Stephen, and H. Poulsen Nautrup, Computationally Universal Phase of Quantum Matter. Phys. Rev. Lett. 122, 090501 (2019)

2019
[27]

Gross and J

D. Gross and J. Eisert, Novel Schemes for Measurement- Based Quantum Computation. Phys. Rev. Lett. 98, 220503 (2007)

2007
[28]

Kissinger, J

A. Kissinger, J. van de Wetering, Universal MBQC with generalised parity-phase interactions and Pauli measure- ments. Quantum 3, 134 (2019)

2019
[29]

Defenu, T

N. Defenu, T. Donner, T. Macr ` ı, G Pagano, S Ruﬀo and A. Trombettoni, Long-range interacting quantum sys- tems, Rev. Mod. Phys. 95, 035002 (2023)

2023
[30]

Z-X. Gong, M. Foss-Feig, F. G. S. L. Brand˜ ao, and A. V. Gorshkov, Entanglement Area Laws for Long-Range Interacting Systems. Phys. Rev. Lett. 119, 050501 (2017). DOI: 10.1103/PhysRevLett.119.050501

work page doi:10.1103/physrevlett.119.050501 2017
[31]

M. C. Tran, C-F Chen, A. Ehrenberg, A. Y. Guo, A. Deshpande, Y. Hong, Z-X. Gong, A. V. Gorshkov, A. Lucas, Hierarchy of linear light cones with long-range interactions Phys. Rev. X 10, 031009 (2020)

2020
[32]

Barnes, P

T. Kuwahara and K. Saito Area law of noncritical ground states in 1D long-range interacting systems. Nat Com- mun 11, 4478 (2020). https://doi.org/10.1038/s41467- 020-18055-x

work page doi:10.1038/s41467- 2020
[33]

Achutha, D

R. Achutha, D. Kim, Y. Kimura, and T. Kuwuhara, Provably Eﬃcient Simulation of 1D Long-Range Interacting Systems at Any Temper- ature, Phys. Rev. Lett. 134, 190404 (2025). DOI: https://doi.org/10.1103/PhysRevLett.134.190404

work page doi:10.1103/physrevlett.134.190404 2025
[34]

D¨ ur, L

W. D¨ ur, L. Hartmann, M. Hein, M. Lewen- stein, H. J. Briegel, Entanglement in spin chains and lattices with long-range Ising-type interac- tions, Phys. Rev. Lett. 94, 097203 (2005). DOI: https://doi.org/10.1103/PhysRevLett.94.097203

work page doi:10.1103/physrevlett.94.097203 2005
[35]

Verstraete and J.I

F. Verstraete and J.I. Cirac, Valence-bond states for quantum computation. Phys. Rev. A 70, 060302(R) (2004)

2004
[36]

Aaronson and D

S. Aaronson and D. Gottesman, Improved simulation of 23 stabilizer circuits. Phys. Rev. A 70 (5): 052328, (2004)

2004
[37]

Harrow and M

A. Harrow and M. Nielsen, Robustness of quantum gates in the presence of noise. Phys. Rev. A 68, 012308 (2003)

2003
[38]

Pashayan, S Bartlett, and D

H. Pashayan, S Bartlett, and D. Gross, Quantum 4, 223 (2020)

2020
[39]

Somma, H

R. Somma, H. Barnum, G. Ortiz, and E. Knill, Eﬃcient Solvability of Hamiltonians and Limits on the Power of Some Quantum Computational Models. Phys. Rev. Lett. 97, 190501 (2006) DOI: 10.1103/PhysRevLett.97.190501

work page doi:10.1103/physrevlett.97.190501 2006
[40]

B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits. Phys. Rev. A, 65(3):032325, (2002)

2002
[41]

Jozsa and N

R. Jozsa and N. Linden, On the role of entanglement in quantum-computational speed-up. Proc. Roy. Soc. A , 459 2036 (2003)

2036
[42]

Aharonov and M

D. Aharonov and M. Ben-Or, Polynomial simula- tions of decohered quantum computers, Proceedings of 37th Conference on Foundations of Computer Sci- ence, Burlington, VT, USA, 1996, pp. 46-55, doi: 10.1109/SFCS.1996.548463

work page doi:10.1109/sfcs.1996.548463 1996
[43]

Vidal, Phys

G. Vidal, Phys. Rev. Lett. 91 147902, (2003)

2003
[44]

M. A. Nielsen, Cluster-state quantum computation. Rep. Math. Phys. 57 147–61 (2006)

2006
[45]

Yoran and A

N. Yoran and A. J. Short, Classical Simulation of Limited-Width Cluster-State Quantum Computation. Phys. Rev. Lett. 96, 170503 (2006)

2006
[46]

On the simulation of quantum circuits

Jozsa, R. On the simulation of quantum circuits. ArXiv Preprint Quant-ph/0603163. (2006)

work page arXiv 2006
[47]

Virmani, S

S. Virmani, S. F. Huelga, and M. B. Plenio, Classical simulability, entanglement breaking, and quantum com- putation thresholds. Phys. Rev. A , 71, 042328 (2005)

2005
[48]

I. L. Markov and Y. Shi, Simulating Quantum Computa- tion by Contracting Tensor Networks. SIAM Journal on Computing, 38(3):963-981, (2008)

2008
[49]

M. B. Hastings, An area law for one dimensional quan- tum systems. J. Stat. Mech. , 2007:08024, (2007)

2007
[50]

& Briegel, H

Van den Nest, M., D¨ ur, W., Vidal, G. & Briegel, H. Classical simulation versus universality in measurement- based quantum computation. Physical Review A . 75, 012337 (2007)

2007
[51]

Ratanje and S

N. Ratanje and S. Virmani, Generalized state spaces and nonlocality in fault-tolerant quantum-computing schemes. Phys. Rev. A 83 032309 (2011)

2011
[52]

Ratanje and S

N. Ratanje and S. Virmani, Exploiting non-quantum entanglement to widen applicability of limited- entanglement classical simulations of quantum systems. arXiv:1201.0613v1

work page arXiv
[53]

Anwar, S Jevtic, O

H. Anwar, S Jevtic, O. Rudolph, and S. Virmani, Families of pure PEPS with eﬃciently simulatable lo- cal hidden variable models for most measurements. arXiv:1412.3780v2

work page arXiv
[54]

Anwar, S Jevtic, O

H. Anwar, S Jevtic, O. Rudolph, and S. Virmani, Small- est disentangling state spaces for general entangled bi- partite quantum states. New J. Phys. 17 093047 (2015); H. Anwar, S Jevtic, O. Rudolph, and S. Virmani, Gen- eralised versions of separable decompositions applicable to bipartite entangled quantum states. New J. Phys. 21 093031 (2019)

2015
[55]

Barnum, E

H. Barnum, E. Knill, G. Ortiz, and L. Viola, General- izations of entanglement based on coherent states and convex sets. Phys. Rev. A 68, 032308 (2003)

2003
[56]

Coherent states, entanglement, and geometric invariant theory

A. Klyachko, Coherent States, Entanglement, and Geometric Invariant Theory,arXiv:quant-ph/0206012, (2002). DOI: 10.48550/arXiv.quant-ph/0206012

work page Pith review doi:10.48550/arxiv.quant-ph/0206012 2002
[57]

Rudolph, A separability criterion for density opera- tors, J

O. Rudolph, A separability criterion for density opera- tors, J. Phys. A: Math. Gen. 33 3951 (2000); O. Rudolph, A new class of entanglement measures, J. Math. Phys. 42 5306 (2001)

2000
[58]

R F Werner, Phys. Rev. A 40 4277 (1989)

1989
[59]

Mansﬁeld, ‘Quantum Miniatures - Quantum- like theories with limited sets of observ- ables’, PhD Thesis, University of York (2024)

A. Mansﬁeld, ‘Quantum Miniatures - Quantum- like theories with limited sets of observ- ables’, PhD Thesis, University of York (2024). https://etheses.whiterose.ac.uk/id/eprint/36125/

2024
[60]

E. P. Wigner, On the quantum correction for thermody- namic equilibrium. Phys. Rev. 40 (5): 749–759 (1932)

1932
[61]

& Raussendorf, R

Okay, C., Zurel, M. & Raussendorf, R. On the extremal points of the Λ -polytopes and classical simulation of quantum computation with magic states. ArXiv Preprint ArXiv:2104.05822. (2021)

work page arXiv 2021
[62]

& Zurel, M

Raussendorf, R., Bermejo-Vega, J., Tyhurst, E., Okay, C. & Zurel, M. Phase-space-simulation method for quan- tum computation with magic states on qubits. Physical Review A . 101, 012350 (2020)

2020
[63]

Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities

H. Pashayan, J. J. Wallman, and S. D. Bartlett, Estimat- ing Outcome Probabilities of Quantum Circuits Using Quasiprobabilities. Phys. Rev. Lett. 115, 070501 (2015). DOI: 10.1103/PhysRevLett.115.070501

work page doi:10.1103/physrevlett.115.070501 2015
[64]

& Raussendorf, R

Zurel, M., Okay, C. & Raussendorf, R. Hidden Variable Model for Universal Quantum Computation with Magic States on Qubits. Physical Review Letters . 125, 260404 (2020)

2020
[65]

E. F. Galvao, Discrete Wigner functions and quantum computational speedup. Phys. Rev. A 71, 042302 (2005) . DOI: 10.1103/PhysRevA.71.042302 ; C. Cormick, E. F. Galvao, D. Gottesman, J. P. Paz, and A. O. Pittenger, Classicality in discrete Wigner functions, Phys. Rev. A 73 012301 (2006). DOI:10.1103/PhysRevA.71.042302

work page doi:10.1103/physreva.71.042302 2005
[66]

and Rogers, J

Fortnow, L. and Rogers, J. Complexity limitations on quantum computation. J. Comput. Sys. Sci., 59(2):240–252, (1999), also at arXiv:cs/9811023v1 (1998)

work page internal anchor Pith review arXiv 1999
[67]

Broadbent, J

A. Broadbent, J. Fitzsimons & E. Kasheﬁ, Universal blind quantum computation. Proceedings of the 50th An- nual IEEE Symposium on Foundations of Computer Sci- ence (FOCS) (2009)

2009
[68]

Harrington, and K

R Raussendorf, J. Harrington, and K. Goyal, Topologi- cal fault-tolerance in cluster state quantum computation. New J. Phys. 9 199 (2007)

2007
[69]

Popescu and D

S. Popescu and D. Rohrlich, Generic quantum nonlocal- ity. Phys. Lett. A 166, 293 (1992)

1992
[70]

Peres, Separability Criterion for Density Matrices

A. Peres, Separability Criterion for Density Matrices. Phys. Rev. Lett. 77 (8): 1413 (1996); M. Horodecki, P. Horodecki, and R. Horodecki, Separability of mixed states: necessary and suﬃcient conditions. Phys. Lett. A. 223 (1–2): 1–8. (1996)

1996
[71]

Weyl, Math

H. Weyl, Math. Ann., 71 441–479 (1912)

1912
[72]

Walgate, A

J. Walgate, A. J. Short, L. Hardy, and V. Vedral, Local Distinguishability of Multipartite Orthogonal Quantum States. Phys. Rev. Lett. 85, 4972 (2000)

2000
[73]

It is possible that the example we present has already been discussed elsehwere, however, as it is a simple modiﬁcation of the approach of

Following [16] let us construct a short-range entangled state with high local purity that can support measure- ment based quantum computation. It is possible that the example we present has already been discussed elsehwere, however, as it is a simple modiﬁcation of the approach of
[74]

Consider a fault tol- erant construction native to cluster state quantum com- putation, such as [57]

we explain it for completeness. Consider a fault tol- erant construction native to cluster state quantum com- putation, such as [57]. Now replace each initial qubit |+⟩ state with a ‘bag’ of n physical qubits each prepared in 24 |ψ ⟩ := cos(θ/ 2)|0⟩ + sin(θ/ 2)|1⟩. The state |ψ ⟩⊗ n can be expressed as a sum of even and odd parity states, with amplitudes ...
[75]

Consider a general 2-qubit unitary that is diagonal in the computational basis, i.e.:     eiφ 1 0 0 0 0 eiφ 2 0 0 0 0 eiφ 3 0 0 0 0 eiφ 4     where 0 ≤ φ i ≤ 2π . Multiplying the gate by the di- agonal product unitary ( |0⟩⟨0|+e− iγ 1 |1⟩⟨1|) ⊗ (|0⟩⟨0|+ e− iγ 1 |1⟩⟨1|) gives the gate:     1 0 0 0 0 ei(φ 2− φ 1− γ 2) 0 0 0 0 ei(φ 3− φ 1− γ 1) 0...
[76]

Although it could turn out to be possible to be drop or relax this assumption, we assume a ﬁnite set of gates to adaptively choose from to make sure that the interactions between the classical controls and other cylindrical bits have bounded fan-in, as this is assumed by the classical algorithm of [26]
[77]

However this implication is not automatic for operators that can have negative eigenvalues (e.g

In ordinary quantum theory, in expressions such as σ → ((P ⊗ I)σ (P † ⊗ I))/ tr{(P ⊗ I)σ } we never concern our- selves with division by zero, because if tr {(P ⊗ I)σ } = 0, then (P ⊗ I)σ (P † ⊗ I) = 0 when all operators are positive semi-deﬁnite. However this implication is not automatic for operators that can have negative eigenvalues (e.g. con- sider t...