Counterintuitive Yet Efficient Regimes for Measurement-Based Quantum Computation on Symmetry-Protected Spin Chains.

Quantum states picked from nontrivial symmetry-protected topological (SPT) phases have computational power in measurement-based quantum computation. This power is uniform across SPT phases, and is unlocked by measurements that break the symmetry. Except at special points in the phase, all computational schemes known to date place these symmetry-breaking measurements far apart, to avoid the correlations introduced by spurious, nonuniversal entanglement.

Universal Measurement-Based Quantum Computation in a One-Dimensional Architecture Enabled by Dual-Unitary Circuits.

A powerful tool emerging from the study of many-body quantum dynamics is that of dual-unitary circuits, which are unitary even when read "sideways," i.e., along the spatial direction.

Hidden Variable Model for Universal Quantum Computation with Magic States on Qubits.

We show that every quantum computation can be described by a probabilistic update of a probability distribution on a finite phase space. Negativity in a quasiprobability function is not required in states or operations. Our result is consistent with Gleason's theorem and the Pusey-Barrett-Rudolph theorem.

Identification of Symmetry-Protected Topological States on Noisy Quantum Computers.

Identifying topological properties is a major challenge because, by definition, topological states do not have a local order parameter. While a generic solution to this challenge is not available yet, a broad class of topological states, namely, symmetry-protected topological (SPT) states, can be identified by distinctive degeneracies in their entanglement spectrum. Here, we propose and realize two complementary protocols to probe these degeneracies based on, respectively, symmetry-resolved entanglement entropies and measurement-based computational algorithms.

Computationally Universal Phase of Quantum Matter.

We provide the first example of a symmetry protected quantum phase that has universal computational power. This two-dimensional phase is protected by one-dimensional linelike symmetries that can be understood in terms of the local symmetries of a tensor network. These local symmetries imply that every ground state in the phase is a universal resource for measurement-based quantum computation.

Topological Qubits from Valence Bond Solids.

Topological qubits based on SU(N)-symmetric valence-bond solid models are constructed. A logical topological qubit is the ground subspace with twofold degeneracy, which is due to the spontaneous breaking of a global parity symmetry. A logical Z rotation by an angle 2π/N, for any integer N>2, is provided by a global twist operation, which is of a topological nature and protected by the energy gap.

Contextuality as a Resource for Models of Quantum Computation with Qubits.

A central question in quantum computation is to identify the resources that are responsible for quantum speed-up. Quantum contextuality has been recently shown to be a resource for quantum computation with magic states for odd-prime dimensional qudits and two-dimensional systems with real wave functions. The phenomenon of state-independent contextuality poses a priori an obstruction to characterizing the case of regular qubits, the fundamental building block of quantum computation.

Computational Power of Symmetry-Protected Topological Phases.

We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order as resources for measurement-based quantum computation (MBQC). We show that, for a wide range of SPT phases, the computational power of ground states is uniform throughout each phase. This computational power, defined as the Lie group of executable gates in MBQC, is determined by the same algebraic information that labels the SPT phase itself.

Measurement-based classical computation.

Measurement-based quantum computation (MBQC) is a model of quantum computation, in which computation proceeds via adaptive single qubit measurements on a multiqubit quantum state. It is computationally equivalent to the circuit model. Unlike the circuit model, however, its classical analog is little studied.

Key ideas in quantum error correction.

In this introductory article on the subject of quantum error correction and fault-tolerant quantum computation, we review three important ingredients that enter known constructions for fault-tolerant quantum computation, namely quantum codes, error discretization and transversal quantum gates. Taken together, they provide a ground on which the theory of quantum error correction can be developed and fault-tolerant quantum information protocols can be built.

Experimental demonstration of topological error correction.

Scalable quantum computing can be achieved only if quantum bits are manipulated in a fault-tolerant fashion. Topological error correction--a method that combines topological quantum computation with quantum error correction--has the highest known tolerable error rate for a local architecture. The technique makes use of cluster states with topological properties and requires only nearest-neighbour interactions.

Thermal states as universal resources for quantum computation with always-on interactions.

Measurement-based quantum computation utilizes an initial entangled resource state and proceeds with subsequent single-qubit measurements. It is implicitly assumed that the interactions between qubits can be switched off so that the dynamics of the measured qubits do not affect the computation. By proposing a model spin Hamiltonian, we demonstrate that measurement-based quantum computation can be achieved on a thermal state with always-on interactions.

Affleck-Kennedy-Lieb-Tasaki state on a honeycomb lattice is a universal quantum computational resource.

Universal quantum computation can be achieved by simply performing single-qubit measurements on a highly entangled resource state, such as cluster states. The family of Affleck-Kennedy-Lieb-Tasaki states has recently been intensively explored and shown to provide restricted computation. Here, we show that the two-dimensional Affleck-Kennedy-Lieb-Tasaki state on a honeycomb lattice is a universal resource for measurement-based quantum computation.

Fault-tolerant quantum computation with high threshold in two dimensions.

We present a scheme of fault-tolerant quantum computation for a local architecture in two spatial dimensions. The error threshold is 0.75% for each source in an error model with preparation, gate, storage, and measurement errors.