Contact
Research Areas

extra space space space space more space 
Symmetry, Phases of Matter, and Resources in Quantum Computing (with Robert Raussendorf, Physics) [Posted: 09/01/19]. Areas of interest include magic state distilliation, extensions of the Pauli stabilizer formalism, measurementbased quantum computation and symmetryproteced topological order.
This position is part of the collaborative quantum projects initiative supported by the Canada First Research Excellence Fund (CFREF). It is a joint project between the Universty of Sherbrooke, UBC and the University of Waterloo (IQC). Interaction with the other sites is strongly enocouraged.
Applications and inquiries should be sent to Robert Raussendorf.
Algebraic methods in quantum computing (supervised by Ian Affleck and Robert Raussendorf) [Posted: 09/01/19] Development of novel methods for mapping Fermionic systems to bosons, and/or Classification of measurementbased quantum computation within the framework of symmetry protected topological order.
Candidates should have a background in both quantum information and condensed matter physics; the former covering computational models such as circuit, measurementbased, adiabatic and topological, plus quantum error correction and the stabilizer formalism. The latter should cover fermionic systems and symmetryprotectedtopological order, and topological order.
This position is located at the Stuart Blusson Quantum Matter Institute at UBC, and is part of the QMI Grand Challenge "Pushing the Boundaries of NISQera Quantum Computing by Quantum Materials Problems". Visit this site for more information.
4 additional postdoc positions in NISCera quantum computation [Posted: 09/01/19]. These positions are located at the Stuart Blusson Quantum Matter Institute at UBC, and are part of the QMI Grand Challenge "Pushing the Boundaries of NISQera Quantum Computing by Quantum Materials Problems". Visit this site for more information.
My research interest is in quantum computation, in particular computational models, quantum faulttolerance and foundational aspects. I have invented the oneway quantum computer (QCc) jointly with Hans Briegel (UK patent GB 2382892, US patent 7,277,872). The QCc is a scheme of universal quantum computation by local measurements on a multiparticle entangled quantum state, the socalled cluster state. Quantum information is written into the cluster state, processed and read out by onequbit measurements only. As the computation proceeds, the entanglement in the resource cluster state is progressively destroyed. Measurements replace unitary evolution as the elementary process driving a quantum computation.
sp 
The oneway quantum computer (QCc): A universal resource for the QCc is the cluster state, a highly entangled multqubit quantum state that can be easily generated unitarily by the Ising interaction on a square lattice. In the figure to the left, the qubits forming the cluster state are represented by dots and arrows. The symbol used indicates the basis of local measurement. Dots represent cluster qubits measured in the eigenbasis of the Pauli operator Z, arrows denote measurement in a basis in the equator of the Bloch sphere. The pattern of measurement bases can be regarded as representing a quantum circuit, i.e., the "vertical" direction on the cluster specifies the location of a logical qubit in a quantum register, and the "horizontal" direction on the cluster represents circuit time. However, this simple picture should be taken with a grain of salt: The optimal temporal order of measurements has very little to do with the temporal sequence of gates in the corresponding circuit. 
I also work in the field of faulttolerant quantum computation. Errorcorrection is what a largescale quantum computer spends most of its computation time with, and it is important to devise errorcorrection methods which allow for a high error threshold at a moderate operational overhead. My research interest is in faulttolerance for quantum systems with a geometrical constraint, e.g. lowdimensional lattice systems, and in topological methods.
With my collaborators Jim Harrington and Kovid Goyal, I have presented a faulttolerant oneway quantum computer [arXiv:quantph/0510135], and have described a method for faulttolerant quantum computation in a twodimensional lattice of qubits requiring local and translationinvariant nearestneighbor interaction only [arXiv:quantph/0610082], [arXiv:quantph/0703143]. For our method, we have obtained by far the highest known threshold for a twodimensional architecture with nearestneighbor interaction, namely 0.75 percent. A high value of the error threshold is important for realization of faulttolerant quantum computation because it relaxes the accuracy requirements of the experiment. The imposed constraint of nearestneighbor interaction in a twodimensional qubit array is suggested by experimental reality: Many physical systems envisioned for the realization of a quantum computer are confined to two dimensions and prefer shortrange interaction, for example optical lattices, arrays of superconducting qubits and quantum dots.

