DECOHERENCE AND QUANTUM INFORMATION JUAN PABLO PAZ Departamento de Fisica, FCEyN Universidad de Buenos Aires, Argentina Paraty August 2007.

Slides:



Advertisements
Similar presentations
How Much Information Is In A Quantum State? Scott Aaronson MIT |
Advertisements

University of Queensland
Quantum Walks, Quantum Gates, and Quantum Computers Andrew Hines P.C.E. Stamp [Palm Beach, Gold Coast, Australia]
Sergey Bravyi, IBM Watson Center Robert Raussendorf, Perimeter Institute Perugia July 16, 2007 Exactly solvable models of statistical physics: applications.
Quantum One: Lecture 6. The Initial Value Problem for Free Particles, and the Emergence of Fourier Transforms.
Efficient Discrete-Time Simulations of Continuous- Time Quantum Query Algorithms QIP 2009 January 14, 2009 Santa Fe, NM Rolando D. Somma Joint work with.
1 Some Comments on Sebastiani et al Nature Genetics 37(4)2005.
Spin chains and channels with memory Martin Plenio (a) & Shashank Virmani (a,b) quant-ph/ , to appear prl (a)Institute for Mathematical Sciences.
Byron Smith December 11, What is Quantum State Tomography? 2. What is Bayesian Statistics? 1.Conditional Probabilities 2.Bayes’ Rule 3.Frequentist.
Quantum Information Stephen M. Barnett University of Strathclyde The Wolfson Foundation.
Gavin Brennen Lauri Lehman Zhenghan Wang Valcav Zatloukal JKP Ubergurgl, June 2010 Anyonic quantum walks: The Drunken Slalom.
On Quantum Walks and Iterated Quantum Games G. Abal, R. Donangelo, H. Fort Universidad de la República, Montevideo, Uruguay UFRJ, RJ, Brazil.
Quantum random walks Andre Kochanke Max-Planck-Institute of Quantum Optics 7/27/2011.
What is the origin of complex probability amplitudes? William K. Wootters Williams College.
Emergence of Quantum Mechanics from Classical Statistics.
Disorder and chaos in quantum system: Anderson localization and its generalization (6 lectures) Boris Altshuler (Columbia) Igor Aleiner (Columbia)
1 Predator-Prey Oscillations in Space (again) Sandi Merchant D-dudes meeting November 21, 2005.
The quantum signature of chaos through the dynamics of entanglement in classically regular and chaotic systems Lock Yue Chew and Ning Ning Chung Division.
Suppressing decoherence and heating with quantum bang-bang controls David Vitali and Paolo Tombesi Dip. di Matematica e Fisica and Unità INFM, Università.
Analysis of the Superoperator Obtained by Process Tomography of the Quantum Fourier Transform in a Liquid-State NMR Experiment Joseph Emerson Dept. of.
Chien Hsing James Wu David Gottesman Andrew Landahl.
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Solid state realisation of Werner quantum states via Kondo spins Ross McKenzie Sam Young Cho Reference: S.Y. Cho and R.H.M, Phys. Rev. A 73, (2006)
Quantum Computing Ambarish Roy Presentation Flow.
NMR Quantum Information Processing and Entanglement R.Laflamme, et al. presented by D. Motter.
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)
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Efficient Quantum State Tomography using the MERA in 1D critical system Presenter : Jong Yeon Lee (Undergraduate, Caltech)
Laurent Itti: CS599 – Computational Architectures in Biological Vision, USC Lecture 7: Coding and Representation 1 Computational Architectures in.
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
Simulating Physical Systems by Quantum Computers J. E. Gubernatis Theoretical Division Los Alamos National Laboratory.
School of Physics & Astronomy FACULTY OF MATHEMATICAL & PHYSICAL SCIENCE Parallel Transport & Entanglement Mark Williamson 1, Vlatko Vedral 1 and William.
Quantum computing Alex Karassev. Quantum Computer Quantum computer uses properties of elementary particle that are predicted by quantum mechanics Usual.
Autonomous Quantum Error Correction Joachim Cohen QUANTIC.
Lecture I: The Time-dependent Schrodinger Equation  A. Mathematical and Physical Introduction  B. Four methods of solution 1. Separation of variables.
Generation of Mesoscopic Superpositions of Two Squeezed States of Motion for A Trapped Ion Shih-Chuan Gou ( 郭西川 ) Department of Physics National Changhua.
CENTER FOR NONLINEAR AND COMPLEX SYSTEMS Giulio Casati - Istituto Nazionale di Fisica della Materia, and Universita’ dell’Insubria -National University.
Quantum computation with solid state devices - “Theoretical aspects of superconducting qubits” Quantum Computers, Algorithms and Chaos, Varenna 5-15 July.
Jian-Wei Pan Decoherence-free sub-space and quantum error-rejection Jian-Wei Pan Lecture Note 7.
Lecture note 8: Quantum Algorithms
Engineering of arbitrary U(N) transformation by quantum Householder reflections P. A. Ivanov, E. S. Kyoseva, and N. V. Vitanov.
 Quantum State Tomography  Finite Dimensional  Infinite Dimensional (Homodyne)  Quantum Process Tomography (SQPT)  Application to a CNOT gate  Related.
