Presentation is loading. Please wait.

Presentation is loading. Please wait.

Quantum Computation and the Bloch Sphere

Similar presentations

Presentation on theme: "Quantum Computation and the Bloch Sphere"— Presentation transcript:

1 Quantum Computation and the Bloch Sphere
Fred Wellstood Joint Quantum Institute and Center for Nanophysics and Advanced Materials Department of Physics University of Maryland, College Park, MD (April 10, 2009)

2 Outline 1. Two key properties of quantum systems: Superposition and Entanglement 2. Brief introduction to quantum computing 3. One qubit quantum computing - 1-qubit states and the Bloch sphere - counting 2-qubit states - 1-qubit operations - Rabi oscillations 4. Controlled Not (CNOT) - a 2-qubit logic operation 5. Conclusions

3 Two key properties of quantum systems
The Principle of Superposition Suppose |0> and |1> are two allowed quantum states of a system, then the system can exist in any linear superposition of these states where a and b are complex numbers But you don’t see such states in everyday objects: "Schrodinger's cat paradox" (Schrodinger, 1935) if this was observable in a macroscopic object + live dead "macroscopic quantum superposition"

4 Two key properties of quantum systems
Quantum Entanglement (Schrodinger, 1935) Multiple quantum systems can exist in entangled super-position states in which the state of an individual system has no well-defined physical meaning. Example: suppose "a" is in |0> and "b" is in |1>. This is a "separable state" or "product state". Both systems are in well-defined state: not entangled. Example: suppose State cannot be written as (some state of system "a" times some state of system "b"). "b" is not in a well-defined state of its own, but depends on "a". If you measure this system and find "a" is 0, then "b" will be 1. If you find "a" is 1, then "b" will be 0. You will never find a and b are both 1. You can't say "sometimes it is in 01 and sometimes 10". Its in both 01 and entangled

5 Quantum Entanglement + and (dead, live) (live, dead) if this were the state of two macroscopic objects Key fact: Superposition and entanglement are unobservable in everyday "macroscopic" objects due to their interaction with other degrees of freedom and the external world. Energy dissipation and "noise" causes transitions between states. "Dephasing" causes the relative phase between the terms in the state to change. The more objects are entangled or superposed, the faster this "decoherence" tends to happen. These strange states are what make a quantum computer powerful!

6 Brief Introduction to Quantum Computing
A quantum computer: a computer that uses coherent quantum mechanical properties of multi-particle systems to do calculations. A quantum computer would be built from quantum bits or "qubits". A "qubit" is just a quantum system with two energy levels ("two-level system"). You can call the levels | > and | >. Or |0> and |1>. The first step in operating the computer would be to prepare all N~1000 or more qubits in a well defined state, such as: |0>|0>|0>|0> |0>|0> this is like clearing the memory of a classical computer. Next perform a mathematical or logical operation by applying a time-dependent perturbation that drives the system into a new state according to: Note: the time-evolution of the state is completely deterministic! With the right perturbation you could flip the 3rd qubit from 0 to 1.

7 Apply perturbations H2(t), H3(t)
Apply perturbations H2(t), H3(t) ... Hm(t) until the m steps of the calculation are complete. Of course you will need to do some work beforehand to figure out what H' corresponds to what mathematical or logical operation. The system is left in a well-defined state ... but it is typically a superposition of classical (0&1) states. The state of each qubit is then measured, producing the result of the calculation: a string of 0's and 1's. This corresponds to selecting one outcome from the superposition... a non-deterministic step... which means you might not get the answer your looking for! The entire calculation may then have to be repeated from the start if another possible outcome is needed.

8 - simulate other quantum systems, search databases
So what's the big deal.... how can you get anything useful out of this? A quantum computer can access superposition states and entangled states... this is a huge set of accessible states that lets the computer do some things much faster than a classical computer: - find the factors of large numbers quickly and break RSA encrypted messages (Shor's algorithm, exponentially faster) - simulate other quantum systems, search databases n A classical computer with an n-bit memory can access states. Example: for n=2 bits the 22 = 4 states are 00, 01, 10 and 11. A quantum computer can access superposition states and entangled states. With n qubits, this gives of order states. n 2 2 Key Question: Can a useful quantum computer be built in practice? Answer: Definitely maybe. Main Experimental Challenge: Noise and interactions with other quantum systems (the outside world) eventually destroys delicate quantum superposition states. This is called decoherence.

9 Quantum Computing with one qubit
Consider one qubit with energy eigenstates |0> and |1>. We will need to be able to put it into superposition states: - probability amplitudes a and b can be complex numbers - state must be normalized to unity so - an overall phase factor has no effect, so we can choose a to be real - then define can always write a superposition state in the form:

10 Superposition States are Points on the Bloch Sphere
z |0> y sphere with radius R=1 …..this is the “Bloch Sphere” x |1>

11 Superposition States as Points on the Unit Sphere
Example: q = 0 z |0> y x

12 Superposition States as Points on the Unit Sphere
Example: q = p, f = 0 z |0> y x |1>

13 Superposition States as Points on the Unit Sphere
Example: q = p/2, f = 0 z |0> y x |1>

14 Superposition States as Points on the Unit Sphere
Example: q = p/2, f = p/2 z |0> y x |1>