sp 
Faulttolerant topological CNOTgate: Holes puncture a the surface of a Kitaev's surface code, creating pieces of boundary. Each pair of holes gives rise to an encoded qubit. There are two types of holes and hence qubits, primal and dual. The CNOTgate is implemented by moving two holes around another, one being primal and the other dual. Also shown is the string corresponding to an encoded Pauli operator X on the control qubit and its evolution from the initial to the final codes surface. As expected for conjugation under the CNOT, X_c evolves into X_c X_t. The CNOT in the opposite direction  the primal qubit being the target and the dual qubit being the control  is also possible. It requires pairwise insertion and removal of holes from the code surface, i.e., the topology of the code surface for that gate changes with time. 
TzuChieh Wei, Ian Affleck, Robert Raussendorf, The 2D AKLT state is a universal quantum computational resource, Phys. Rev. Lett. 106, 070501 (2011).
R. Raussendorf and J. Harrington, Faulttolerant quantum computation with high threshold in two dimensions, arXiv:quantph/0610082, Phys. Rev. Lett. 98, 150504 (2007).
R. Raussendorf and H.J. Briegel, Computational model underlying the oneway quantum computer, arXiv:quantph/0108067, Quant. Inf. Comp. 6, 443 (2002).
R. Raussendorf and H.J. Briegel, A oneway quantum computer, Phys. Rev. Lett. 86, 5188 (2001).
A computationally universal phase of quantum matter [Published March 4, 2019] We provide the first example of a symmetry protected quantum phase that has universal computational power. This twodimensional phase is protected by onedimensional linelike symmetries that can be understood in terms of 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.
In the presence of symmetry, quantum phases of matter can have computational power. The important property is that the computational power is uniform. It does not depend on the precise choice of the state within the phase, and is thus a property of the phase itself. In this way, phases of quantum matter acquire a computational characterization and computational value.
Quantum computational power of physical phases is utilized by measurement based quantum computation (MBQC), where the process of computation is driven by local measurements on an initial entangled state. Here, we consider initial states that originate from symmetry protected topological phases. Work on the usefulness of SPT phases of matter for MBQC have to date been focussed on spatial dimension 1. Computationally, physical phases in dimension 2 and higher are more interesting than in dimension 1. The reason is that, in MBQC, one spatial dimension plays the role of circuit model time. Therefore, MBQC in dimension D corresponds to the circuit model in dimension D1, and universal MBQC is possible only in D >=2.
Here, we prove the existence of a computationally universal phase of quantum matter in spatial dimension two. The phase we consider is protected by onedimensional linelike symmetries, generalizing the conventional notion of symmetry protected topological order defined by global onsite symmetries. As in the case of global symmetries, these line symmetries can be built from the local symmetries of a tensor network which persist throughout the phase. Using this, we establish that computational universality persists throughout the entire phase.
sp 
Symmetry Lego. Ground states throughout the whole cluster states have an enhanced symmetry, and the functioning of MBQC is based on it. This symmetry is best under stood in terms of tensor networks. (a) Tensor network representing an MBQC resource state in the 2D cluster phase. Every local tensor represents one physical spin 1/2 particle. (b) Throughout the cluster phase, each local tensor is invariant under a number of symmetries. These symmetries form the backbone of measurementbased computation in the cluster phase, as is illustrated in Figs. (c) and (d). (c) The symmetries shown in (b) are composed into a larger pattern propagating a logical Zoperator forward in time. The area shown represents the ``clock cycle'' of the compution. If all physical qubits shown are measured in the Xeigenbasis, the resulting operation is the logical identity (computational wire). (d) If the qubit marked by the doubleheaded arrow is measured off the Xbasis, the result is an entangling gate. Again, the functioning of the gate can be understood in terms of the tensor symmetries shown in (b). 
Journal References:
R. Raussendorf, C. Okay, D.S. Wang, D.T. Stephen, H. Poulsen Nautrup, A computationally universal quantum phase of matter, Phys. Rev. Lett. 122, 090501 (2019).
Further computationally universal SPT phases, and the connection to quantum cellular automata:
D.T. Stephen, H.P Nautrup, J. BermejoVega, J. Eisert, R. Raussendorf, Subsystem symmetries, quantum cellular automata, and computational phases
of quantum matter, arXiv:1806.08780.
Click here for previous posts.
I obtained my PhD from the Ludwig Maximilians University in Munich, Germany in 2003. My PhD thesis [Int. J. of Quantum Information 7, 1053  1203 (2009).] is on measurementbased quantum computation. I was postdoc at Caltech (200306) and at the Perimeter Institute for Theoretical Physics (200607), and Sloan Research Fellow 2009  2011. I am Associate Professor at the Department of Physics and Astronomy of the University of British Columbia, and scholar of the Cifar Quantum Information program.