Quantum Control Synthesizing Robust Gates T. S. Mahesh

Slides:



Advertisements
Similar presentations
Quantum Walks, Quantum Gates, and Quantum Computers Andrew Hines P.C.E. Stamp [Palm Beach, Gold Coast, Australia]
Advertisements

Quantum Computing via Local Control Einat Frishman Shlomo Sklarz David Tannor.
Density Matrix Tomography, Contextuality, Future Spin Architectures T. S. Mahesh Indian Institute of Science Education and Research, Pune.
Efficient Discrete-Time Simulations of Continuous- Time Quantum Query Algorithms QIP 2009 January 14, 2009 Santa Fe, NM Rolando D. Somma Joint work with.
Quantum dynamics and quantum control of spins in diamond Viatcheslav Dobrovitski Ames Laboratory US DOE, Iowa State University Works done in collaboration.
Trapped Ions and the Cluster State Paradigm of Quantum Computing Universität Ulm, 21 November 2005 Daniel F. V. JAMES Department of Physics, University.
7- Double Resonance 1. Types of double resonance experiments 2. 1 H-{ 1 H} Homonuclear Decoupling C-{ 1 H} Heteronuclear Decoupling.
Suppressing decoherence and heating with quantum bang-bang controls David Vitali and Paolo Tombesi Dip. di Matematica e Fisica and Unità INFM, Università.
Coherence Selection: Phase Cycling and Gradient Pulses.
Scaling up a Josephson Junction Quantum Computer Basic elements of quantum computer have been demonstrated 4-5 qubit algorithms within reach 8-10 likely.
Experimental quantum information processing - the of the art Nadav Katz A biased progress report Contact: Quantum computation.
Analysis of the Superoperator Obtained by Process Tomography of the Quantum Fourier Transform in a Liquid-State NMR Experiment Joseph Emerson Dept. of.
A Universal Operator Theoretic Framework for Quantum Fault Tolerance Yaakov S. Weinstein MITRE Quantum Information Science Group MITRE Quantum Error Correction.
Simple quantum algorithms with an electron in a Penning Trap David Vitali, Giacomo Ciaramicoli, Irene Marzoli, and Paolo Tombesi Dip. di Matematica e.
Niels Bohr Institute Copenhagen University Eugene PolzikLECTURE 3.
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Quantum Computing Lecture 19 Robert Mann. Nuclear Magnetic Resonance Quantum Computers Qubit representation: spin of an atomic nucleus Unitary evolution:
Control of Inhomogeneous Spin Ensembles. Robust Control of Inhomogeneous Spin Ensembles M x y M.
Gate robustness: How much noise will ruin a quantum gate? Aram Harrow and Michael Nielsen, quant-ph/0212???
Single-ion Quantum Lock-in Amplifier
Long coherence times with dense trapped atoms collisional narrowing and dynamical decoupling Nir Davidson Yoav Sagi, Ido Almog, Rami Pugatch, Miri Brook.
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
Dynamic Effects in NMR. The timescale in nmr is fairly long; processes occurring at frequencies of the order of chemical shift differences will tend to.
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)
Design and Characterization of Solid-State Quantum Processors with Slow Decoherence Rates for NMR QIP Len Mueller University of California, Riverside CCF
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
Dynamical Error Correction for Encoded Quantum Computation Kaveh Khodjasteh and Daniel Lidar University of Southern California December, 2007 QEC07.
Experimental Realization of Shor’s Quantum Factoring Algorithm ‡ ‡ Vandersypen L.M.K, et al, Nature, v.414, pp. 883 – 887 (2001) M. Steffen 1,2,3, L.M.K.
Hybrid quantum decoupling and error correction Leonid Pryadko University of California, Riverside Pinaki Sengupta(LANL) Greg Quiroz (USC) Sasha Korotkov.
NMR investigations of Leggett-Garg Inequality
Radiofrequency Pulse Shapes and Functions
Quantum Devices (or, How to Build Your Own Quantum Computer)
Liquid State NMR Quantum Computing
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.
Quantum systems for information technology, ETHZ
4. The Nuclear Magnetic Resonance Interactions 4a. The Chemical Shift interaction The most important interaction for the utilization of NMR in chemistry.
CENTER FOR NONLINEAR AND COMPLEX SYSTEMS Giulio Casati - Istituto Nazionale di Fisica della Materia, and Universita’ dell’Insubria -National University.
NMR spectroscopy in solids: A comparison to NMR spectroscopy in liquids Mojca Rangus Mentor: Prof. Dr. Janez Seliger Comentor: Dr. Gregor Mali.
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.
Quantum Computing Preethika Kumar
Implementation of Quantum Computing Ethan Brown Devin Harper With emphasis on the Kane quantum computer.
Chapter 6 Product Operator Product operator is a complete and rigorous quantum mechanical description of NMR experiments and is most suited in describing.
Meet the transmon and his friends
A NMR pulse is often designed to detect a certain outcome (state) but often unwanted states are present. Thus, we need to device ways to select desired.
David G. Cory Department of Nuclear Engineering Massachusetts Institute of Technology Using Nuclear Spins for Quantum Information Processing and Quantum.
1 Dorit Aharonov Hebrew Univ. & UC Berkeley Adiabatic Quantum Computation.
Ancilla-Assisted Quantum Information Processing Indian Institute of Science Education and Research, Pune T. S. Mahesh.
Use of Genetic Algorithm for Quantum Information Processing by NMR V.S. Manu and Anil Kumar Centre for quantum Information and Quantum Computing Department.
Probing fast dynamics of single molecules: non-linear spectroscopy approach Eli Barkai Department of Physics Bar-Ilan University Shikerman, Barkai PRL.
Quantum Computing and Nuclear Magnetic Resonance Jonathan Jones EPS-12, Budapest, August Oxford Centre for Quantum Computation
Efficient measure of scalability Cecilia López, Benjamin Lévi, Joseph Emerson, David Cory Department of Nuclear Science & Engineering, Massachusetts Institute.
Goren Gordon, Gershon Kurizki Weizmann Institute of Science, Israel Daniel Lidar University of Southern California, USA QEC07 USC Los Angeles, USA Dec.
Quantum Computing: An Overview for non-specialists Mikio Nakahara Department of Physics & Research Centre for Quantum Computing Kinki University, Japan.
Principles and Applications of NMR Spectroscopy Instructor: Tai-huang Huang (02)
Large scale quantum computing in silicon with imprecise qubit couplings ArXiv : (2015)
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.
Pulse : Recvr: AB A: DQF-COSY B: Treat only the last pulse Pulse: ; Rcvr:  Essentially the same as the DQF COSY. We can.
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
Suggestion for Optical Implementation of Hadamard Gate Amir Feizpour Physics Department Sharif University of Technology.
Quantum Boltzmann Machine
BASIS Foundation Summer School 2018 "Many body theory meets quantum information" Simulation of many-body physics with existing quantum computers Walter.
Outline Device & setup Initialization and read out
Quantum Correlations in Nuclear Spin Ensembles
OSU Quantum Information Seminar
Determining the capacity of any quantum computer to perform a useful computation Joel Wallman Quantum Resource Estimation June 22, 2019.
Presentation transcript:

Quantum Control Synthesizing Robust Gates T. S. Mahesh Indian Institute of Science Education and Research, Pune

Contents DiVincenzo Criteria Quantum Control Single and Two-qubit control Control via Time-dependent Hamiltonians Progressive Optimization Gradient Ascent Practical Aspects Bounding within hardware limits Robustness Nonlinearity Summary

Criteria for Physical Realization of QIP Scalable physical system with mapping of qubits A method to initialize the system Big decoherence time to gate time Sufficient control of the system via time-dependent Hamiltonians (availability of a universal set of gates). 5. Efficient measurement of qubits DiVincenzo, Phys. Rev. A 1998

how best can we control its dynamics? Quantum Control Given a quantum system, how best can we control its dynamics? Control can be a general unitary or a state to state transfer (can also involve non-unitary processes: eg. changing purity) Control parameters must be within the hardware limits Control must be robust against the hardware errors Fast enough to minimize decoherence effects or combined with dynamical decoupling to suppress decoherence

General Unitary Hilbert Space 1 UTG UEXP 0 General unitary is state independent: Example: NOT, CNOT, Hadamard, etc. Hilbert Space 1 UTG UEXP obtained by simulation or process tomography 0 Fidelity =  Tr{UEXP·UTG} / N 2

State to State Transfer A particular input state is transferred to a particular output state Eg. 000  ( 000 + 111 ) /2 Hilbert Space Target Final obtained by tomography Initial Fidelity = FinalTarget 2

Universal Gates Local gates (eg. Ry(), Rz()) and CNOT gates together form a universal set Example: Error Correction Circuit Chiaverini et al, Nature 2004

Degree of control Fault-tolerant computation - E. Knill et al, Science 1998. Quantum gates need not be perfect Error correction can take care of imperfections For fault tolerant computation: Fidelity ~ 0.999

Single Qubit (spin-1/2) Control (up to a global phase) Bloch sphere

