Analysis of the Superoperator Obtained by Process Tomography of the Quantum Fourier Transform in a Liquid-State NMR Experiment Joseph Emerson Dept. of.

Slides:



Advertisements
Similar presentations
A Quantum Programming Language
Advertisements

Statistical perturbation theory for spectral clustering Harrachov, 2007 A. Spence and Z. Stoyanov.
3D Geometry for Computer Graphics
Chapter 4 Continuous Time Signals Time Response Continuous Time Signals Time Response.
Use of Kalman filters in time and frequency analysis John Davis 1st May 2011.
Experimental quantum estimation using NMR Diogo de Oliveira Soares Pinto Instituto de Física de São Carlos Universidade de São Paulo
Quantum Phase Estimation using Multivalued Logic.
Quantum Phase Estimation using Multivalued Logic Vamsi Parasa Marek Perkowski Department of Electrical and Computer Engineering, Portland State University.
A Universal Operator Theoretic Framework for Quantum Fault Tolerance Yaakov S. Weinstein MITRE Quantum Information Science Group MITRE Quantum Error Correction.
QEC’07-1 ASF 6/13/2015 MIT Lincoln Laboratory Channel-Adapted Quantum Error Correction Andrew Fletcher QEC ‘07 21 December 2007.
Analyse de la cohérence en présence de lumière partiellement polarisée François Goudail Laboratoire Charles Fabry de l’Institut d’Optique, Palaiseau (France)
Quantum Computing Lecture 19 Robert Mann. Nuclear Magnetic Resonance Quantum Computers Qubit representation: spin of an atomic nucleus Unitary evolution:
Department of Computer Science & Engineering University of Washington
1 Quantum Computing: What’s It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10,  John.
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
Introduction to Quantum Information Processing Lecture 4 Michele Mosca.
Dirac Notation and Spectral decomposition Michele Mosca.
Anuj Dawar.
Design and Characterization of Solid-State Quantum Processors with Slow Decoherence Rates for NMR QIP Len Mueller University of California, Riverside CCF
Advanced Computer Architecture Lab University of Michigan Quantum Noise and Distance Patrick Cassleman More Quantum Noise and Distance Measures for Quantum.
1 Recap (I) n -qubit quantum state: 2 n -dimensional unit vector Unitary op: 2 n  2 n linear operation U such that U † U = I (where U † denotes the conjugate.
分子・レーザー相互作用を使っ た 量子情報処理 大槻幸義 ( 東北大院理. & JST-CREST)
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.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
Dirac Notation and Spectral decomposition
1cs542g-term Notes  Extra class next week (Oct 12, not this Friday)  To submit your assignment: me the URL of a page containing (links to)
Liquid State NMR Quantum Computing
Lecture 1 Signals in the Time and Frequency Domains
Principle Component Analysis (PCA) Networks (§ 5.8) PCA: a statistical procedure –Reduce dimensionality of input vectors Too many features, some of them.
Density Matrix Density Operator State of a system at time t:
Eigenvalue Problems Solving linear systems Ax = b is one part of numerical linear algebra, and involves manipulating the rows of a matrix. The second main.
The Limits of Adiabatic Quantum Algorithms
Lecture note 8: Quantum Algorithms
Algorithms Artur Ekert. Our golden sequence H H Circuit complexity n QUBITS B A A B B B B A # of gates (n) = size of the circuit (n) # of parallel units.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Engineering of arbitrary U(N) transformation by quantum Householder reflections P. A. Ivanov, E. S. Kyoseva, and N. V. Vitanov.
Quantum One: Lecture Representation Independent Properties of Linear Operators 3.
The Road to Quantum Computing: Boson Sampling Nate Kinsey ECE 695 Quantum Photonics Spring 2014.
Quantum Computing MAS 725 Hartmut Klauck NTU
Quantum Factoring Michele Mosca The Fifth Canadian Summer School on Quantum Information August 3, 2005.
Quantum Control Synthesizing Robust Gates T. S. Mahesh
Adiabatic quantum computation and stoquastic Hamiltonians B.M. Terhal IQI, RWTH Aachen A review of joint work with S. Bravyi, D.P.DiVincenzo and R. Oliveira.
David G. Cory Department of Nuclear Engineering Massachusetts Institute of Technology Using Nuclear Spins for Quantum Information Processing and Quantum.
1 Complex Images k’k’ k”k” k0k0 -k0-k0 branch cut   k 0 pole C1C1 C0C0 from the Sommerfeld identity, the complex exponentials must be a function.
1 Dorit Aharonov Hebrew Univ. & UC Berkeley Adiabatic Quantum Computation.
A Study of Error-Correcting Codes for Quantum Adiabatic Computing Omid Etesami Daniel Preda CS252 – Spring 2007.
Eigenvalues The eigenvalue problem is to determine the nontrivial solutions of the equation Ax= x where A is an n-by-n matrix, x is a length n column.
Efficient measure of scalability Cecilia López, Benjamin Lévi, Joseph Emerson, David Cory Department of Nuclear Science & Engineering, Massachusetts Institute.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.
1 Quantum Computation with coupled quantum dots. 2 Two sides of a coin Two different polarization of a photon Alignment of a nuclear spin in a uniform.
As if computers weren’t fast enough already…
Chapter 4 Two-Level Systems, Spin. Two-level systems Let us start with the simplest non-trivial state space, with only two dimensions Despite its simplicity,
Chapter 13 Discrete Image Transforms
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Chapter 3 Postulates of Quantum Mechanics. Questions QM answers 1) How is the state of a system described mathematically? (In CM – via generalized coordinates.
Suggestion for Optical Implementation of Hadamard Gate Amir Feizpour Physics Department Sharif University of Technology.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Intro to Quantum Algorithms SUNY Polytechnic Institute Chen-Fu Chiang Fall 2015.
Background on Classification
Postulates of Quantum Mechanics
Introduction to Quantum Computing Lecture 1 of 2
A Ridiculously Brief Overview
Chap 4 Quantum Circuits: p
Chapter 4 Two-Level Systems.
OSU Quantum Information Seminar
Eigenvectors and Eigenvalues
QM2 Concept Test 10.1 Consider the Hamiltonian
Quantum One.
Presentation transcript:

Analysis of the Superoperator Obtained by Process Tomography of the Quantum Fourier Transform in a Liquid-State NMR Experiment Joseph Emerson Dept. of Nuclear Engineering MIT MIT: Yaakov S. Weinstein, Nicolas Boulant, Tim Havel, David G. Cory CNEA (Argentina): Marcos Saraceno

A general transformation is given by a completely positive linear map, or “superoperator”: Performing state tomography on the output states for a complete set of input states completely specifies the superoperator for the transformation: S N 2 X N 2 Supermatrix Density matrices as N 2 x 1 vectors where each column of R in and R out is a vector of length N 2 obtained by stacking the columns of the associated N x N density matrix, such that, Superoperators and Quantum Process Tomography R in R out

Quantum Fourier Transform The quantum Fourier transform is implemented via a sequence of one and two qubit quantum gates. For 3 qubits the gate-sequence is: H j is the one-qubit Hadamard gate on qubit j. B jk is the two-qubit conditional phase gate. It applies a z-phase to qubit j only if qubit k is one. The QFT is a fundamental component of all practical algorithms that potentially offer exponential speed-ups, ie. Shor’s algorithm and quantum simulation.

NMR Hamiltonian for Liquid Solution of Alanine RF Wave C3 C2 Alanine C3 C1 C2 J 12 J 23 J 13 H total (t) = H int + H ext (t) H int =  1 I 1 z +  2 I 2 z +  3 I 3 z + 2  J 12 I 1 z I 2 z + 2  J 13 I 1 z I 3 z + 2  J 23 I 2 z I 3 z H ext (t) =  RFx (t)·(I 1 x + I 2 x + I 3 x )+  RFy (t)·(I 1 y + I 2 y + I 3 x ) time-dependent control from applied RF field static B field spin-spin coupling in high-field approximation Dominant decoherence source: residual inter- molecular dipolar interactions.

S exp Plotted is the real part of supermatrices in the computational basis. How can we determine the relative importance of different error and decoherence sources (and what can we do about them)? Measured QFT Supermatrix

Time-domain resolution limitations in the RF control will produce a unitary which only approximates the exact (desired) gate: Initial State: 000Final State: 001RF Control Waveform Implemented Unitary is an Approximation to the Exact QFT

Eigenvalues of Implemented Unitary Note: the exact QFT has four degenerate eigenvalues: (1,1,1,i,i,-1,-1,-i) The implemented unitary is no longer degenerate due to the cumulative unitary errors in the gate sequence.  (3 qubits) (x) Implemented Unitary (o) Unitary part of largest Kraus operator

Kraus Decomposition Given the supermatrix we can construct a canonical Kraus sum from the eigenvectors of the “Choi” matrix (see T. Havel, J. Math Phys, 2002) : Experimental QFT Kraus operator amplitudes A1A1 A2A2 Trace-preserving condition: Kraus Decomposition: +

Information from the Largest Kraus Operator (x) Implemented Unitary (o) Unitary part of Largest Kraus Operator Obviously this cumulative unitary error, once identified, can be removed by additional pulses… though we do not learn much about our sources of error from this process.

Experimental Supermatrix Eigenvalues (o) Implemented Unitary (x) Experimental Map Unital Process

Numerical Simulation of the Experiment with the Measured “Natural” Relaxation Superoperator (o) Implemented Unitary (x) Simulation of Experiment with the Measured “Natural” Relaxation Superoperator

Uniform Eigenvalue Attenuation under the Depolarizing Channel  dep  p  p  The superoperator S dep for this process has the N eigenvalues (1,a,a,…,a), where eigenvalue 1 is for the identity eigenvector, and a = 1-p is an attenuation constant. S dep is thus diagonal is the eigenbasis of any trace-preserving, unital transformation, and uniformly attenuates its N-1 non-identity eigenvalues by the factor 1-p.

The QFT Sequence “Evens-Out” the Non- Uniform Natural System Decoherence (o) Implemented Unitary under Depolarizing Channel (x) Simulation of Experiment with the Measured “Natural” Relaxation Superoperator The relaxation super- operator under the QFT may/should be very different than for the internal Hamiltonian. Some small differences More importantly, the in- homogeneity of the RF over the sample introduces “incoherence” effects…

Signatures of Incoherence In NMR, p(  ) arises from the inhomogeneous distribution of RF power over the sample. S inc = d  p(  ) [ U(  ) U(  ) ] Not environment-induced decoherence, but “ignorance- induced” decoherence. U(  ) = U QFT exp(iK(  )) p(  ) Some basic features of the eigenvalues of S inc are determined from generic properties of p(  ). inc where, is unitary.

Numerical Simulation of Experiment with the Measured RF Inhomogeneity Distribution (o) Implemented Unitary (x) Simulation of Sequence with the Measured RF Inhomogeneity Distribution Phase-shift of eigenvalues due to asymmetric p(  ) Eigenvalues along real axis are from the degenerate unperturbed eigenvalues. Spreading determined by properties of a doubly-stochastic matrix. Under strong but physical assumptions the spectral gap can be related to the width of the inhomogeneity

Numerical Simulation with RF Inhomogeneity and the Natural Relaxation Superoperator (o) Numerical Simulation of the Sequence with the Natural Relaxation Superoperator and RF Inhomogeneity (x) Experimental Map Differences give some indication of the dependence of the relaxation super- operator on the applied transformation.

Conclusions and Future Work From the largest operator in the Kraus decomposition we can identify a unitary “close” to the target unitary. Is this the closest unitary? Is there information in the smaller operators? The supermatrix eigenvalues exhibit distinctive signatures for different types of decoherence: models and perturbation theory provide estimates of the “strength” of different noise sources. Do other maps mix the noise generators as uniformly as the QFT? Explore relation between cumulative error and underlying error model? Try regular vs chaotic/random unitary maps… As the system increases in size we need to develop algorithms and statistical methods to efficiently estimate the few scalar quantities of most interest. Can the universal statistics of random maps help?