A simple nearest-neighbour two-body Hamiltonian system for which the ground state is a universal resource for quantum computation Stephen Bartlett Terry.

Slides:



Advertisements
Similar presentations
Henry Haselgrove School of Physical Sciences University of Queensland
Advertisements

Identifying universal phases for measurement-based quantum computing Stephen Bartlett in collaboration with Andrew Doherty (UQ)
Quantum Walks, Quantum Gates, and Quantum Computers Andrew Hines P.C.E. Stamp [Palm Beach, Gold Coast, Australia]
Local Hamiltonians in Quantum Computation Funding: Slovak Research and Development Agency, contract No. APVV , European Project QAP 2004-IST- FETPI-15848,
Sergey Bravyi, IBM Watson Center Robert Raussendorf, Perimeter Institute Perugia July 16, 2007 Exactly solvable models of statistical physics: applications.
APRIL 2010 AARHUS UNIVERSITY Simulation of probed quantum many body systems.
Part 2: Indirect interactions We assume that two quantum objects A and C interact only via another object (or objects) B. No other assumptions are made.
Preparing Projected Entangled Pair States on a Quantum Computer Martin Schwarz, Kristan Temme, Frank Verstraete University of Vienna, Faculty of Physics,
Spin chains and channels with memory Martin Plenio (a) & Shashank Virmani (a,b) quant-ph/ , to appear prl (a)Institute for Mathematical Sciences.
Preparing Topological States on a Quantum Computer Martin Schwarz (1), Kristan Temme (1), Frank Verstraete (1) Toby Cubitt (2), David Perez-Garcia (2)
Separable States can be Used to Distribute Entanglement Toby Cubitt 1, Frank Verstraete 1, Wolfgang Dür 2, and Ignacio Cirac 1 1 Max Planck Institüt für.
No friction. No air resistance. Perfect Spring Two normal modes. Coupled Pendulums Weak spring Time Dependent Two State Problem Copyright – Michael D.
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Julia Kempe CNRS & LRI, Univ. of Paris-Sud Alexei Kitaev Caltech Oded Regev Tel-Aviv University FSTTCS, Chennai, December 18 th, 2004 The Complexity of.
Jordan-Wigner Transformation and Topological characterization of quantum phase transitions in the Kitaev model Guang-Ming Zhang (Tsinghua Univ) Xiaoyong.
Revealing anyonic statistics by multiphoton entanglement Jiannis K. Pachos Witlef Wieczorek Christian Schmid Nikolai Kiesel Reinhold Pohlner Harald Weinfurter.
Valence-bond ground states of quantum antiferromagnets as a resource for universal quantum computation University of British Columbia QC11, HKUST, July.
Quantum Error Correction Codes-From Qubit to Qudit Xiaoyi Tang, Paul McGuirk.
Spin Liquid Phases ? Houches/06//2006.
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
Schrödinger’s Elephants & Quantum Slide Rules A.M. Zagoskin (FRS RIKEN & UBC) S. Savel’ev (FRS RIKEN & Loughborough U.) F. Nori (FRS RIKEN & U. of Michigan)
Dogma and Heresy in Quantum Computing DoRon Motter February 18, 2002.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Simulating Physical Systems by Quantum Computers J. E. Gubernatis Theoretical Division Los Alamos National Laboratory.
Decoherence-free/Noiseless Subsystems for Quantum Computation IPQI, Bhubaneswar February 24, 2014 Mark Byrd Physics Department, CS Department Southern.
Quantum Two 1. 2 Time Independent Approximation Methods 3.
Jian-Wei Pan Decoherence-free sub-space and quantum error-rejection Jian-Wei Pan Lecture Note 7.
Max Planck Institut of Quantum Optics (Garching) New perspectives on Thermalization Aspen (NON) THERMALIZATION OF 1D SYSTEMS: numerical studies.
On the energy landscape of 3D spin Hamiltonians with topological order Sergey Bravyi (IBM Research) Jeongwan Haah (Caltech) QEC 2011 December 6, 2011 TexPoint.
Merlin-Arthur Games and Stoquastic Hamiltonians B.M. Terhal, IBM Research based on work with Bravyi, Bessen, DiVincenzo & Oliveira. quant-ph/ &
Implementation of Quantum Computing Ethan Brown Devin Harper With emphasis on the Kane quantum computer.
Quantum Information Theory: Present Status and Future Directions Julia Kempe CNRS & LRI, Univ. de Paris-Sud, Orsay, France Newton Institute, Cambridge,
PEPS, matrix product operators and the algebraic Bethe ansatz
Symmetries in Nuclei, Tokyo, 2008 Symmetries in Nuclei Symmetry and its mathematical description The role of symmetry in physics Symmetries of the nuclear.
Global control, perpetual coupling and the like Easing the experimental burden Simon Benjamin, Oxford. EPSRC. DTI, Royal Soc.
Anatoli Polkovnikov Krishnendu Sengupta Subir Sachdev Steve Girvin Dynamics of Mott insulators in strong potential gradients Transparencies online at
Barriers in Hamiltonian Complexity Umesh V. Vazirani U.C. Berkeley.
Quantum Two 1. 2 Evolution of Many Particle Systems 3.
Tensor networks and the numerical study of quantum and classical systems on infinite lattices Román Orús School of Physical Sciences, The University of.
A Study of Error-Correcting Codes for Quantum Adiabatic Computing Omid Etesami Daniel Preda CS252 – Spring 2007.
1 The Topological approach to building a quantum computer. Michael H. Freedman Theory Group Microsoft Research.
Recent Progress in Many-Body Theories Barcelona, 20 July 2007 Antonio Acín 1,2 J. Ignacio Cirac 3 Maciej Lewenstein 1,2 1 ICFO-Institut de Ciències Fotòniques.
Quantum computation through many-body correlations of a condensed matter system New trends in QC, Nov. 17 (2010) Akimasa Miyake 1 Perimeter Institute for.
Quantum Computing Reversibility & Quantum Computing.
Multiparticle Entangled States of the W- class, their Properties and Applications A. Rodichkina, A. Basharov, V. Gorbachev Laboratory for Quantum Information.
CENTER FOR EXOTIC QUANTUM SYSTEMS CEQS Preskill 1983 Kitaev 2002 Refael 2005 Motrunich 2006 Fisher 2009 Historically, Caltech physics has focused on the.
A Monomial matrix formalism to describe quantum many-body states Maarten Van den Nest Max Planck Institute for Quantum Optics Montreal, October 19 th 2011.
Entangling Quantum Virtual Subsytems Paolo Zanardi ISI Foundation February Universita’di Milano.
Quasi-1D antiferromagnets in a magnetic field a DMRG study Institute of Theoretical Physics University of Lausanne Switzerland G. Fath.
Entanglement and Topological order in 1D & 2D cluster states
Damian Markham University of Tokyo Entanglement and Group Symmetries: Stabilizer, Symmetric and Anti-symmetric states IIQCI September 2007, Kish Island,
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
NTNU 2011 Dimer-superfluid phase in the attractive Extended Bose-Hubbard model with three-body constraint Kwai-Kong Ng Department of Physics Tunghai University,
Quantum Shift Register Circuits Mark M. Wilde arXiv: National Institute of Standards and Technology, Wednesday, June 10, 2009 To appear in Physical.
Arnau Riera, Grup QIC, Universitat de Barcelona Universität Potsdam 10 December 2009 Simulation of the Laughlin state in an optical lattice.
TC, U. Dorner, P. Zoller C. Williams, P. Julienne
Hamiltonian quantum computer in one dimension
Time Dependent Two State Problem
Information-Theoretical Analysis of the Topological Entanglement Entropy and Multipartite correlations Kohtaro Kato (The University of Tokyo) based on.
Stationary Perturbation Theory And Its Applications
Algorithmic simulation of far-from- equilibrium dynamics using quantum computer Walter V. Pogosov 1,2,3 1 Dukhov Research Institute of Automatics (Rosatom),
2nd Lecture: QMA & The local Hamiltonian problem
On MPS and PEPS… David Pérez-García. Near Chiemsee
Topological quantum computing ▬ Toric code
Quantum Computing: the Majorana Fermion Solution
Quantum computation using two component Bose-Einstein condensates
QM2 Concept Test 11.1 In a 3D Hilbert space,
in collaboration with Andrew Doherty (UQ)
QM2 Concept Test 10.1 Consider the Hamiltonian
Quantum One.
Presentation transcript:

