Mark Tame QTeQ - Quantum Technology at Queen’s Queen’s University, Belfast Fault-tolerant One-way quantum computation using minimal resources.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

Henry Haselgrove School of Physical Sciences University of Queensland
Noise thresholds for optical quantum computers
Entanglement Boosts Quantum Turbo Codes Mark M. Wilde School of Computer Science McGill University Seminar for the Quantum Computing Group at McGill Montreal,
Advanced Piloting Cruise Plot.
Survey on the Bounds of the Threshold For Quantum Decoherence Chris Graves December 12, 2012.
Topological Subsystem Codes with Local Gauge Group Generators Martin Suchara in collaboration with: Sergey Bravyi and Barbara Terhal December 08, 2010.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Toulouse, May 2011, Slide 1 20 x 20. Toulouse, May 2011, Slide 2 20 x 20.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
ZMQS ZMQS
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Real-Time Competitive Environments: Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks Anwar Mohammadi, Nathan Fisher, and Daniel.
Q U RE: T HE Q UANTUM R ESOURCE E STIMATOR T OOLBOX Martin Suchara (IBM Research) October 9, 2013 In collaboration with: Arvin Faruque, Ching-Yi Lai, Gerardo.
ABC Technology Project
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]
Quantum Logic and Quantum gates with Photons
Three-qubit quantum error correction with superconducting circuits
Sergey Bravyi, IBM Watson Center Robert Raussendorf, Perimeter Institute Perugia July 16, 2007 Exactly solvable models of statistical physics: applications.
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
Approximate quantum error correction for correlated noise Avraham Ben-Aroya Amnon Ta-Shma Tel-Aviv University 1.
Squares and Square Root WALK. Solve each problem REVIEW:
Energy & Green Urbanism Markku Lappalainen Aalto University.
Mark Tame QTeQ - Quantum Technology at Queen’s Queen’s University, Belfast Fault-tolerant one-way quantum computation using minimal resources - Decoherence-free.
Quantum algorithms in the presence of decoherence: optical experiments Masoud Mohseni, Jeff Lundeen, Kevin Resch and Aephraim Steinberg Department of Physics,
The Threshold for Fault-Tolerant Quantum Computation Daniel Gottesman Perimeter Institute.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Quantum versus Classical Correlations in Gaussian States Gerardo Adesso joint work with Animesh Datta (Imperial College / Oxford) School of Mathematical.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
1 First EMRAS II Technical Meeting IAEA Headquarters, Vienna, 19–23 January 2009.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
Week 1.
We will resume in: 25 Minutes.
How Cells Obtain Energy from Food
Applications of randomized techniques in quantum information theory Debbie Leung, Caltech & U. Waterloo roll up our sleeves & prove a few things.
Holonomic quantum computation in decoherence-free subspaces Lian-Ao Wu Center for Quantum Information and Quantum Control In collaboration with Polao Zanardi.
Transfer of entanglement from a Gaussian field to remote qubits Myungshik Kim Queen’s University, Belfast UniMilano 14 December 2004.
Simulating Physical Systems by Quantum Computers J. E. Gubernatis Theoretical Division Los Alamos National Laboratory.
Quantum Communication, Quantum Entanglement and All That Jazz Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering,
Paraty - II Quantum Information Workshop 11/09/2009 Fault-Tolerant Computing with Biased-Noise Superconducting Qubits Frederico Brito Collaborators: P.
Quantum Error Correction and Fault-Tolerance Todd A. Brun, Daniel A. Lidar, Ben Reichardt, Paolo Zanardi University of Southern California.
Jian-Wei Pan Decoherence-free sub-space and quantum error-rejection Jian-Wei Pan Lecture Note 7.
Quantum Convolutional Coding for Distillation and Error Correction Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical.
Michael A. Nielsen Fault-tolerant quantum computation with cluster states School of Physical Sciences Chris Dawson (UQ) Henry Haselgrove (UQ) The University.
Global control, perpetual coupling and the like Easing the experimental burden Simon Benjamin, Oxford. EPSRC. DTI, Royal Soc.
Quantum Computing Reversibility & Quantum Computing.
Quantum Convolutional Coding Techniques Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering, University of.
A simple nearest-neighbour two-body Hamiltonian system for which the ground state is a universal resource for quantum computation Stephen Bartlett Terry.
Hybrid quantum error prevention, reduction, and correction methods Daniel Lidar University of Toronto Quantum Information & Quantum Control Conference.
Entanglement and Topological order in 1D & 2D cluster states
Linear Quantum Error Correction
Quantum Computing Dorca Lee.
Improving Quantum Circuit Dependability
Quantum Computation – towards quantum circuits and algorithms
Presentation transcript:

Mark Tame QTeQ - Quantum Technology at Queen’s Queen’s University, Belfast Fault-tolerant One-way quantum computation using minimal resources

2/21 The one-way model for quantum computation – Brief introduction 1) Preparation of |+> 2) Application of CZ ’s |  > = |+> |+> |+> |+> |  > = 1/4(|+> |+> |+> |+> + |+> |-> |+> |-> + |-> |+> |-> |+> - |-> |-> |-> |-> ) S ac : |0> |0> --> |0> |0> |0> |1> --> |0> |1> |1> |0> --> |1> |0> |1> |1> --> - |1> |1> - R. Raussendorf & H.-J. Briegel, PRL Raussendorf, Browne & Briegel, PRA 2003 just type “one-way” or “cluster state” on the archive.

3/21 The one-way model for quantum computation – Brief introduction 3) Measurement process ?

4/21 The one-way model for quantum computation – Brief introduction 3) Measurement process (i) |  > = (  |0> |+> +  |1> |-> ) | Q 1 > = (  |0> +  |1>)

5/21 The one-way model for quantum computation – Brief introduction 3) Measurement process (ii) |  > = (  |0> |0> +  |0> |1>+  |0> |1> -  |0> |1> ) | Q 1 > = (  |0> +  |1>) | Q 2 > = (  |0> +  |1>)

6/21 The one-way model for quantum computation – Brief introduction 3) Measurement process (iii)

7/21 The one-way model for quantum computation – Brief introduction 3) Measurement process

8/21 The one-way model for quantum computation – Brief introduction Algorithms: Grover’s Algorithm Deutsch’s Algorithm Quantum Games M. S. Tame et al., PRL (2007) P. Walther et al., PRL (2005) M. Paternostro et al., NJP (2005)

9/21 Noise in the one-way model for quantum computation Environment effects during time evolution – Decoherence Pauli error General error Loss Local/Global noise: Pauli error General error Loss Preparation of |+> controlled phase gate error controlled unitary gate error Loss from non-deterministic gates Application of CZ ’s Measurement process error in measurement of qubits propagates into the remaining cluster Stage 1 Stage 2