The Road to Quantum Computing: Boson Sampling Nate Kinsey ECE 695 Quantum Photonics Spring 2014.
Quantum Factoring Michele Mosca The Fifth Canadian Summer School on Quantum Information August 3, 2005.
DECOHERENCE AND QUANTUM INFORMATION JUAN PABLO PAZ Departamento de Fisica, FCEyN Universidad de Buenos Aires, Argentina Paraty August 2007.
R. Demkowicz-Dobrzański 1, J. Kołodyński 1, K. Banaszek 1, M. Jarzyna 1, M. Guta 2 1 Faculty of Physics, Warsaw University, Poland 2 School of Mathematical.
Quantum entanglement and Quantum state Tomography Zoltán Scherübl Nanophysics Seminar – Lecture BUTE.
Precise and Approximate Representation of Numbers 1.The Cartesian-Lagrangian representation of numbers. 2.The homotopic representation of numbers 3.Loops.
Time-dependent Schrodinger Equation Numerical solution of the time-independent equation is straightforward constant energy solutions do not require us.
Decoherence in Phase Space for Markovian Quantum Open Systems
Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.
Phase space, decoherence and the Wigner function for finite dimensional systems. James Yearsley Superviser: Prof. JJ Halliwell. See: Gibbons et. al. quant-ph/
Quantum Convolutional Coding Techniques Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering, University of.
Efficient measure of scalability Cecilia López, Benjamin Lévi, Joseph Emerson, David Cory Department of Nuclear Science & Engineering, Massachusetts Institute.
A simple nearest-neighbour two-body Hamiltonian system for which the ground state is a universal resource for quantum computation Stephen Bartlett Terry.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
DYNAMICS OF OPEN Q-SYSTES FROM A PERSPECTIVE OF QIT IMS, Imperial College, London, 18 January 2007 Vladimír Bužek Research Center for Quantum Information.
1 Conference key-agreement and secret sharing through noisy GHZ states Kai Chen and Hoi-Kwong Lo Center for Quantum Information and Quantum Control, Dept.
DECOHERENCE AND QUANTUM CLASSICAL TRANSITION
Capabilities and limitations of quantum computers Michele Mosca 1 November 1999 ECC ’99.
ECE-7000: Nonlinear Dynamical Systems 2. Linear tools and general considerations 2.1 Stationarity and sampling - In principle, the more a scientific measurement.
As if computers weren’t fast enough already…
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Outline Device & setup Initialization and read out
For computer scientists
Many-body Spin Echo and Quantum Walks in Functional Spaces
OSU Quantum Information Seminar
Quantum computation using two component Bose-Einstein condensates
Determining the capacity of any quantum computer to perform a useful computation Joel Wallman Quantum Resource Estimation June 22, 2019.
Presentation transcript:

DECOHERENCE AND QUANTUM INFORMATION JUAN PABLO PAZ Departamento de Fisica, FCEyN Universidad de Buenos Aires, Argentina Paraty August 2007