A simple nearest-neighbour two-body Hamiltonian system for which the ground state is a universal resource for quantum computation Stephen Bartlett Terry Rudolph Phys. Rev. A (R) (2006)

Quantum computing with a cluster state Quantum computing can proceed through measurements rather than unitary evolution Measurements are strong and incoherent: easier Uses a cluster state:  a universal circuit board  a 2-d lattice of spins in a specific entangled state

So what is a cluster state?  Describe via the eigenvalues of a complete set of commuting observables Stabilizer  Cluster state is the +1 eigenstate of all stabilizers  Massively entangled (in every sense of the word)

“State of the art” - Making cluster states Optical approaches Cold atom approaches

Can Nature do the work?  Is the cluster state the ground state of some system?  If it was (and system is gapped), we could cool the system to the ground state and get the cluster state for free!  Has 5-body interactions  Nature: only 2-body int n s  Nielsen 2005 – gives proof: no 2-body nearest-neighbour H has the cluster state as its exact ground state

Some insight from research in quantum complexity classes  Kitaev (’02): Local Hamiltonian is QMA-complete  Original proof required 5-body terms in Hamiltonian  Kempe, Kitaev, Regev (‘04), then Oliviera and Terhal (‘05): 2-Local Hamiltonian is QMA-complete  Use ancilla systems to mediate an effective 5-body interaction using 2-body Hamiltonians  Approximate cluster state as ground state  Energy gap ! 0 for large lattice  Requires precision on Hams that grows with lattice size  Not so useful... M. Van den Nest, K. Luttmer, W. Dür, H. J. Briegel quant-ph/

