Determining the capacity of any quantum computer to perform a useful computation Joel Wallman Quantum Resource Estimation June 22, 2019.

Slides:



Advertisements
Similar presentations
University of Queensland
Advertisements

Sergey Bravyi, IBM Watson Center Robert Raussendorf, Perimeter Institute Perugia July 16, 2007 Exactly solvable models of statistical physics: applications.
Computational Statistics. Basic ideas  Predict values that are hard to measure irl, by using co-variables (other properties from the same measurement.
Cadence Design Systems, Inc. Why Interconnect Prediction Doesn’t Work.
Kriging.
Emergence of Quantum Mechanics from Classical Statistics.
Quantum Error Correction Joshua Kretchmer Gautam Wilkins Eric Zhou.
Multiple Linear Regression Model
A Universal Operator Theoretic Framework for Quantum Fault Tolerance Yaakov S. Weinstein MITRE Quantum Information Science Group MITRE Quantum Error Correction.
Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.
RELIABILITY consistency or reproducibility of a test score (or measurement)
Gate robustness: How much noise will ruin a quantum gate? Aram Harrow and Michael Nielsen, quant-ph/0212???
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
Beyond the DiVincenzo Criteria: Requirements and Desiderata for Fault-Tolerance Daniel Gottesman.
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 13th Lecture Christian Schindelhauer.
Schrödinger’s Elephants & Quantum Slide Rules A.M. Zagoskin (FRS RIKEN & UBC) S. Savel’ev (FRS RIKEN & Loughborough U.) F. Nori (FRS RIKEN & U. of Michigan)
Introduction to Hadronic Final State Reconstruction in Collider Experiments Introduction to Hadronic Final State Reconstruction in Collider Experiments.
Topic 3: Regression.
Dogma and Heresy in Quantum Computing DoRon Motter February 18, 2002.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Efficient Quantum State Tomography using the MERA in 1D critical system Presenter : Jong Yeon Lee (Undergraduate, Caltech)
Laurent Itti: CS599 – Computational Architectures in Biological Vision, USC Lecture 7: Coding and Representation 1 Computational Architectures in.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
From T. McMillen & P. Holmes, J. Math. Psych. 50: 30-57, MURI Center for Human and Robot Decision Dynamics, Sept 13, Phil Holmes, Jonathan.
Requirements and Desiderata for Fault-Tolerant Quantum Computing Daniel Gottesman Perimeter Institute for Theoretical Physics Beyond the DiVincenzo Criteria.
Quantum Error Correction and Fault-Tolerance Todd A. Brun, Daniel A. Lidar, Ben Reichardt, Paolo Zanardi University of Southern California.
Quantum systems for information technology, ETHZ
Matt Reed Yale University Boston, MA - February 28, 2012
ENTROPIC CHARACTERISTICS OF QUANTUM CHANNELS AND THE ADDITIVITY PROBLEM A. S. Holevo Steklov Mathematical Institute, Moscow.
Software Reliability SEG3202 N. El Kadri.
Jian-Wei Pan Decoherence-free sub-space and quantum error-rejection Jian-Wei Pan Lecture Note 7.
Quantum Computing Preethika Kumar
The Road to Quantum Computing: Boson Sampling Nate Kinsey ECE 695 Quantum Photonics Spring 2014.
Ch. 1.  High-profile failures ◦ Therac 25 ◦ Denver Intl Airport ◦ Also, Patriot Missle.
Quantum Computing – Part 2 Amanda Denton – Evil Dictator Jesse Millikan – Mad Scientist Lee Ballard – Some Guy With A Beard September 30, 2001.
© 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.
Efficient measure of scalability Cecilia López, Benjamin Lévi, Joseph Emerson, David Cory Department of Nuclear Science & Engineering, Massachusetts Institute.
Quantum Mechanics(14/2) Hongki Lee BIOPHOTONICS ENGINEERING LABORATORY School of Electrical and Electronic Engineering, Yonsei University Quantum Computing.
Turbo Codes. 2 A Need for Better Codes Designing a channel code is always a tradeoff between energy efficiency and bandwidth efficiency. Lower rate Codes.
BME 353 – BIOMEDICAL MEASUREMENTS AND INSTRUMENTATION MEASUREMENT PRINCIPLES.
Capabilities and limitations of quantum computers Michele Mosca 1 November 1999 ECC ’99.
Privacy-Preserving Data Aggregation without Secure Channel: Multivariate Polynomial Evaluation Taeho Jung 1, XuFei Mao 2, Xiang-Yang Li 1, Shao-Jie Tang.
Exposure Prediction and Measurement Error in Air Pollution and Health Studies Lianne Sheppard Adam A. Szpiro, Sun-Young Kim University of Washington CMAS.
Home Reading Skoog et al. Fundamental of Analytical Chemistry. Chapters 5 and 6.
Combining Models Foundations of Algorithms and Machine Learning (CS60020), IIT KGP, 2017: Indrajit Bhattacharya.
Prabhas Chongstitvatana Chulalongkorn University
OPERATING SYSTEMS CS 3502 Fall 2017
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
Dynamo: A Runtime Codesign Environment
Boosted Augmented Naive Bayes. Efficient discriminative learning of
Quantum Circuit Visualization
Introduction to Quantum Computing Lecture 1 of 2
The general linear model and Statistical Parametric Mapping
Markov Random Fields with Efficient Approximations
Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel Kiyoshi Tamaki * *Perimeter Institute for.
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
Quantum Computing: an introduction
Using surface code experimental output correctly and effectively
3rd Lecture: QMA & The local Hamiltonian problem (CNT’D)
Constraint Programming and Backtracking Search Algorithms
Qubit Recycling in Quantum Computation
OSU Quantum Information Seminar
MICRO-50 Swamit Tannu Zachary Myers Douglas Carmean Prashant Nair
Bayesian Deep Learning on a Quantum Computer
Statistical Thinking and Applications
Magic-State Functional Units
Presentation transcript:

Determining the capacity of any quantum computer to perform a useful computation Joel Wallman Quantum Resource Estimation June 22, 2019

Quantum Computing 101 Ideal computational model: prepare N systems in initial state apply a sequence of gates measure all systems independently Produces samples from a distribution over 2N outcomes

Computational Error Error: a deviation from accuracy or correctness

Computational Error Outcomes from an experimental quantum computer are equivalent to ideal sampling and transmitting the result through a noisy classical channel The probability that the noisy channel causes an error is the total variation distance (TVD)

Noisy Quantum Computers (Quantum) computers never work perfectly

Murphy’s law Evolution determined by control pulses, Hamiltonians Possible errors: every term 𝑖 𝜕𝜓 𝑡 𝜕𝑡 = 𝐻 0 𝑡 + 𝑘 𝑢 𝑘 𝑡 𝐻 𝑘 (𝑡) 𝜓(𝑡) (under crosstalk)

Component Errors Computational error arises from component errors Context-independent errors: T1/T2, depolarizing Context-dependent errors: coherent errors Contribution fluctuates by orders of magnitude

Component Errors Errors depend on how you parallelize (and the history) Errors per one- and two-qubit gate are misleading: The rest of the system does not idle perfectly (people think you can serialize) The effect of the error depends upon the context

Implementing Quantum Computers The conventional approach: construct effective gates acting on small subsystems characterize noise on individual gates stitch individual noise models together use quantum error correction Need to characterize gates as they are implemented.

E.g., cross-talk IBM Q Cross-talk introduces significant gate-dependent coherent errors that depend on what gates are implemented simultaneously

Cycles A cycle is a set of gates applied in parallel in a fixed time slice A circuit is a list of cycles, fixes parallelization Relevant error is the error of the cycle, not the individual gates

Cycles Large gains can be achieved by optimizing each cycle Gains should increase at least linearly with the number of qubits C Neill et al., Science  13, 4309

Cycles Need to minimize how many cycles are calibrated and monitored Naïve approaches gives exponential number of cycles or increases circuit time Can use 3 types of cycles: Independent simultaneous Z rotations Simultaneous X90 on all qubits O(1)/4 parallel multi-qubit cycles

Cycles For any n, can implement any cycle of: Independent single-qubit gates can be implemented with 2 X cycles, 3 Z cycles Independent two-qubit unitary gates on any configuration with 3 fixed multi-qubit cycles Optimal gain from calibrating all possible cycles is only 3x better than calibrating 4 Clifford cycles

Randomized compiling Error in cycles is well-defined, can include coherent errors due to cross-talk, etc Randomize single-qubit operations, average over independent realizations Little to no overhead Effective error is stochastic, well-defined error rate per cycle independent of context

Randomized compiling Reduced errors and predictable error rates! Data from IBM Q Melbourne Reduced errors and predictable error rates! Probability of inaccurate solution

Cycle benchmarking Can estimate the error per cycle efficiently in the number of qubits via a variant of RB Can alternate interleaved cycles to study interactions between cycles

Cycle benchmarking Experimentally implemented on up to 10 qubits with an all-to-all entangling gate Used 400 circuits, 100 repetitions per circuit per cycle

Cycle benchmarking Data from UIBK Same calibrations can be used even for subsets of qubits Can choose the best subset of qubits and estimate the error rates with no experimental overhead

Noise reconstruction Cycle benchmarking gives different decay curves that are separately fitted and averaged to get an average process fidelity Can also sample and transform these decay curves to efficiently reconstruct the underlying error channel The error can be used to identify recalibrations and to design fault-tolerant circuits and gadgets

Data from IBM Q Melbourne Noise reconstruction Data from IBM Q Melbourne E.g., one day automatic calibration of IBM Q resulted in an unexpectedly large error on one qubit

Noise reconstruction Data from UIBK Error in a round of 4 independent single-qubit gates, errors primarily local but some correlated errors

Noise reconstruction Data from UIBK Errors in a 4-qubit all-to-all entangling gate, extra errors primarily due to many-body errors

Acknowledgements Funding Collaborators R Blatt U.Innsbruck J Emerson U.Waterloo S Flammia U.Sydney R Harper U.Sydney T Monz U.Innsbruck P Schindler U.Innsbruck

Open positions! Institute for Quantum Computing, University of Waterloo 3 postdoc positions with Emerson/Wallman Characterization of quantum devices and open quantum systems theory Quantum Algorithms Quantum Foundations and Quantum Resources https://services.iqc.uwaterloo.ca/applications/positions/iqc-postdoctoral-fellowship/ Quantum Benchmark Inc. Research Scientist Chief Product Officer 2 software developers Contact Jemerson@quantumbenchmark.com School of Physics, University of Sydney Multiple postdoc positions with Flammia http://bit.ly/SydneyPostdoc2019

Achieve reliable quantum solutions with unreliable quantum hardware. Quantum Benchmark Software Achieve reliable quantum solutions with unreliable quantum hardware. TRUE-Q™ DESIGN For QC scientists to improve design of hardware and quantum control: Assess and suppress errors Improve hardware design Optimize qubit control Fast tune-up Minimize error correction overheads Optimize decoder TRUE-Q™ OS For QC users to optimize run-time performance & accuracy of solutions Universal transpiler between circuit formats Monitor drift & fast tune-up Suppress run-time errors Error-aware compiler to optimize application performance Validate accuracy of solutions Sample PRODUCTS slide.