Lecture 1 & 2: Decoherence and the quantum origin of the classical world Lecture 2 & 3: Decoherence and quantum information processing, noise characterization (process tomography) Colaborations with: W. Zurek (LANL), M. Saraceno (CNEA), D. Mazzitelli (UBA), D. Dalvit (LANL), J. Anglin (MIT), R. Laflamme (IQC), D. Cory (MIT), G. Morigi (UAB), S. Fernandez-Vidal (UAB), F. Cucchietti (LANL), 1, 2 & 3. Decoherence, an overview. –Hadamard-Phase-Hadamard and the origin of the classical world! Information transfer from the system to the environment. –Bosonic environment. Complex environments. Spin environments (some new results) 3. Decoherence in quantum information. How to characterize it? –Quantum process tomography (some new ideas) Current/former students: D. Monteoliva, C. Miquel (UBA), P. Bianucci (UBA, UT), L. Davila (UEA, UK), C. Lopez (UBA, MIT), A. Roncaglia (UBA), C. Cormick (UBA), A. Benderski (UBA), F. Pastawski (UNC), C. Schmiegelow (UNLP, UBA)

DECOHERENCE: AN OVERVIEW SUMMARY: SOME BASIC POINTS ON DECOHERENCE POINTER STATES: W.Zurek, S. Habib & J.P. Paz, PRL 70, 1187 (1993), J.P. Paz & W. Zurek, PRL 82, 5181 (1999) TIMESCALES: J.P. Paz, S. Habib & W. Zurek, PRD 47, 488 (1993), J. Anglin, J.P. Paz & W. Zurek, PRA 55, 4041 (1997) CONTROLLED DECOHERENCE EXPERIMENTS: Zeillinger et al (Vienna) PRL (2003), Haroche et al (ENS) PRL 77, 4887 (1997), Wineland et al (NIST), Nature 403, 269 (2000). DECOHERENCE AND THE QUANTUM-CLASSICAL TRANSITION: YES: HILBERT SPACE IS HUGE, BUT MOST STATES ARE UNSTABLE!! (DECAY VERY FAST INTO MIXTURES) CLASSICAL STATES: A (VERY!) SMALL SUBSET. THEY ARE THE POINTER STATES OF THE SYSTEM DYNAMICALLY CHOSEN BY THE ENVIRONMENT

DECOHERENCE: AN OVERVIEW LAST DECADE: MANY QUESTIONS ON DECOHERENCE WERE ANSWERED NATURE OF POINTER STATES: QUANTUM SUPERPOSITIONS DECAY INTO MIXTURES WHEN QUANTUM INTERFERENCE IS SUPRESSED. WHAT ARE THE STATES SELECTED BY THE INTERACTION? POINTER STATES: THE MOST STABLE STATES OF THE SYSTEM, DYNAMICALLY SELECTED BY THE ENVIRONMENT: W.Zurek, S. Habib & J.P. Paz, PRL 70, 1187 (1993), J.P. Paz & W. Zurek, PRL 82, 5181 (1999) TIMESCALES: HOW FAST DOES DECOHERENCE OCCURS? J.P. Paz, S. Habib & W. Zurek, PRD 47, 488 (1993), J. Anglin, J.P. Paz & W. Zurek, PRA 55, 4041 (1997) INITIAL CORRELATIONS: THEIR ROLE, THEIR IMPLICTIONS L. Davila Romero & J.P. Paz, Phys Rev A 54, 2868 (1997), MORE REALISTIC PREPARATION OF INITIAL STATE (FINITE TIME PREPARATION, ETC) J. Anglin, J.P. Paz & W. Zurek, PRA 55, 4041 (1997) DECOHERENCE FOR CLASSICALLY CHAOTIC SYSTEMS: W. Zurek & J.P. Paz, PRL 72, 2508 (1994), D. Monteoliva & J.P. Paz, PRL 85, 3373 (2000). CONTROLLED DECOHERENCE EXPERIMENTS: S. Haroche et al (ENS) PRL 77, 4887 (1997), D. Wineland et al (NIST), Nature 403, 269 (2000), A. Zeillinger et al (Vienna) PRL (2003), ENVIRONMENT ENGENEERING: Cirac & Zoller, etc; see Nature 412, 869 (2001) (review of PRL work published by UFRJ group on environment engeneering with ions) SPIN ENVIRONMENTS: ASK CECILIA CORMICK (POSTER NEXT WEEK).

