Еugene Grichuk, Margarita Kuzmina, Eduard Manykin

Slides:



Advertisements
Similar presentations
Optics, Eugene Hecht, Chpt. 8
Advertisements

By Christopher Coffman 11/7/2012. What are quantum computers? What are the physics concepts are at play? What are the basic components of a quantum computer.
University of Queensland
Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
Emergence of Quantum Mechanics from Classical Statistics.
David Gershoni The Physics Department, Technion-Israel Institute of Technology, Haifa, 32000, Israel and Joint Quantum Institute, NIST and University of.
Quantum Computation and the Bloch Sphere
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Quantum Computing Ambarish Roy Presentation Flow.
NMR Quantum Information Processing and Entanglement R.Laflamme, et al. presented by D. Motter.
University of Queensland
UNIVERSITY OF NOTRE DAME Xiangning Luo EE 698A Department of Electrical Engineering, University of Notre Dame Superconducting Devices for Quantum Computation.
Quantum Computing Joseph Stelmach.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
Quantum Computers Todd A. Brun Communication Sciences Institute USC.
LESSON 4 METO 621. The extinction law Consider a small element of an absorbing medium, ds, within the total medium s.
Quantum Information Processing
Quantum Algorithms for Neural Networks Daniel Shumow.
A Study of The Applications of Matrices and R^(n) Projections By Corey Messonnier.
Quantum Information, Communication and Computing Jan Kříž Department of physics, University of Hradec Králové Doppler Institute for mathematical physics.
From Bits to Qubits Wayne Viers and Josh Lamkins
QUANTUM COMPUTING an introduction Jean V. Bellissard Georgia Institute of Technology & Institut Universitaire de France.
Engineering of arbitrary U(N) transformation by quantum Householder reflections P. A. Ivanov, E. S. Kyoseva, and N. V. Vitanov.
Degree of polarization in quantum optics UCMUCM Luis L. Sánchez-Soto, E. C. Yustas Universidad Complutense. Madrid. Spain Andrei B. Klimov Universidad.
Quantization via Fractional Revivals Quantum Optics II Cozumel, December, 2004 Carlos Stroud, University of Rochester Collaborators:
Integrated electronic optical switches in future chip ion trap Shu, Gang 5/24/2006.
Quantum Computing Paola Cappellaro
Serge Andrianov Theory of Symplectic Formalism for Spin-Orbit Tracking Institute for Nuclear Physics Forschungszentrum Juelich Saint-Petersburg State University,
High Altitude Observatory (HAO) – National Center for Atmospheric Research (NCAR) The National Center for Atmospheric Research is operated by the University.
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.
Review of Basic Polarization Optics for LCDs Module 4.
Nawaf M Albadia
Quantum Mechanics(14/2) Hongki Lee BIOPHOTONICS ENGINEERING LABORATORY School of Electrical and Electronic Engineering, Yonsei University Quantum Computing.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
A SEMINAR ON Q UANTUM C OMPUTING Institute Of Engineering & Management (CSE 3 rd year batch) Submitted to- Submitted by- Mr. D.P.S. Rathor Sudhir.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
As if computers weren’t fast enough already…
Quantum Computing: An Introduction Khalid Muhammad 1 History of Quantum Computing Bits and Qubits Problems with the Quantum Machine.
Quantum Computing Charles Bloomquist CS147 Fall 2009.
EKT 441 MICROWAVE COMMUNICATIONS CHAPTER 3: MICROWAVE NETWORK ANALYSIS (PART 1)
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
Bloch spheres, Bloch vectors, and solving Schrödinger’s equation with (almost) no math Two-level time independent hamiltonians David Blasing, Quantum Mechanics.
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.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Purdue University Spring 2016 Prof. Yong P. Chen Lecture 18 (3/24/2016) Slide Introduction to Quantum Photonics.
Quantum Computing: An Introduction
Intro to Quantum Algorithms SUNY Polytechnic Institute Chen-Fu Chiang Fall 2015.
BIOLOGICALLY MOTIVATED OSCILLATORY NETWORK MODEL FOR DYNAMICAL IMAGE SEGMENTATION Margarita Kuzmina, Eduard Manykin Keldysh Institute of Applied Mathematics.
Polarization in spectral lines
Introduction to Quantum Computing Lecture 1 of 2
EKT 356 MICROWAVE COMMUNICATIONS
Algorithmic simulation of far-from- equilibrium dynamics using quantum computer Walter V. Pogosov 1,2,3 1 Dukhov Research Institute of Automatics (Rosatom),
Quantum mechanics from classical statistics
For computer scientists
Quantum Teleportation
Complex Analysis in Quantum Computing
Quantum One.
Quantum Information with Continuous Variables
Quantum Computing Dorca Lee.
A Ridiculously Brief Overview
OSU Quantum Information Seminar
Quantum computation with classical bits
Polarization Superposition of plane waves
Quantum Computing Prabhas Chongstitvatana Faculty of Engineering
Quantum Computation – towards quantum circuits and algorithms
Quantum Computing Hakem Alazmi Jhilakshi Sharma Linda Vu.
Quantum Computing Joseph Stelmach.
Margarita Kuzmina, Eduard Manykin
Presentation transcript:

Еugene Grichuk, Margarita Kuzmina, Eduard Manykin NETWORK OF COUPLED STOCHASTIC OSCILLATORS AND ONE-WAY QUANTUM COMPUTATIONS Еugene Grichuk, Margarita Kuzmina, Eduard Manykin National Research Nuclear University, Moscow, Russia Keldysh Institute of Applied Mathematics RAS, Moscow, Russia Russian Research Center “Kurchatov Institute”, Moscow, Russia

Classical and quantum computations Programmable computers perform computational tasks by algorithmic means. Universal Turing Machine is the underlying model for all programmable computations (Alan Turing, 1936) Since 1985 it was recognized (David Deutsch) that all computing devices would ultimately be physical systems, obeying laws of physics rather than the laws of classical logics. It gave rise to the concept of a Universal quantum computer. Quantum computation algorithms are based on evolution of some quantum system and exploitataion of quantum physics laws for computation performance. In classical computations the basic piece of the yes – no information is the bit The quantum analogue of classical bit is qubit, a two-level quantum system in the sate of quantum superposition of and After measurement Quantum computing can put much more computational power than classical computing.

Logical quantum networks Gubit - a two-level quantum-mechanical system - is single processing unit of logical quantum network One-qubit gates specify unitary transformations of single qubit states Two-qubit gates specify qubit interactions Diagram of logical quantum network Quantum computations permit to realize a specific type of computation parallelization that is not inherent to traditional parallel computation algorithms. Examples of created highly efficient quantum algorithms: Quantum factoring algorithm (Peter Shor, 1994) Quantum search algorithm (Lov Grover, 1996)

One-way quantum computations One-way quantum computation schemes (or cluster quantum computations, CQC ) are significantly different of quantum computation algorithms based on logical quantum networks. Computational resource of CQC is a cluster of entangled qubits; information processing and information readout are realized via specially organized sequence of оne-qubit measurements; the choice of measurement sequence defines quantum computation algorithm itself. Cluster entanglement is gradually destroyed under the measurements (controlled changing of cluster entanglement degree); so a cluster can be used only once for computation performance. Information processing in CQC schemes is really carried out at classical physics level. Quantum-mechanical principles are used only for “preparation” of entangled qubit cluster. Advantage: CQC computation schemes permit to overcome quantum coherence destruction, caused by measurements (the main difficulty of logical quantum networks). CQC schemes are ideally suitable for realization of Grover’s algorithm of quantum search through unstructured data.

A beam of polarized light as a qubit A beam of polarized light as a qubit. Quantum and classical levels of description Quantum level Stokes parameters - density matrix of pure state. Classical level - electrical field of electro-magnetic wave Stokes parameters in optics parameters of polarization ellipse Pure quantum-mechanical states (states of full polarization of light beam) form the Bloch sphere (known as Poincare sphere in optics).

Оsсillatory model of qubit . Oscillatory qubit model is designed as a pair of chaotically modulated limit cycle oscillators. Let the dynamical equations for unperturbed pair of uncoupled oscillators be : where are radii of limit cycles, are own oscillator frequencies. Consider linearly coupled pair of chaotically modulated oscillators with where and are stationary random functions with zero means. Then the system of ODE, governing the dynamics of the coupled pair can be written as The system (1) of ODE, governing qubit model, can be rewritten in variables

Qubit states (polarization states of light) . Pure state (ensemble of elliptically polarized photons Pure state (ensemble of circularly polarized photons Pure state (ensemble of Mixed state with (ensemble of linearly polarized photons) unpolarized photons). Polarization entangled state.

Dynamical equations for entangled qubit cluster Network of coupled stochastic oscillators simulates a cluster of entangled qubits. The qubit cluster in maximally entangled state corresponds to a beam of quasi-monochromatic unpolarized light, composed of N independent sub-beams. The dynamical system for oscillatory network can be written as - 4D-state vector for j-th oscillator - collection of internal parameters of j-th oscillator - matrices, characterizing oscillatory coupling four-component functions, specifying external actions on j-th network oscillator

Example of one-qubit gate ( polarized light beam transmission through linear polarizer ) Methods of classical ellipsometry The Jones matrix of ideal absorptive linear polarizer

Calculation of cluster entanglement degree changing In view of optical interpretation of N-qubit cluster entanglement degree decrease accompanied the process of CQC computations can be exactly calculated as light polarization degree increase after light transfer through the system of optical devices, corresponding to the set of one-qubit gates, specified by CQC scheme. The Stokes parameters provide proper tools to accurate polarization degree calculation after light transfer through given sequence of optical devices.

Conclusions Qubit admits optical interpretation - as a polarization state of a beam of quasi-monochromatic light (that can be adequately described at classical level). A cluster of N entangled qubits can be interpreted as a beam of unpolarized light, composed of N independent sub-beams. One-qubit gates can be modeled as actions of typical optical devices, modifying of light polarization. Cluster entanglement degree, decreased in the process of CQC computations, is directry related to light polarization degree. Qubit model is designed as a stochastic oscillator. It simulates electric field behavior of light beam and imitates correctly both pure and mixed qubit states. A network of coupled stochastic oscillators is designed as a model of N-qubit cluster. The network DS can provide a detailed analysis of cluster state behavior. Network state is changed in a discrete manner via external actions on single network oscillators. Cluster entanglement degree decrease can be accurately calculated as transformed light polarization degree increase in terms of Stokes parameters.