~ NMR spectrometer B0 B1cos(wrft) RF coil Pulse/Detect Sample resonance at 0 =B0 ~ B0 Superconducting coil B1cos(wrft)

~ Control Parameters B0 B1cos(wrft)  01 = 0 - ref 1 = B1  rf All frequencies are measured w.r.t. ref  RF offset =  = rf - ref  (kHz rad) Chemical Shift 01 = 0 - ref 1 = B1  rf ~ time B0  RF duration 1 RF amplitude  RF phase  RF offset B1cos(wrft)

Single Qubit (spin-1/2) Control (in RF frame) x (in REF frame) y Bloch sphere 90-x 90x y A general state: (up to a global phase)

Single Qubit (spin-1/2) Control (in RF frame) (in REF frame)

Single Qubit (spin-1/2) Control (in RF frame) (in REF frame) Turning OFF 0 : Refocusing y X Refocus Chemical Shift  time x w01

Two Qubit Control Local Gates

Qubit Selective Rotations - Homonuclear Band-width  1/   = 1 1 2 dibromothiophene non-selective  = 1 selective Not a good method: ignores the time evolution

~ Qubit Selective Rotations - Heteronuclear 13CHCl3 1H (500 MHz @ 11T) 13C (125 MHz @ 11T) Larmor frequencies are separated by MHz Usually irradiated by different coils in the probe No overlap in bandwidths at all Easy to rotate selectively ~

Two Qubit Control Local Gates CNOT Gate

Two Qubit Control   Refocussing: X 1 2   Z X 1 2  Chemical shift Coupling constant Refocussing: X Refocus Chemical Shifts 1 2   Z Rz(90)   = 1/(4J) time X Refocus 0 & J-coupling 1 2  Rz(0)  time

Two Qubit Control Z H = = Chemical shift Chemical shift Coupling constant Z H = 1/(4J) R-z(90) time X R-y(90) =

Control via Time-dependent Hamiltonians H = H (a (t), b (t) , g (t) , ) a (t) t NOT EASY !! (exception: periodic dependence)

Control via Piecewise Continuous Hamiltonians b3 g3 H 3 a1 b1 g1 H 1 a2 b2 g2 H 2 a4 b4 g4 H 4 Time

Numerical Approaches for Control Progressive Optimization D. G. Cory & co-workers, JCP 2002 Mahesh & Suter, PRA 2006 Gradient Ascent Navin Khaneja et al, JMR 2005 Common features Generate piecewise continuous Hamiltonians Start from a random guess, iteratively proceed Good solution not guaranteed Multiple solutions may exist No global optimization

Piecewise Continuous Control D. G. Cory, JCP 2002 Strongly Modulated Pulse (SMP) (t3,w13,f3,w3) … (t1,w11,f1,w1) (t2,w12,f2,w2)

Progressive Optimization D. G. Cory, JCP 2002 Random Guess Maximize Fidelity simplex Split Maximize Fidelity simplex Split Maximize Fidelity simplex

Example Fidelity : 0.99 Shifts: 500 Hz, - 500 Hz Coupling: 20 Hz Target Operator : (/2)y1 Fidelity : 0.99

Shifts: 500 Hz, - 500 Hz Coupling: 20 Hz Target Operator : (/2)y1

Initial state Iz1+Iz2 SMPs are not limited by bandwidth Shifts: 500 Hz, - 500 Hz Coupling: 20 Hz Target Operator : (/2)y1 Initial state Iz1+Iz2 SMPs are not limited by bandwidth

Initial state Iz1+Iz2 SMPs are not limited by bandwidth Shifts: 500 Hz, - 500 Hz Coupling: 20 Hz Target Operator : (/2)y1 Initial state Iz1+Iz2 SMPs are not limited by bandwidth

1 2 3 0.99 0.99 0.99 CH3 C NH3+ O -O H 3 1 2 13C Alanine Amp (kHz) Pha (deg) 0.99 Amp (kHz) Pha (deg) 0.99 Amp (kHz) Pha (deg) CH3 C NH3+ O -O H 3 1 2 Time (ms) 13C Alanine

Shifts and J-couplings AB 1 2 3 4 5 6 7 8 9 10 11 12 -1423 134 6.6 -13874 52 35.2 4.1 2.0 1.8 5.3 1444 2.2 74 11.5 4.4 -9688 53.6 147 6.1 201 8233 998 3.6 4.3 6.7 -998 4421 16.2 4279 2455 221.8 1756 -3878

Benchmarking 12-qubits A 8 A’ 2 11 1 3 10 5 4 9 7 6 Qubits Time Benchmarking circuit AA’ 1 2 3 4 5 6 7 8 9 10 11 Qubits Time Fidelity: 0.8 PRL, 2006

