Optical Quantum Memory and Its Applications in Quantum Communication Systems
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Free-Electron Qubits
Free-Electron Qubits Ori Reinhardt†, Chen Mechel†, Morgan Lynch, and Ido Kaminer Department of Electrical Engineering and Solid State Institute, Technion - Israel Institute of Technology, 32000 Haifa, Israel † equal contributors Free-electron interactions with laser-driven nanophotonic nearfields can quantize the electrons’ energy spectrum and provide control over this quantized degree of freedom. We propose to use such interactions to promote free electrons as carriers of quantum information and find how to create a qubit on a free electron. We find how to implement the qubit’s non-commutative spin-algebra, then control and measure the qubit state with a universal set of 1-qubit gates. These gates are within the current capabilities of femtosecond-pulsed laser-driven transmission electron microscopy. Pulsed laser driving promise configurability by the laser intensity, polarizability, pulse duration, and arrival times. Most platforms for quantum computation today rely on light-matter interactions of bound electrons such as in ion traps [1], superconducting circuits [2], and electron spin systems [3,4]. These form a natural choice for implementing 2-level systems with spin algebra. Instead of using bound electrons for quantum information processing, in this letter we propose using free electrons and manipulating them with femtosecond laser pulses in optical frequencies. Compared to bound electrons, free electron systems enable accessing high energy scales and short time scales. Moreover, they possess quantized degrees of freedom that can take unbounded values, such as orbital angular momentum (OAM), which has also been proposed for information encoding [5-10]. Analogously, photons also have the capability to encode information in their OAM [11,12]. -
Design of a Qubit and a Decoder in Quantum Computing Based on a Spin Field Effect
Design of a Qubit and a Decoder in Quantum Computing Based on a Spin Field Effect A. A. Suratgar1, S. Rafiei*2, A. A. Taherpour3, A. Babaei4 1 Assistant Professor, Electrical Engineering Department, Faculty of Engineering, Arak University, Arak, Iran. 1 Assistant Professor, Electrical Engineering Department, Amirkabir University of Technology, Tehran, Iran. 2 Young Researchers Club, Aligudarz Branch, Islamic Azad University, Aligudarz, Iran. *[email protected] 3 Professor, Chemistry Department, Faculty of Science, Islamic Azad University, Arak Branch, Arak, Iran. 4 faculty member of Islamic Azad University, Khomein Branch, Khomein, ABSTRACT In this paper we present a new method for designing a qubit and decoder in quantum computing based on the field effect in nuclear spin. In this method, the position of hydrogen has been studied in different external fields. The more we have different external field effects and electromagnetic radiation, the more we have different distribution ratios. Consequently, the quality of different distribution ratios has been applied to the suggested qubit and decoder model. We use the nuclear property of hydrogen in order to find a logical truth value. Computational results demonstrate the accuracy and efficiency that can be obtained with the use of these models. Keywords: quantum computing, qubit, decoder, gyromagnetic ratio, spin. 1. Introduction different hydrogen atoms in compound applied for the qubit and decoder designing. Up to now many papers deal with the possibility to realize a reversible computer based on the laws of 2. An overview on quantum concepts quantum mechanics [1]. In this chapter a short introduction is presented Modern quantum chemical methods provide into the interesting field of quantum in physics, powerful tools for theoretical modeling and Moore´s law and a summary of the quantum analysis of molecular electronic structures. -
Quantum Noise in Quantum Optics: the Stochastic Schr\" Odinger
Quantum Noise in Quantum Optics: the Stochastic Schr¨odinger Equation Peter Zoller † and C. W. Gardiner ∗ † Institute for Theoretical Physics, University of Innsbruck, 6020 Innsbruck, Austria ∗ Department of Physics, Victoria University Wellington, New Zealand February 1, 2008 arXiv:quant-ph/9702030v1 12 Feb 1997 Abstract Lecture Notes for the Les Houches Summer School LXIII on Quantum Fluc- tuations in July 1995: “Quantum Noise in Quantum Optics: the Stochastic Schroedinger Equation” to appear in Elsevier Science Publishers B.V. 1997, edited by E. Giacobino and S. Reynaud. 0.1 Introduction Theoretical quantum optics studies “open systems,” i.e. systems coupled to an “environment” [1, 2, 3, 4]. In quantum optics this environment corresponds to the infinitely many modes of the electromagnetic field. The starting point of a description of quantum noise is a modeling in terms of quantum Markov processes [1]. From a physical point of view, a quantum Markovian description is an approximation where the environment is modeled as a heatbath with a short correlation time and weakly coupled to the system. In the system dynamics the coupling to a bath will introduce damping and fluctuations. The radiative modes of the heatbath also serve as input channels through which the system is driven, and as output channels which allow the continuous observation of the radiated fields. Examples of quantum optical systems are resonance fluorescence, where a radiatively damped atom is driven by laser light (input) and the properties of the emitted fluorescence light (output)are measured, and an optical cavity mode coupled to the outside radiation modes by a partially transmitting mirror. -
A Theoretical Study of Quantum Memories in Ensemble-Based Media
A theoretical study of quantum memories in ensemble-based media Karl Bruno Surmacz St. Hugh's College, Oxford A thesis submitted to the Mathematical and Physical Sciences Division for the degree of Doctor of Philosophy in the University of Oxford Michaelmas Term, 2007 Atomic and Laser Physics, University of Oxford i A theoretical study of quantum memories in ensemble-based media Karl Bruno Surmacz, St. Hugh's College, Oxford Michaelmas Term 2007 Abstract The transfer of information from flying qubits to stationary qubits is a fundamental component of many quantum information processing and quantum communication schemes. The use of photons, which provide a fast and robust platform for encoding qubits, in such schemes relies on a quantum memory in which to store the photons, and retrieve them on-demand. Such a memory can consist of either a single absorber, or an ensemble of absorbers, with a ¤-type level structure, as well as other control ¯elds that a®ect the transfer of the quantum signal ¯eld to a material storage state. Ensembles have the advantage that the coupling of the signal ¯eld to the medium scales with the square root of the number of absorbers. In this thesis we theoretically study the use of ensembles of absorbers for a quantum memory. We characterize a general quantum memory in terms of its interaction with the signal and control ¯elds, and propose a ¯gure of merit that measures how well such a memory preserves entanglement. We derive an analytical expression for the entanglement ¯delity in terms of fluctuations in the stochastic Hamiltonian parameters, and show how this ¯gure could be measured experimentally. -
Quantum Computation and Complexity Theory
Quantum computation and complexity theory Course given at the Institut fÈurInformationssysteme, Abteilung fÈurDatenbanken und Expertensysteme, University of Technology Vienna, Wintersemester 1994/95 K. Svozil Institut fÈur Theoretische Physik University of Technology Vienna Wiedner Hauptstraûe 8-10/136 A-1040 Vienna, Austria e-mail: [email protected] December 5, 1994 qct.tex Abstract The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applicationsto quantum computing. Standardinterferomeric techniques are used to construct a physical device capable of universal quantum computation. Some consequences for recursion theory and complexity theory are discussed. hep-th/9412047 06 Dec 94 1 Contents 1 The Quantum of action 3 2 Quantum mechanics for the computer scientist 7 2.1 Hilbert space quantum mechanics ..................... 7 2.2 From single to multiple quanta Ð ªsecondº ®eld quantization ...... 15 2.3 Quantum interference ............................ 17 2.4 Hilbert lattices and quantum logic ..................... 22 2.5 Partial algebras ............................... 24 3 Quantum information theory 25 3.1 Information is physical ........................... 25 3.2 Copying and cloning of qbits ........................ 25 3.3 Context dependence of qbits ........................ 26 3.4 Classical versus quantum tautologies .................... 27 4 Elements of quantum computatability and complexity theory 28 4.1 Universal quantum computers ....................... 30 4.2 Universal quantum networks ........................ 31 4.3 Quantum recursion theory ......................... 35 4.4 Factoring .................................. 36 4.5 Travelling salesman ............................. 36 4.6 Will the strong Church-Turing thesis survive? ............... 37 Appendix 39 A Hilbert space 39 B Fundamental constants of physics and their relations 42 B.1 Fundamental constants of physics ..................... 42 B.2 Conversion tables .............................. 43 B.3 Electromagnetic radiation and other wave phenomena ......... -
Physical Implementations of Quantum Computing
Physical implementations of quantum computing Andrew Daley Department of Physics and Astronomy University of Pittsburgh Overview (Review) Introduction • DiVincenzo Criteria • Characterising coherence times Survey of possible qubits and implementations • Neutral atoms • Trapped ions • Colour centres (e.g., NV-centers in diamond) • Electron spins (e.g,. quantum dots) • Superconducting qubits (charge, phase, flux) • NMR • Optical qubits • Topological qubits Back to the DiVincenzo Criteria: Requirements for the implementation of quantum computation 1. A scalable physical system with well characterized qubits 1 | i 0 | i 2. The ability to initialize the state of the qubits to a simple fiducial state, such as |000...⟩ 1 | i 0 | i 3. Long relevant decoherence times, much longer than the gate operation time 4. A “universal” set of quantum gates control target (single qubit rotations + C-Not / C-Phase / .... ) U U 5. A qubit-specific measurement capability D. P. DiVincenzo “The Physical Implementation of Quantum Computation”, Fortschritte der Physik 48, p. 771 (2000) arXiv:quant-ph/0002077 Neutral atoms Advantages: • Production of large quantum registers • Massive parallelism in gate operations • Long coherence times (>20s) Difficulties: • Gates typically slower than other implementations (~ms for collisional gates) (Rydberg gates can be somewhat faster) • Individual addressing (but recently achieved) Quantum Register with neutral atoms in an optical lattice 0 1 | | Requirements: • Long lived storage of qubits • Addressing of individual qubits • Single and two-qubit gate operations • Array of singly occupied sites • Qubits encoded in long-lived internal states (alkali atoms - electronic states, e.g., hyperfine) • Single-qubit via laser/RF field coupling • Entanglement via Rydberg gates or via controlled collisions in a spin-dependent lattice Rb: Group II Atoms 87Sr (I=9/2): Extensively developed, 1 • P1 e.g., optical clocks 3 • Degenerate gases of Yb, Ca,.. -
Quantum Memories for Continuous Variable States of Light in Atomic Ensembles
Quantum Memories for Continuous Variable States of Light in Atomic Ensembles Gabriel H´etet A thesis submitted for the degree of Doctor of Philosophy at The Australian National University October, 2008 ii Declaration This thesis is an account of research undertaken between March 2005 and June 2008 at the Department of Physics, Faculty of Science, Australian National University (ANU), Can- berra, Australia. This research was supervised by Prof. Ping Koy Lam (ANU), Prof. Hans- Albert Bachor (ANU), Dr. Ben Buchler (ANU) and Dr. Joseph Hope (ANU). Unless otherwise indicated, the work present herein is my own. None of the work presented here has ever been submitted for any degree at this or any other institution of learning. Gabriel H´etet October 2008 iii iv Acknowledgments I would naturally like to start by thanking my principal supervisors. Ping Koy Lam is the person I owe the most. I really appreciated his approachability, tolerance, intuition, knowledge, enthusiasm and many other qualities that made these three years at the ANU a great time. Hans Bachor, for helping making this PhD in Canberra possible and giving me the opportunity to work in this dynamic research environment. I always enjoyed his friendliness and general views and interpretations of physics. Thanks also to both of you for the opportunity you gave me to travel and present my work to international conferences. This thesis has been a rich experience thanks to my other two supervisors : Joseph Hope and Ben Buchler. I would like to thank Joe for invaluable help on the theory and computer side and Ben for the efficient moments he spent improving the set-up and other innumerable tips that polished up the work presented here, including proof reading this thesis. -
What Can Quantum Optics Say About Computational Complexity Theory?
week ending PRL 114, 060501 (2015) PHYSICAL REVIEW LETTERS 13 FEBRUARY 2015 What Can Quantum Optics Say about Computational Complexity Theory? Saleh Rahimi-Keshari, Austin P. Lund, and Timothy C. Ralph Centre for Quantum Computation and Communication Technology, School of Mathematics and Physics, University of Queensland, St Lucia, Queensland 4072, Australia (Received 26 August 2014; revised manuscript received 13 November 2014; published 11 February 2015) Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational complexity theory point of view. We derive a general formula for calculating the output probabilities, and by considering input thermal states, we show that the output probabilities are proportional to permanents of positive-semidefinite Hermitian matrices. It is believed that approximating permanents of complex matrices in general is a #P-hard problem. However, we show that these permanents can be approximated with an algorithm in the BPPNP complexity class, as there exists an efficient classical algorithm for sampling from the output probability distribution. We further consider input squeezed- vacuum states and discuss the complexity of sampling from the probability distribution at the output. DOI: 10.1103/PhysRevLett.114.060501 PACS numbers: 03.67.Ac, 42.50.Ex, 89.70.Eg Introduction.—Boson sampling is an intermediate model general formula for the probabilities of detecting single of quantum computation that seeks to generate random photons at the output of the network. Using this formula we samples from a probability distribution of photon (or, in show that probabilities of single-photon counting for input general, boson) counting events at the output of an M-mode thermal states are proportional to permanents of positive- linear-optical network consisting of passive optical ele- semidefinite Hermitian matrices. -
Electron Spin Qubits in Quantum Dots
Electron spin qubits in quantum dots R. Hanson, J.M. Elzerman, L.H. Willems van Beveren, L.M.K. Vandersypen, and L.P. Kouwenhoven' 'Kavli Institute of NanoScience Delft, Delft University of Technology, PO Box 5046, 2600 GA Delft, The Netherlands (Dated: September 24, 2004) We review our experimental progress on the spintronics proposal for quantum computing where the quantum bits (quhits) are implemented with electron spins confined in semiconductor quantum dots. Out of the five criteria for a scalable quantum computer, three have already been satisfied. We have fabricated and characterized a double quantum dot circuit with an integrated electrometer. The dots can be tuned to contain a single electron each. We have resolved the two basis states of the qubit by electron transport measurements. Furthermore, initialization and singleshot read-out of the spin statc have been achieved. The single-spin relaxation time was found to be very long, but the decoherence time is still unknown. We present concrete ideas on how to proceed towards coherent spin operations and two-qubit operations. PACS numbers: INTRODUCTION depicted in Fig. la. In Fig. 1b we map out the charging diagram of the The interest in quantum computing [l]derives from double dot using the electrometer. Horizontal (vertical) the hope to outperform classical computers using new lines in this diagram correspond to changes in the number quantum algorithms. A natural candidate for the qubit of electrons in the left (right) dot. In the top right of the is the electron spin because the only two possible spin figure lines are absent, indicating that the double dot orientations 17) and 11) correspond to the basis states of is completely depleted of electrons. -
Quantum Error Correction
Quantum Error Correction Sri Rama Prasanna Pavani [email protected] ECEN 5026 – Quantum Optics – Prof. Alan Mickelson - 12/15/2006 Agenda Introduction Basic concepts Error Correction principles Quantum Error Correction QEC using linear optics Fault tolerance Conclusion Agenda Introduction Basic concepts Error Correction principles Quantum Error Correction QEC using linear optics Fault tolerance Conclusion Introduction to QEC Basic communication system Information has to be transferred through a noisy/lossy channel Sending raw data would result in information loss Sender encodes (typically by adding redundancies) and receiver decodes QEC secures quantum information from decoherence and quantum noise Agenda Introduction Basic concepts Error Correction principles Quantum Error Correction QEC using linear optics Fault tolerance Conclusion Two bit example Error model: Errors affect only the first bit of a physical two bit system Redundancy: States 0 and 1 are represented as 00 and 01 Decoding: Subsystems: Syndrome, Info. Repetition Code Representation: Error Probabilities: 2 bit flips: 0.25 *0.25 * 0.75 3 bit flips: 0.25 * 0.25 * 0.25 Majority decoding Total error probabilities: With repetition code: Error Model: 0.25^3 + 3 * 0.25^2 * 0.75 = 0.15625 Independent flip probability = 0.25 Without repetition code: 0.25 Analysis: 1 bit flip – No problem! Improvement! 2 (or) 3 bit flips – Ouch! Cyclic system States: 0, 1, 2, 3, 4, 5, 6 Operators: Error model: probability = where q = 0.5641 Decoding Subsystem probability -
Quantum Interference & Entanglement
QIE - Quantum Interference & Entanglement Physics 111B: Advanced Experimentation Laboratory University of California, Berkeley Contents 1 Quantum Interference & Entanglement Description (QIE)2 2 Quantum Interference & Entanglement Pictures2 3 Before the 1st Day of Lab2 4 Objectives 3 5 Introduction 3 5.1 Bell's Theorem and the CHSH Inequality ............................. 3 6 Experimental Setup 4 6.1 Overview ............................................... 4 6.2 Diode Laser.............................................. 4 6.3 BBOs ................................................. 6 6.4 Detection ............................................... 7 6.5 Coincidence Counting ........................................ 8 6.6 Proper Start-up Procedure ..................................... 9 7 Alignment 9 7.1 Violet Beam Path .......................................... 9 7.2 Infrared Beam Path ......................................... 10 7.3 Detection Arm Angle......................................... 12 7.4 Inserting the polarization analyzing elements ........................... 12 8 Producing a Bell State 13 8.1 Mid-Lab Questions.......................................... 13 8.2 Quantifying your Bell State..................................... 14 9 Violating Bell's Inequality 15 9.1 Using the LabVIEW Program.................................... 15 9.1.1 Count Rate Indicators.................................... 15 9.1.2 Status Indicators....................................... 16 9.1.3 General Settings ....................................... 16 9.1.4 -
Quantum Retrodiction: Foundations and Controversies
S S symmetry Article Quantum Retrodiction: Foundations and Controversies Stephen M. Barnett 1,* , John Jeffers 2 and David T. Pegg 3 1 School of Physics and Astronomy, University of Glasgow, Glasgow G12 8QQ, UK 2 Department of Physics, University of Strathclyde, Glasgow G4 0NG, UK; [email protected] 3 Centre for Quantum Dynamics, School of Science, Griffith University, Nathan 4111, Australia; d.pegg@griffith.edu.au * Correspondence: [email protected] Abstract: Prediction is the making of statements, usually probabilistic, about future events based on current information. Retrodiction is the making of statements about past events based on cur- rent information. We present the foundations of quantum retrodiction and highlight its intimate connection with the Bayesian interpretation of probability. The close link with Bayesian methods enables us to explore controversies and misunderstandings about retrodiction that have appeared in the literature. To be clear, quantum retrodiction is universally applicable and draws its validity directly from conventional predictive quantum theory coupled with Bayes’ theorem. Keywords: quantum foundations; bayesian inference; time reversal 1. Introduction Quantum theory is usually presented as a predictive theory, with statements made concerning the probabilities for measurement outcomes based upon earlier preparation events. In retrodictive quantum theory this order is reversed and we seek to use the Citation: Barnett, S.M.; Jeffers, J.; outcome of a measurement to make probabilistic statements concerning earlier events [1–6]. Pegg, D.T. Quantum Retrodiction: The theory was first presented within the context of time-reversal symmetry [1–3] but, more Foundations and Controversies. recently, has been developed into a practical tool for analysing experiments in quantum Symmetry 2021, 13, 586.