Strategies for measurement-based quantum computation with cluster states transformed by stochastic local operations and classical communication

Abstract

We examine cluster states transformed by stochastic local operations and classical communication, as a resource for deterministic universal computation driven strictly by projective measurements. We identify circumstances under which such states in one dimension constitute resources for random length single-qubit rotations, in one case quasi-deterministically (N-U-N states) and in another probabilistically (B-U-B states). In contrast to the cluster states, the N-U-N states exhibit spin correlation functions that decay exponentially with distance, while the B-U-B states can be arbitrarily locally pure. A two-dimensional square N-U-N lattice is a universal resource for quasideterministic measurement-based quantum computation. Measurements on cubic B-U-B states yield two-dimensional cluster states with bond defects, whose connectivity exceeds the percolation threshold for a critical value of the local purity.

16 pages, 6 figures

References in corpus (18)

• Novel schemes for measurement-based quantum computation
• Localizable Entanglement
• Measurement-based quantum computation beyond the one-way model
• Affleck-Kennedy-Lieb-Tasaki State on a Honeycomb Lattice is a Universal Quantum Computational Resource
• Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
• Quantum computation on the edge of a symmetry-protected topological order
• Identifying phases of quantum many-body systems that are universal for quantum computation
• Percolation, renormalization, and quantum computing with non-deterministic gates
• All Maximally Entangled Four Qubits States
• Fundamentals of universality in one-way quantum computation
• A simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation
• Ground state approximation for strongly interacting systems in arbitrary dimension
• Potential and limits to cluster state quantum computing using probabilistic gates
• Graph states as ground states of many-body spin-1/2 Hamiltonians
• Quantum computation in correlation space and extremal entanglement
• Quantum state reduction for universal measurement based computation
• A variational method based on weighted graph states
• Cluster state preparation using gates operating at arbitrary success probabilities

Cited by in corpus (1)

• Graph states as ground states of two-body frustration-free Hamiltonians