Recently, it was shown that the non-local correlations needed for measurement-based quantum computation (MBQC) can be revealed in the ground state of the Affleck–Kennedy–Lieb–Tasaki (AKLT) model involving nearest-neighbour spin-3/2 interactions on a honeycomb lattice. This state is not singular but resides in the disordered phase of the ground states of a large family of Hamiltonians characterized by short-range-correlated valence bond solid states. By applying local filtering and adaptive single-particle measurements, we show that most states in the disordered phase can be reduced to a graph of correlated qubits that is a scalable resource for MBQC. At the transition between the disordered and Néel ordered phases, we find a transition from universal to non-universal states as witnessed by the scaling of percolation in the reduced graph state.
Recently, it was shown that the non-local correlations needed for measurement-based quantum computation (MBQC) can be revealed in the ground state of the Affleck–Kennedy–Lieb–Tasaki (AKLT) model involving nearest-neighbour spin-3/2 interactions on a honeycomb lattice. This state is not singular but resides in the disordered phase of the ground states of a large family of Hamiltonians characterized by short-range-correlated valence bond solid states. By applying local filtering and adaptive single-particle measurements, we show that most states in the disordered phase can be reduced to a graph of correlated qubits that is a scalable resource for MBQC. At the transition between the disordered and Néel ordered phases, we find a transition from universal to non-universal states as witnessed by the scaling of percolation in the reduced graph state.
The framework of measurement-based quantum computation (MBQC) allows us to view the ground states of local Hamiltonians as potential resources for universal quantum computation. A central goal in this field is to find models with ground states that are universal for MBQC and that are also natural in the sense that they involve only two-body interactions and have a small local Hilbert space dimension. Graph states are the original resource states for MBQC, and while it is not possible to obtain graph states as exact ground states of two-body Hamiltonians here we construct two-body frustration-free Hamiltonians that have arbitrarily good approximations of graph states as unique ground states. The construction involves taking a two-body frustration-free model that has a ground state convertible to a graph state with stochastic local operations, then deforming the model such that its ground state is close to a graph state. Each graph state qubit resides in a subspace of a higher dimensional particle. This deformation can be applied to two-body frustration-free Affleck-Kennedy-Lieb-Tasaki (AKLT) models, yielding Hamiltonians that are exactly solvable with exact tensor network expressions for ground states. For the star-lattice AKLT model, the ground state of which is not expected to be a universal resource for MBQC, applying such a deformation appears to enhance the computational power of the ground state, promoting it to a universal resource for MBQC. Transitions in computational power, similar to percolation phase transitions, can be observed when Hamiltonians are deformed in this way. Improving the fidelity of the ground state comes at the cost of a shrinking gap. While analytically proving gap properties for these types of models is difficult in general, we provide a detailed analysis of the deformation of a spin-1 AKLT state to a linear graph state.
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.
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.
One-way quantum computation was first invented using the cluster state. Since then graph states, the generalization of the cluster state, were investigated and understood when they would enable such a measurement-based approach for quantum computation. Are there any other family of states, i.e., states with different entanglement structures, that can also serve as the universal resource for quantum computation? Recent study shows that the Affleck-Kennedy-Lieb-Tasaki (AKLT) states also provide a useful source. Here, we show that the spin-2 state on the square lattice is a universal resource for measurement-based quantum computation. We employ a POVM on all sites that convert the local 5-level system to 2-level, and the post-POVM state is a graph state, whose graph is in general non-planar. We then follow with another round of measurement to recover the planarity of the graphs by thinning. The resultant typical graphs are shown to reside in the supercritical phase of percolation via Monte Carlo simulations and the associated graph states are universal, implying the AKLT state is also universal.
Measurement-based quantum computation can achieve universal quantum computation via simply performing single-qubit measurements alone on an entangled resource state. Instead of the canonical resource state–cluster state, we pay great attention to another resource state, the Affleck–Kennedy–Lieb–Tasaki (AKLT) state, which is a nondegenerate ground state of a nearest-neighbor two-body interaction Hamiltonian. We propose an optical scheme to generate a two-dimensional AKLT state defined on the honeycomb lattice. In our proposal, three photons from different singlet states are projected onto a spin-32 particle comprising the AKLT state with maximum success probability 38. We also show the controlled-NOT gate can be implemented on this photonic AKLT state via projective measurement using linear optics and photodetection.
Measurement-based quantum computation (MBQC) performs quantum algorithms by local, adaptive measurements on an initially entangled many-body "resource" state. This thesis investigates MBQC through two tightly coupled lenses: (i) which physical states and phases of matter constitute universal resources, and (ii) how the temporal order induced by measurement adaptivity constrains and, in turn, is constrained by those resources. Resources from valence-bond constructions. We develop hybrid AKLT-type (valence-bond) resources on two-dimensional lattices and show how a generalized POVM reduces higher-spin degrees of freedom to effective qubits while preserving computational viability. We analyze worst-case and frustrated geometries (e.g., kagome and decorated lattices), identify planarity-restoring local operations, and use percolation-style diagnostics on the induced graph states to certify universality beyond idealized cluster-state settings. A two-parameter phase with noisy POVMs. Extending ground states across a phase connected to the AKLT point, we introduce a measurement-noise–aware framework with probabilistic restoration and closed-form weight formulae derived via a graphical (g-)calculus. Large-scale numerics that account for correlations map a two-parameter phase diagram and delineate regimes of universal vs. non-universal post-measurement graphs. These results exhibit a robust universal region that persists away from ideal measurements and clarify how noise and Hamiltonian deformation jointly control computational power. Temporal order and determinism. We develop a stabilizer-and-influence-matrix formalism that places temporal dependencies on the same footing as resource structure. Four theorems establish a two-way determination between (a) the classical processing relations (including the influence matrix that generates the partial order of measurements) and (b) the resource stabilizer in a normal form, up to local equivalence. This links gauge freedoms, byproduct handling, and flow/gflow–style constraints into a unified picture of when adaptive measurement schedules yield deterministic computation. Together, these contributions clarify when physically motivated ground states serve as universal MBQC resources under realistic measurement noise, and how temporal constraints fundamentally shape the space of admissible computations in MBQC.