Quantum Physics · arXiv:2609.14757 v1 · submitted 13 Sep 2026 · 32 references
Universal computation with magic Hamiltonians
The paper says
“In the conventional theory of quantum computation, universality is discussed in terms of properties of unitary gate sets.”
more of the abstract
In many experimental setups, however, we instead have access to a parametrized set of Hamiltonians, which can be exponentiated for any desired time. Accordingly, we formulate a continuous analogue of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation. We find several concrete sets of 1- or 2-local Pauli generators S and n-qubit “magic" Hamiltonians H that together generate the full Lie algebra $\mathfrak{su}(2^n)$, with a special focus on the Ising Hamiltonian J. We propose a method to directly implement any unitary by exponentiating these generator sets, and give bounds on the needed time of application of the magic Hamiltonian H. We find that the number of applications of H needed to approximate any unitary up to accuracy ε scales exponentially in the number of qubits as expected from the standard application of the Solovay-Kitaev theorem. We also find phase transitions in the size of the generated Lie algebras as the parameters of the Ising Hamiltonian are varied. We find an algorithmic application of the Chow/Rashevskii technique to implement unitaries corresponding to iterated commutators.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 15 Sep 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions. Interesting framework with potential gaps in the heavy-lifting commutator calculations; the core idea holds up but needs tighter support. This line is wrong
4 major objections · 6 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 32 references say.
The paper says, at Proposition 3.11 and Corollary 3.13
The review did not quote this passage.
Pith says: Objection 1 of 4 · major
The extraction of individual X_kX_{k+1} and Y_kY_{k+1} from a_k = (1+γ)X_kX_{k+1} + (1-γ)Y_kY_{k+1} via double commutation with a_{k+1} is the critical step for establishing that J_{γ,λ} is magic with respect to {X_1}∪Z(2) when λ≠0 and γ∉{-1,0,1} (case 8 of Theorem 3.14).
more of objection 1
The paper merely states that [a_{k+1}, [a_k, a_{k+1}]] yields (1-γ)X_kX_{k+1}+(1+γ)Y_kY_{k+1} without showing the cancellation of the four intermediate Pauli strings. Without an explicit verification—or at least a clear reference to a supporting source—this step remains unsubstantiated. Since case 8 depends on this, the entire claim that J_{γ,λ} is magic for {X_1}∪Z(2) under the stated conditions is currently incomplete.
The paper says, at After Theorem 3.14 (phase-transition note)
The review did not quote this passage.
Pith says: Objection 2 of 4 · major
The remark states that for γ=1 the generated algebra is so(n)⊕so(n+1) and quotes dimension n(n+1)/2. However, the analysis evaluates J_{1,λ} as 2∑_j X_jX_{j+1}, silently dropping the λ∑_j Z_j term. The claimed polynomial algebra is only justified for λ=0. When λ≠0 the argument does not apply; the presence of the Z terms could change the generated algebra. This omission undermines the claimed phase transition at γ=1 and λ≠0, which is part of the paper's advertised connection to the work of Araki–Matsui.
The paper says, at Proposition 3.5
The review did not quote this passage.
Pith says: Objection 3 of 4 · major
The proof asserts that 'a simple but tedious calculation shows that for any Pauli string P∈Q_n \ {I,X^{⊗n},Y^{⊗n},Z^{⊗n}} one can make a Pauli string from X(2),Y(2),Z(2) with the same k_x,k_y,k_z' and that this implies containment of the full set. No calculation or outline is provided.
more of objection 3
Given that this result is used to determine the Lie algebra dimension and the parity constraints, it should either be carried out explicitly (e.g., in an appendix) or substantiated by a reference that contains the argument.
The paper says, at Algorithm 1 in Appendix B
The review did not quote this passage.
Pith says: Objection 4 of 4 · major
The algorithm claims to produce any Pauli string using at most O(n^3) commutators, but the cost analysis assumes the ability to generate Z_1Z_2 etc. without counting the cost of those preparatory steps. The bound 4n^3 appears plausible, but the accounting should be made rigorous and cross-checked against the subroutines described in the proof of Theorem 4.1.
6 minor objections
The paper says, at Definition 2.1
Pith says: minor objection 1 of 6
In part (ii), the notation G(P_1,...,P_m) is defined as the abstract subgroup they generate, but the following text uses the same symbol for the Lie group. Clarify the relationship between the discrete group and the connected Lie group.
The paper says, at Proposition 3.4
Pith says: minor objection 2 of 6
The statement 'The resulting Lie algebra is ⊕_{i=1}^2 so(n)' should explicitly note that the dimension is n^2−n (as later computed). The reference to [4] could be supplemented with a brief explanation of how the direct sum arises from the PauLie map.
show 4 more
The paper says, at Proposition 3.11 and Proposition 3.13
Pith says: minor objection 3 of 6
The condition n>4 is repeatedly stated without justification. Why is n=4 excluded? Is it only to avoid boundary artifacts in the commutator chains, or is there a specific failure for n=4? Provide a brief explanation.
The paper says, at Corollary 3.13, third claim
Pith says: minor objection 4 of 6
The line '⟨J_{γ,λ}∪Z(2)∪{X_1}⟩=su(2^n)' is stated for n>4. Verify that the argument does not require γ≠0 and λ≠0 simultaneously—the text says 'γ≠0 and λ≠0' but the proof sketch only mentions extracting X_kX_{k+1} and Y_kY_{k+1}. Should be consistent.
The paper says, at Theorem 5.16
Pith says: minor objection 5 of 6
The case numbering in the proof (cases 1,2,4,5,7,8,9) references Theorem 3.14 but the list does not include case 3 or 6 because they are not magic. That is fine, but the proof of case 8 should explicitly note that the result depends on the validity of the extraction step flagged in the major comments. Otherwise the bound may be conditional.
The paper says, at Various
Pith says: minor objection 6 of 6
Typos: 'assertion' instead of 'assertion' in Lemma 2.7 proof; 'resepctively' in Lemma 2.7; 'Rashveskii' in several places should be 'Rashevskii'; 'Chow/Rashevskii' in the abstract should be 'Chow–Rashevskii'. Also, reference [4] is dated 2024 and may not be peer-reviewed; consider updating if the final version has appeared.
What would settle it
Symbolically compute [a_2, a_3] and [a_3, [a_2, a_3]] for n=5, γ=2 (generic γ not in {-1,0,1}) using a Pauli algebra package. Verify that the double commutator equals exactly 4(1-γ)(1+γ)^2 X_2X_3 + 4(1+γ)(1-γ)^2 Y_2Y_3, with no admixture of X_2Z_3Y_2, Y_2Z_3X_2, or any other Pauli string. Repeat for n=4 to test whether the n>4 condition is genuine.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 15 Sep 2026
- Reader holds up, with conditions
- Skeptic agrees
- Editor wrote the verdict above
- Referee major revision: 4 major objections, 6 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
Here's my take on this one. The central idea—defining a Hamiltonian resource theory where a single 'magic' Hamiltonian plus minimal local controls generates the full Lie algebra—is genuinely new, and the concrete examples (especially the Ising Hamiltonian with {X1} ∪ Z(2) and the case 5 in Theorem 3.14) are the real contributions. The exponential lower bounds on alternating length via Szarek covering numbers are also a solid piece of work, building on existing entropy results in a clean way. The paper is self-consistent and cites external independent work (Aguilar et al., Szarek) as anchors; there's no circularity or parameter fitting.
The soft spots are real, though. The load-bearing commutator-chain calculations in Propositions 3.5 and 3.11 are asserted rather than demonstrated. The stress-test on Proposition 3.11 is fair: the double commutation that is supposed to isolate X_kX_{k+1} and Y_kY_{k+1} from ak is given as a one-liner with no verification of cancellations, and the n>4 condition is stated without justification. Since Corollary 3.13 and Theorem 3.14 case 8 depend on this step, the whole λ ≠ 0, γ ∉ {-1,0,1} regime is less solid than the rest. The phase-transition note after Theorem 3.14 also hand-waves the λ ≠ 0 boundary: at γ = 1 the lambda term is silently dropped, so the claimed so(n) ⊕ so(n+1) description is only justified at λ = 0.
That said, I don't think these flaws kill the paper's main claims. The magic Hamiltonian idea, the identification of Jγ,λ as magic for resource sets like {X1,Z_1Z2}∪Z(1) (Corollary 3.8, which does not rely on the fragile extraction in Proposition 3.11), and the exponential lower bounds are likely salvageable. The paper would benefit from a thorough rewrite of the computational sections: either provide explicit Pauli algebra proofs for the commutator chains, or cite a known combinatorial lemma that guarantees the extraction.
For a reading group, maybe—the framework is thought-provoking even if some details are pending. I wouldn't cite it in my own work until the gaps are closed, but I'd like to see it reviewed seriously. Recommendation: send to peer review, but insist that the authors either supply the missing commutator calculations (or at minimum a clear argument why the cancellations work) and clarify the phase boundary analysis.
The strongest objection
Proposition 3.11 attempts to extract individual X_kX_{k+1} and Y_kY_{k+1} from a_k = (1+γ)X_kX_{k+1} + (1-γ)Y_kY_{k+1} by double commutation with a_{k+1}. The text states: [a_k, a_{k+1}] → X_kZ_{k+1}Y_{k+2} − Y_kZ_{k+1}X_{k+2}, then [a_{k+1}, that] → (1-γ)X_kX_{k+1} + (1+γ)Y_kY_{k+1}. No explicit computation is given; the intermediate operator is a linear combination of two Pauli strings, and commutation with a_{k+1} (itself a sum of two strings) produces four terms whose coefficients must cancel to leave only the claimed two. The paper does not verify this cancellation, nor does it exclude survival of other strings (e.g., X_kZ_{k+1}X_{k+2} or Y_kZ_{k+1}Y_{k+2}). The condition n>4 is stated without justification; it may be needed to avoid boundary artifacts at k=1 or k=n-1, but the proof does not explain. Since Corollary 3.13 (λ≠0) and Theorem 3.14 case 8 depend on this extraction, the entire claim that J_{γ,λ} is magic with respect to {X_1}∪Z(2) for λ≠0, γ∉{-1,0,1} rests on this unverified step.
The reader's weakest_assumption identifies Proposition 3.11 and Corollary 3.13 as fragile. I agree that the coefficient-isolation argument is unverified and load-bearing: it directly supports both the magic status of J_{γ,λ} in case 8 and the claimed phase transition at γ∉{-1,0,1}. The concrete test would settle whether the algebra closes as claimed. The reader's CONDITIONAL verdict already accounts for this fragility, so no adjustment is necessary.
The referee's report
If the central algebraic derivations hold, the paper establishes that minimal continuous control (e.g., full control over one qubit plus global couplings) suffices for universal quantum computation, and that the cost in Hamiltonian applications is necessarily exponential in the number of qubits. The connection between computational phase transitions and operator-algebraic phase transitions (Appendix C) is conceptually interesting. The explicit algorithmic perspective on Chow-Rashevskii is a useful contribution. However, the significance is tempered by the fact that several load-bearing commutator-chain calculations are asserted without being fully verified.
Pith's reading of the paper (a machine's summary, not the authors')
The paper formulates a Hamiltonian-based notion of quantum universality, where cheap local controls (e.g., single-qubit Z rotations) are supplemented by a single expensive 'magic' Hamiltonian. It shows that for several concrete resource sets, the Ising Hamiltonian J_{γ,λ} is magic, meaning the Lie algebra it generates together with the local controls is the full su(2^n). This implies that universal quantum computation is possible with minimal control hardware. However, the paper also proves that the number of times the magic Hamiltonian must be applied to approximate an arbitrary unitary grows exponentially with the number of qubits, establishing a fundamental trade-off between control simplicity and computational cost.
What carries the argument. The central machinery is the Lie-algebraic analysis of Pauli strings: given a resource set S of Pauli strings (cheap local controls) and a magic Hamiltonian H (typically the Ising model J_{γ,λ}), the paper computes the generated Lie algebra by explicit commutator calculations. The key identity is the Pauli commutator formula [P,Q] = 2 δ_{[P,Q]≠0} PQ. The paper also uses the Chow-Rashevskii theorem to convert commutators into finite-duration evolutions, and Szarek's covering-number bounds to lower-bound the alternating approximation length.
Core claim. The central discovery is that the Ising Hamiltonian J_{γ,λ} = Σ_j [(1+γ)X_j X_{j+1} + (1-γ)Y_j Y_{j+1} + λ Z_j] acts as a 'magic' Hamiltonian: when combined with small local control sets (such as {X_1, Z_1 Z_2} together with all single-qubit Z operators), it generates the full Lie algebra su(2^n). The paper provides explicit commutator chains to show this generation and uses them to algorithmically construct any unitary via the Chow-Rashevskii construction. It also characterizes the alternating approximation length—the number of times the magic Hamiltonian must be applied—and proves it is exponential in n for all magic examples found, using Szarek's covering-number estimates.
The premise it rests on. The concrete results rely on the completeness of commutator-chain constructions that are asserted via 'a simple but tedious calculation' (Proposition 3.5) and on parameter regimes (γ∉{-1,0,1}, n>4) that are not fully justified at the boundaries, as the paper itself notes in the discussion after Theorem 3.14 where the γ=1 case is only analyzed at λ=0.
If the paper is right (Pith's inferences, not the authors')
If the paper's claims are correct, then any experimental platform that can implement a single global Ising interaction along with local single-qubit Z rotations and one or two two-qubit operations can perform universal quantum computation, albeit with an exponential overhead in the number of applications of the Ising Hamiltonian.
The phase transitions observed in the generated Lie algebra dimension as parameters γ and λ vary (e.g., polynomial to exponential growth at γ=±1) imply that precise parameter tuning is necessary to achieve universality; otherwise the generated algebra may remain polynomial and not allow universal computation.
The exponential lower bound on alternating length suggests that any universal computation using this minimal-control scheme will require a number of rounds that grows rapidly with qubit count, making practical quantum advantage unlikely with this approach alone.
The algorithmic procedure for constructing unitaries via iterated commutators provides an explicit, if inefficient, method to compile any gate into a sequence of Hamiltonian evolutions, which could be useful for near-term platforms with limited control.
The paper's demonstration that a single global Hamiltonian suffices for universality, when combined with very limited local control, could inspire alternative architectures for quantum computation where the primary resource is a naturally occurring interaction (e.g., Ising coupling in spin chains) rather than engineered multi-qubit gates. However, the exponential cost may shift the trade-off: perh
The connection to phase transitions in operator algebra (Araki-Matsui) suggests that the computational phase transition is deeply linked to properties of the ground-state manifold. This opens a question: can one characterize the 'computational phase' of a Hamiltonian (whether it is magic or not) in terms of its spectrum or correlation functions alone, without explicit Lie-algebra calculations?
The algorithmic construction (Theorem 4.1) builds any Pauli string using O(n³) commutators, but the alternating length lower bound (exponential) suggests that converting these commutators into actual evolutions via Chow-Rashevskii reintroduces exponential overhead. A tighter analysis might reveal that for specific target unitaries, the overhead is lower; the paper's bound is worst-case over all un
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
In the conventional theory of quantum computation, universality is discussed in terms of properties of unitary gate sets. In many experimental setups, however, we instead have access to a parametrized set of Hamiltonians, which can be exponentiated for any desired time. Accordingly, we formulate a continuous analogue of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation. We find several concrete sets of 1- or 2-local Pauli generators S and n-qubit “magic" Hamiltonians H that together generate the full Lie algebra $\mathfrak{su}(2^n)$, with a special focus on the Ising Hamiltonian J. We propose a method to directly implement any unitary by exponentiating these generator sets, and give bounds on the needed time of application of the magic Hamiltonian H. We find that the number of applications of H needed to approximate any unitary up to accuracy ε scales exponentially in the number of qubits as expected from the standard application of the Solovay-Kitaev theorem. We also find phase transitions in the size of the generated Lie algebras as the parameters of the Ising Hamiltonian are varied. We find an algorithmic application of the Chow/Rashevskii technique to implement unitaries corresponding to iterated commutators.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-09-23
The authors' main claim, as the classifier picked it out 0.99
“Accordingly, we formulate a continuous analogue of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation.”
How the main claim is stated: asserted 0.99
What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.81 · human participants 0.01 · controlled comparison 0.05 · randomized assignment 0.01 · states quantitative result 0.85 · compares with prior results 0.63 · mentions code or data availability 0.02
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| In the conventional theory of quantum computation, universality is discussed in terms of properties of unitary gate sets. | background 1.00 | 0.05 | 0.02 | asserted 1.00 |
| In many experimental setups, however, we instead have access to a parametrized set of Hamiltonians, which can be exponentiated for any desired time. | background 0.98 | 0.09 | 0.02 | asserted 0.93 |
| Accordingly, we formulate a continuous analogue of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation. | contribution 0.96 | 0.62 | 0.73 | asserted 0.99 |
| We find several concrete sets of 1- or 2-local Pauli generators $S$ and $n$-qubit ``magic" Hamiltonians $H$ that together generate the full Lie algebra $\mathfrak{su}(2^n)$, with a special focus on the Ising Hamiltonian $J$. | result 0.70 | 0.95 | 0.21 | asserted 1.00 |
| We propose a method to directly implement any unitary by exponentiating these generator sets, and give bounds on the needed time of application of the magic Hamiltonian $H$. | method 0.69 | 0.92 | 0.15 | asserted 0.96 |
| We find that the number of applications of $H$ needed to approximate any unitary up to accuracy $\epsilon$ scales exponentially in the number of qubits as expected from the standard application of the Solovay-Kitaev theorem. | result 1.00 | 0.94 | 0.19 | asserted 1.00 |
| We also find phase transitions in the size of the generated Lie algebras as the parameters of the Ising Hamiltonian are varied. | result 1.00 | 0.95 | 0.05 | asserted 1.00 |
| We find an algorithmic application of the Chow/Rashevskii technique to implement unitaries corresponding to iterated commutators. | contribution 0.53 | 0.90 | 0.06 | asserted 1.00 |
What kind of paper the classifier reports this is: theoretical result 0.81 · evidence from proof or derivation 0.99
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,440 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
References (32)
- [1] Sergei Bravyi and Alexei Kitaev. Universal quantum computation with ideal Clifford gates and noisy ancillas.Phys. Rev. A, 71(2):022316, 2005 on Pith
- [2] Michael A. Nielsen. A geometric approach to quantum circuit lower bounds.Quant. Inf. Comput., 6(3):213–262, 2006 on Pith
- [3] Domenico D’Alessandro and Yasemin Isik. Controllability of the periodic quantum ising spin chain and the onsager algebra.Journal of Physics A: Mathematical and Theoretical, 58(11):115202, mar 2025 on Pith
- [4] Gerard Aguilar, Simon Cichy, Jens Eisert, and Lennart Bittel. Full classification of pauli lie algebras, 2024 on Pith
- [5] P. De Fouquieres, S. G. Schirmer, S. J. Glaser, and Ilya Kuprov. Second order gradient ascent pulse engineering.Journal of Magnetic Resonance, 212(2):412–417, 10 2011. UNIVERSAL COMPUTATION WITH MAGIC HAMILTONIANS 37 on Pith
- [6] Robert de Keijzer, Oliver Tse, and Servaas Kokkelmans. Pulse based variational quantum optimal control for hybrid quantum computing.Quantum, 7:908, January 2023 on Pith
- [7] David C. McKay, Christopher J. Wood, Sarah Sheldon, Jerry M. Chow, and Jay M. Gambetta. Efficient Z gates for quantum computing.Phys. Rev. A, 96(2):022330, 2017 on Pith
- [8] Morten Kjaergaard, Mollie E Schwartz, Jochen Braum¨ uller, Philip Krantz, Joel I- J Wang, Simon Gustavsson, and William D Oliver. Superconducting qubits: Current state of play.Annual Review of Condensed Matter Physics, 13:58, 2026 on Pith
- [9] Evan McKinney, Mingkang Xia, Chao Zhou, Pinlei Lu, Michael Hatridge, and Alex K. Jones. Co-Designed Architectures for Modular Superconducting Quantum Comput- ers. InProceedings - International Symposium on High-Performance Computer Ar- chitecture, volume 2023-February, pages 7... on Pith
- [10] Lo¨ ıc Henriet, Lucas Beguin, Adrien Signoles, Thierry Lahaye, Antoine Browaeys, Georges Olivier Reymond, and Christophe Jurczak. Quantum computing with neutral atoms.Quantum, 4, 2020 on Pith
- [11] A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi.Classical and quantum computation, volume 47 ofGraduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2002. Translated from the 1999 Russian original by Lester J. Senechal on Pith
- [12] Christopher M. Dawson and Michael A. Nielsen. The solovay-kitaev algorithm.Quan- tum Info. Comput., 6(1):81–95, January 2006 on Pith
- [13] Hong-Ye Hu, Abigail McClain Gomez, Liyuan Chen, Aaron Trowbridge, Andy J. Goldschmidt, Zachary Manchester, Frederic T. Chong, Arthur Jaffe, and Susanne F. Yelin. Universal dynamics with globally controlled analog quantum simulators, 2026 on Pith
- [14] Huzihiro Araki and Taku Matsui. Ground states of theXY-model.Comm. Math. Phys., 101(2):213–245, 1985 on Pith
- [15] Wei-Liang Chow. ¨Uber systeme von liearren partiellen differentialgleichungen erster ordnung.Mathematische Annalen, 117(1):98–105, 1940 on Pith
- [16] Piotr K Rashevsky. About connecting two points of a completely nonholonomic space by admissible curve.Uch. Zapiski Ped. Inst. Libknechta, 2:83–94, 1938 on Pith
- [17] Andrew M. Childs, Yuan Su, Minh C. Tran, Nathan Wiebe, and Shuchen Zhu. Theory of Trotter Error with Commutator Scaling.Phys. Rev. X, 11(1):011020, 2021 on Pith
- [18] Stanislaw J Szarek. Metric entropy of homogeneous spaces.Quantum probability Banach Center Publications, 43:395–410, 1998 on Pith
- [19] Lars H¨ ormander. Hypoelliptic second order differential equations.Acta Mathematica, 119(none):147 – 171, 1967 on Pith
- [20] M. Takesaki.Theory of operator algebras. I, volume 124 ofEncyclopaedia of Math- ematical Sciences. Springer-Verlag, Berlin, 2002. Reprint of the first (1979) edition, Operator Algebras and Non-commutative Geometry, 5 on Pith
show 12 more
- [21] Cristina Giannotti, Andrea Spiro, and Marta Zoppello. Proving the Chow-Rashevski˘ ı Theorem ` a la Rashevski˘ ı.Hokkaido Mathematical Journal, 54(3):395 – 424, 2025. 38 UNIVERSAL COMPUTATION WITH MAGIC HAMILTONIANS on Pith
- [22] Alexander Nagel, Elias M. Stein, and Stephen Wainger. Balls and metrics defined by vector fields i: Basic properties.Acta Mathematica, 155(1):103–147, Dec 1985 on Pith
- [23] Gilles Pisier.The volume of convex bodies and Banach space geometry, volume 94 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 1989 on Pith
- [24] Masuo Suzuki. Generalized trotter’s formula and systematic approximants of expo- nential operators and inner derivations with applications to many-body problems. Communications in Mathematical Physics, 51(2):183–190, Jun 1976 on Pith
- [25] Walter H. Aschbacher and Claude-Alain Pillet. Non-equilibrium steady states of the xy chain.Journal of Statistical Physics, 112(5):1153–1175, Sep 2003 on Pith
- [26] D. J. H. Garling.Clifford algebras: an introduction, volume 78 ofLondon Mathemat- ical Society Student Texts. Cambridge University Press, Cambridge, 2011 on Pith
- [27] Huzihiro Araki and David E. Evans. On aC ∗-algebra approach to phase transition in the two-dimensional Ising model.Comm. Math. Phys., 91(4):489–503, 1983 on Pith
- [28] D. E. Evans and J. T. Lewis. On aC ∗-algebra approach to phase transition in the two-dimensional Ising model. II.Comm. Math. Phys., 102(4):521–535, 1986 on Pith
- [29] Ola Bratteli and Derek W. Robinson.Operator algebras and quantum statistical me- chanics. 2. Texts and Monographs in Physics. Springer-Verlag, Berlin, second edition, on Pith
- [30] Ola Bratteli and Derek W. Robinson.Operator algebras and quantum statistical me- chanics. 1. Texts and Monographs in Physics. Springer-Verlag, New York, second edition, 1987.C ∗- andW ∗-algebras, symmetry groups, decomposition of states on Pith
- [31] Huzihiro Araki. On theXY-model on two-sided infinite chain.Publ. Res. Inst. Math. Sci., 20(2):277–296, 1984. AppendixA.Explicit mapping fromS i toT i In Prop. 3.4, we use the properties of PauLie maps to find the resulting Lie Algebra without needing an explicit map on all Pau... on Pith
- [1997] Equilibrium states. Models in quantum statistical mechanics on Pith
Cited by 1 Pith paper
Reviewed papers on Pith that cite this one. The full citation record
- Avoiding Exponentially Large Groups with Open Quantum System Technology quant-ph · Oct 2026
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment