Michael A. Nielsen University of Queensland Quantum Shwantum Goal: To explain all the things that got left out of my earlier lectures because I tried to.

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

University of Queensland
Identifying universal phases for measurement-based quantum computing Stephen Bartlett in collaboration with Andrew Doherty (UQ)
University of Queensland
Michael A. Nielsen University of Queensland Quantum entropy Goals: 1.To define entropy, both classical and quantum. 2.To explain data compression, and.
Introduction to Computability Theory
Prof. Busch - LSU1 Decidable Languages. Prof. Busch - LSU2 Recall that: A language is Turing-Acceptable if there is a Turing machine that accepts Also.
DENSITY MATRICES, traces, Operators and Measurements
Fall 2004COMP 3351 Recursively Enumerable and Recursive Languages.
Fall 2003Costas Busch - RPI1 Decidability. Fall 2003Costas Busch - RPI2 Recall: A language is decidable (recursive), if there is a Turing machine (decider)
Snick  snack A Working Computer Slides based on work by Bob Woodham and others.
Fundamental limits in Information Theory Chapter 10 :
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Recursively Enumerable and Recursive Languages
1 The Chomsky Hierarchy. 2 Unrestricted Grammars: Rules have form String of variables and terminals String of variables and terminals.
Phase in Quantum Computing. Main concepts of computing illustrated with simple examples.
1 Uncountable Sets continued Theorem: Let be an infinite countable set. The powerset of is uncountable.
Quantum Computing Ambarish Roy Presentation Flow.
Superdense coding. How much classical information in n qubits? Observe that 2 n  1 complex numbers apparently needed to describe an arbitrary n -qubit.
Fall 2004COMP 3351 The Chomsky Hierarchy. Fall 2004COMP 3352 Non-recursively enumerable Recursively-enumerable Recursive Context-sensitive Context-free.
Gate robustness: How much noise will ruin a quantum gate? Aram Harrow and Michael Nielsen, quant-ph/0212???
University of Queensland
Linear Bounded Automata LBAs
Introduction to Quantum Information Processing Lecture 4 Michele Mosca.
Dirac Notation and Spectral decomposition Michele Mosca.
CSEP 590tv: Quantum Computing
Fall 2005Costas Busch - RPI1 Recursively Enumerable and Recursive Languages.
Dogma and Heresy in Quantum Computing DoRon Motter February 18, 2002.
Fall 2006Costas Busch - RPI1 Undecidable Problems (unsolvable problems)
Prof. Busch - LSU1 Undecidable Problems (unsolvable problems)
1 Quantum NP Dorit Aharonov & Tomer Naveh Presented by Alex Rapaport.
1 Introduction to Computability Theory Lecture11: The Halting Problem Prof. Amos Israeli.
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
Dirac Notation and Spectral decomposition
Halting Problem. Background - Halting Problem Common error: Program goes into an infinite loop. Wouldn’t it be nice to have a tool that would warn us.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
Quantum Shannon Theory Patrick Hayden (McGill) 17 July 2005, Q-Logic Meets Q-Info.
Michael A. Nielsen University of Queensland Introduction to computer science Goals: 1.Introduce the notion of the computational complexity of a problem,
Alice and Bob’s Excellent Adventure
Michael A. Nielsen University of Queensland Quantum Mechanics I: Basic Principles Goal of this and the next lecture: to introduce all the basic elements.
University of Queensland Quantum Information and Computation Summer School.
Generating and harnessing photonic entanglement
Quantum systems for information technology, ETHZ
Quantum Information Jan Guzowski. Universal Quantum Computers are Only Years Away From David’s Deutsch weblog: „For a long time my standard answer to.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
The Halting Problem – Undecidable Languages Lecture 31 Section 4.2 Wed, Oct 31, 2007.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
Chapter 1 About Science. Science is the study of nature’s rules.
Michael A. Nielsen Fault-tolerant quantum computation with cluster states School of Physical Sciences Chris Dawson (UQ) Henry Haselgrove (UQ) The University.
University of Queensland Quantum Information and Computation Summer School.
Michael A. Nielsen University of Queensland Density Matrices and Quantum Noise Goals: 1.To review a tool – the density matrix – that is used to describe.
Introduction to Quantum Key Distribution
Michael A. Nielsen University of Queensland Quantum Mechanics II: Examples Goals: 1.To apply the principles introduced in the last lecture to some illustrative.
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
 2005 SDU Lecture13 Reducibility — A methodology for proving un- decidability.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
