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

arXiv:2206.15307 · Physical Review A

Efficient verification of Affleck-Kennedy-Lieb-Tasaki states

Tianyi Chen, Yunting Li, Huangjun Zhu

Published Feb 21, 2023• 12 citations
arXivHTMLPDF

Abstract

Affleck-Kennedy-Lieb-Tasaki (AKLT) states are an important class of many-body quantum states that are useful in quantum information processing, including measurement-based quantum computation in particular. Here we propose a general approach for constructing efficient verification protocols for AKLT states on arbitrary graphs with local spin measurements. Our verification protocols build on bond verification protocols and matching covers (including edge coloring) of the underlying graphs, which have a simple geometric and graphic picture. We also provide rigorous performance guarantee that is required for practical applications. With our approach, most AKLT states of wide interest, including those defined on one- and two-dimensional lattices, can be verified with a constant sample cost, which is independent of the system size and is dramatically more efficient than all previous approaches. As an illustration, we construct concrete verification protocols for AKLT states on various lattices and on arbitrary graphs up to five vertices.

DOI
10.1103/physreva.107.022616

Related papers

Efficient Verification of Ground States of Frustration-Free Hamiltonians

Huangjun Zhu, Yunting Li, Tianyi Chen

Ground states of local Hamiltonians are of key interest in many-body physics and also in quantum information processing. Efficient verification of these states are crucial to many applications, but very challenging. Here we propose a simple, but powerful recipe for verifying the ground states of general frustration-free Hamiltonians based on local measurements. Moreover, we derive rigorous bounds on the sample complexity by virtue of the quantum detectability lemma (with improvement) and quantum union bound. Notably, the number of samples required does not increase with the system size when the underlying Hamiltonian is local and gapped, which is the case of most interest. As an application, we propose a general approach for verifying Affleck-Kennedy-Lieb-Tasaki (AKLT) states on arbitrary graphs based on local spin measurements, which requires only a constant number of samples for AKLT states defined on various lattices. Our work is of interest not only to many tasks in quantum information processing, but also to the study of many-body physics.

arXiv:2206.15292•Quantum•Jan 10, 2024•11 citations

Quantum computational universality of Affleck-Kennedy-Lieb-Tasaki states beyond the honeycomb lattice

Tzu-Chieh Wei

Universal quantum computation can be achieved by simply performing single-spin measurements on a highly entangled resource state, such as cluster states. The family of Affleck-Kennedy-Lieb-Tasaki (AKLT) states has recently been explored; for example, the spin-1 AKLT chain can be used to simulate single-qubit gate operations on a single qubit, and the spin-3/2 two-dimensional AKLT state on the honeycomb lattice can be used as a universal resource. However, it is unclear whether such universality is a coincidence for the specific state or a shared feature in all two-dimensional AKLT states. Here we consider the family of spin-3/2 AKLT states on various trivalent Archimedean lattices and show that in addition to the honeycomb lattice, the spin-3/2 AKLT states on the square octagon $(4,{8}^{2})$ and the ``cross'' $(4,6,12)$ lattices are also universal resource, whereas the AKLT state on the ``star'' $(3,{12}^{2})$ lattice is likely not due to geometric frustration.

arXiv:1306.1420•Physical Review A•Dec 5, 2013•22 citations

Quantum computational universality of Affleck-Kennedy-Lieb-Tasaki states beyond the honeycomb lattice

Tzu-Chieh Wei

Universal quantum computation can be achieved by simply performing single-spin measurements on a highly entangled resource state, such as cluster states. The family of Affleck-Kennedy-Lieb-Tasaki (AKLT) states has recently been explored; for example, the spin-1 AKLT chain can be used to simulate single-qubit gate operations on a single qubit, and the spin-3/2 two-dimensional AKLT state on the honeycomb lattice can be used as a universal resource. However, it is unclear whether such universality is a coincidence for the specific state or a shared feature in all two-dimensional AKLT states. Here we consider the family of spin-3/2 AKLT states on various trivalent Archimedean lattices and show that in addition to the honeycomb lattice, the spin-3/2 AKLT states on the square octagon $(4,{8}^{2})$ and the ``cross'' $(4,6,12)$ lattices are also universal resource, whereas the AKLT state on the ``star'' $(3,{12}^{2})$ lattice is likely not due to geometric frustration.

Bulletin of the American Physical Society•Mar 3, 2014•0 citations

Universal measurement-based quantum computation with spin-2 Affleck-Kennedy-Lieb-Tasaki states

Tzu-Chieh Wei, Robert Raussendorf

We demonstrate that the spin-2 Affleck-Kennedy-Lieb-Tasaki (AKLT) state on a square lattice is a universal resource for measurement-based quantum computation. Our proof is done by locally converting the AKLT to two-dimensional random planar graph states and by certifying that with a high probability the resulting random graphs are in the supercritical phase of percolation using Monte Carlo simulations. One key enabling point is the exact weight formula that we derive for arbitrary measurement outcomes according to a spin-2 positive operator-valued measure on all spins. We also argue that the spin-2 AKLT state on a three-dimensional diamond lattice is a universal resource, the advantage of which would be the possibility of implementing fault-tolerant quantum computation with topological protection. In addition, as we deform the AKLT Hamiltonian, there is a finite region in which the ground state can still support a universal resource before making a transition in its quantum computational power.

arXiv:1501.07571•Physical Review A•Jul 9, 2015•35 citations

Efficient adiabatic preparation of tensor network states

Zhi-Yuan Wei, Daniel Malz, J. I. Cirac

The Affleck-Kennedy-Lieb-Tasaki (AKLT) states have significant applications in condensed matter physics and quantum computation. An adiabatic path that enables the deterministic preparation of a broad range of many-body states, including AKLT states on arbitrary lattice geometries, is proposed. The numerical results on 1D and 2D AKLT states demonstrate the high efficiency of this approach.

Physical Review Research•May 22, 2023•22 citations

Two-dimensional Affleck-Kennedy-Lieb-Tasaki state on the honeycomb lattice is a universal resource for quantum computation

Tzu-Chieh Wei, Ian K. Affleck, Robert Raussendorf

Universal quantum computation can be achieved by simply performing single-qubit measurements on a highly entangled resource state. Resource states can arise from ground states of carefully designed two-body interacting Hamiltonians. This opens up an appealing possibility of creating them by cooling. The family of Affleck-Kennedy-Lieb-Tasaki (AKLT) states are the ground states of particularly simple Hamiltonians with high symmetry, and their potential use in quantum computation gives rise to a new research direction. Expanding on our prior work [T.-C. Wei, I. Affleck, and R. Raussendorf, Phys. Rev. Lett. 106, 070501 (2011)], we give a detailed analysis to explain why the spin-3/2 AKLT state on a two-dimensional honeycomb lattice is a universal resource for measurement-based quantum computation. Along the way, we also provide an alternative proof that the 1D spin-1 AKLT state can be used to simulate arbitrary one-qubit unitary gates. Moreover, we connect the quantum computational universality of 2D random graph states to their percolation property and show that these states whose graphs are in the supercritical (i.e., percolated) phase are also universal resources for measurement-based quantum computation.

