arXiv subjects

Robert Raussendorf

Publications and source records attributed to Robert Raussendorf.

At least 55 records · Page 3Linked to original sources

arXiv2017

Qudit quantum computation on matrix product states with global symmetry

Resource states that contain nontrivial symmetry-protected topological order are identified for universal single-qudit measurement-based quantum computation. Our resource states fall into two classes: one as the qudit generalizations of the 1D qubit cluster state, and the other as the higher-symmetry generalizations of the spin-1 Affleck-Kennedy-Lieb-Tasaki (AKLT) state, namely, with unitary, orthogonal, or symplectic symmetry. The symmetry in cluster states protects information propagation (identity gate), while the higher symmetry in AKLT-type states enables nontrivial gate computation. This work demonstrates a close connection between measurement-based quantum computation and symmetry-protected topological order.

quant-ph↗

arXiv2016

Equivalence between contextuality and negativity of the Wigner function for qudits

Contextuality and negativity of the Wigner function are two notions of non-classicality for quantum systems. Howard, Wallman, Veitch and Emerson proved recently that these two notions coincide for qudits in odd prime dimension. This equivalence is particularly important since it promotes contextuality as a ressource that magic states must possess in order to allow for a quantum speed-up. We propose a simple proof of the equivalence between contextuality and negativity of the Wigner function based on character theory. This simplified approach allows us to generalize this equivalence to multiple qudits and to any qudit system of odd local dimension.

quant-ph↗

arXiv2016

Symmetry-protected topological phases with uniform computational power in one dimension

We investigate the usefulness of ground states of quantum spin chains with symmetry-protected topological order (SPTO) for measurement-based quantum computation. We show that, in spatial dimension one, if an SPTO phase supports quantum wire, then, subject to an additional symmetry condition that is satisfied in all cases so far investigated, it can also be used for quantum computation.

quant-ph↗

arXiv2015

Topos logic in measurement-based quantum computation

We report first steps towards elucidating the relationship between contextuality, measurement-based quantum computation (MBQC) and the non-classical logic of a topos associated with the computation. We show that, in a class of MBQC, classical universality requires non-classical logic, which is 'consumed' during the course of the computation, thereby pinpointing another potential quantum computational resource.

quant-ph↗

arXiv2015

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

We demonstrate that the spin-2 Affleck-Kennedy-Lieb-Tasaki (AKLT) state on the square lattice is a universal resource for the 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 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 POVM on all spins. We also argue that the spin-2 AKLT state on the 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 that the ground state can still support a universal resource before making a transition in its quantum computational power.

quant-ph↗

arXiv2015

Wigner function negativity and contextuality in quantum computation on rebits

We describe a universal scheme of quantum computation by state injection on rebits (states with real density matrices). For this scheme, we establish contextuality and Wigner function negativity as computational resources, extending results of [M. Howard et al., Nature 510, 351--355 (2014)] to two-level systems. For this purpose, we define a Wigner function suited to systems of $n$ rebits, and prove a corresponding discrete Hudson's theorem. We introduce contextuality witnesses for rebit states, and discuss the compatibility of our result with state-independent contextuality.

quant-ph↗

arXiv2015

Hybrid valence-bond states for universal quantum computation

The spin-3/2 Affleck-Kennedy-Lieb-Tasaki (AKLT) valence-bond state on the hexagonal lattice was shown to be a universal resource state for measurement-based quantum computation (MBQC). Can AKLT states of higher spin magnitude support universal MBQC? We demonstrate that several hybrid 2D AKLT states involving mixture of spin-2 and other lower-spin entities, such as spin-3/2 and spin-1, are also universal for MBQC. This significantly expands universal resource states in the AKLT family. Even though frustration may be a hinderance to quantum computational universality, lattices can be modified to yield AKLT states that are universal. The family of AKLT states thus provides a versatile playground for quantum computation.

quant-ph↗

arXiv2014

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 multi-qubit 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, Jozsa and Shepherd in Proc. R. Soc. A 467, 459 (2011)) 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 nevertheless exhibit non-classicality when used as a computational resource - an imprint of their quantum origin.

quant-ph↗

arXiv2014

Generalized parity proofs of the Kochen-Specker theorem

We discuss two approaches to producing generalized parity proofs of the Kochen-Specker theorem. Such proofs use contexts of observables whose product is $I$ or $-I$; we call them constraints. In the first approach, one starts with a fixed set of constraints and methods of linear algebra are used to produce subsets that are generalized parity proofs. Coding theory methods are used for enumeration of the proofs by size. In the second approach, one starts with the combinatorial structure of the set of constraints and one looks for ways to suitably populate this structure with observables. As well, we are able to show that many combinatorial structures can not produce parity proofs.

quant-ph↗

arXiv2013

Contextuality in Measurement-based Quantum Computation

