Experimental Comparison of Two Quantum Computing Architectures

Slides:



Advertisements
Similar presentations
Q U RE: T HE Q UANTUM R ESOURCE E STIMATOR T OOLBOX Martin Suchara (IBM Research) October 9, 2013 In collaboration with: Arvin Faruque, Ching-Yi Lai, Gerardo.
Advertisements

Three-qubit quantum error correction with superconducting circuits
ELE 523E COMPUTATIONAL NANOELECTRONICS W3: Quantum Computing, 22/9/2014 FALL 2014 Mustafa Altun Electronics & Communication Engineering Istanbul Technical.
1 Optimization Algorithms on a Quantum Computer A New Paradigm for Technical Computing Richard H. Warren, PhD Optimization.
Trapped Ions and the Cluster State Paradigm of Quantum Computing Universität Ulm, 21 November 2005 Daniel F. V. JAMES Department of Physics, University.
Quantum Speedups DoRon Motter August 14, Introduction Two main approaches are known which produce fast Quantum Algorithms The first, and main approach.
Advanced Computer Architecture Laboratory EECS Fall 2001 Quantum Logic Circuits John P. Hayes EECS Department University of Michigan, Ann Arbor,
A Universal Operator Theoretic Framework for Quantum Fault Tolerance Yaakov S. Weinstein MITRE Quantum Information Science Group MITRE Quantum Error Correction.
A Transformation Based Algorithm for Reversible Logic Synthesis D. Michael Miller Dmitri Maslov Gerhard W. Dueck Design Automation Conference, 2003.
Ion Trap Quantum Computer. Two Level Atom as a qubit Electron on lower orbit Electron on higher orbit.
Phase in Quantum Computing. Main concepts of computing illustrated with simple examples.
Reversible Circuit Synthesis Vivek Shende & Aditya Prasad.
Quantum Oracles Jesse Dhillon, Ben Schmid, & Lin Xu CS/Phys C191 Final Project December 1, 2005.
University of Queensland
UNIVERSITY OF NOTRE DAME Xiangning Luo EE 698A Department of Electrical Engineering, University of Notre Dame Superconducting Devices for Quantum Computation.
Classical and Quantum Circuit Synthesis An Algorithmic Approach.
Error-correcting the IBM qubit error-correcting the IBM qubit panos aliferis IBM.
Weikang Qian The Synthesis of Stochastic Logic to Perform Multivariate Polynomial Arithmetic Abstract Ph.D. Student, University of Minnesota Marc D. Riedel.
1 Recap (I) n -qubit quantum state: 2 n -dimensional unit vector Unitary op: 2 n  2 n linear operation U such that U † U = I (where U † denotes the conjugate.
Running a Quantum Circuit at the Speed of Data Nemanja Isailovic, Mark Whitney, Yatish Patel, John Kubiatowicz U.C. Berkeley QEC 2007.
In Search of a Magic Bottle of Error-Be-Gone Dave Bacon Caltech Department of Physics Institute for Quantum Information Decoherence errosol.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Introduction to Quantum logic (2) Yong-woo Choi.
NSF Workshop on Quantum Information Processing And Nanoscale Systems, 9/11/2007 Jungsang Kim Changsoon KimFelix Lu Bin LiuCaleb Knoernschild Kyle McKayChris.
Interfacing quantum optical and solid state qubits Cambridge, Sept 2004 Lin Tian Universität Innsbruck Motivation: ion trap quantum computing; future roads.
Superconducting Qubits Kyle Garton Physics C191 Fall 2009.
Paraty - II Quantum Information Workshop 11/09/2009 Fault-Tolerant Computing with Biased-Noise Superconducting Qubits Frederico Brito Collaborators: P.
Quantum systems for information technology, ETHZ
Matt Reed Yale University Boston, MA - February 28, 2012
1 Cost Metrics for Reversible and Quantum Logic Synthesis Dmitri Maslov 1 D. Michael Miller 2 1 Dept. of ECE, McGill University 2 Dept. of CS, University.
Quantum Homomorphic Encryption
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
Quantum Computing Paola Cappellaro
A brief introduction to Quantum computer
QUANTUM COMPUTING What is it ? Jean V. Bellissard Georgia Institute of Technology & Institut Universitaire de France.
QUANTUM COMPUTING Part II Jean V. Bellissard
Quantum Computing and Quantum Programming Language
Quantum Computation With Trapped Ions Brian Fields.
Quantum Computing Reversibility & Quantum Computing.
© 2015 AT&T Intellectual Property. All rights reserved. AT&T, the AT&T logo and all other AT&T marks contained herein are trademarks of AT&T Intellectual.
Introduction to Quantum Computing
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.
Panos aliferis IBM Jan. 09 quantum computing hardware with highly biased noise.
Mesoscopic Physics Introduction Prof. I.V.Krive lecture presentation Address: Svobody Sq. 4, 61022, Kharkiv, Ukraine, Rooms. 5-46, 7-36, Phone: +38(057)707.
Capabilities and limitations of quantum computers Michele Mosca 1 November 1999 ECC ’99.
CLASSICAL LOGIC SRFPGA layout With I/O pins.
Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment D. Maslov (spkr) – IQC/UWaterloo,
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Introduction to Quantum Algorithms Winter School on Quantum Security, Darmstadt Michele Mosca 25 January 2016.
Suggestion for Optical Implementation of Hadamard Gate Amir Feizpour Physics Department Sharif University of Technology.
Christopher Monroe Joint Quantum Institute and Department of Physics NIST and University of Maryland Quantum Computation and Simulation.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
QUANTUM COMPUTING: Quantum computing is an attempt to unite Quantum mechanics and information science together to achieve next generation computation.
Algorithmic simulation of far-from- equilibrium dynamics using quantum computer Walter V. Pogosov 1,2,3 1 Dukhov Research Institute of Automatics (Rosatom),
BASIS Foundation Summer School 2018 "Many body theory meets quantum information" Simulation of many-body physics with existing quantum computers Walter.
Outline Device & setup Initialization and read out
Optical qubits
Design and Realization of Decoherence-Free
Quantum Computing: An Overview
Quantum Computing Dorca Lee.
Programmable ions set the stage for quantum computers
Introduction to Quantum logic (2)
Quipper : A Scalable Quantum Programming Language
Quantum circuits for floating-point arithmetic
Linear Optical Quantum Computing
IS ERROR DETECTION HELPFUL ON IBM 5Q CHIPS ?
Quantum-classical hybrid algorithms
Entangling Atoms with Optical Frequency Combs
Josephson Qubits in a Microcavity
Presentation transcript:

Experimental Comparison of Two Quantum Computing Architectures Norbert M. Linke, Dmitri Maslov, Martin Roerreler, Shantanu Debnath, Caroline Figgatt, Kevein A. Landsman, Kenneth Wright and Christopher Monroe UMD, NSF, Microsoft Research and IonQ Inc.

Contents Motivation The Two Quantum Computers Experiments Experimental Results Discussion

Motivation Leap in performance with Quantum Many candidate architectures Need to determine which is better

The Two Quantum Computers IBM-Q (5 qubit, Star topology) Ion Trap (5 qubit, Fully connected)

Superconductor Islands with Josephson Junctions IBM-Q Ion Trap Superconductor Islands with Josephson Junctions 130ns single qubit gates 250-450ns 2-qubit gates Lower accuracy (80%) More gates used for mapping algorithms Uses the Clifford + T library (X, Y, Z, T, H, CNOT and S) Ytterbium Ions 20μs single qubit gates 250μs 2-qubit gates Highly accurate (95.7%) Requires fewer gates Uses R/XX Library These accuracies are readout accuracies Gate for ion trap 99.1 and 97 (1 and 2) Single qubit ion 0 99.7 and 1 99.1 Reading all 5 is 95.7 IBM Q reading all 5 is 80 Reading is 96 99.7 and 96.5 for 1 and 2 qubit gates

More on Accuracy IBM-Q Ion Trap 1 qubit gate – 99.7% Reading one qubit – 96% Reading all five qubits – 80% 1 qubit gate – 99.1% 2 qubit gate – 97% Reading one qubit – 99.7 for 0 and 99.1 for 1 Reading all five qubits – 95.7% These accuracies are readout accuracies Gate for ion trap 99.1 and 97 (1 and 2) Single qubit ion 0 99.7 and 1 99.1 Reading all 5 is 95.7 IBM Q reading all 5 is 80 Reading is 96 99.7 and 96.5 for 1 and 2 qubit gates

Experiments Four algorithms (Gates) :- Margolus Toffoli Bernstein-Vazirani Hidden Shift

Margolus Simplified Toffoli gate Uses 3 CNOTs Creates a phase shift for |101> input http://algassert.com/quirk#circuit={%22cols%22:[[%22X%22,1,%22X%22],[%22Sample3%22],[1,1,%22Y^%C2%BC%22],[1,%22%E2%80%A2%22,%22X%22],[1,1,%22Y^%C2%BC%22],[%22%E2%80%A2%22,1,%22X%22],[1,1,%22Y^-%C2%BC%22],[1,%22%E2%80%A2%22,%22X%22],[1,1,%22Y^-%C2%BC%22]]}

Toffoli Uses five 2-qubit gates for Ion trap Uses ten 2-qubit gates for IBM-Q

Bernstein Vazirani Finds c in f(x) = x.c c is encoded as CNOT by oracle on ancilla bit

Hidden Shift Finds the hidden s for Boolean function f Oracle gives function f(x+s) Returns s for above shifted function in one call

Gates Required for each Circuit Connectivity Star LNN Full Hardware Superconductor Ion Trap Gate type 1-qubit 2-qubit Margolus 20 3 11 Toffoli 17 10 9 5 Bernstein–Vazirani 0–4 0–10 14–26 Hidden shift 28–34 20–26 4 42–50 QFT-3 42 19 7 8 QFT-5 * 35 28 22

Experimental Results Connectivity Star shaped Fully connected Hardware Superconducting Ion trap Success probability/% Obs Rand Sys Margolus 74.1 82 75 90.1 91 81 Toffoli 52.6 78 59 85.0 89 Bernstein–Vazirani 72.8 80 74 85.1 90 77 Hidden shift 35.1 52 77.1 86 57 Random is (1-eg)rootN (1-em)M Sys is (1-eg)N (1-em)M

Open Problems Number of qubits is small Connectivity is an issue Need scalable architecture Remove cross talk Maintaining controllability Ensuring accuracy Connectivity is an issue Automated calibration Quantum Computers is wires to quantum bits Scalability issues in in IBM-Q is the ability to send wires to the qubits (Control and Biasing) Microvwa Another issue is to manage the heat with scale In Ion Trap the designs hinge on precise laser beams to measure and excite the ions

Thank You