SYSTEM ENVIRONMENT INTERACTION CREATES “A RECORD” OF THE STATE OF THE SYSTEM IN THE ENVIRONMENT CLASSICALITY, OBJECTIVITY AND REDUNDANCY INTERACTION WITH ENVIRONMENT INDUCES DECAY OF FRINGE VISIBILITY: DECOHERENCE PURE STATEMIXED STATE

WHAT SHOULD YOU DO IF YOU WANT TO LEARN ABOUT THE SYSTEM? (THE INITIAL STATE, FOR EXAMPLE) CLASSICALITY, OBJECTIVITY AND REDUNDANCY PURE STATEMIXED STATE LOOK AT THE ENVIRONMENT! HOW MUCH CAN YOU LEARN ABOUT THE SYSTEM BY LOOKING AT THE ENVIRONMENT? TOOL: MUTUAL INFORMATION (NOT ALWAYS USEFUL BUT…) I(A,B)=S(A)+S(B)-S(A,B) FLOW OF INFORMATION BETWEEN SYSTEM AND ENVIRONMENT AND ITS RELATION WITH CLASSICALITY (A. Roncaglia & J.P.P, 2007) A= ONE of the oscillators of the environment (a band centered around a certain frequency); B= SYSTEM

CLASSICALITY, OBJECTIVITY AND REDUNDANCY PURE STATEMIXED STATE I(A,B)=S(A)+S(B)-S(A,B) Environmental fraction THE SYSTEM BECOMES CLASSICAL WHEN THE INFORMATION ABOUT IT IS “STORED” REDUNDANTLY IN THE ENVIRONMENT. RECOVER THE STATE OF THE SYSTEM ONLY WHEN YOU MEASURE THE COMPLETE ENVIRONMENT. OTHERWISE YOU ONLY KNOW WHERE THE CAT IS (NOT THE PHASE!)

1. Classical random walk ¿  ó  ? Typical probability distribution Probability 1/ EXAMPLE: DECOHERENCE IN A QUANTUM ALGORITHM

2. Quantum walk algorithm: A quantum coin (spin 1/2) and a quantum walker (moving in a ring with N sites) : It could be a useful “subroutine” move to the right move to the left Quantum walk “algorithm”: Initial state: Evolution operator: The coin (spin) and the walker become entangled. The state of the walker after t-iterations is: EXAMPLE: DECOHERENCE IN A QUANTUM WALK

Initial state: “Impartial spin”, localized walker Classical and quantum walks have rather different properties: Probability distribution: Classical vs Quantum Quantum walker spreads faster than classical! Reason?: Quantum interference (more later!) EXAMPLE: DECOHERENCE IN A QUANTUM WALK

Key to the potential advantadge of quantum walks?: Use the quantum nature of the walk, that allows for faster spreading over the graph (this enables, for example, exponentially faster hiting times) NOTE Quantum walks on graphs have been proposed as potentially useful quantum subroutines Review: J. Kempe, Contemp Phys 44, 307 (2003) Proposed in: D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani, Proc 33. ACM STOC-2001, There are very few algorithms that use quantum walks as a central piece: * N. Shenvi, J. Kempe & B. Whaley, PRA (2003) (DISCRETE); * A. M. Childs et al, Proc 35 ACM STOC-2003, (CONTINUOUS) EXAMPLE: DECOHERENCE IN A QUANTUM WALK

