Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Solid State Communications

Derivation of spin Hamiltonians by tensor decomposition

W. J. Grant, M. W. P. Strandberg

Published Feb 1, 1964• 0 citations
Publisher
DOI
10.1016/0038-1098(64)90598-8

Related papers

Quantum spin hamiltonians: A renormalization group study

Indrani Bose, S. Chatterjee

physica status solidi (b)•May 1, 1983•0 citations

Using Higher-Order Singular Value Decomposition To Define Weakly Coupled and Strongly Correlated Clusters: The n-Body Tucker Approximation

Nicholas J. Mayhall

An approximate wave function ansatz is presented which describes low-energy states of a highly clustered molecular system as a linear combination of multiple reduced-rank tensors. Using the Tucker decomposition as a way to obtain local clusters states, the exact solution is solved for in the space spanned by a small number of states on each cluster, with complete correlation occurring between limited numbers of clusters at a time. In this initial study, we report the implementation for a Heisenberg spin Hamiltonian with numerical examples of regular grid spin lattices, and ab initio-derived spin Hamiltonians used to analyze the approximation. From these results, we find that the proposed method works well when the Hamiltonian interactions within a cluster are larger than between a cluster, and when this is not true, the method is not effective.

Journal of Chemical Theory and Computation•Aug 22, 2017•17 citations

Basics of Quantum Spin Systems

Hal Tasaki

Graduate texts in physics•Jan 1, 2020•1 citation

An alternative formulation of the quantum phase estimation using projection-based tensor decompositions

Marian Stengl

Abstract In this paper, an alternative version of the quantum phase estimation is proposed, in which the Hadamard gates at the beginning are substituted by a quantum Fourier transform. This new circuit coincides with the original one, when the ancilla is initialized with $$\left| {0}\right\rangle $$ 0 . With the help of a projection-based tensor decomposition and closed-form expressions of its exponential, this new method can be interpreted as a multiplier coupled to the Hamiltonian of the corresponding target unitary operator. Based on this observation, a recursive decomposition is derived.

arXiv:2303.05894•Quantum Information Processing•Apr 9, 2024•1 citation

H2ZIXY: Pauli spin matrix decomposition of real symmetric matrices

Rocco Monteiro Nunes Pesce, P. D. Stevenson

We present a code in Python3 which takes a square real symmetric matrix, of arbitrary size, and decomposes it as a tensor product of Pauli spin matrices. The application to the decomposition of a Hamiltonian of relevance to nuclear physics for implementation on quantum computer is given.

arXiv:2111.00627•Oct 31, 2021•18 citations

Derivation of a Matrix Product Hamiltonian

Amit Dutta, G. Aeppli, Bikas K. Chakrabarti +3 more

Cambridge University Press eBooks•Jan 28, 2015•0 citations
An approximate wave function ansatz is presented which describes low-energy states of a highly clustered molecular system as a linear combination of multiple reduced-rank tensors. Using the Tucker decomposition as a way to obtain local clusters states, the exact solution is solved for in the space spanned by a small number of states on each cluster, with complete correlation occurring between limited numbers of clusters at a time. In this initial study, we report the implementation for a Heisenberg spin Hamiltonian with numerical examples of regular grid spin lattices, and ab initio-derived spin Hamiltonians used to analyze the approximation. From these results, we find that the proposed method works well when the Hamiltonian interactions within a cluster are larger than between a cluster, and when this is not true, the method is not effective.
Abstract In this paper, an alternative version of the quantum phase estimation is proposed, in which the Hadamard gates at the beginning are substituted by a quantum Fourier transform. This new circuit coincides with the original one, when the ancilla is initialized with ∣0⟩\left| {0}\right\rangle ∣0⟩ 0 . With the help of a projection-based tensor decomposition and closed-form expressions of its exponential, this new method can be interpreted as a multiplier coupled to the Hamiltonian of the corresponding target unitary operator. Based on this observation, a recursive decomposition is derived.