10/21 Work on Fault-tolerance in the one-way model -Raussendorf, PhD Thesis (2003) ( -Nielsen and Dawson, PRA 71, (2005) -Aliferis and Leung, PRA 73, (2006) Proved that an Error Threshold existed, which could be determined by mapping noise in the cluster state to noise in a corresponding circuit model. -Dawson, Haselgrove and Nielsen, PRL 96, (2006) PRA 73, (2006) Error correcting schemes and associated error threshold values for optical setups STEANE 7 qubit and GOLAY 23 qubit codes -Ralph, Hayes and Gilchrist PRL, 95, (2005) -Varnava, Browne and Rudolph PRL 97, (2006) Loss tolerant schemes for linear optics setups -Raussendorf, Harrington and Goyal, Ann. Phys. 321, 2242 (2006) -Raussendorf and Harrington, quant-ph/ (2006) Fault-tolerant using topological error correction and surface codes -Silva et al., quant-ph/ (2006) -Fujii and Yamamoto, quant-ph/ (2006) Most Recently: -Dawson, Haselgrove and Nielsen, PRL 96, (2006). -Silva et al., quant-ph/ (2006).

11/21 Problems with Fault-tolerant schemes in the one-way model Large resource overheads: - A minimum of 7 qubits for an encoded qubit (STEANE code) Complicated structure for the encoded qubit: - Underlying graph to encode qubit is complex Error syndrome extraction techniques lead to additional overheads “One-buffered”, “two-at-a-time” and “fully-parallel” approaches complicate the model: - They modify the measurement patterns and entangling steps Off-line preparation of ancilla qubits can also be a cumbersome process: - setup dependent Q: Is there a way to achieve fault-tolerance using less resources?

12/21 Minimal-resource Fault-tolerance in the one-way model Local Collective noise 4-qubit collective noise 2-qubit collective noise 3-qubit collective noise Universal resource for one-way QC -Van den Nest, Miyake, Dür, Briegel PRL 97, (2006)

13/21 Decoherence-free subspace one-way model - Simple protection from collective noise G. M. Palma et al., Proc. Roy. Soc. London A 452, (1996) Basic 1-bit teleportation unit: 4 physical qubits

14/21 Decoherence-free subspace one-way model - Protection from all types of collective noise (I) Theory: Kempe et al., PRA (2001) Experiment: Bourenanne et al., PRL (2004)

15/21 Decoherence-free subspace one-way model - Protection from all types of collective noise (II) Knill, Laflamme and Viola PRL 84, 2525 (2000) (Decoherence-free subsystems) Basic 1-bit teleportation unit: 6 physical qubits

16/21 Performance of Decoherence-free subspace one-way model - Theoretical (I) M. S. Tame, M. Paternostro, M. S. Kim -submitted (2007) Probe states: QPT techniques: H H H H

17/21 Performance of Decoherence-free subspace one-way model - Theoretical (I)

18/21 Performance of Decoherence-free subspace one-way model - Experimental (II) R. Prevedel, M. S. Tame, A. Stefanov, M. Paternostro, M. S. Kim and A. Zeilinger -submitted (2007) Standard DFS encoded Information transfer protocol: 4 physical qubits Linear optical setup See also: Kwiat et al., Science 290, (2000) for single qubit DFS encoding.

19/21 Outlook M. S. Tame et al., work in progress (2007) 1) Investigating the performance of the fault-tolerance, for asymmetries in the collective approximation How does the performance of the 2- and 3-qubit Codes with asymmetries compare to standard cluster state Quantum Error Correcting Codes (QECC). 2) Most resourceful method for the 3-qubit code

20/21 Special thanks to Collaborators Queen’s, UK : Mauro Paternostro and Myungshik Kim Vienna, Austria : Robert Prevedel, André Stefanov, Pascal Böhi, Anton Zeilinger Leeds, UK : Vlatko Vedral London, UK : Chris Hadley, Sougato Bose Palermo, Italy : Massimo Palma

21/21 References DFS one-way QC -Hein et al., Proceedings of the International School of Physics "Enrico Fermi" on "Quantum Computers, Algorithms and Chaos", Varenna, Italy, July, 2005; also at quant-ph/ Raussendorf, Browne and Briegel, PRA 68, (2003). -Dawson, Haselgrove and Nielsen, PRL 96, (2006) PRA 73, (2006) -Lidar and Birgitta Whaley, "Irreversible Quantum Dynamics", F. Benatti and R. Floreanini (Eds.), pp (Springer Lecture Notes in Physics vol. 622, Berlin, 2003); also at quant-ph/ Introduction to graph states and one-way QC using cluster states Fault-tolerant one-way QC using QECC Introduction to DFS -M. S. Tame, M. Paternostro, M. S. Kim -submitted (2007) -R. Prevedel, M. S. Tame, A. Stefanov, M. Paternostro, M. S. Kim and A. Zeilinger -submitted (2007) *Thanks for your attention*

 t=0.15  t=0.5  t=1  t=5