What happens if the coin (or walker) interacts with an environment? Simple model to simulate coupling to a spin environment (NMR) (G.Teklemarian, et al PRA67, (2003)) (2002, 2003: V. Kendon, B. Tregenna, H. Carteret, T. Brun, A. Ambainis, etc) k t=0 t=T k Feature: model can be exactly solved (analytic solutions C.Lopez & J.P.P, PRA 68, (2003) = coupling strength EXAMPLE: DECOHERENCE IN A QUANTUM WALK

RESULTS: Decoherence and quantum-classical transition for quantum walks Fixe time, vary system-environment coupling strength EXAMPLE: DECOHERENCE IN A QUANTUM WALK

QUANTUM WALKS IN PHASE SPACE Simple interpretation Exact formula valid in the case of full decoherence Quantum walk with decoherence in the coin looks like random walk. Effect: Diffusion along the position direction in phase space. Lesson I from decoherence studies: a) Environment couples to spin. b) Spin couples with walker via U (displacement operator). d) U is diagonal in momentum. Then: momentum states are pointer states! EXAMPLE: DECOHERENCE IN A QUANTUM WALK

QUANTUM WALKS IN PHASE SPACE Lesson II from decoherence: If the phase space picture of decoherence (position diffusion) is correct, we can make a prediction: Superposition of two positions should be robust agains decoherence! No decoherenceFull decoherence EXAMPLE: DECOHERENCE IN A QUANTUM WALK

QUANTUM WALKS IN PHASE SPACE Quantum coherence in this Schrodinger cat state is robust against decoherence. No entropy is produced from the decay of the coherent superposition Mixture of two positionsSuperposition of two positions

QUANTUM WALKS IN PHASE SPACE A surprise: Entropy curves cross each other. Why? Some decoherence may be useful! Superposition of two positions Fix time, vary coupling strength

USE WIGNER FUNCTIONS TO REPRESENT THE STATE AND THE EVOLUTION OF QUANTUM COMPUTERS see C. Miquel, J.P.P & M. Saraceno, Phys Rev A 65 (2002), Phase space representation of Grover’s algorithm See paper for other interesting (useful?) analogies between quantum algorithms and quantum maps PHASE SPACE TECHNIQUES IN QUANTUM COMPUTATION Ather approaches to Discrte Wigner functions in NxN grids with interesting connection with stabilizer formalism: Wootters et al; C.Cormick, A. Roncaglia, M. Saraceno, E. Galvao, J.P.P, et al.

MOST GENERAL EVOLUTION OF TWO INTERACTING SUBSYSTEMS REDUCED DENSITY MATRIX OF SUB-SYSTEM A KRAUSS REPRESENTATION OF EVOLUTION OF REDUCED DENSITY MATRIX (general) Valid if initial state of B is pure EVOLUTION OF QUANTUM OPEN SYSTEMS

KRAUS REPRESENTATION (PHASE DAMPING CHANNEL) EXAMPLE: CONSIDER A DECOHERENCE MECHANISM THAT SUPRESSES OFF DIAGONAL TERMS IN {0,1} BASIS: EVOLUTION OF QUANTUM OPEN SYSTEMS

MORE GENERAL NOISY CHANNEL STUDY HOW THE QUANTUM STATE IS DEGRADED BY A NOISY CHANNEL FIDELITY DECAY: PURITY DECAY: DECAY DEPENDS ON THE STATE DECAY IS LINEAR IN p

HOW TO FIGHT AGAINST DECOHERENCE ERROR CORRECTION CAN BE USED TO PROTECT QUANTUM INFORMATION EncodingDecodingRepairRefresh FIDELITY GOES FROM LINEAR TO QUADRATIC IN p!

TO CORRECT ERRORS YOU MUST CHARACTERIZE THEM: KNOW YOUR ERRORS! MOST GENERAL EVOLUTION OF A QUANTUM OPEN SYSTEM CAN BE WRITTEN IN KRAUSS FORM (Exercise: Think about this!) THUS, WE NEED TO FIND OUT WHAT ARE THE KRAUSS OPERATORS: CHARACTERIZE A QUANTUM CHANNEL HOW TO FIGHT AGAINST DECOHERENCE WHAT TO DO IF YOU DON’T KNOW THE KRAUSS OPERATORS? Exercise: Show that Krauss representation is not unique Find another Krauss representation for the phase damping channel