Some insight from research in classical simulation of q. systems  Projected entangled pair states (PEPS) – a powerful representation of quantum states of lattices For any lattice/graph:  place a Bell state on every edge, with a virtual qubit on each of the two verticies  project all virtual qubits at a vertex down to a 2-D subspace Cluster state can be expressed as a PEPS state: F. Verstraete and J. I. Cirac PRA 70, (R) (2004)

Can we make use of these ideas?: 1. effective many-body couplings 2. encoding logical qubits in a larger number of physical qubits

Encoding a cluster state  KEY IDEA: Encode a qubit in four spins at a site  Ground state manifold is a qubit code space

Interactions between sites  Interact spins with a different Hamiltonian Ground state is Hamiltonian for lattice is

Perturbation theory  Intuition: “strong” site Hamiltonian effectively implements PEPS projection on “weak” bond Hamiltonian’s ground state  Degenerate perturbation theory in Ground state manifold of H S “Logical states” All excited states of H S “Illogical states” First order: directly break ground-state degeneracy?

Perturbation theory  Intuition: “strong” site Hamiltonian effectively implements PEPS projection on “weak” bond Hamiltonian’s ground state  Degenerate perturbation theory in Ground state manifold of H S “Logical states” All excited states of H S “Illogical states” Second order: use an excited state to break ground-state degeneracy?

Perturbation theory  Look at how Pauli terms in bond Hamiltonian act

Is it what we want?  Basically, yes.  Low energy behaviour of this system, for small, is described by the Hamiltonian  Ground state is a cluster state with first-order correction  System is gapped:

Can we perform 1-way QC?  1-way QC on an encoded cluster state would require single logical qubit measurements in a basis  Encoding is redundant ! decode measure 3 physical qubits in | §i basis if an odd number of | – i outcomes occurred, apply z to the 4 th qubit measure 4 th in basis  Note: results of Walgate et al (’00) ensure this “trick” works for any encoding

The low-T thermal state  Consider the low- temperature thermal state Is it useful for 1-way QC?  Two types of errors: Thermal Perturbative corrections

Thermal logical-Z errors  Thermal state: cluster state with logical-Z errors occurring independently at each site with probability  Raussendorf, Bravyi, Harrington (’05): correctable if  Energy scales: Perturbation energy Related to order of perturbation

Perturbative corrections  Ground state is a cluster state with first-order correction  Treat as incoherent xz errors occurring with probability  x-error ! out of code space  appears as measurement error in computation

Conclusions/Discussion  Simple proof-of-principle model – Can it be made practical?  Energy gap scales as where n is the perturbation order at which the degeneracy is broken ! use hexagonal rather than square lattice  Generalize this method to other PEPS states?  Use entirely Heisenberg interactions? has 2-d singlet ground state manifold

Conclusions/Discussion