15 note: one classical bit has 21 possible states (0 and 1).
There are an infinite number of states on the Bloch sphere, but we can choose a "digital" subset for computing note: one classical bit has 21 possible states (0 and 1). One of these qubits has of order ~22 accessible states 1

16 Example: Number of states for n= 2 qubits
+18 more states with -x, +y and -y in first index = 36 product states

17 But that's not all....... there are also entangled states
(can’t be written as product) such as: and many more such entangled combinations, for example There are way more 2-qubit states (more than 40) than 2 bit states (just 4).... The total number of such quantum states rises super-exponentially with the number of qubits

18 Quantum Computing with one qubit
Consider again just one qubit. There are just a few operations needed to go from one state to any other. Example: Phase gate: |0> |0> |1> eif|1> a|0> +b|1> a|0> +eifb|1> Example: NOT operation: |0> |1> |1> |0> a|0> +b|1> a|1> +b|0> Example: operation: All operations must work on superposition states! |0> |1>

19 Single qubit NOT operation as rotation on the Bloch sphere
Example: q = 0 z |0> y Starting from |0> rotate about the x-axis by p. x Such a rotation would also change |1> to |0>. NOT, or "px-pulse" or H'=esx |1>

20 Single qubit operation as rotation on the Bloch sphere
Example: q = p/2, f = 0 z |0> y starting from |0> rotate about the y-axis by p/2. A p/2-pulse, or sy, or Two such rotations would produce a NOT x |1>

21 Single qubit control operations as rotations on the Bloch sphere
Example: q = p/2, f = p/2 z |0> y rotate about the z-axis by p/2 will increase phase of any state by p/2. This is a “p/2 phase gate” or sz x |1>

22 But how can you get the state to rotate on the Bloch sphere?
- Basic Idea: Use a Rabi Oscillation - Consider a 2-level system with energy splitting DE. - Apply power (a perturbation) continuously at frequency f = DE/h. 1 1 1 DE=hf DE=hf DE=hf Keep applying power --> eventually system pumped entirely into 1 (NOT gate or p-pulse) Start in 0 and Apply power for short time --> Small amplitude to be in 1 Keep applying power --> system pumped back down to 0 (stimulated emission) System cycles back and forth between 0 and 1 deterministically at well-defined rate (Rabi frequency W) set by power and tuning. Stopping power at appropriate time can produce NOT or

23 Two-level System Dynamics
State of a system described by wavefunction Y that satisfies time-dependent Schrodinger’s Equation For a two-level system with Hamiltonian Ho that is being driven at frequency w with a perturbing energy H’, we can write H in matrix form as: where: Eo = energy of ground state, E1 = energy of excited state V cos(wt) = <0|H’|1> and where:

24 Two-level System Dynamics
Plug into Schrodinger’s Equation: Write as two coupled equations: notice that this says that the amplitude b to be found in |1> will change based on amplitude a to be in |0> Fairly nasty…guess solution of form: (this will always work!) Plug into Schrodinger’s Equation

25 For the first equation, we find:
Clean things up: For simplicity, let’s assume we are on resonance ( ) expand this term

26 This term is changing very rapidly and is far from resonance at w…
so it can be dropped…. “rotating wave approximation” take another time derivative of the 1st equation and use 2nd to eliminate dB/dt Assuming A(0) = 1, solution is: is the Rabi frequency

27 Take out an overall phase factor of
probabilty 1 P0=|a|2 P1=|b|2 t

28 Take out an overall phase factor of
Also notice this is now in the familiar “polar coordinate” form: where and

29 Rabi Oscillation on the Bloch Sphere
z |0> df/dt =w01 y To make NOT gate, just drive system at resonance for total time of t = p/W x |1>

30 Controlled NOT or CNOT:
Two Qubit Operations All that stuff was 1 qubit operations. To be useful for computation, you need many qubits. In particular, to do logic, you need to be able to control the state of one qubit based on the state of another. Look at what happens with 2. Controlled NOT or CNOT: Reversible two-qubit operation that flips the second qubit state if and only if the first qubit state is 1. input state output state |0,0> |0,1> |1,0> |1,1> Example, CNOT operation on a|1,1> + b|0,1> + g |1,0> yields: a|1,0> + b|0,1> + g |1,1>

31 Implementing a CNOT in a 2-qubit system
input state output state |0,0> |0,1> |1,0> |1,1> Notice that it just exchanges 10 and 11 .... Like a p-pulse between 10 and 11 Somehow arrange Hamiltonian so that 10 and 01 energy levels have splitting hfo..... different than splittings to 11 and 00. Drive a Rabi oscillation (p-pulse) at resonant frequency fo. 01 and 10 flip, while 11 and 00 are unchanged |1,1> |1,0> DE=hfo |0,1> |0,0>

32 Conclusions Given you a brief introduction to quantum computing. Used 1 and 2 qubit systems for simplicity There is much more to this than covered here... including examples of physical systems that are being used as qubits ... and the many experiments that have been done. Although there still is not a viable quantum computer in existence this is a very active area in theory and experiment.

Download ppt "Quantum Computation and the Bloch Sphere"

Similar presentations

Ads by Google