NMR Quantum Information Processing and Entanglement R.Laflamme, et al. presented by D. Motter.

Slides:



Advertisements
Similar presentations
PHYSICS OF MAGNETIC RESONANCE
Advertisements

Density Matrix Tomography, Contextuality, Future Spin Architectures T. S. Mahesh Indian Institute of Science Education and Research, Pune.
Introduction to Entanglement Allan Solomon, Paris VI.
Frustration of Decoherence and Entanglement-sharing in the Spin-bath Andrew Hines Christopher Dawson Ross McKenzie Gerard Milburn.
Thus in the rotating frame the magnetic field becomes time-independent while the z-magnetic field component is reduced by the frequency of rotation x RoF.
Quantum Information Stephen M. Barnett University of Strathclyde The Wolfson Foundation.
Entropy in the Quantum World Panagiotis Aleiferis EECS 598, Fall 2001.
Danny Terno Entropy and entanglement on the horizon joint work with Etera Livine gr-qc/ gr-qc/ Phys. Rev. A (2005)
1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 / RAC 2211 Lecture.
Lecture 3 Nonparametric density estimation and classification
On Quantum Walks and Iterated Quantum Games G. Abal, R. Donangelo, H. Fort Universidad de la República, Montevideo, Uruguay UFRJ, RJ, Brazil.
Emergence of Quantum Mechanics from Classical Statistics.
Advanced Computer Architecture Lab University of Michigan Quantum Operations and Quantum Noise Dan Ernst Quantum Noise and Quantum Operations Dan Ernst.
ECE 497NC: Unconventional Computer Architecture Lecture 12: Quantum Computers II – Implementation Issues Nicholas Carter.
Quantum Computing Lecture 19 Robert Mann. Nuclear Magnetic Resonance Quantum Computers Qubit representation: spin of an atomic nucleus Unitary evolution:
Quantum Computation and Error Correction Ali Soleimani.
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
UNIVERSITY OF NOTRE DAME Xiangning Luo EE 698A Department of Electrical Engineering, University of Notre Dame Superconducting Devices for Quantum Computation.
Preference Analysis Joachim Giesen and Eva Schuberth May 24, 2006.
Introduction to Quantum Information Processing Lecture 4 Michele Mosca.
Fermions and non-commuting observables from classical probabilities.
Quantum Algorithms II Andrew C. Yao Tsinghua University & Chinese U. of Hong Kong.
Main ideas of a NMR quantum computer Advantages of NMR Nucleus is naturally protected from outside interference.Nucleus is naturally protected.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
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.
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
School of Physics & Astronomy FACULTY OF MATHEMATICAL & PHYSICAL SCIENCE Parallel Transport & Entanglement Mark Williamson 1, Vlatko Vedral 1 and William.
Entanglement Measures in Quantum Computing About distinguishable and indistinguishable particles, entanglement, exchange and correlation Szilvia Nagy Department.
Quantum correlations. Adam W. Majewski. Quantum entanglement. Ghhjhjj Quantum entanglement is a phenomenon that occurs when particles (subsystems) are.
1 Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Richard Cleve QNC 3129 Lecture 18 (2014)
Introduction to Tensor Network States Sukhwinder Singh Macquarie University (Sydney)
1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 16 (2011)
1 Cost Metrics for Reversible and Quantum Logic Synthesis Dmitri Maslov 1 D. Michael Miller 2 1 Dept. of ECE, McGill University 2 Dept. of CS, University.
Jian-Wei Pan Decoherence-free sub-space and quantum error-rejection Jian-Wei Pan Lecture Note 7.
Chiranjib Mitra IISER-Kolkata
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
NUCLEAR MAGNETIC RESONANCE SPECTROSCOPY Basics of …….. NMR phenomenonNMR phenomenon Chemical shiftChemical shift Spin-spin splittingSpin-spin splitting.
Quantifying quantum discord and Entanglement of Formation via Unified Purifications 岑理相 四川大学 物理科学与技术学院.
Quantum Computing – Part 2 Amanda Denton – Evil Dictator Jesse Millikan – Mad Scientist Lee Ballard – Some Guy With A Beard September 30, 2001.
1 Dorit Aharonov Hebrew Univ. & UC Berkeley Adiabatic Quantum Computation.
Build Your Own Quantum Computer for Fun and Profit!
Quantum Computers by Ran Li.
Quantum Mechanics1 Schrodinger’s Cat. Quantum Mechanics2 A particular quantum state, completely described by enough quantum numbers, is called a state.
1 The Topological approach to building a quantum computer. Michael H. Freedman Theory Group Microsoft Research.
Quantum Computing and Nuclear Magnetic Resonance Jonathan Jones EPS-12, Budapest, August Oxford Centre for Quantum Computation
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.
Efficient measure of scalability Cecilia López, Benjamin Lévi, Joseph Emerson, David Cory Department of Nuclear Science & Engineering, Massachusetts Institute.
Introduction to Quantum Computing
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 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Basic Q.C. One moose, two moose Red moose, blue moose Live moose, dead moose.
As if computers weren’t fast enough already…
1 Transactional Nature of Quantum Information Subhash Kak Computer Science, Oklahoma State Univ © Subhash Kak, June 2009.
Debasis Sarkar * Department of Applied Mathematics, University of Calcutta *
Quantum Computers By Ryan Orvosh.
Density matrix and its application. Density matrix An alternative of state-vector (ket) representation for a certain set of state-vectors appearing with.
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Applications of the Canonical Ensemble: Simple Models of Paramagnetism
Еugene Grichuk, Margarita Kuzmina, Eduard Manykin
Ch9: Decision Trees 9.1 Introduction A decision tree:
Applications of the Canonical Ensemble:
Quantum mechanics from classical statistics
Quantum Information Theory Introduction
Classical World because of Quantum Physics
all Cooper pairs must behave in the same way
Quantum computation with classical bits
An Introduction to Quantum Mechanics through Random Walks
Computational approaches for quantum many-body systems
Quantum One.
Presentation transcript:

NMR Quantum Information Processing and Entanglement R.Laflamme, et al. presented by D. Motter

Introduction ► Does NMR entail true quantum computation? ► What about entanglement? ► Also:  What is entanglement (really)?  What is (liquid state) NMR? ► Why are quantum computers more powerful than classical computers

Outline ► Background  States  Entanglement ► Introduction to NMR ► NMR vs. Entanglement ► Conclusions and Discussion

Background: Quantum States ► Pure States  |  > =  0 |0000> +  1 |0001> + … +  n |1111> ► Density Operator   Useful for quantum systems whose state is not known ► In most cases we don’t know the exact state  For pure states ►  = |  > <  |  When acted on by unitary U ►   U  U †  When measured, probability of M = m ► P{ M = m } = tr(M m † M m  )

Background: Quantum States ► Ensemble of pure states  A quantum system is in one of a number of states |  i > ► i is an index ► System in |  i > with probability p i  {p i, |  i >} is an ensemble ► Density operator   =  Σ p i |  i > <  i | ► If the quantum state is not known exactly  Call it a mixed state

Entanglement ► Seems central to quantum computation ► For pure states:  Entangled if can’t be written as product of states  |  >  |  1 >|  2 >  |  n > ► For mixed states:  Entangled if cannot be written as a convex sum of bi-partite states     Σ a i (  1   2 )

Quantum Computation w/o Entanglement ► For pure states:  If there is no entanglement, the system can be simulated classically (efficiently) ► Essentially will only have 2n degrees of freedom ► For mixed states:  Liquid State NMR at present does not show entanglement  Yet is able to simulate quantum algorithms

Power of Quantum Computing ► Why are Quantum Computers more powerful than their classical counterparts? ► Several alternatives  Hilbert space of size 2 n, so inherently faster ► But we can only measure one such state  Entangled states during computation ► For pure states, this holds. But what about mixed states? ► Some systems with entanglement can be simulated classically  Universe splits  Parallel Universes  All a consequence of superpositions

Introduction to NMR QC ► Nuclei possess a magnetic moment  They respond to and can be detected by their magnetic fields ► Single nuclei impossible to detect directly  If many are available they can be observed as an ensemble ► Liquid state NMR  Nuclei belong to atoms forming a molecule  Many molecules are dissolved in a liquid

Introduction to NMR QC ► ► Sample is placed in external magnetic field   Each proton's spin aligns with the field ► ► Can induce the spin direction to tip off-axis by RF pulses   Then the static field causes precession of the proton spins

Difficulties in NMR QC ► ► Standard QC is based on pure states   In NMR single spins are too weak to measure   Must consider ensembles QC measurements are usually projective In NMR get the average over all molecules Suffices for QC Tendency for spins to align with field is weak Even at equilibrium, most spins are random Overcome by method of pseudo-pure states

Entanglement in NMR ► Today’s NMR  no entanglement  It is not believed that Liquid State NMR is a promising technology ► Future NMR experiments could show entanglement  Solid state NMR  Larger numbers of qubits in liquid state

Quantifying Entanglement ► Measure entanglement by entropy ► Von Neumann entropy of a state ► If λ i are the eigenvalues of ρ, use the equivalent definition:

► Basic properties of Von Neumann’s entropy , equality if and only if in “pure state”.  In a d-dimensional Hilbert space:, the equality if and only if in a completely mixed state, i.e. the equality if and only if in a completely mixed state, i.e. Quantifying Entanglement

► Entropy is a measure of entanglement  After partial measurement ► Randomizes the initial state ► Can compute reduced density matrix by partial trace  Entropy of the resulting mixed state measures the amount of this randomization ► The larger the entropy  The more randomized the state after measurement  The more entangled the initial state was!

Quantifying Entanglement ► Consider a pair of systems (X,Y) ► Mutual Information  I(X, Y) = S(X) + S(Y) – S(X,Y)  J(X, Y) = S(X) – S(X|Y)  Follows from Bayes Rule: ► p(X=x|Y=y) = p(X=x and Y=y)/p(Y=y) ► Then S(X|Y) = S(X,Y) – S(Y) ► For classical systems, we always have I = J

Quantifying Entanglement ► Quantum Systems  S(X), S(Y) come from treating individual subsystems independently  S(X,Y) come from the joint system  S(X|Y) = State of X given Y ► Ambiguous until measurement operators are defined ► Let Pj be a projective measurement giving j with prob p j  S(X|Y) = Σ j p j S(  X|PjY ) ► Define discord (dependent on projectors)  D = J(X,Y) – I(X,Y) ► In NMR, reach states with nonzero discord  Discord central to quantum computation?

Conclusions ► Control over unitary evolution in NMR has allowed small algorithms to be implemented  Some quantum features must be present  Much further than many other QC realizations ► Importance of synthesis realized  Designing a RF pulse sequence which implements an algorithm  Want to minimize imperfections, add error correction

References ► NMR Quantum Information Processing and Entanglement. R. Laflamme and D. Cory. Quantum Information and Computation, Vol 2. No 2. (2002) ► Introduction to NMR Quantum Information Processing. R. Laflamme, et al. April 8, ► Entropy in the Quantum World. Panagiotis Aleiferis, EECS Fall 2001