arXiv:1009.2840•Physical Review A•Sep 21, 2012•51 citations
Affleck-Kennedy-Lieb-Tasaki (AKLT) states are an important class of many-body quantum states that are useful in quantum information processing, including measurement-based quantum computation in particular. Here we propose a general approach for constructing efficient verification protocols for AKLT states on arbitrary graphs with local spin measurements. Our verification protocols build on bond verification protocols and matching covers (including edge coloring) of the underlying graphs, which have a simple geometric and graphic picture. We also provide rigorous performance guarantee that is required for practical applications. With our approach, most AKLT states of wide interest, including those defined on one- and two-dimensional lattices, can be verified with a constant sample cost, which is independent of the system size and is dramatically more efficient than all previous approaches. As an illustration, we construct concrete verification protocols for AKLT states on various lattices and on arbitrary graphs up to five vertices.
Ground states of local Hamiltonians are of key interest in many-body physics and also in quantum information processing. Efficient verification of these states are crucial to many applications, but very challenging. Here we propose a simple, but powerful recipe for verifying the ground states of general frustration-free Hamiltonians based on local measurements. Moreover, we derive rigorous bounds on the sample complexity by virtue of the quantum detectability lemma (with improvement) and quantum union bound. Notably, the number of samples required does not increase with the system size when the underlying Hamiltonian is local and gapped, which is the case of most interest. As an application, we propose a general approach for verifying Affleck-Kennedy-Lieb-Tasaki (AKLT) states on arbitrary graphs based on local spin measurements, which requires only a constant number of samples for AKLT states defined on various lattices. Our work is of interest not only to many tasks in quantum information processing, but also to the study of many-body physics.
Universal quantum computation can be achieved by simply performing single-spin measurements on a highly entangled resource state, such as cluster states. The family of Affleck-Kennedy-Lieb-Tasaki (AKLT) states has recently been explored; for example, the spin-1 AKLT chain can be used to simulate single-qubit gate operations on a single qubit, and the spin-3/2 two-dimensional AKLT state on the honeycomb lattice can be used as a universal resource. However, it is unclear whether such universality is a coincidence for the specific state or a shared feature in all two-dimensional AKLT states. Here we consider the family of spin-3/2 AKLT states on various trivalent Archimedean lattices and show that in addition to the honeycomb lattice, the spin-3/2 AKLT states on the square octagon (4,82)(4,{8}^{2})(4,82) and the ``cross'' (4,6,12)(4,6,12)(4,6,12) lattices are also universal resource, whereas the AKLT state on the ``star'' (3,122)(3,{12}^{2})(3,122) lattice is likely not due to geometric frustration.
Universal quantum computation can be achieved by simply performing single-spin measurements on a highly entangled resource state, such as cluster states. The family of Affleck-Kennedy-Lieb-Tasaki (AKLT) states has recently been explored; for example, the spin-1 AKLT chain can be used to simulate single-qubit gate operations on a single qubit, and the spin-3/2 two-dimensional AKLT state on the honeycomb lattice can be used as a universal resource. However, it is unclear whether such universality is a coincidence for the specific state or a shared feature in all two-dimensional AKLT states. Here we consider the family of spin-3/2 AKLT states on various trivalent Archimedean lattices and show that in addition to the honeycomb lattice, the spin-3/2 AKLT states on the square octagon (4,82)(4,{8}^{2})(4,82) and the ``cross'' (4,6,12)(4,6,12)(4,6,12) lattices are also universal resource, whereas the AKLT state on the ``star'' (3,122)(3,{12}^{2})(3,122) lattice is likely not due to geometric frustration.
We demonstrate that the spin-2 Affleck-Kennedy-Lieb-Tasaki (AKLT) state on a square lattice is a universal resource for measurement-based quantum computation. Our proof is done by locally converting the AKLT to two-dimensional random planar graph states and by certifying that with a high probability the resulting random graphs are in the supercritical phase of percolation using Monte Carlo simulations. One key enabling point is the exact weight formula that we derive for arbitrary measurement outcomes according to a spin-2 positive operator-valued measure on all spins. We also argue that the spin-2 AKLT state on a three-dimensional diamond lattice is a universal resource, the advantage of which would be the possibility of implementing fault-tolerant quantum computation with topological protection. In addition, as we deform the AKLT Hamiltonian, there is a finite region in which the ground state can still support a universal resource before making a transition in its quantum computational power.
Universal quantum computation can be achieved by simply performing single-qubit measurements on a highly entangled resource state. Resource states can arise from ground states of carefully designed two-body interacting Hamiltonians. This opens up an appealing possibility of creating them by cooling. The family of Affleck-Kennedy-Lieb-Tasaki (AKLT) states are the ground states of particularly simple Hamiltonians with high symmetry, and their potential use in quantum computation gives rise to a new research direction. Expanding on our prior work [T.-C. Wei, I. Affleck, and R. Raussendorf, Phys. Rev. Lett. 106, 070501 (2011)], we give a detailed analysis to explain why the spin-3/2 AKLT state on a two-dimensional honeycomb lattice is a universal resource for measurement-based quantum computation. Along the way, we also provide an alternative proof that the 1D spin-1 AKLT state can be used to simulate arbitrary one-qubit unitary gates. Moreover, we connect the quantum computational universality of 2D random graph states to their percolation property and show that these states whose graphs are in the supercritical (i.e., percolated) phase are also universal resources for measurement-based quantum computation.