ARE DOMINANT KRAUSS OPERATORS ONE QUBIT ERRORS? WHAT IS THE WEIGHT OF THE IDENTITY IN THE KRAUSS REPRESENTATION? HOW TO FIGHT AGAINST DECOHERENCE DO NOT KRAUSS OPERATORS? WE CAN STILL CONSIDER AN ARBITRARY BASIS OF OPERATORS E’s AND WRITE: COEFFICIENTS DEPEND UPON THE BASIS WE CHOOSE

HOW TO CHARACTERIZE A QUANTUM CHANNEL QUANTUM PROCESS TOMOGRAPHY: OBTAIN COMPLETE KNOWLEDGE OF CHANNEL PARAMETERS (KRAUSS OPERATORS) EXPONENTIALLY HARD TASK (MEASURE SURVIVAL PROBABILITY OF EXPONENTIALLY MANY INITIAL STATES) EACH EXPERIMENT (i,j) DOES NOT GIVE INFORMATION ABOUT THE CHANNEL BUT ON THE ACTION OF THE CHANNEL ON SOME STATES (BUT STATE DEPENDENT). SIMILARLY STATE FIDELITY:

HOW TO CHARACTERIZE A QUANTUM CHANNEL QUESTION: HOW TO DETERMINE PROPERTIES OF THE CHANNEL? EFFICIENT ESTIMATION OF AVERAGE FIDELITY IS POSSIBLE! (Klappenecker & Roetteler 2005; see C. Dankert’s Thesis quant-ph/ ) WHAT DOES THE AVERAGE FIDELITY MEASURES? USE A VERY NICE BASIS E (PAULI’s):

HOW TO CHARACTERIZE A QUANTUM CHANNEL d(d+1) STATES FORMING d+1 MUTUALLY UNBIASED BASIS THIS SEEMS TO BE VERY HARD! HOW DO YOU INTEGRATE OVER ALL HILBERT SPACE IN REAL LIFE? HOWEVER… MOREOVER THIS CAN BE COMPUTED AS A SUM OVER d(d+1) STATES!

ESTIMATE AVERAGE FIDELITY: AVERAGE OVER d(d+1) STATES TO FIND AN ESTIMATE (WITH PRECISION INDEPENDENT OF d) WE NEED TO SAMPLE A RANDOM SUBSET OF THE STATES OF THE MUB’S! (it is efficient if we are OK with a d-independent accuracy) HOW TO CHARACTERIZE A QUANTUM CHANNEL

SEE POSTER BY F. PASTAWSKI FOR A GENERALIZATION TO DETERMINE (EFFICIENTLY) ANY COEFFICIENT IN THE EXPANSION OF THE CHANNEL (SELECTIVE EFFICIENT PROCESS TOMOGRAPHY) HOW TO CHARACTERIZE A QUANTUM CHANNEL NEED A ‘CLEAN’ SOURCE OF STATES FROM MUBs (can be efficiently produced) EXAMPLE: TWO QUBITS, d=4, d+1=5 (5 Mutually Unbiased Bases) EACH BASIS FORMED BY EIGENSTATES OF OPERATORS IN EACH ROW

PHOTONIC QUANTUM PROCESS TOMOGRAPHY SEE POSTER BY CH. SCHMIEGELOW FOR AN EXPLANATION OF PHOTONIC IMPLEMENTATION (ALL GATES NEEDED TO PREPARE THE d(d+1) STATES ARE REALIZED WITH VARIATIONS OF PHASE SHIFTERS, QWP & HWP). RESULT: OBTAIN ALL DIAGONAL COEFFICIENTS OF THE CHANNEL

HOW TO CHARACTERIZE A QUANTUM CHANNEL METHOD TO DETERMINE ANY COEFFICIENT IN THE EXPANSION OF THE CHANNEL (SELECTIVE EFFICIENT PROCESS TOMOGRAPHY). AVERAGE SURVIVAL PROBABILITY OVER A SAMPLE OF STATES FROM MUBs IN AN INTERACTION OF THE FORM: C NEED ONE EXTRA QUBIT (BETTER THAN OTHER METHODS..). SEE F. PASTAWSKI’s POSTER