One-Way Quantum Computing Andrew Lopez. A commonly used model in the field of quantum computing is the Quantum
|
|
- Joel Hunter
- 5 years ago
- Views:
Transcription
1 One-Way Quantum Computing Andrew Lopez A commonly used model in the field of quantum computing is the Quantum Circuit Model. The Circuit Model can be thought of as a quantum version of classical computing, where a computer is characterized by an quantum input state, quantum logic gates which perform operations on the input state, and an output state. Over time other models have been developed and are being researched, such as the Topological Quantum Model, and Adiabatic Quantum Model. The quantum computing model which will be discussed in this paper is called one-way quantum computation. First we will discuss how quantum computations are performed with this one-way model, then we will discuss the advantages the one-way model has over the circuit model, and finally we will finish with the future of one-way quantum computing. One-way quantum computation requires that a certain type of entangled state, called a cluster or graph state, be set up beforehand [1]. Once the cluster or graph state is prepared we can perform a universal quantum computation by performing a series of single-qubit measurements. Due to the fact that the computation is performed by single-qubit measurements, this model is inherently irreversible (one-way). The inherent irreversiblility is in contrast with the reversibility of every gate used in the Circuit Model. Now to take a closer look at the process, let us discuss cluster and graph states. A graph state G is associated with a graph, G, in which every qubit is represented by a vertex and each edge represents the interaction between respective qubits. Since graphs can vary greatly in layout it is sometimes easier 1
2 to generate an entangled state with a corresponding graph in the shape of a square lattice. This type of state is called a cluster state. The type of entangled state you should use depends on your physics system. While cluster states can be generated efficiently they also require many more qubits than a graph state to perform the same computation. Now we will briefly consider a simple example of one-way computation that involves two qubits []. Before we begin let me define a few operations. The operation U k (γ) (where k is x,y, or z) is exp(i γ σ k), the CZ operation is 0 0 Î σ z, and the operation (θ, φ) is defined as U z (φ + π)u x(θ)σ z U x ( θ)u z ( φ π ). Qubit 1 is prepared in an unknown state: ψ = α 0 + β 1, where 0, 1 are eigenvectors of σ z. Qubit is prepared in the known state: + = 1 ( ), where + is an eigenvector of σ x. Now we apply a CZ operation to each qubit: and find that the qubits are in an entangled state: q 1, q = 1 (α β 1 ). Next we perform a measurement on qubit 1 in the basis 1 ( 0 ± exp(i φ) 1 ) thereby destroying qubit 1; this measurement corresponds to the measurement ( π, φ). From this measurement there are only two possible outcomes (an eigenvalue of ±1). If we define a binary digit m 0, 1 to represent the measurement outcome ( 1) m, then the final state of qubit can be written, up to a phase, as σ m x HU z (φ) ψ. So we can see that the unknown state on qubit 1 has been passed to qubit without any loss of coherence. However, if the measurement on qubit 1 returns the -1 eigenvalue, then qubit will undergo an additional Pauli transformation. This example shows that any desired unitary transformation can be implemented only up to random but known Pauli transformations. These unwanted Pauli transformations are
3 called by-product operators, as they are a by-product of the randomness of the measurements. Since we are confident that one-way computation is viable for one singlequbit operation let s attempt three consecutive single-qubit operations. If we perform the two-qubit measurement protocol as described above three times for three arbitrary angles φ 1, φ, φ 3, then the net unitary transformation applied to qubit will be U = Hσ m 3 z U z (φ 3 )Hσ m z U z (φ )Hσ m 1 z U z (φ 1 ), where m 1, m, m 3 are the binary digits for measurement 1,, and 3 respectively. By using a few identities we see that U = σ m 3 x σ m z σ m 1 x HU z (( 1) m φ 3 )U x (( 1) m φ )U z (φ 1 ). As we can see, the sign of two rotations depend on two of the measurements which are random. This would cause one to question whether this computation is deterministic. It is not, however by appropriate choice of angles φ 1 = α, φ = ( 1) m 1 β, and φ 3 = ( 1) m γ we can obtain a deteministic unitary transformation. The dependency that some of our angles have on previous measurements occurs for all but one class of operations, called the Clifford group. This dependency introduces a time-ordering to the measurements, in other words, there is a limit on how quickly a computation can be implemented. Also since the byproduct Pauli operators are known, they can be corrected through classical post-processing. Stabilizer formalism is a tool use to characterize graph states and subspaces over mulitple qubits in a compact way. In the stabilizer formalism these states and sub-spaces are described in terms of operators under which they are invariant. A similar technique is used in standard quantum mechanics, for example, describing the atomic states by the quantum numbers. 3
4 The formalism focuses on operators that satisfy two properties: 1) the operators stabilizes the sub-space, and ) the operators are Hermitian members of the Pauli group. The defnition of property 1 is as follows: An operator K stablizes a substapce S when, for all states ψ S, K ψ = ψ. The key principle of the formalism is to identify a set of stabilizing operators that uniquely define the state, or sub-space of interest. The stabilizer formalism really shines when used in conjunction with the Clifford group. Application of the formalism leads to the conclusion that any stabilizer state can be transformed to a graph state by local Clifford operations. These graph states are, in general, not unique. Therefore given any one-way pattern containing Pauli measurements, Clifford operations can be used to find a one-way pattern which performs the operation with fewer qubits []. Many recent developments have been made in the field of one-way quantum computation. In 011, Ryuji Ukai and his collaborators demonstrated the use of a Controlled Phase (CZ) gate for continuous-variable one-way quantum computation on a four-mode linear cluster state [3]. The fourmode linear cluster state can be interpreted as two Einstein-Podolsky-Rosen (EPR) paires with a CZ interaction between them. Since the CZ gate is the gate that entangles the EPR pairs it is vital to prove that it s implementation is nonclassical. To that end a sufficient condition for entanglement of a twomode state is given as (gˆp µ ˆx v ) + (gˆp v ˆx µ ) < g for some g R. For the experimental setup used by Ukai, it was determined that g = 3/4 gives the minimal resource requirement. As shown in Fig. 1 the condition for entanglement was met. Ukai concludes by saying that the quality of the CZ gate is only limited by the squeezing level of the resource state, and 4
5 Figure 1: Fig. 1: Lines (viii) show the sufficient condition for entanglement. Traces (vii) show the measurement results. mentions that once a single-mode non-gaussian gate can be experimentally implemented then full universality of arbitrary multi-mode quantum optical states will be realizable. In 013, B. A. Bell and his collaborators characterized the quantum H gate, T gate, and CNOT gate for one-way quantum computation [4]. These three gates form a universal set of gates and therefore allow Bell to simulate and predict the performance of any one-way quantum quantum computation. Bell used two photonic crystal fibre sources to produce pairs of Bell states, and then fused the pairs with a polarising beamsplitter to generate an entangled four-photon star cluster state. At first glance, the star cluster state seems to put us at a disadvantage. Since the cluster state is made with photons of two different wavelengths the standard methods for generating a larger resource state for universal quantum computation cannot be used. However, by performing what is known as a fusion operation, star cluster states can be combined until a resource state of desired size is generated. This resource state will be in a hexagonal lattice which can be converted to a square D lattice by using local operations, thereby confirming the resource 5
6 state as universal. The converion of the hexagonal resource state to a square D lattice is not always necessary as, for one-way quantum computation, the hexagonal lattice has an intrinsic robustness to noise. The state was characterized and compared to the ideal cluster state ψ star by carrying out state tomography. State tomography is the process of analysing the state in all combinations of three measurement bases for each photon: H, V, +,, and R, L where R, L are the right and left circular polarizations. After performing all of the measurements, Bell and his group were able to reconstruct the density matrix, ρ exp. They also calculated the fidelity of the state, F = ψ star ρ exp ψ star = 0.66 ± 0.01 which is well above the threshold value of 0.5, proving that the state has genuine four-party entanglement. Keeping in mind that the fault-tolerant threshold is , Bell calculated the error-probability per gate, ɛ for the H gate (ɛ > 0.33 ± 0.03), the T gate (ɛ > 0.4 ± 0.04), and the CNOT gate (ɛ > 0.36 ± 0.01). We can see there is much room for improvement. These results were then used to simulate a SWAP gate by linking three CNOT gates together. The error-probability per gate was calculated to be ɛ > 0.70±0.01. It is obvious that by simulating an operation with only three concatenated gates, the quality of the operation is greatly reduced. The limitations of the experiment are largely due to the multiphoton count rates and interference visibilities of the photonic crystal fibre sources. Once the sources improve, specifically the collection efficiency of the photons and their indistinguishability, then it will become possible to investigate experimentally larger cluster states and more complicated one-way protocols and algorithms. One-way quantum computation unique way to look at computation. While 6
7 the circuit model draws inspiration from classical computation, the one-way model cleverly uses its quantum nature to solve old problems in new ways. The one-way model has many advantages over the circuit model such as the one-way structure being more flexible than the circuit model due to the necessary adaptive measurements. At the same time, however, it has just as many disadvantages, for example the adaptive measurements introducing a time-ordering to the system, limiting how quickly a computation can be performed. Recent experiments show that at our current level of technology building a one-way quantum computer to efficiently perform computations is far off, but in time we may see one-way quantum computers used in scientific institutions worldwide. References: [1] Quantum Computation and Quantum Information, by Michael A. Nielsen and Isaac L. Chuang, Cambridge University Press. [] One-way Quantum Computation. Dan Browne and Hans Briegel. arxiv:quantph/0603v 3 Oct 006 [3] Demonstration of a Controlled-Phase Gate for Continuous-Variable One- Way Quantum Computation. Ryuji Ukai, Shota Yokoyama, et al. arxiv: v1 [quant-ph] 4 Jul 011 [4] Experimental characterization of universal one-way quantum computing. B.A. Bell, M.S. Tame, et al. arxiv: v1 [quant-ph] 1 May 013 7
Teleportation-based approaches to universal quantum computation with single-qubit measurements
Teleportation-based approaches to universal quantum computation with single-qubit measurements Andrew Childs MIT Center for Theoretical Physics joint work with Debbie Leung and Michael Nielsen Resource
More informationExperimental characterization of universal one-way quantum computing arxiv: v1 [quant-ph] 1 May 2013
Experimental characterization of universal one-way quantum computing arxiv:1305.0212v1 [quant-ph] 1 May 2013 B. A. Bell, 1 M. S. Tame, 2 A. S. Clark, 3 R. W. Nock, 1 W. J. Wadsworth, 4 and J. G. Rarity
More informationMeasurement-based quantum computation 10th Canadian Summer School on QI. Dan Browne Dept. of Physics and Astronomy University College London
Measurement-based quantum computation 0th Canadian Summer School on QI Dan Browne Dept. of Physics and Astronomy University College London What is a quantum computer? The one-way quantum computer A multi-qubit
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationIBM quantum experience: Experimental implementations, scope, and limitations
IBM quantum experience: Experimental implementations, scope, and limitations Plan of the talk IBM Quantum Experience Introduction IBM GUI Building blocks for IBM quantum computing Implementations of various
More informationTowards Scalable Linear-Optical Quantum Computers
Quantum Information Processing, Vol. 3, Nos. 1 5, October 2004 ( 2004) Towards Scalable Linear-Optical Quantum Computers J. P. Dowling, 1,5 J. D. Franson, 2 H. Lee, 1,4 and G. J. Milburn 3 Received February
More informationLectures on Fault-Tolerant Quantum Computation
Lectures on Fault-Tolerant Quantum Computation B.M. Terhal, IBM Research I. Descriptions of Noise and Quantum States II. Quantum Coding and Error-Correction III. Fault-Tolerant Error-Correction. Surface
More informationSUPERDENSE CODING AND QUANTUM TELEPORTATION
SUPERDENSE CODING AND QUANTUM TELEPORTATION YAQIAO LI This note tries to rephrase mathematically superdense coding and quantum teleportation explained in [] Section.3 and.3.7, respectively (as if I understood
More informationarxiv: v1 [quant-ph] 25 Apr 2017
Deterministic creation of a four-qubit W state using one- and two-qubit gates Firat Diker 1 and Can Yesilyurt 2 1 Faculty of Engineering and Natural Sciences, arxiv:170.0820v1 [quant-ph] 25 Apr 2017 Sabanci
More informationOverview of Topological Cluster-State Quantum Computation on 2D Cluster-State
Overview of Topological Cluster-State Quantum Computation on 2D Cluster-State based on High-threshold universal quantum computation on the surface code -Austin G. Fowler, Ashley M. Stephens, and Peter
More informationLogical error rate in the Pauli twirling approximation
Logical error rate in the Pauli twirling approximation Amara Katabarwa and Michael R. Geller Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA (Dated: April 10, 2015)
More informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 1 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca TAs Nitica Sakharwade nsakharwade@perimeterinstitute.ca
More informationHigh-fidelity Z-measurement error encoding of optical qubits
Griffith Research Online https://research-repository.griffith.edu.au High-fidelity Z-measurement error encoding of optical qubits Author O'Brien, J., Pryde, G., White, A., Ralph, T. Published 2005 Journal
More informationA Guide to Experiments in Quantum Optics
Hans-A. Bachor and Timothy C. Ralph A Guide to Experiments in Quantum Optics Second, Revised and Enlarged Edition WILEY- VCH WILEY-VCH Verlag CmbH Co. KGaA Contents Preface 1 Introduction 1.1 Historical
More informationIon trap quantum processor
Ion trap quantum processor Laser pulses manipulate individual ions row of qubits in a linear Paul trap forms a quantum register Effective ion-ion interaction induced by laser pulses that excite the ion`s
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT
Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students
More informationarxiv: v2 [quant-ph] 16 Nov 2018
aaacxicdvhlsgmxfe3hv62vvswncwelkrmikdlgi7cqc1yfwyro+mthmasibkjlgg+wk3u/s2/wn8wfsxs1qsjh3nuosckjhcuhb8fry5+yxfpejyawv1bx2jxnm8tto1hftcs23ui7aohciwcjnxieojjf/xphvrdcxortlqhqykdgj6u6ako5kjmwo5gtsc0fi/qtgbvtaxmolcnxuap7gqihlspyhdblqgbicil5q1atid3qkfhfqqo+1ki6e5f+cyrt/txh1f/oj9+skd2npbhlnngojzmpd8k9tyjdw0kykioniem9jfmxflvtjmjlaseio9n9llpk/ahkfldycthdga3aj3t58/gwfolthsqx2olgidl87cdyigsjusbud182x0/7nbjs9utoacgfz/g1uj2phuaubx9u6fyy7kljdts8owchowj1dsarmc6qvbi39l78ta8bw9nvoovjv1tsanx9rbsmy8zw==
More informationInstantaneous Nonlocal Measurements
Instantaneous Nonlocal Measurements Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA July 22, 2010 References Entanglement consumption of instantaneous nonlocal quantum measurements.
More informationShort Course in Quantum Information Lecture 2
Short Course in Quantum Information Lecture Formal Structure of Quantum Mechanics Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture
More informationA relational quantum computer using only twoqubit total spin measurement and an initial supply of highly mixed single-qubit states
A relational quantum computer using only twoqubit total spin measurement and an initial supply of highly mixed single-qubit states To cite this article: Terry Rudolph and Shashank Soyuz Virmani 2005 New
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationMore advanced codes 0 1 ( , 1 1 (
p. 1/24 More advanced codes The Shor code was the first general-purpose quantum error-correcting code, but since then many others have been discovered. An important example, discovered independently of
More informationFault-Tolerant Universality from Fault-Tolerant Stabilizer Operations and Noisy Ancillas
Fault-Tolerant Universality from Fault-Tolerant Stabilizer Operations and Noisy Ancillas Ben W. Reichardt UC Berkeley NSF, ARO [quant-ph/0411036] stabilizer operations, Q: Do form a universal set? prepare
More informationEnergetics and Error Rates of Self-Correcting Quantum Memories
Energetics and Error Rates of Self-Correcting Quantum Memories John Schulman Quantum codes allow for the robust storage of quantum information despite interaction with the environment. In a quantum code,
More informationProjects about Quantum adder circuits Final examination June 2018 Quirk Simulator
Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator http://algassert.com/2016/05/22/quirk.html PROBLEM TO SOLVE 1. The HNG gate is described in reference: Haghparast M. and
More informationQuantum information and quantum computing
Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement
More informationMeasurement Based Quantum Computing, Graph States, and Near-term Realizations
Measurement Based Quantum Computing, Graph States, and Near-term Realizations Miami 2018 Antonio Russo Edwin Barnes S. E. Economou 17 December 2018 Virginia Polytechnic Institute and State University A.
More informationMagic States. Presented by Nathan Babcock
Magic States Presented by Nathan Babcock Overview I will discuss the following points:. Quantum Error Correction. The Stabilizer Formalism. Clifford Group Quantum Computation 4. Magic States 5. Derivation
More informationD.5 Quantum error correction
D. QUANTUM ALGORITHMS 157 Figure III.34: E ects of decoherence on a qubit. On the left is a qubit yi that is mostly isoloated from its environment i. Ontheright,aweakinteraction between the qubit and the
More informationLecture 11, May 11, 2017
Lecture 11, May 11, 2017 This week: Atomic Ions for QIP Ion Traps Vibrational modes Preparation of initial states Read-Out Single-Ion Gates Two-Ion Gates Introductory Review Articles: D. Leibfried, R.
More informationON THE ROLE OF THE BASIS OF MEASUREMENT IN QUANTUM GATE TELEPORTATION. F. V. Mendes, R. V. Ramos
ON THE ROLE OF THE BASIS OF MEASREMENT IN QANTM GATE TELEPORTATION F V Mendes, R V Ramos fernandovm@detiufcbr rubens@detiufcbr Lab of Quantum Information Technology, Department of Teleinformatic Engineering
More informationQuantum Error Correction and Fault Tolerance. Classical Repetition Code. Quantum Errors. Barriers to Quantum Error Correction
Quantum Error Correction and Fault Tolerance Daniel Gottesman Perimeter Institute The Classical and Quantum Worlds Quantum Errors A general quantum error is a superoperator: ρ ΣA k ρ A k (Σ A k A k = I)
More informationProblem Set # 8 Solutions
Id: hw.tex,v 1.4 009/0/09 04:31:40 ike Exp 1 MIT.111/8.411/6.898/18.435 Quantum Information Science I Fall, 010 Sam Ocko November 15, 010 Problem Set # 8 Solutions 1. (a) The eigenvectors of S 1 S are
More informationAP/P387 Note2 Single- and entangled-photon sources
AP/P387 Note Single- and entangled-photon sources Single-photon sources Statistic property Experimental method for realization Quantum interference Optical quantum logic gate Entangled-photon sources Bell
More informationQuantum Computing with Very Noisy Gates
Quantum Computing with Very Noisy Gates Produced with pdflatex and xfig Fault-tolerance thresholds in theory and practice. Available techniques for fault tolerance. A scheme based on the [[4, 2, 2]] code.
More informationJian-Wei Pan
Lecture Note 6 11.06.2008 open system dynamics 0 E 0 U ( t) ( t) 0 E ( t) E U 1 E ( t) 1 1 System Environment U() t ( ) 0 + 1 E 0 E ( t) + 1 E ( t) 0 1 0 0 1 1 2 * 0 01 E1 E0 q() t = TrEq+ E = * 2 1 0
More informationION TRAPS STATE OF THE ART QUANTUM GATES
ION TRAPS STATE OF THE ART QUANTUM GATES Silvio Marx & Tristan Petit ION TRAPS STATE OF THE ART QUANTUM GATES I. Fault-tolerant computing & the Mølmer- Sørensen gate with ion traps II. Quantum Toffoli
More informationAncilla-driven universal quantum computing
Ancilla-driven universal quantum computing Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. September 30, 2010 Vlad Gheorghiu (CMU) Ancilla-driven universal
More informationPhysics ; CS 4812 Problem Set 4
Physics 4481-7681; CS 4812 Problem Set 4 Six problems (six pages), all short, covers lectures 11 15, due in class 25 Oct 2018 Problem 1: 1-qubit state tomography Consider a 1-qubit state ψ cos θ 2 0 +
More informationQuantum Dense Coding and Quantum Teleportation
Lecture Note 3 Quantum Dense Coding and Quantum Teleportation Jian-Wei Pan Bell states maximally entangled states: ˆ Φ Ψ Φ x σ Dense Coding Theory: [C.. Bennett & S. J. Wiesner, Phys. Rev. Lett. 69, 88
More informationQuantum Noise. Michael A. Nielsen. University of Queensland
Quantum Noise Michael A. Nielsen University of Queensland Goals: 1. To introduce a tool the density matrix that is used to describe noise in quantum systems, and to give some examples. Density matrices
More informationA review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels
JOURNAL OF CHEMISTRY 57 VOLUME NUMBER DECEMBER 8 005 A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels Miri Shlomi
More informationUnitary Dynamics and Quantum Circuits
qitd323 Unitary Dynamics and Quantum Circuits Robert B. Griffiths Version of 20 January 2014 Contents 1 Unitary Dynamics 1 1.1 Time development operator T.................................... 1 1.2 Particular
More informationQuantum computing! quantum gates! Fisica dell Energia!
Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!
More informationFourier analysis of boolean functions in quantum computation
Fourier analysis of boolean functions in quantum computation Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical Physics, University of Cambridge
More informationquantum error-rejection
Lecture Note 7 Decoherence-free sub-space space and quantum error-rejection rejection.06.006 open system dynamics ψ = α 0 + α 0 Decoherence System Environment 0 E 0 U ( t) ( t) 0 E ( t) E U E ( t) U()
More informationThe Quantum Supremacy Experiment
The Quantum Supremacy Experiment John Martinis, Google & UCSB New tests of QM: Does QM work for 10 15 Hilbert space? Does digitized error model also work? Demonstrate exponential computing power: Check
More informationQuantum Computing: Foundations to Frontier Fall Lecture 3
Quantum Computing: Foundations to Frontier Fall 018 Lecturer: Henry Yuen Lecture 3 Scribes: Seyed Sajjad Nezhadi, Angad Kalra Nora Hahn, David Wandler 1 Overview In Lecture 3, we started off talking about
More informationarxiv:quant-ph/ v5 6 Apr 2005
Nonunitary quantum circuit Hiroaki Terashima 1, and Masahito Ueda 1, arxiv:quant-ph/3461v5 6 Apr 5 1 Department of Physics, Tokyo Institute of Technology, Tokyo 15-8551, Japan CREST, Japan Science and
More informationhigh thresholds in two dimensions
Fault-tolerant quantum computation - high thresholds in two dimensions Robert Raussendorf, University of British Columbia QEC11, University of Southern California December 5, 2011 Outline Motivation Topological
More informationQuantum error correction on a hybrid spin system. Christoph Fischer, Andrea Rocchetto
Quantum error correction on a hybrid spin system Christoph Fischer, Andrea Rocchetto Christoph Fischer, Andrea Rocchetto 17/05/14 1 Outline Error correction: why we need it, how it works Experimental realization
More informationb) (5 points) Give a simple quantum circuit that transforms the state
C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish
More informationQuantum non-demolition measurements:
Quantum non-demolition measurements: One path to truly scalable quantum computation Kae Nemoto Tim Spiller Sean Barrett Ray Beausoleil Pieter Kok Bill Munro HP Labs (Bristol) Why should optical quantum
More informationQuantum Information & Quantum Computing
Math 478, Phys 478, CS4803, February 9, 006 1 Georgia Tech Math, Physics & Computing Math 478, Phys 478, CS4803 Quantum Information & Quantum Computing Problems Set 1 Due February 9, 006 Part I : 1. Read
More informationarxiv: v2 [quant-ph] 19 Jul 2018
Multiqubit and multilevel quantum reinforcement learning with quantum technologies F. A. Cárdenas-López,2,*, L. Lamata 3, J. C. Retamal,2, E. Solano 3,4,5 arxiv:709.07848v2 [quant-ph] 9 Jul 208 Departamento
More informationProblem Set: TT Quantum Information
Problem Set: TT Quantum Information Basics of Information Theory 1. Alice can send four messages A, B, C, and D over a classical channel. She chooses A with probability 1/, B with probability 1/4 and C
More informationarxiv: v2 [quant-ph] 14 May 2017
A Low-Overhead Hybrid Approach for Universal Fault-Tolerant Quantum Computation Eesa Nikahd, Morteza Saheb Zamani, and Mehdi Sedighi Quantum Design Automation Lab Amirkabir University of Technology, Tehran,
More informationIntroduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
More information*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition *WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Contents Preface XIII 1 Introduction
More information1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8
C/CS/Phys C191 Unitaries and Quantum Gates 9//09 Fall 009 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Kaye et al: Ch. 1.1-1.5,
More informationIntroduction to Quantum Error Correction
Introduction to Quantum Error Correction Nielsen & Chuang Quantum Information and Quantum Computation, CUP 2000, Ch. 10 Gottesman quant-ph/0004072 Steane quant-ph/0304016 Gottesman quant-ph/9903099 Errors
More informationExperimental demonstrations of teleportation of photons. Manuel Chinotti and Nikola Đorđević
Experimental demonstrations of teleportation of photons Manuel Chinotti and Nikola Đorđević Outline Quantum teleportation (QT) protocol. Laboratory experimental demonstration: Bouwmeester at al. (1997).
More informationOther Topics in Quantum Information
p. 1/23 Other Topics in Quantum Information In a course like this there is only a limited time, and only a limited number of topics can be covered. Some additional topics will be covered in the class projects.
More informationarxiv:quant-ph/ v3 18 Jan 2004
A feasible gate for scalable linear optics quantum computation using polarization optics Kaoru Sanaka and Kevin Resch Institut für Experimentalphysik, Universität Wien, Boltzmanngasse arxiv:quant-ph/0316
More informationQuantum information processing. Two become one
Quantum information processing Two become one Scientists experimentally demonstrate a scheme for quantum joining, which allow the number of qubits encoded per photon to be varied while keeping the overall
More informationQuantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits
Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited
More informationQuantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139
Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense
More informationThe information content of a quantum
The information content of a quantum A few words about quantum computing Bell-state measurement Quantum dense coding Teleportation (polarisation states) Quantum error correction Teleportation (continuous
More informationMultipath and polarization entanglement of photons
Multipath and polarization entanglement of photons. Chiuri, G. Vallone*, P. Mataloni Quantum Optics Group, Dipartimento di Fisica Sapienza Università di Roma, 0085, Italy INO CNR, 5025 Firenze, Italy *
More informationQuantum Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationThe Solovay-Kitaev theorem
The Solovay-Kitaev theorem Maris Ozols December 10, 009 1 Introduction There are several accounts of the Solovay-Kitaev theorem available [K97, NC00, KSV0, DN05]. I chose to base my report on [NC00], since
More informationIntroduction to Topological Error Correction and Computation. James R. Wootton Universität Basel
Introduction to Topological Error Correction and Computation James R. Wootton Universität Basel Overview Part 1: Topological Quantum Computation Abelian and non-abelian anyons Quantum gates with Abelian
More informationarxiv: v2 [quant-ph] 3 Nov 2017
Fault-tolerant fermionic quantum computation based on color code arxiv:1709.0645v [quant-ph] 3 Nov 017 Ying Li 1, 1 Graduate School of China Academy of Engineering Physics, Beijing 100193, China Department
More informationDECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS
DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS SCOTT HOTTOVY Abstract. Quantum networks are used to transmit and process information by using the phenomena of quantum mechanics.
More informationSimple scheme for efficient linear optics quantum gates
PHYSICAL REVIEW A, VOLUME 65, 012314 Simple scheme for efficient linear optics quantum gates T. C. Ralph,* A. G. White, W. J. Munro, and G. J. Milburn Centre for Quantum Computer Technology, University
More informationProbabilistic exact cloning and probabilistic no-signalling. Abstract
Probabilistic exact cloning and probabilistic no-signalling Arun Kumar Pati Quantum Optics and Information Group, SEECS, Dean Street, University of Wales, Bangor LL 57 IUT, UK (August 5, 999) Abstract
More informationQuantum process tomography of a controlled-not gate
Quantum process tomography of a controlled-not gate J. L. O Brien,,, G. J. Pryde,,, A. Gilchrist, D. F. V. James, 3 N. K. Langford,, T. C. Ralph, and A. G. White, These authors contributed equally to this
More informationarxiv: v5 [quant-ph] 28 Jan 2015
Long-distance quantum communication over noisy networks without long-time quantum memory Paweł Mazurek 1, Andrzej Grudka 2, Michał Horodecki 1, Paweł Horodecki 3, Justyna Łodyga 2, Łukasz Pankowski 1 and
More informationWitnessing Genuine Many-qubit Entanglement with only Two Local Measurement Settings
Witnessing Genuine Many-qubit Entanglement with only Two Local Measurement Settings Géza Tóth (MPQ) Collaborator: Otfried Gühne (Innsbruck) uant-ph/0405165 uant-ph/0310039 Innbruck, 23 June 2004 Outline
More informationQuantum entanglement and its detection with few measurements
Quantum entanglement and its detection with few measurements Géza Tóth ICFO, Barcelona Universidad Complutense, 21 November 2007 1 / 32 Outline 1 Introduction 2 Bipartite quantum entanglement 3 Many-body
More informationExperimental Demonstration of Five-photon Entanglement and Open-destination Teleportation
Experimental Demonstration of Five-photon Entanglement and Open-destination Teleportation Zhi Zhao, Yu-Ao Chen, An-Ning Zhang, Tao Yang, ans Briegel & Jian-Wei Pan, Department of Modern Physics, University
More informationarxiv:quant-ph/ v1 12 Feb 2007
Fundamentals of universality in one-way quantum computation arxiv:quant-ph/0702116v1 12 Feb 2007 M. Van den Nest 1, W. Dür 1,2, A. Miyake 1,2 and H. J. Briegel 1,2 1 Institut für Quantenoptik und Quanteninformation
More informationCompression and entanglement, entanglement transformations
PHYSICS 491: Symmetry and Quantum Information April 27, 2017 Compression and entanglement, entanglement transformations Lecture 8 Michael Walter, Stanford University These lecture notes are not proof-read
More informationEinstein-Podolsky-Rosen-like correlation on a coherent-state basis and Continuous-Variable entanglement
12/02/13 Einstein-Podolsky-Rosen-like correlation on a coherent-state basis and Continuous-Variable entanglement Ryo Namiki Quantum optics group, Kyoto University 京大理 並木亮 求職中 arxiv:1109.0349 Quantum Entanglement
More informationPhysics is becoming too difficult for physicists. David Hilbert (mathematician)
Physics is becoming too difficult for physicists. David Hilbert (mathematician) Simple Harmonic Oscillator Credit: R. Nave (HyperPhysics) Particle 2 X 2-Particle wave functions 2 Particles, each moving
More informationQuantum Computing: the Majorana Fermion Solution. By: Ryan Sinclair. Physics 642 4/28/2016
Quantum Computing: the Majorana Fermion Solution By: Ryan Sinclair Physics 642 4/28/2016 Quantum Computation: The Majorana Fermion Solution Since the introduction of the Torpedo Data Computer during World
More informationQuantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Preface XIII 1 Introduction and
More informationD. Bouwmeester et. al. Nature (1997) Joep Jongen. 21th june 2007
al D. Bouwmeester et. al. Nature 390 575 (1997) Universiteit Utrecht 1th june 007 Outline 1 3 4 5 EPR Paradox 1935: Einstein, Podolsky & Rosen Decay of a π meson: π 0 e + e + Entangled state: ψ = 1 ( +
More informationCharacterization of a Polarisation Based Entangled Photon Source
The African Review of Physics (04) 9:009 7 Characterization of a Polarisation Based Entangled Photon Source Y. Ismail,*, A. R. Mirza,, A. Forbes,3 and F. Petruccione,,4 University of KwaZulu-Natal, Durban
More informationExperimental Quantum Computing: A technology overview
Experimental Quantum Computing: A technology overview Dr. Suzanne Gildert Condensed Matter Physics Research (Quantum Devices Group) University of Birmingham, UK 15/02/10 Models of quantum computation Implementations
More informationPHY305: Notes on Entanglement and the Density Matrix
PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and
More informationDistinguishing different classes of entanglement for three qubit pure states
Distinguishing different classes of entanglement for three qubit pure states Chandan Datta Institute of Physics, Bhubaneswar chandan@iopb.res.in YouQu-2017, HRI Chandan Datta (IOP) Tripartite Entanglement
More informationQuantum Memory with Atomic Ensembles
Lecture Note 5 Quantum Memory with Atomic Ensembles 04.06.2008 Difficulties in Long-distance Quantum Communication Problems leads Solutions Absorption (exponentially) Decoherence Photon loss Degrading
More informationIs Entanglement Sufficient to Enable Quantum Speedup?
arxiv:107.536v3 [quant-ph] 14 Sep 01 Is Entanglement Sufficient to Enable Quantum Speedup? 1 Introduction The mere fact that a quantum computer realises an entangled state is ususally concluded to be insufficient
More informationQuantum Computers. Todd A. Brun Communication Sciences Institute USC
Quantum Computers Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose components are individual
More informationSecrets of Quantum Information Science
Secrets of Quantum Information Science Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose
More informationEntanglement creation and characterization in a trapped-ion quantum simulator
Time Entanglement creation and characterization in a trapped-ion quantum simulator Christian Roos Institute for Quantum Optics and Quantum Information Innsbruck, Austria Outline: Highly entangled state
More informationP 3/2 P 1/2 F = -1.5 F S 1/2. n=3. n=3. n=0. optical dipole force is state dependent. n=0
(two-qubit gate): tools: optical dipole force P 3/2 P 1/2 F = -1.5 F n=3 n=3 n=0 S 1/2 n=0 optical dipole force is state dependent tools: optical dipole force (e.g two qubits) ω 2 k1 d ω 1 optical dipole
More informationarxiv:quant-ph/ v1 2 Oct 1997
Experimental Realization of Teleporting an nknown Pure Quantum State via Dual Classical and Einstein-Podolski-Rosen Channels arxiv:quant-ph/97003v Oct 997 D. Boschi (), S. Branca (), F. De Martini (),
More informationTutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction
Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states
More information