Quantum computation with classical bits

Slides:



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

Quantum Computation and Quantum Information – Lecture 2
Emergence of Quantum Mechanics from Classical Statistics.
GHZ correlations are just a bit nonlocal Carlton M. Caves University of New Mexico caves Seminar date Please join the APS Topical.
Energy. Simple System Statistical mechanics applies to large sets of particles. Assume a system with a countable set of states.  Probability p n  Energy.
Phase in Quantum Computing. Main concepts of computing illustrated with simple examples.
X y p z >0 p z
Quantum Theory Made Easy 0 1 Classical p0p0 p1p1 probabilities Quantum a0a0 a1a1 0 1 amplitudes p 0 +p 1 =1|a 0 | 2 +|a 1 | 2 =1 bit qubit p i is a real.
Quantum fermions from classical statistics. quantum mechanics can be described by classical statistics !
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
From Atoms to Quantum Computers: the classical and quantum faces of nature Antonio H. Castro Neto Dartmouth College, November 2003.
Anuj Dawar.
Advanced Computer Architecture Lab University of Michigan Quantum Noise and Distance Patrick Cassleman More Quantum Noise and Distance Measures for Quantum.
Fermions and non-commuting observables from classical probabilities.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Quantum fermions from classical statistics. quantum mechanics can be described by classical statistics !
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
Simulating Physical Systems by Quantum Computers J. E. Gubernatis Theoretical Division Los Alamos National Laboratory.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
Quantum Algorithms Preliminaria Artur Ekert. Computation INPUT OUTPUT Physics Inside (and outside) THIS IS WHAT OUR LECTURES WILL.
Quantum correlations. Adam W. Majewski. Quantum entanglement. Ghhjhjj Quantum entanglement is a phenomenon that occurs when particles (subsystems) are.
Quantum Information Processing
Quantum computing Alex Karassev. Quantum Computer Quantum computer uses properties of elementary particle that are predicted by quantum mechanics Usual.
Study and characterisation of polarisation entanglement JABIR M V Photonic sciences laboratory, PRL.
PHYS 3313 – Section 001 Lecture #17
Presented by: Erik Cox, Shannon Hintzman, Mike Miller, Jacquie Otto, Adam Serdar, Lacie Zimmerman.
Quantum Computing MAS 725 Hartmut Klauck NTU
Quantum Algorithms for Neural Networks Daniel Shumow.
IPQI-2010-Anu Venugopalan 1 Quantum Mechanics for Quantum Information & Computation Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
6. Second Quantization and Quantum Field Theory
Alice and Bob’s Excellent Adventure
Outline Main result Quantum computation and quantum circuits Feynman’s sum over paths Polynomials QuPol program “Quantum Polynomials” Quantum polynomials.
Quantum, classical & coarse-grained measurements Johannes Kofler and Časlav Brukner Faculty of Physics University of Vienna, Austria Institute for Quantum.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 2117 Lecture.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Quantum Physics Mathematics. Quantum Physics Tools in Real Life Reality.
Ch 9 pages Lecture 22 – Harmonic oscillator.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
1 Qubits, time and the equations of physics Salomon S. Mizrahi Departamento de Física, CCET, Universidade Federal de São Carlos Time and Matter October.
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.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Non-locality and quantum games Dmitry Kravchenko University of Latvia Theory days at Jõulumäe, 2008.
Quantum Shift Register Circuits Mark M. Wilde arXiv: National Institute of Standards and Technology, Wednesday, June 10, 2009 To appear in Physical.
Quantum Computing Keith Kelley CS 6800, Theory of Computation.
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Schrodinger wave equation
Postulates of Quantum Mechanics
Introduction to Quantum Computing Lecture 1 of 2
Quantum Computers Superposition Interference Entanglement and Quantum Error Correction Lesson 1 By: Professor Lili Saghafi
Quantum mechanics from classical statistics
Quantum One.
For computer scientists
14.2 Electrons in the atom Each different element has its own characteristic pattern of colors called a spectrum. The colors of clothes, paint, and.
Quantum One.
2. Solving Schrödinger’s Equation
??? The Uncertainty Principle Uncertainty Rel W. Udo Schröder, 2004.
Quantum Information with Continuous Variables
Quantum Computing Dorca Lee.
A Ridiculously Brief Overview
Classical World because of Quantum Physics
Quantum Deep Learning Neural Network
Double Slit Experiment
Chap 4 Quantum Circuits: p
OSU Quantum Information Seminar
Quantum One.
Presentation transcript:

Quantum computation with classical bits

Does our brain use quantum computing Does our brain use quantum computing ? Do artificial neural networks employ quantum algorithms ? Can classical statistical memory materials perform quantum operations ?

Quantum gates Unitary transformation of density matrix Rotation Single qubit: Rotation Hadamard gate Two qubits: CNOT gate

Entanglement CNOT - gate transforms product state for two qubits into entangled state All unitary operations for two qubits can be constructed from Hadamard, rotation and CNOT gates.