Computation Motivating questions: What does “computation” mean? What are the similarities and differences between computation in computers and in natural.
Recursively Enumerable and Recursive Languages
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 3 The Church-Turing Thesis Contents Turing Machines definitions, examples,
1 The Chomsky Hierarchy. 2 Unrestricted Grammars: Productions String of variables and terminals String of variables and terminals.
1 Recursively Enumerable and Recursive Languages.
Decidability.
Recursively Enumerable and Recursive Languages
Undecidable Problems Costas Busch - LSU.
Busch Complexity Lectures: Undecidable Problems (unsolvable problems)
A Ridiculously Brief Overview
Quantum Computation – towards quantum circuits and algorithms
University of Queensland
University of Queensland
Determining the capacity of any quantum computer to perform a useful computation Joel Wallman Quantum Resource Estimation June 22, 2019.
Presentation transcript:

Michael A. Nielsen University of Queensland Quantum Shwantum Goal: To explain all the things that got left out of my earlier lectures because I tried to stuff too much in.

The measurement postulate formulated in terms of “observables”

An example of observables in action

What can be measured in quantum mechanics? Computer science can inspire fundamental questions about physics. We may take an “informatic” approach to physics. (Compare the physical approach to information.) Problem: What measurements can be performed in quantum mechanics?

“Traditional” approach to quantum measurements: A quantum measurement is described by an observable, M, that is, a Hermitian operator acting on the state space of the system. Measuring a system prepared in an eigenstate of M gives the corresponding eigenvalue of M as the measurement outcome. “The question now presents itself – Can every observable be measured? The answer theoretically is yes. In practice it may be very awkward, or perhaps even beyond the ingenuity of the experimenter, to devise an apparatus which could measure some particular observable, but the theory always allows one to imagine that the measurement could be made.” - Paul A. M. Dirac What can be measured in quantum mechanics?

Does program number x halt on input of x? Is there an algorithm to solve the halting problem, that is, to compute h(x)? Suppose such an algorithm exists. PROGRAM: TURING(x) IF h(x) = 1 THEN HALT ELSE loop forever Let T be the program number for TURING. TURING(T) haltsh(T) = 1h(T) = 0 Contradiction! The halting problem

The halting observable Can we build a measuring device capable of measuring the halting observable? Yes: Would give us a procedure to solve the halting problem. No: There is an interesting class of “superselection” rules controlling what observables may, in fact, be measured.

Research problem: Is the halting observable really measurable? If so, how? If not, why not?

Quantum computation via measurement alone A quantum computation can be done simply by a sequence of two-qubit measurements. (No unitary dynamics required, except quantum memory!)

Can we build a programmable quantum computer? fixed array Challenge exercise: Prove the no-programming theorem.

A stochastic programmable quantum computer Bell Measurement {

Why it works Bell Measurement {

How to do single-qubit gates using measurements alone Bell Measurement {

Coping with failure

How to do the controlled-not Bell Measurement {

Simplification: reducing to two-qubit measurements The only measurement of more than two qubits presently required is for preparing the input to the controlled-not.

Simplification: reducing to two-qubit measurements

Discussion Measurement is now recognized as a powerful tool in many schemes for the implementation of quantum computation. Research problem: Is there a practical variant of this scheme? Research problem: What sets of measurement are sufficient to do universal quantum computation? Research problem: We have talked about attempts to quantify the “power” of different entangled states. Can a similar quantitative theory of the power of quantum measurements be developed?

Thankyou to: Organizing Committee Michael Bremner Jennifer Dodd Anna Rogers Tutors Michael Bremner Paul Cochrane Chris Dawson Jennifer Dodd Alexei Gilchrist Sarah Morrison Duncan Mortimer Tobias Osborne Rodney Polkinghorne Damian Pope Speakers Dave Bacon Steve Bartlett Bob Clark Alex Hamilton Ping Koy Lam Keith Schwab Matt Sellars Ben Travaglione Andrew White Howard Wiseman The Godparents Gerard Milburn Halina Rubinsztein-Dunlop Andrew White Volunteers Tamyka Bell, Andrew Hines Mark Dowling, Michael Gagen, Joel Gilmore, Nathan Langford, Austin Lund, Jeremy O’Brien, Geoff Pryde, Doug Turk

Reliable communication in the presence of noise Example: Binary symmetric channel 00 11

General model of a noisy channel

Reliable communication in the presence of noise encoding decoding Mutual information X Y

Quantum capacity Research problem: Find a general formula for any of the quantum capacities! qubits classical information entanglement ? Many different capacities

Strong subadditivity