Overlapping qubits. Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH. The parallel-repeated magic square game is rigid
|
|
- Christian Porter
- 5 years ago
- Views:
Transcription
1 Rui Chao USC Ben W. Reichardt USC Overlapping qubits Chris Sutherland USC Thomas Vidick Caltech arxiv Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH Andrea W. Coladangelo Caltech arxiv The parallel-repeated magic square game is rigid Matthew Coudron MIT Anand Natarajan MIT arxiv
2 Rui Chao USC Ben W. Reichardt USC Overlapping qubits Chris Sutherland USC Thomas Vidick Caltech arxiv Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH Andrea W. Coladangelo Caltech arxiv The parallel-repeated magic square game is rigid Matthew Coudron MIT Anand Natarajan MIT arxiv
3 5 superconducting qubits, IBM 16 trapped ion qubits, UMD/NIST 1152 superconducting qubits, D-Wave quantum computers are scaling up n qubits 2 n dimensions exponentially hard to analyze
4 5 superconducting qubits, IBM 16 trapped ion qubits, UMD/NIST 1152 superconducting qubits, D-Wave quantum computers are scaling up n qubits 2 n dimensions exponentially hard to analyze small state/process tomography How to test quantum computers? medium error correction? small simulation? our tests! large factorization
5 box box Testing quantum systems -Is it quantum? -How many qubits? -How much entanglement? -How does it work? box classical Accept or Reject?
6 box box Testing quantum systems -Is it quantum? -How many qubits? -How much entanglement? -How does it work? box classical Accept or Reject? Goal: tests that and(or) and(or) for large quantum systems take polynomial time scalability efficiency with high probability completeness & soundness tolerate constant noise robustness & rigidity
7 my part: next: Test the dimensionality of a single quantum system How many qubits ^ overlapping Test the number of (tilted) EPR pairs between two systems How much entanglement Andrea: using tilted CHSH games Matthew: using Magic Square games
8 Quantum systems are made of qubits in tensor product n qubits 2 n dim
9 Quantum systems are made of qubits in tensor product n qubits 2 n dim In general qubits can overlap operations on one qubit can slightly affect the others
10 Quantum systems are made of qubits in tensor product n qubits 2 n dim In general qubits can overlap operations on one qubit can slightly affect the others ε U 1 U 2 k[u 1,U 2 ]kapple
11 Quantum systems are made of qubits in tensor product n qubits 2 n dim In general qubits can overlap operations on one qubit can slightly affect the others ε n ε-overlapping qubits U 1 U 2 k[u 1,U 2 ]kapple n 1/ ε 2 dim
12 Theorem 1: n overlapping qubits can fit in poly(n) dimensions ε-overlap (operations on one qubit can affect any other qubit by at most ε) n 1/ ε 2 dimensions
13 Theorem 1: n overlapping qubits can fit in poly(n) dimensions ε-overlap (operations on one qubit can affect any other qubit by at most ε) n 1/ ε 2 dimensions Theorem 2: Given access to n (overlapping) qubits, a test s.t. Pr[pass test] 1-ε dimension (1-O(n 2 ε)) 2 n
14 Definitions: A qubit in Indeed: H is a pair of anti-commuting reflections on it H ' C 2 H 0 {X, Z} =0) X ' x 1 Z ' z 1
15 Definitions: A qubit in Indeed: H is a pair of anti-commuting reflections on it H ' C 2 H 0 {X, Z} =0) X ' x 1 Z ' z 1 The overlap ε of 2 qubits (X1,Z1), (X2,Z2) in max k[p 1,Q 2 ]k P,Q2{X,Z} H is given by
16 Definitions: A qubit in Indeed: H is a pair of anti-commuting reflections on it H ' C 2 H 0 {X, Z} =0) X ' x 1 Z ' z 1 The overlap ε of 2 qubits (X1,Z1), (X2,Z2) in max k[p 1,Q 2 ]k P,Q2{X,Z} ε=0 qubits in tensor product: H is given by X 1 ' x I 1 Z 1 ' z I 1 X 2 ' I x 1 Z 2 ' I z 1
17 Theorem 1: n ε-overlapping qubits can fit in n Ω (1/ε 2 ) -dimensional Hilbert space. Proof idea: nearly orthogonal vectors 3n points in R O log n 2
18 Theorem 1: n ε-overlapping qubits can fit in n Ω (1/ε 2 ) -dimensional Hilbert space. Proof idea: nearly orthogonal vectors group in threes nearly orthogonal subspaces e1 g1 f1 en gn fn
19 Theorem 1: n ε-overlapping qubits can fit in n Ω (1/ε 2 ) -dimensional Hilbert space. Proof idea: nearly orthogonal vectors group in threes nearly orthogonal subspaces Clifford algebra rep. nearly commuting qubits e1 g1 f1 X = i E F en gn (n Ω(1/ ε 2 ) -dim ref.) fn Z = i E G
20 Theorem 1: n ε-overlapping qubits can fit in n Ω (1/ε 2 ) -dimensional Hilbert space. Proof idea: nearly orthogonal vectors group in threes nearly orthogonal subspaces Clifford algebra rep. nearly commuting qubits e1 g1 f1 X = i E F en gn (n Ω(1/ ε 2 ) -dim ref.) fn Z = i E G Note: meaningful only if ε=ω( (log n/n) )
21 Dimension test: Given access to n qubits 1. Sequentially store n random qubits ( 0, 1, +, or - ) 2. Retrieve a random index & check it s correct 1 j n
22 Dimension test: Given access to n qubits 1. Sequentially store n random qubits ( 0, 1, +, or - ) 2. Retrieve a random index & check it s correct 1 j n Theorem 2: Pr[pass test] 1-ε dimension (1-O(n 2 ε)) 2 n Note: meaningful only if ε=o( 1/n 2 )
23 Summary Qubit: anti-commuting reflection pair Overlapping qubits: nearly commuting reflections Qubit packing: n overlapping qubits can fit in poly(n) dimensions Qubit separation: Pr[pass test] 1-ε dimension (1-O(n 2 ε)) 2 n
24 Summary Qubit: anti-commuting reflection pair Overlapping qubits: nearly commuting reflections Qubit packing: n overlapping qubits can fit in poly(n) dimensions Qubit separation: Pr[pass test] 1-ε dimension (1-O(n 2 ε)) 2 n Applications and open questions: Test functionality Loosen assumptions & run experiments Self-testing of EPR states
25 Summary Qubit: anti-commuting reflection pair Overlapping qubits: nearly commuting reflections Qubit packing: n overlapping qubits can fit in poly(n) dimensions Qubit separation: Pr[pass test] 1-ε dimension (1-O(n 2 ε)) 2 n Applications and open questions: Thank you! Test functionality Loosen assumptions & run experiments Self-testing of EPR states
Overlapping qubits THOMAS VIDICK CALIFORNIA INSTITUTE OF TECHNOLOGY J O I N T WO R K W I T H BEN REICHARDT, UNIVERSITY OF SOUTHERN CALIFORNIA
Overlapping qubits THOMAS VIDICK CALIFORNIA INSTITUTE OF TECHNOLOGY JOINT WORK WITH BEN REICHARDT, UNIVERSITY OF SOUTHERN CALIFORNIA What is a qubit? Ion trap, Georgia Tech Superconducting qubit, Martinis
More informationENTANGLEMENT OF APPROXIMATE QUANTUM STRATEGIES IN XOR GAMES
Quantum Information and Computation, Vol. 18, No. 7&8 (2018) 0617 0631 c Rinton Press ENTANGLEMENT OF APPROXIMATE QUANTUM STRATEGIES IN XOR GAMES DIMITER OSTREV a Interdisciplinary Center for Security,
More informationChallenges in Quantum Information Science. Umesh V. Vazirani U. C. Berkeley
Challenges in Quantum Information Science Umesh V. Vazirani U. C. Berkeley 1 st quantum revolution - Understanding physical world: periodic table, chemical reactions electronic wavefunctions underlying
More informationarxiv: v1 [quant-ph] 4 Jan 2017
Overlapping qubits Rui Chao 1 Ben W. Reichardt 1 Chris Sutherland 1 Thomas Vidick 2 arxiv:1701.01062v1 [quant-ph] 4 Jan 2017 Abstract An ideal system of n qubits has 2 n dimensions. This exponential grants
More informationQuantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002
Quantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002 1 QMA - the quantum analog to MA (and NP). Definition 1 QMA. The complexity class QMA is the class of all languages
More informationUntrusted quantum devices. Yaoyun Shi University of Michigan updated Feb. 1, 2014
Untrusted quantum devices Yaoyun Shi University of Michigan updated Feb. 1, 2014 Quantum power is incredible! Quantum power is incredible! Quantum power is incredible! Spooky action at a distance Quantum
More informationExplicit bounds on the entangled value of multiplayer XOR games. Joint work with Thomas Vidick (MIT)
Explicit bounds on the entangled value of multiplayer XOR games Jop Briët Joint work with Thomas Vidick (MIT) Waterloo, 2012 Entanglement and nonlocal correlations [Bell64] Measurements on entangled quantum
More informationCS286.2 Lecture 15: Tsirelson s characterization of XOR games
CS86. Lecture 5: Tsirelson s characterization of XOR games Scribe: Zeyu Guo We first recall the notion of quantum multi-player games: a quantum k-player game involves a verifier V and k players P,...,
More informationDetecting genuine multipartite entanglement in higher dimensional systems
University of Vienna March 16, 2011 (University of Vienna) March 16, 2011 1 / 19 1 2 3 4 5 6 7 8 (University of Vienna) March 16, 2011 2 / 19 To start with some easy basics (University of Vienna) March
More informationTutorial 5 Clifford Algebra and so(n)
Tutorial 5 Clifford Algebra and so(n) 1 Definition of Clifford Algebra A set of N Hermitian matrices γ 1, γ,..., γ N obeying the anti-commutator γ i, γ j } = δ ij I (1) is the basis for an algebra called
More informationLecture 26: QIP and QMIP
Quantum Computation (CMU 15-859BB, Fall 2015) Lecture 26: QIP and QMIP December 9, 2015 Lecturer: John Wright Scribe: Kumail Jaffer 1 Introduction Recall QMA and QMA(2), the quantum analogues of MA and
More informationCS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games Scribe: Zeyu Guo In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking,
More informationQuantum Error Correction Codes-From Qubit to Qudit. Xiaoyi Tang, Paul McGuirk
Quantum Error Correction Codes-From Qubit to Qudit Xiaoyi Tang, Paul McGuirk Outline Introduction to quantum error correction codes (QECC) Qudits and Qudit Gates Generalizing QECC to Qudit computing Need
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 informationThe Entanglement Frontier
The Entanglement Frontier John Preskill, Caltech QuEST, 28 March 2011 HEP: What underlying theory explains the observed elementary particles and their interactions, including gravity? QIS: Can we control
More informationQuantum Computing An Overview
Quantum Computing An Overview NAS Division NASA Ames Research Center TR Govindan Program Manager, QIS U.S. Army Research Office Outline Motivation Essentials of the Quantum Computing (QC) model Challenges
More informationIntroduction to Quantum Logic. Chris Heunen
Introduction to Quantum Logic Chris Heunen 1 / 28 Overview Boolean algebra Superposition Quantum logic Entanglement Quantum computation 2 / 28 Boolean algebra 3 / 28 Boolean algebra A Boolean algebra is
More informationQuantum Simulation. 9 December Scott Crawford Justin Bonnar
Quantum Simulation 9 December 2008 Scott Crawford Justin Bonnar Quantum Simulation Studies the efficient classical simulation of quantum circuits Understanding what is (and is not) efficiently simulable
More information5. Communication resources
5. Communication resources Classical channel Quantum channel Entanglement How does the state evolve under LOCC? Properties of maximally entangled states Bell basis Quantum dense coding Quantum teleportation
More informationTsuyoshi Ito (McGill U) Hirotada Kobayashi (NII & JST) Keiji Matsumoto (NII & JST)
Tsuyoshi Ito (McGill U) Hirotada Kobayashi (NII & JST) Keiji Matsumoto (NII & JST) arxiv:0810.0693 QIP 2009, January 12 16, 2009 Interactive proof [Babai 1985] [Goldwasser, Micali, Rackoff 1989] erifier:
More informationThreshold theorem for quantum supremacy arxiv:
2017.1.16-20 QIP2017 Seattle, USA Threshold theorem for quantum supremacy arxiv:1610.03632 Keisuke Fujii Photon Science Center, The University of Tokyo /PRESTO, JST 2017.1.16-20 QIP2017 Seattle, USA Threshold
More informationFUNDAMENTAL QUANTUM OPTICS EXPERIMENTS IN SPACE AND LAB. Luca Calderaro Admission to III year 22 September 2017
FUNDAMENTAL QUANTUM OPTICS EXPERIMENTS IN SPACE AND LAB Luca Calderaro Admission to III year 22 September 2017 II year experiments Extension of the Wheeler s delayed choice experiment in space Direct Measurements
More informationGrover s algorithm. We want to find aa. Search in an unordered database. QC oracle (as usual) Usual trick
Grover s algorithm Search in an unordered database Example: phonebook, need to find a person from a phone number Actually, something else, like hard (e.g., NP-complete) problem 0, xx aa Black box ff xx
More informationSome Introductory Notes on Quantum Computing
Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best
More informationOn the power of quantum, one round, two prover interactive proof systems
On the power of quantum, one round, two prover interactive proof systems Alex Rapaport and Amnon Ta-Shma Department of Computer Science Tel-Aviv University Israel 69978. email: rapapo,amnon@post.tau.ac.il.
More informationTsirelson s problem and linear system games
IQC, University of Waterloo October 10th, 2016 includes joint work with Richard Cleve and Li Liu Non-local games x Referee y Win/lose based on outputs a, b and inputs x, y Alice Bob Alice and Bob must
More information2. Introduction to quantum mechanics
2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian
More informationQuantum error correction for continuously detected errors
Quantum error correction for continuously detected errors Charlene Ahn, Toyon Research Corporation Howard Wiseman, Griffith University Gerard Milburn, University of Queensland Quantum Information and Quantum
More informationQuantum Entanglement, Beyond Quantum Mechanics, and Why Quantum Mechanics
Quantum Entanglement, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G. Kwiat Physics 403 talk: July 28, 2014 Entanglement is a feature of compound quantum systems States
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 informationOptimal state reconstructions
Quantum observations talk 3 Vladimír Bužek Research Center for Quantum Information, Bratislava, Slovakia 4 September 0 Sharif University of Technology, Tehran Optimal state reconstructions Reconstructions
More information6. Quantum error correcting codes
6. Quantum error correcting codes Error correcting codes (A classical repetition code) Preserving the superposition Parity check Phase errors CSS 7-qubit code (Steane code) Too many error patterns? Syndrome
More informationQuantum Error Correction Codes - From Qubit to Qudit
Quantum Error Correction Codes - From Qubit to Qudit Xiaoyi Tang Paul McGuirk December 7, 005 1 Introduction Quantum computation (QC), with inherent parallelism from the superposition principle of quantum
More informationQuantum expanders from any classical Cayley graph expander
Quantum expanders from any classical Cayley graph expander arxiv:0709.1142 Aram Harrow (Bristol) QIP 08 19 Dec 2007 outline Main result. Definitions. Proof of main result. Applying the recipe: examples
More informationLocal Algorithms for 1D Quantum Systems
Local Algorithms for 1D Quantum Systems I. Arad, Z. Landau, U. Vazirani, T. Vidick I. Arad, Z. Landau, U. Vazirani, T. Vidick () Local Algorithms for 1D Quantum Systems 1 / 14 Many-body physics Are physical
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 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 informationVerification of quantum computation
Verification of quantum computation THOMAS VIDICK CALIFORNIA INSTITUTE OF TECHNOLOGY Slides: http://users.cms.caltech.edu/~vidick/verification.{ppsx,pdf} 1. Problem formulation 2. Overview of existing
More informationTransversal logical gates
Transversal logical gates SPT phases gapped boundaries eni Yoshida (Perimeter Institute) *SPT = symmetry protected topological Transversal logical gates SPT phases gapped boundaries *SPT = symmetry protected
More informationMACROREALISM and WEAK MEASUREMENT
CIFAR 1 MACROREALISM and WEAK MEASUREMENT Original CHSH inequality: A A AB A B AB A B 2 ~ S ~ B B (A, B, A, B 1) Satisfied by all objective local theories, df. by conjunction of 1) Induction 2) Einstein
More informationTeleportation-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 informationNoise-resilient quantum circuits
Noise-resilient quantum circuits Isaac H. Kim IBM T. J. Watson Research Center Yorktown Heights, NY Oct 10th, 2017 arxiv:1703.02093, arxiv:1703.00032, arxiv:17??.?????(w. Brian Swingle) Why don t we have
More informationSimulation of quantum computers with probabilistic models
Simulation of quantum computers with probabilistic models Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. April 6, 2010 Vlad Gheorghiu (CMU) Simulation of quantum
More informationTensor product Take two tensors, get together enough inputs to feed into both, and take the product of their results.
1 Tensors Tensors are a representation of linear operators. Much like with bra-ket notation, we want a notation which will suggest correct operations. We can represent a tensor as a point with n legs radiating
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 Error-Correction Subsystem Codes Constructions of Subsystem Codes Bounds on Subsystem Codes Summary. Subsystem Codes
Quantum Error-Correction Constructions of Bounds on Summary Pradeep Sarvepalli, Andreas Klappenecker Department of Computer Science Texas A&M University Quantum Computing Seminar, 6th November 2006 Quantum
More informationExploring Quantum Chaos with Quantum Computers
Exploring Quantum Chaos with Quantum Computers Part II: Measuring signatures of quantum chaos on a quantum computer David Poulin Institute for Quantum Computing Perimeter Institute for Theoretical Physics
More informationRobust Characterization of Quantum Processes
Robust Characterization of Quantum Processes Shelby Kimmel Center for Theoretical Physics, MIT Marcus da Silva, Colm Ryan, Blake Johnson, Tom Ohki Raytheon BBN Technologies JQI Monday Dec. 16 Why don t
More informationErrata list, Nielsen & Chuang. rrata/errata.html
Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation
More informationThree-Party Quantum Self-Testing with a Proof by Diagrams
Three-Party Quantum Self-Testing with a Proof by Diagrams Spencer reiner NIST spencer.breiner@nist.gov mir Kalev Joint Center for Quantum Information and Computer Science (QuICS) amirk@umd.edu Carl. Miller
More informationBaby's First Diagrammatic Calculus for Quantum Information Processing
Baby's First Diagrammatic Calculus for Quantum Information Processing Vladimir Zamdzhiev Department of Computer Science Tulane University 30 May 2018 1 / 38 Quantum computing ˆ Quantum computing is usually
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 Many Body Systems and Tensor Networks
Quantum Many Body Systems and Tensor Networks Aditya Jain International Institute of Information Technology, Hyderabad aditya.jain@research.iiit.ac.in July 30, 2015 Aditya Jain (IIIT-H) Quantum Hamiltonian
More informationWitness-preserving Amplification of QMA
Witness-preserving Amplification of QMA Yassine Hamoudi December 30, 2015 Contents 1 Introduction 1 1.1 QMA and the amplification problem.................. 2 1.2 Prior works................................
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 informationThe Lovász ϑ-function in Quantum Mechanics
The Lovász ϑ-function in Quantum Mechanics Zero-error Quantum Information and Noncontextuality Simone Severini UCL Oxford Jan 2013 Simone Severini (UCL) Lovász ϑ-function in Quantum Mechanics Oxford Jan
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 information)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI
Riley Tipton Perry University of New South Wales, Australia )j > World Scientific NEW JERSEY LONDON. SINGAPORE BEIJING SHANSHAI HONG K0N6 TAIPEI» CHENNAI Contents Acknowledgments xi 1. Introduction 1 1.1
More informationFactoring on a Quantum Computer
Factoring on a Quantum Computer The Essence Shor s Algorithm Wolfgang Polak wp@pocs.com Thanks to: Eleanor Rieffel Fuji Xerox Palo Alto Laboratory Wolfgang Polak San Jose State University, 4-14-010 - p.
More informationRobust protocols for securely expanding randomness and distributing keys using untrusted quantum devices
Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices Carl A. Miller and Yaoyun Shi Department of Electrical Engineering and Computer Science University
More informationPermutationally invariant quantum tomography
/ 4 Permutationally invariant quantum tomography G. Tóth,2,3, W. Wieczorek 4,5, D. Gross 6, R. Krischek 4,5, C. Schwemmer 4,5, and H. Weinfurter 4,5 Theoretical Physics, The University of the Basque Country,
More informationNoisy Interactive Quantum Communication
Noisy Interactive Quantum ommunication arxiv: 1309.2643 Gilles rassard, shwin Nayak, lain Tapp, Dave Touchette and Falk Unger arcelona, QIP 2014 touchetd@iro.umontreal.ca Noisy Interactive Quantum ommunication
More informationThe partial-fractions method for counting solutions to integral linear systems
The partial-fractions method for counting solutions to integral linear systems Matthias Beck, MSRI www.msri.org/people/members/matthias/ arxiv: math.co/0309332 Vector partition functions A an (m d)-integral
More informationC/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9
C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9 1 Readings Benenti, Casati, and Strini: Quantum Gates Ch. 3.2-3.4 Universality Ch. 3.5-3.6 2 Quantum Gates Continuing
More informationQuantum strategy, Quantum correlations and Operator algebras
Quantum strategy, Quantum correlations and Operator algebras Hun Hee Lee Seoul National University Seoul, Nov. 28th, 2016 Personal encounters with CS/mathematicians Elementary Proofs of Grothendieck Theorems
More informationClassical Verification of Quantum Computations
2018 IEEE 59th Annual Symposium on Foundations of Computer Science Classical Verification of Quantum Computations Urmila Mahadev Department of Computer Science, UC Berkeley mahadev@berkeley.edu Abstract
More informationTopological quantum computation and quantum logic
Topological quantum computation and quantum logic Zhenghan Wang Microsoft Station Q UC Santa Barbara Microsoft Project Q: Search for non-abelian anyons in topological phases of matter, and build a topological
More informationBasics of quantum computing and some recent results. Tomoyuki Morimae YITP Kyoto University) min
Basics of quantum computing and some recent results Tomoyuki Morimae YITP Kyoto University) 50+10 min Outline 1. Basics of quantum computing circuit model, classically simulatable/unsimulatable, quantum
More informationADIABATIC PREPARATION OF ENCODED QUANTUM STATES
ADIABATIC PREPARATION OF ENCODED QUANTUM STATES Fernando Pastawski & Beni Yoshida USC Los Angeles, June 11, 2014 QUANTUM NOISE Storing single observable not enough. Decoherence deteriorates quantum observables.
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 informationiqim Quantum computing and the entanglement frontier John Preskill, Caltech Solvay Conference 19 October 2011
Quantum computing and the entanglement frontier iqim Institute for Quantum Information and Matter John Preskill, Caltech Solvay Conference 19 October 2011 HEP: Big Questions What underlying theory explains
More informationChiral Haldane-SPT phases of SU(N) quantum spin chains in the adjoint representation
Chiral Haldane-SPT phases of SU(N) quantum spin chains in the adjoint representation Thomas Quella University of Cologne Presentation given on 18 Feb 2016 at the Benasque Workshop Entanglement in Strongly
More informationThe first law of general quantum resource theories
The first law of general quantum resource theories Carlo Sparaciari 1, Lídia del Rio 2, Carlo Maria Scandolo 3, Philippe Faist 4, and Jonathan Oppenheim 1 1 Department of Physics and Astronomy, University
More informationFrustration-free Ground States of Quantum Spin Systems 1
1 FRG2011, Harvard, May 19, 2011 Frustration-free Ground States of Quantum Spin Systems 1 Bruno Nachtergaele (UC Davis) based on joint work with Sven Bachmann, Spyridon Michalakis, Robert Sims, and Reinhard
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 informationSome limits on non-local randomness expansion
Some limits on non-local randomness expansion Matt Coudron and Henry Yuen December 12, 2012 1 Introduction God does not play dice. Albert Einstein Einstein, stop telling God what to do. Niels Bohr One
More informationError Classification and Reduction in Solid State Qubits
Southern Illinois University Carbondale OpenSIUC Honors Theses University Honors Program 5-15 Error Classification and Reduction in Solid State Qubits Karthik R. Chinni Southern Illinois University Carbondale,
More informationLecture 6: Quantum error correction and quantum capacity
Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem
More informationOrthogonality and Algebraic Lambda-Calculus
Orthogonality and Algebraic Lambda-Calculus Benoît Valiron March 28, 2010 Abstract Directly encoding lambda-terms on quantum strings while keeping a quantum interpretation is a hard task. As shown by van
More informationCharacterizing Quantum Supremacy in Near-Term Devices
Characterizing Quantum Supremacy in Near-Term Devices S. Boixo S. Isakov, V. Smelyanskiy, R. Babbush, M. Smelyanskiy, N. Ding, Z. Jiang, M. J. Bremner, J. Martinis, H. Neven Google January 19th Beyond-classical
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 informationQuantum Correlations and Tsirelson s Problem
Quantum Correlations and Tsirelson s Problem NaruTaka OZAWA {Ø Research Institute for Mathematical Sciences, Kyoto University C -Algebras and Noncommutative Dynamics March 2013 About the Connes Embedding
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationInformation Theory Meets Quantum Physics
Information Theory Meets Quantum Physics The magic of wave dynamics Apoorva Patel Centre for High Energy Physics Indian Institute of Science, Bangalore 30 April 2016 (Commemorating the 100th birthday of
More informationQuantum Supremacy and its Applications
Quantum Supremacy and its Applications HELLO HILBERT SPACE Scott Aaronson (University of Texas, Austin) Simons Institute, Berkeley, June 12, 2018 Based on joint work with Lijie Chen (CCC 2017, arxiv: 1612.05903)
More informationRank-one and Quantum XOR Games
Rank-one and Quantum XOR Games T. Cooney 1 M. Junge 2 C. Palazuelos 3 D. Pérez García 1 and O. Regev 4 T. Vidick 5 1 Universidad Complutense de Madrid 2 University of Illinois at Urbana Champaign 3 Instituto
More informationFrustration-free Ground States of Quantum Spin Systems 1
1 Davis, January 19, 2011 Frustration-free Ground States of Quantum Spin Systems 1 Bruno Nachtergaele (UC Davis) based on joint work with Sven Bachmann, Spyridon Michalakis, Robert Sims, and Reinhard Werner
More informationarxiv: v1 [quant-ph] 19 Dec 2017
Decoherence of up to -qubit entangled states in a -qubit superconducting quantum processor Asier Ozaeta,,, and Peter L. McMahon QC Ware Corp., University Ave., Suite, Palo Alto, CA 9, USA E. L. Ginzton
More informationBy allowing randomization in the verification process, we obtain a class known as MA.
Lecture 2 Tel Aviv University, Spring 2006 Quantum Computation Witness-preserving Amplification of QMA Lecturer: Oded Regev Scribe: N. Aharon In the previous class, we have defined the class QMA, which
More informationSemiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005
Semiconductors: Applications in spintronics and quantum computation Advanced Summer School 1 I. Background II. Spintronics Spin generation (magnetic semiconductors) Spin detection III. Spintronics - electron
More informationRandomness in nonlocal games between mistrustful players
Randomness in nonlocal games between mistrustful players Carl A. Miller and Yaoyun Shi* Source paper: Forcing classical behavior for quantum players by C. Miller and Y. Shi (2016), attached. One of the
More informationIntroduction into Quantum Computations Alexei Ashikhmin Bell Labs
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs Workshop on Quantum Computing and its Application March 16, 2017 Qubits Unitary transformations Quantum Circuits Quantum Measurements Quantum
More informationTesting Quantum Mechanics and Bell's Inequality with Astronomical Observations
Testing Quantum Mechanics and Bell's Inequality with Astronomical Observations Dr. Andrew Friedman NSF Research Associate, Visiting Research Scientist MIT Center for Theoretical Physics http://web.mit.edu/asf/www/
More informationMP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More informationQUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36
QUANTUM INFORMATION - THE NO-HIDING THEOREM Arun K Pati akpati@iopb.res.in Instititute of Physics, Bhubaneswar-751005, Orissa, INDIA and Th. P. D, BARC, Mumbai-400085, India QUANTUM INFORMATION -THE NO-HIDING
More informationCategories and Quantum Informatics: Hilbert spaces
Categories and Quantum Informatics: Hilbert spaces Chris Heunen Spring 2018 We introduce our main example category Hilb by recalling in some detail the mathematical formalism that underlies quantum theory:
More informationQuantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G.
Quantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G. Kwiat Physics 403 talk: December 2, 2014 Entanglement is a feature of compound
More informationRMT and boson computers
RMT and boson computers [Aaronson-Arkhipov 2011] John Napp May 11, 2016 Introduction Simple type of quantum computer proposed in 2011 by Aaronson and Arkhipov based on the statistics of noninteracting
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 informationMaximal vectors in Hilbert space and quantum entanglement
Maximal vectors in Hilbert space and quantum entanglement William Arveson arveson@math.berkeley.edu UC Berkeley Summer 2008 arxiv:0712.4163 arxiv:0801.2531 arxiv:0804.1140 Overview Quantum Information
More information