RESUMEN
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. Here, we show that this provides the ideal framework to understand and expand on the notion of measurement-based quantum computation (MBQC). In particular, applying a dual-unitary circuit to a many-body state followed by appropriate measurements effectively implements quantum computation in the spatial direction. We show how the dual-unitary dynamics generated by the dynamics of the paradigmatic one-dimensional kicked Ising chain with certain parameter choices generate resource states for universal deterministic MBQC. Specifically, after k time steps, equivalent to a depth-k quantum circuit, we obtain a resource state for universal MBQC on â¼3k/4 encoded qubits. Our protocol allows generic quantum circuits to be "rotated" in space-time and gives new ways to exchange between resources like qubit number and coherence time in quantum computers. Beyond the practical advantages, we also interpret the dual-unitary evolution as generating an infinite sequence of new symmetry-protected topological phases with spatially modulated symmetries, which gives a vast generalization of the well-studied one-dimensional cluster state and shows that our protocol is robust to symmetry-respecting deformations.
RESUMEN
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.
RESUMEN
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. The two protocols link quantum information processing to the classification of SPT phases of matter. They invoke the creation of a cluster state and are implemented on an IBM quantum computer. The experimental findings are compared to noisy simulations, allowing us to study the stability of topological states to perturbations and noise.
RESUMEN
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.
RESUMEN
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. A general concatenation scheme with standard quantum error-correction codes is also proposed, which can lead to better codes. Generic error-correction properties of symmetry-protected topological order are also demonstrated.
RESUMEN
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. Here we report the experimental demonstration of topological error correction with an eight-photon cluster state. We show that a correlation can be protected against a single error on any quantum bit. Also, when all quantum bits are simultaneously subjected to errors with equal probability, the effective error rate can be significantly reduced. Our work demonstrates the viability of topological error correction for fault-tolerant quantum information processing.
RESUMEN
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. We prove that these Lie groups always contain a full set of single-qubit gates, thereby affirming the long-standing conjecture that general SPT phases can serve as computationally useful phases of matter.
RESUMEN
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. Here, we establish contextuality of magic states as a necessary resource for a large class of quantum computation schemes on qubits. We illustrate our result with a concrete scheme related to measurement-based quantum computation.
RESUMEN
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. Here we present a classical analog of MBQC whose computational complexity presents a rich structure. To do so, we identify uniform families of quantum computations [refining the circuits introduced by Bremner Proc. R. Soc. A 467, 459 (2010)] whose output is likely hard to exactly simulate (sample) classically. We demonstrate that these circuit families can be efficiently implemented in the MBQC model without adaptive measurement and, thus, can be achieved in a classical analog of MBQC whose resource state is a probability distribution which has been created quantum mechanically. Such states (by definition) violate no Bell inequality, but, if widely held beliefs about computational complexity are true, they, nevertheless, exhibit nonclassicality when used as a computational resourcean imprint of their quantum origin.
RESUMEN
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.
RESUMEN
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. Moreover, computational errors induced by thermal fluctuations can be corrected and thus the computation can be executed fault tolerantly if the temperature is below a threshold value.
RESUMEN
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.
RESUMEN
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.