Probabilistic computing Not necessarily quantum computing Transforms probabilistic information about state at layer t to probabilistic information at neighboring layer Deterministic computing special case with sharp values of bits 1 or 0, or Ising spins 1 or -1 Probabilistic computing : only expectation values of Ising spins and correlations ( probabilistic information) Can probabilistic computing in classical statistical systems perform quantum operations?

Quantum subsystems Quantum systems are subsystems of classical statistical systems They use only part of the available probabilistic information Incomplete statistics

Example One qubit from three classical Ising spins Ising spin : macroscopic two-level observable Neuron fires above or below certain level

Three Ising spins ( classical bits ) Arbitrary macroscopic two-level observables Eight states Classical statistics

One qubit from three classical bits Expectation values : Quantum subsystem defined by density matrix Only part of classical statistical information used for subsystem

Incomplete statistics Classical correlation function between Ising spin 1 and Ising spin 2 cannot be computed from information in subsystem ! It involves information about environment of subsystem : probabilistic information beyond

Quantum condition This implies uncertainty relation ! Positivity of density matrix requires quantum condition : This implies uncertainty relation !

Non-commuting operators Quantum rule for expectation values follows from classical statistical rules :

Hadamard gate Can be realized by deterministic spin flip

A few one qubit gates

CNOT gate for two qubits SU(4)- generators : CNOT – gate:

Quantum subsystems using correlations Scaling for Q qubits Independent classical spins for each entry of density matrix: classical bits needed Use correlations: Only 3Q classical bits needed !

Probabilistic computation If density matrix for quantum subsystem involves correlations: CNOT gate cannot be realized by deterministic operations on six classical Ising spins All two-qubit gates can be realized if arbitrary changes of probability distribution for six classical Ising spins are allowed

Scaling for many qubits Scaling for many qubits is theoretically possible if correlations are used Big question : How to realize suitable changes of probability distributions in practice ?

Static memory materials Generalized Ising model: Boundary term :

Probabilistic computing with static memory materials ? Let general equilibrium classical statistics transport information from one layer to the next Simulation, with D. Sexty

Classical interference Depending on boundary conditions : Positive interference Negative interference

Quantum formalism for classical statistics Formalism for information transport from one hypersurface to the next: Classical wave functions and density matrix Transfer matrix formalism : Heisenberg picture Wave functions : Schroedinger picture Non commuting operators for observables Quantum rules from classical statistical rules

Artificial neural networks Can neural networks learn to perform quantum operations ?

Arbitrary quantum operations Arbitrary quantum gates for an arbitrary number of qubits can be realized by suitable changes of probability distributions Infinite number of classical bits or continuous Ising spins needed Similar to description of rotations by classical bits

Quantum Field Theories Continuous classical observables or fields always involve an infinite number of bits Bits: yes/no decisions Possible measurement values 1 or 0 or 1 or -1 Discrete spectrum of observables

Conclusion Quantum operations can be performed by classical statistical systems Very low temperature or well isolated systems of microscopic qubits not needed !

end

quantum mechanics can be described by classical statistics !

statistical picture of the world basic theory is not deterministic basic theory makes only statements about probabilities for sequences of events and establishes correlations probabilism is fundamental , not determinism ! quantum mechanics from classical statistics : not a deterministic hidden variable theory

Probabilistic realism Physical theories and laws only describe probabilities

Physics only describes probabilities Gott würfelt

Physics only describes probabilities Gott würfelt Gott würfelt nicht

Physics only describes probabilities Gott würfelt Gott würfelt nicht humans can only deal with probabilities

probabilistic Physics There is one reality This can be described only by probabilities one droplet of water … 1020 particles electromagnetic field exponential increase of distance between two neighboring trajectories

probabilistic realism The basis of Physics are probabilities for predictions of real events

laws are based on probabilities determinism as special case : probability for event = 1 or 0 law of big numbers unique ground state …

conditional probability sequences of events( measurements ) are described by conditional probabilities both in classical statistics and in quantum statistics

w(t1) : not very suitable for statement , if here and now a pointer falls down

Schrödinger’s cat conditional probability : if nucleus decays then cat dead with wc = 1 (reduction of wave function)

structural elements of quantum mechanics

unitary time evolution ν

h

Simple conversion factor for units

i

presence of complex structure

[A,B]=C

non-commuting observables classical statistical systems admit many product structures of observables many different definitions of correlation functions possible , not only classical correlation ! type of measurement determines correct selection of correlation function !

conclusion quantum statistics emerges from classical statistics quantum state, superposition, interference, entanglement, probability amplitude unitary time evolution of quantum mechanics can be described by suitable time evolution of classical probabilities memory materials are quantum simulators conditional correlations for measurements both in quantum and classical statistics

Can quantum physics be described by classical probabilities ? “ No go “ theorems Bell , Clauser , Horne , Shimony , Holt implicit assumption : use of classical correlation function for correlation between measurements Kochen , Specker assumption : unique map from quantum operators to classical observables

end