scholarly journals Interrelations among frustration-free models via Witten's conjugation

2021 ◽  
Vol 4 (4) ◽  
Author(s):  
Jurriaan Wouters ◽  
Hosho Katsura ◽  
Dirk Schuricht

We apply Witten’s conjugation argument [Nucl. Phys. B 202, 253 (1982)] to spin chains, where it allows us to derive frustration-free systems and their exact ground states from known results. We particularly focus on \mathbb{Z}_pℤp-symmetric models, with the Kitaev and Peschel–Emery line of the axial next-nearest neighbour Ising (ANNNI) chain being the simplest examples. The approach allows us to treat two \mathbb{Z}_3ℤ3-invariant frustration-free parafermion chains, recently derived by Iemini et al. [Phys. Rev. Lett. 118, 170402 (2017)] and Mahyaeh and Ardonne [Phys. Rev. B 98, 245104 (2018)], respectively, in a unified framework. We derive several other frustration-free models and their exact ground states, including \mathbb{Z}_4ℤ4- and \mathbb{Z}_6ℤ6-symmetric generalisations of the frustration-free ANNNI chain.

1994 ◽  
Vol 08 (25n26) ◽  
pp. 3645-3654 ◽  
Author(s):  
M.T. BATCHELOR ◽  
C.M. YUNG

Quantum spin chains with exact valence-bond ground states are of great interest in condensed-matter physics. A class of such models was proposed by Affleck et al., each of which is su(2)-invariant and constructed as a sum of projectors onto definite total spin states at neighboring sites. We propose to use the machinery of the q-deformation of su(2) to obtain generalisations of such models, and work out explicitly the two simplest examples. In one case we recover the known anisotropic spin-1 VBS model while in the other we obtain a new anisotropic generalisation of the spin-½ Majumdar-Ghosh model.


1989 ◽  
Vol 10 (7) ◽  
pp. 633-637 ◽  
Author(s):  
M Fannes ◽  
B Nachtergaele ◽  
R. F Werner

1997 ◽  
Vol 56 (14) ◽  
pp. 8799-8806 ◽  
Author(s):  
Takahiro Fukui ◽  
Norio Kawakami
Keyword(s):  

Author(s):  
Richard Jozsa ◽  
Barbara Kraus ◽  
Akimasa Miyake ◽  
John Watrous

Matchgates are an especially multiflorous class of two-qubit nearest-neighbour quantum gates, defined by a set of algebraic constraints. They occur for example in the theory of perfect matchings of graphs, non-interacting fermions and one-dimensional spin chains. We show that the computational power of circuits of matchgates is equivalent to that of space-bounded quantum computation with unitary gates, with space restricted to being logarithmic in the width of the matchgate circuit. In particular, for the conventional setting of polynomial-sized (logarithmic-space generated) families of matchgate circuits, known to be classically simulatable, we characterize their power as coinciding with polynomial-time and logarithmic-space-bounded universal unitary quantum computation.


Sign in / Sign up

Export Citation Format

Share Document