We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a non-linear Boolean function with high probability are contextual. The class of contextual MBQCs includes an example which is of practical interest and has a super-polynomial speedup over the best known classical algorithm, namely the quantum algorithm that solves the Discrete Log problem.

quant-ph↗

arXiv2012

Classical simulation of measurement-based quantum computation on higher-genus surface-code states

We consider the efficiency of classically simulating measurement-based quantum computation on surface-code states. We devise a method for calculating the elements of the probability distribution for the classical output of the quantum computation. The operational cost of this method is polynomial in the size of the surface-code state, but in the worst case scales as $2^{2g}$ in the genus $g$ of the surface embedding the code. However, there are states in the code space for which the simulation becomes efficient. In general, the simulation cost is exponential in the entanglement contained in a certain effective state, capturing the encoded state, the encoding and the local post-measurement states. The same efficiencies hold, with additional assumptions on the temporal order of measurements and on the tessellations of the code surfaces, for the harder task of sampling from the distribution of the computational output.

quant-ph↗

arXiv2012

The 2D AKLT state on the honeycomb lattice is a universal resource for quantum computation

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 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.

quant-ph↗

arXiv2012

Quantum computation by local measurement

Quantum computation is a novel way of information processing which allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit and measurement-based models. They have been proven equivalent in their computational power, but operate very differently. As such, they may be suitable for realization in different physical systems, and also offer different perspectives on open questions such as the precise origin of the quantum speedup. Here, we give an introduction to the one-way quantum computer, a scheme of measurement-based quantum computation. In this model, the computation is driven by local measurements on a carefully chosen, highly entangled state. We discuss various aspects of this computational scheme, such as the role of entanglement and quantum correlations. We also give examples for ground states of simple Hamiltonians which enable universal quantum computation by local measurements.

quant-ph↗

arXiv2012

Experimental demonstration of topological error correction

Topological error correction--a novel method to actively correct errors based on cluster states with topological properties--has the highest order of tolerable error rates known to date (10^{-2}). Moreover, the scheme requires only nearest-neighbour interaction, particularly suitable for most physical systems. Here we report the first experimental demonstration of topological error correction with an 8-qubit optical cluster state. In the experiment, it is shown that a correlation can be protected against a single error on any single qubit. In addition, when all qubits are simultaneously subjected to errors with equal probability, the effective error rate is significantly reduced, clearly verifying the advantage of topological error correction. The quantum gate with the error rate below the threshold is within the current experimental technology. We believe topological error correction should be a critical ingredient for the future large-scale quantum computation.

quant-ph↗

arXiv2012

Experimental demonstration of topological error correction

Scalable quantum computing can only be achieved if qubits are manipulated fault-tolerantly. Topological error correction - a novel method which combines topological quantum computing and quantum error correction - possesses the highest known tolerable error rate for a local architecture. This scheme makes use of cluster states with topological properties and requires only nearest-neighbour interactions. Here we report the first experimental demonstration of topological error correction with an eight-photon cluster state. It is shown that a correlation can be protected against a single error on any qubit, and when all qubits are simultaneously subjected to errors with equal probability, the effective error rate can be significantly reduced. This demonstrates the viability of topological error correction. Our work represents the first experimental effort to achieve fault-tolerant quantum information processing by exploring the topological properties of quantum states.

quant-ph↗

arXiv2012

Quantum computational universality of the Cai-Miyake-Dür-Briegel 2D quantum state from Affleck-Kennedy-Lieb-Tasaki quasichains

Universal quantum computation can be achieved by simply performing single-qubit measurements on a highly entangled resource state, such as cluster states. Cai, Miyake, Dür, and Briegel recently constructed a ground state of a two-dimensional quantum magnet by combining multiple Affleck-Kennedy-Lieb-Tasaki quasichains of mixed spin-3/2 and spin-1/2 entities and by mapping pairs of neighboring spin-1/2 particles to individual spin-3/2 particles [Phys. Rev. A 82, 052309 (2010)]. They showed that this state enables universal quantum computation by single-spin measurements. Here, we give an alternative understanding of how this state gives rise to universal measurement-based quantum computation: by local operations, each quasichain can be converted to a 1D cluster state and entangling gates between two neighboring logical qubits can be implemented by single-spin measurements. We further argue that a 2D cluster state can be distilled from the Cai-Miyake-Dür-Briegel state.

quant-ph↗

arXiv2011

Efficient Decoding of Topological Color Codes

Color codes are a class of topological quantum codes with a high error threshold and large set of transversal encoded gates, and are thus suitable for fault tolerant quantum computation in two-dimensional architectures. Recently, computationally efficient decoders for the color codes were proposed. We describe an alternate efficient iterative decoder for topological color codes, and apply it to the color code on hexagonal lattice embedded on a torus. In numerical simulations, we find an error threshold of 7.8% for independent dephasing and spin flip errors.

quant-ph↗

arXiv2011

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. 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.

quant-ph↗