1 / 10

Quantum Control

Quantum Control. Quantum compiling Algorithms as closed loop control circuits Correcting quantum errors with unitary operations. Shaped Ultrafast Optical Pumping of NMR Systems. Jason Taylor / Neil Gershenfeld MIT Media Lab Daniel Morris / Phil Bucksbaum University of Michigan.

aimon
Download Presentation

Quantum Control

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Quantum Control • Quantum compiling • Algorithms as closed loop control circuits • Correcting quantum errors with unitary operations

  2. Shaped Ultrafast Optical Pumping of NMRSystems Jason Taylor / Neil Gershenfeld MIT Media Lab Daniel Morris / Phil Bucksbaum University of Michigan

  3. Typical pulse shaper with feedback

  4. goals • Increase nuclear polarization • Unity polarization would be nice for quantum computers • Decrease nuclear polarization • Resetting qubits is necessary for quantum error correction • Selectively polarize nuclei

  5. NMR & Biology • Tools for accessible NMR • Table-top NMR (whole systems, amplifiers) • Automatic shimming • Ultimate goal: • Biological structure via NMR • Imaging • Structure calculations • ??

  6. Radio Frequency Graphical Models Implemented in Analog Circuits Benjamin Vigoda MIT Media Lab

  7. A Spread Spectrum Radio System

  8. AFSR Iterative Factor GraphFinds phase of 4 bin, 2 tap LFSR

  9. Soft Gates for Coding pz(1) = px(1) py(1) pz(0) = px(0) py(0) pz(1) = px(0) py(1) + px(1) py(0) pz(0) = px(0) py(0) + px(1) py(1) For Binary Symmetric Channel with Hard Decision pz(x=1|y = 0) = p(x=0|y=1) = 1-A pz(x=1|y = 1) = p(x=0|y=0) = A

  10. Translinear Multiplier SoftGate Source Referenced Subthreshold MOSFET: IDS = IO e KSVGS/t (1 – e -VDS/t ) For understanding circuit, think: IDS = IO e KVGS Circuit Computes: pz(1) = px(0) py(1) + px(1) py(0) pz(0) = px(0) py(0) + px(1) py(1)

More Related