Quantum Algorithm for NGE (QNGE) : in liquid crystal PRA, 2006

Quantum Algorithm for NGE (QNGE) : Quantum Algorithm for NGE (QNGE) : Crob: 0.98 PRA, 2006

Progressive Optimization D. G. Cory, JCP 2002 Advantages Works well for small number of qubits ( < 5 ) Can be combined with other optimizations (genetic algorithm etc) Solutions consist of small number of segments – easy to analyze Disadvantage 1. Maximization is usually via Simplex algorithms Takes a long time

SMPs : Calculation Time During SMP calculation: U = exp(-iHeff t) calculated typically over 103 times Qubits Calc. time 1 - 3 minutes 4 - 6 Hours > 7 Days (estimation) Single ½ : Heff = 2 x 2 Two spins : Heff = 4 x 4 . Matrix Exponentiation is a difficult job - Several dubious ways !! 210 x 210 ~ Million 10 spins : Heff =

Gradient Ascent Final density matrix: Navin Khaneja et al, JMR 2005 Liouville von-Neuman eqn Control parameters Final density matrix:

Gradient Ascent Navin Khaneja et al, JMR 2005 Correlation: Backward propagated opeartor at t = jt Forward propagated opeartor at t = jt

Gradient Ascent ’  = ’ t ? (up to 1st order in t) Navin Khaneja et al, JMR 2005  = ’ t ’ ? (up to 1st order in t)

Gradient Ascent Navin Khaneja et al, JMR 2005 Step-size

Gradient Ascent GRAPE Algorithm Stop Guess uk Navin Khaneja et al, JMR 2005 GRAPE Algorithm Guess uk No Correlation > 0.99? Yes Stop

Practical Aspects Bounding within hardware limits Robustness Nonlinearity

Shoots-up if any control parameter exceeds the limit Bounding the control parameters Quality factor = Fidelity + Penalty function Shoots-up if any control parameter exceeds the limit To be maximized

Practical Aspects Bounding within hardware limits Robustness Nonlinearity

Incoherent Processes Spatial inhomogeneities in RF / Static field Hilbert Space Final Final Final Initial UEXPk(t)

Robust Control Coherent control in the presence of incoherence: Hilbert Space Target Initial UEXPk(t)

Inhomogeneities SFI Analysis of spectral line shapes RFI Analysis of nutation decay Ideal SFI f f z z Ideal RFI y y x x

RF inhomogeneity 1 Ideal Probability of distribution In practice RFI: Spatial nonuniformity in RF power RF Power Desired RF Power

RF inhomogeneity Bruker PAQXI probe (500 MHz)

Example Shifts: 500 Hz, - 500 Hz Coupling: 20 Hz Target Operator : (/2)y1

Shifts: 500 Hz, - 500 Hz Coupling: 20 Hz Target Operator : (/2)y1

Shifts: 500 Hz, - 500 Hz Coupling: 20 Hz Target Operator : (/2)y1

Initial state Iz1+Iz2 Shifts: 500 Hz, - 500 Hz Coupling: 20 Hz Target Operator : (/2)y1 Initial state Iz1+Iz2

Initial state Iz1+Iz2 Shifts: 500 Hz, - 500 Hz Coupling: 20 Hz Target Operator : (/2)y1 Initial state Iz1+Iz2

Robust Control Initial state Ix1+Ix2 - Eg. Two-qubit system Shifts: 500 Hz, -500 Hz J = 50 Hz Fidelity = 0.99 Target Operator : ()y1 Initial state Ix1+Ix2 -

Robust Control - Initial state Ix1+Ix2 Eg. Two-qubit system Shifts: 500 Hz, -500 Hz J = 50 Hz Fidelity = 0.99 Target Operator : ()y1 - Initial state Ix1+Ix2

Practical Aspects Bounding within hardware limits Robustness Nonlinearity

Spectrometer non-linearities Computer: “This is what I sent”

Spectrometer non-linearities Spins: “This is what we got” Computer: “This is what I sent”

~ Multi-channel probes: Target coil Spy coil - D. G. Cory et al, PRA 2003.

Spectrometer non-linearities F

Feedback correction F hardware F-1 F hardware - D. G. Cory et al, PRA 2003.

Feedback correction: Computer: Spins: “This is what we got” “This is what I sent” Spins: “This is what we got” Compensated Shape - D. G. Cory et al, PRA 2003.

Summary DiVincenzo Criteria Quantum Control Single and Two-qubit control Control via Time-dependent Hamiltonians Progressive Optimization Gradient Ascent Practical Aspects Bounding within hardware limits Robustness Nonlinearity