DOCSLIB.ORG

Magic States and Contextuality

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Magic States and Contextuality Magic States and Contextuality Mark Howard (NUI Galway, Ireland) Outline of Talk 1. Universal Quantum Computing via Magic States 2. Quantum Contextuality 3. How 1 and 2 are related (esp. qudits) Quantum Computing 0 j0i (Classical) Bits Qubits (Quantum) Probabilistic 0=1 α 0 + β 1 j i j i 1 j1i Qudits::: X Are naturally occurring in many physical systems Are (probably) more difficult to experimentally prepare, control & × measure than qubits X Have nice symmetries, advantageous for fault-tolerance Qubits::: X Are what people actually want to use::: Qubits vs Qudits (Relevant Later) Let's define a qudit to be a p-level quantum system (p =odd prime) Qubit: α0 0 + α1 1 p−1 p−1j i j i 8 αk = 1; αk C >Qudit: αk k j j 2 <> j i kX=0 kX=0 > :> Mixed/impure states: ρ = p p = 1 ij iih ij i i i ! X X Qubits vs Qudits (Relevant Later) Let's define a qudit to be a p-level quantum system (p =odd prime) Qubit: α0 0 + α1 1 p−1 p−1j i j i 8 αk = 1; αk C >Qudit: αk k j j 2 <> j i kX=0 kX=0 > :> Mixed/impure states: ρ = p p = 1 ij iih ij i i i ! X X Qudits::: X Are naturally occurring in many physical systems Are (probably) more difficult to experimentally prepare, control & × measure than qubits X Have nice symmetries, advantageous for fault-tolerance Qubits::: X Are what people actually want to use::: Weyl-Heisenberg/Pauli Group: n a = [a1; a2; : : : ; an]; b = [b1; b2; : : : ; bn] F Binary Vectors 2 2 D(a; b) = Xa1 Zb1 Xa2 Zb2 Xan Zbn Pauli Operators ⊗ ⊗ · · · ⊗ ~ κ n WH2n = i D(a; b) a; b F ; κ Z4 Pauli/WH Group f j 2 2 2 g The Clifford Group: y Cliff2n = g U2n gD(a; b)g WH2n ; D(a; b) WH2n 2 j 2 8 2 It turns out that gD(a; b)gy = D([a; b]F ) where F is a 2n 2n binary matrix ± g g × Cliff2n =WH2n h Sp(2n; F2) Pauli Matrices: 0 1 1 0 0 i X = ;Z = ;Y = iXZ = − : 1 0 0 1 i 0 ! − ! ! The Clifford Group: y Cliff2n = g U2n gD(a; b)g WH2n ; D(a; b) WH2n 2 j 2 8 2 It turns out that gD(a; b)gy = D([a; b]F ) where F is a 2n 2n binary matrix ± g g × Cliff2n =WH2n h Sp(2n; F2) Pauli Matrices: 0 1 1 0 0 i X = ;Z = ;Y = iXZ = − : 1 0 0 1 i 0 ! − ! ! Weyl-Heisenberg/Pauli Group: n a = [a1; a2; : : : ; an]; b = [b1; b2; : : : ; bn] F Binary Vectors 2 2 D(a; b) = Xa1 Zb1 Xa2 Zb2 Xan Zbn Pauli Operators ⊗ ⊗ · · · ⊗ ~ κ n WH2n = i D(a; b) a; b F ; κ Z4 Pauli/WH Group f j 2 2 2 g It turns out that gD(a; b)gy = D([a; b]F ) where F is a 2n 2n binary matrix ± g g × Cliff2n =WH2n h Sp(2n; F2) Pauli Matrices: 0 1 1 0 0 i X = ;Z = ;Y = iXZ = − : 1 0 0 1 i 0 ! − ! ! Weyl-Heisenberg/Pauli Group: n a = [a1; a2; : : : ; an]; b = [b1; b2; : : : ; bn] F Binary Vectors 2 2 D(a; b) = Xa1 Zb1 Xa2 Zb2 Xan Zbn Pauli Operators ⊗ ⊗ · · · ⊗ ~ κ n WH2n = i D(a; b) a; b F ; κ Z4 Pauli/WH Group f j 2 2 2 g The Clifford Group: y Cliff2n = g U2n gD(a; b)g WH2n ; D(a; b) WH2n 2 j 2 8 2 Pauli Matrices: 0 1 1 0 0 i X = ;Z = ;Y = iXZ = − : 1 0 0 1 i 0 ! − ! ! Weyl-Heisenberg/Pauli Group: n a = [a1; a2; : : : ; an]; b = [b1; b2; : : : ; bn] F Binary Vectors 2 2 D(a; b) = Xa1 Zb1 Xa2 Zb2 Xan Zbn Pauli Operators ⊗ ⊗ · · · ⊗ ~ κ n WH2n = i D(a; b) a; b F ; κ Z4 Pauli/WH Group f j 2 2 2 g The Clifford Group: y Cliff2n = g U2n gD(a; b)g WH2n ; D(a; b) WH2n 2 j 2 8 2 It turns out that gD(a; b)gy = D([a; b]F ) where F is a 2n 2n binary matrix ± g g × Cliff2n =WH2n h Sp(2n; F2) Heisenberg Representation: Describe a state by its stabilizer instead::: n sj WH2n sj = ; 1 j 2 ( ) = f 2 j j i j i ≤ ≤ g 2n n S ( [a; b]j F sj = ; 1 j 2 2 2 j j i j i ≤ ≤ Updating description after Clifford g is easy, g j i 7! j i [a; b] [a; b]Fg Upshot: 7! Large class of states & operations efficiently/poly(n) simulable 1 0 Symmetry Symmetry = = • , group of =UQC = • , group of , T 0 eiπ/4 Cliff2n h i 6 h i Classical Simulation Rough Intuition: Simulating quantum theory is hard because 2n States' description exponentially long: C • j i 2 Evolution governed by 2n 2n Unitary Matrices. • × Updating description after Clifford g is easy, g j i 7! j i [a; b] [a; b]Fg Upshot: 7! Large class of states & operations efficiently/poly(n) simulable 1 0 Symmetry Symmetry = = • , group of =UQC = • , group of , T 0 eiπ/4 Cliff2n h i 6 h i Classical Simulation Rough Intuition: Simulating quantum theory is hard because 2n States' description exponentially long: C • j i 2 Evolution governed by 2n 2n Unitary Matrices. • × Heisenberg Representation: Describe a state by its stabilizer instead::: n sj WH2n sj = ; 1 j 2 ( ) = f 2 j j i j i ≤ ≤ g 2n n S ( [a; b]j F sj = ; 1 j 2 2 2 j j i j i ≤ ≤ 1 0 Symmetry Symmetry = = • , group of =UQC = • , group of , T 0 eiπ/4 Cliff2n h i 6 h i Classical Simulation Rough Intuition: Simulating quantum theory is hard because 2n States' description exponentially long: C • j i 2 Evolution governed by 2n 2n Unitary Matrices. • × Heisenberg Representation: Describe a state by its stabilizer instead::: n sj WH2n sj = ; 1 j 2 ( ) = f 2 j j i j i ≤ ≤ g 2n n S ( [a; b]j F sj = ; 1 j 2 2 2 j j i j i ≤ ≤ Updating description after Clifford g is easy, g j i 7! j i [a; b] [a; b]Fg Upshot: 7! Large class of states & operations efficiently/poly(n) simulable 1 0 Symmetry Symmetry = • , group of =UQC = • , group of , T 0 eiπ/4 h i 6 h i Classical Simulation Rough Intuition: Simulating quantum theory is hard because 2n States' description exponentially long: C • j i 2 Evolution governed by 2n 2n Unitary Matrices. • × Heisenberg Representation: Describe a state by its stabilizer instead::: n sj WH2n sj = ; 1 j 2 ( ) = f 2 j j i j i ≤ ≤ g 2n n S ( [a; b]j F sj = ; 1 j 2 2 2 j j i j i ≤ ≤ Updating description after Clifford g is easy, g j i 7! j i [a; b] [a; b]Fg Upshot: 7! Large class of states & operations efficiently/poly(n) simulable = Cliff2n Encode 1 logical qubit in 3: α 0 + β 1 α 000 + β 111 j Li j Li j i j i . 0 0 0 0 0 0 . 0 0 0 0 1 1 2 s 3 = 2 3 j 0 0 0 1 0 1 . 6 7 6 . 7 6 0 0 0 1 1 0 7 6 7 6 7 4 5 4 5 Unitary X⊗3 exchanges 000 111 j i $ j i Has the logical effect 0 1 j Li $ j Li In general UL \Normalizer of sj in U" 2 f g We would like code s.t. UL generates U2k (Universal) h i Alas, Eastin-Knill theorem prevents this Will show how to supplement Cliff2n with additional \ T " gate 1 0 Symmetry Symmetry = • , group of =UQC = • , group of , T 0 eiπ/4 h i 6 h i Fault-Tolerant Logic Use Quantum Error-Correcting to protect a 2k-dim subspace 2n n−k C sj = ; 1 j 2 j i 2 j i j i ≤ ≤ n o Unitary X⊗3 exchanges 000 111 j i $ j i Has the logical effect 0 1 j Li $ j Li In general UL \Normalizer of sj in U" 2 f g We would like code s.t. UL generates U2k (Universal) h i Alas, Eastin-Knill theorem prevents this Will show how to supplement Cliff2n with additional \ T " gate 1 0 Symmetry Symmetry = • , group of =UQC = • , group of , T 0 eiπ/4 h i 6 h i Fault-Tolerant Logic Use Quantum Error-Correcting to protect a 2k-dim subspace 2n n−k C sj = ; 1 j 2 j i 2 j i j i ≤ ≤ n o Encode 1 logical qubit in 3: α 0 + β 1 α 000 + β 111 j Li j Li j i j i . 0 0 0 0 0 0 . 0 0 0 0 1 1 2 s 3 = 2 3 j 0 0 0 1 0 1 . 6 7 6 . 7 6 0 0 0 1 1 0 7 6 7 6 7 4 5 4 5 We would like code s.t. UL generates U2k (Universal) h i Alas, Eastin-Knill theorem prevents this Will show how to supplement Cliff2n with additional \ T " gate 1 0 Symmetry Symmetry = • , group of =UQC = • , group of , T 0 eiπ/4 h i 6 h i Fault-Tolerant Logic Use Quantum Error-Correcting to protect a 2k-dim subspace 2n n−k C sj = ; 1 j 2 j i 2 j i j i ≤ ≤ n o Encode 1 logical qubit in 3: α 0 + β 1 α 000 + β 111 j Li j Li j i j i .
Load more

Recommended publications
  • Programm 5 Layout 1
    SPONSORS Pauli Center for Theoretical Studies QAP European Project PAULI CENTER for Theoretical Studies Sandia National Laboratories The Swiss National Science Foundation Institute for Quantum Computing ETH Zurich (Computer Science and Physics Department) id Quantique Quantum Science and Technology (ETH) CQT Singapore VENUE W-LAN ETH Zürich, Rämistrasse 101, CH-8092 Zürich 1. Check available WLAN’s Main building / Hauptgebäude 2. Connect to WLAN „public“ Conference Helpline 0041 (0)79 770 84 29 3. Open browser 4.Login at welcome page with Login: qip2010 Password: 2010qipconf Main entrance FLOOR E Registration/Information desk Poster session Computer room E 26.3 Main entrance Registration desk Information Computer room E 26.3 Poster session 1 FLOOR E. 0 Poster session FLOOR F Auditorium F 5: Tutorial (January 15 – 17, 2010) Auditorium maximum F 30: Scientific programme (January 18 – 22, 2010) F 33.1: Congress-Office, F 33.2: Cloak room Foyer and “Uhrenhalle”: Coffee breaks, Poster session Auditorium Maximum F 30 Scientific programmme January 18 – 22, 2010 F 33.1: Congress-Office Foyer: F 33.2 Cloak room Coffee breaks Poster session Auditorium F 5 Tutorial January 15 – 17, 2010 Uhrenhalle: Coffee breaks 2 RUMP SESSION StuZ, ETH Zürich, Universitätsstrasse 6, CH-8092 Zürich CAB Building room No. CAB F21 to CAB F27 18.30 – 23.00 h (January 20, 2010) Entry ETH CAB Building ETH Main Building 3 CONFERENCE DINNER Thursday, January 21, 2010, 19.00h Restaurant Lake Side Bellerivestrasse 170 CH-8008 Zürich Phone: +41 (0) 44 385 86 00 Directions from ETH main building • (Tram No. 9 to “Bellevue” (direction “Triemli”).
    [Show full text]
  • Using Graph States for Quantum Computation and Communication
    Using Graph States for Quantum Computation and Communication Thesis by Kovid Goyal In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2009 (Submitted May 27, 2009) ii c 2009 Kovid Goyal All Rights Reserved iii To Dr. Ajay Patwardhan, for inspiring a whole generation of physicists. iv Acknowledgements I would like to start by acknowledging my thesis adviser, John Preskill, for giving me the freedom to pursue my interests and for setting a very high standard for me to aspire to. John has also provided the direction I needed at critical points in my career. I would like to thank Robert Raussendorf for sharing a lot of his ideas with me and patiently explaining them when needed. Most of the great ideas in Chapter 2 were orig- inated by him. Robert has been a mentor and a guide. I would like to thank Jim Harrington for introducing me to the numerical techniques needed for the analysis of the measurement based quantum computer and for writing relatively clear and easy to follow code. I would like to thank Austin Fowler for asking me a lot of questions and thereby greatly improving the clarity and depth of my understanding. Austin also inspired me to make this work as clear and easy to follow as possible. The magic state distillation circuit diagrams and the CNOT gate construction in Chapter 2 are his. I would like to thank Ben Toner, Panos Aliferis, Greg Ver Steeg and Prabha Mandayam Dodamanne for many stimulating discussions. I would like to thank my parents, Ashima and Niraj, for supporting my desire to be- come a physicist and for providing me with a stimulating and enjoyable childhood.
    [Show full text]
  • Booklet of Abstracts
    Booklet of abstracts Thomas Vidick California Institute of Technology Tsirelson's problem and MIP*=RE Boris Tsirelson in 1993 implicitly posed "Tsirelson's Problem", a question about the possible equivalence between two different ways of modeling locality, and hence entanglement, in quantum mechanics. Tsirelson's Problem gained prominence through work of Fritz, Navascues et al., and Ozawa a decade ago that establishes its equivalence to the famous "Connes' Embedding Problem" in the theory of von Neumann algebras. Recently we gave a negative answer to Tsirelson's Problem and Connes' Embedding Problem by proving a seemingly stronger result in quantum complexity theory. This result is summarized in the equation MIP* = RE between two complexity classes. In the talk I will present and motivate Tsirelson's problem, and outline its connection to Connes' Embedding Problem. I will then explain the connection to quantum complexity theory and show how ideas developed in the past two decades in the study of classical and quantum interactive proof systems led to the characterization (which I will explain) MIP* = RE and the negative resolution of Tsirelson's Problem. Based on joint work with Ji, Natarajan, Wright and Yuen available at arXiv:2001.04383. Joonho Lee, Dominic Berry, Craig Gidney, William Huggins, Jarrod McClean, Nathan Wiebe and Ryan Babbush Columbia University | Macquarie University | Google | Google Research | Google | University of Washington | Google Efficient quantum computation of chemistry through tensor hypercontraction We show how to achieve the highest efficiency yet for simulations with arbitrary basis sets by using a representation of the Coulomb operator known as tensor hypercontraction (THC). We use THC to express the Coulomb operator in a non-orthogonal basis, which we are able to block encode by separately rotating each term with angles that are obtained via QROM.
    [Show full text]
  • Memory Cost of Quantum Contextuality
    Master of Science Thesis in Physics Department of Electrical Engineering, Linköping University, 2016 Memory Cost of Quantum Contextuality Patrik Harrysson Master of Science Thesis in Physics Memory Cost of Quantum Contextuality Patrik Harrysson LiTH-ISY-EX--16/4967--SE Supervisor: Jan-Åke Larsson isy, Linköpings universitet Examiner: Jan-Åke Larsson isy, Linköpings universitet Division of Information Coding Department of Electrical Engineering Linköping University SE-581 83 Linköping, Sweden Copyright © 2016 Patrik Harrysson Abstract This is a study taking an information theoretic approach toward quantum contex- tuality. The approach is that of using the memory complexity of finite-state ma- chines to quantify quantum contextuality. These machines simulate the outcome behaviour of sequential measurements on systems of quantum bits as predicted by quantum mechanics. Of interest is the question of whether or not classical representations by finite-state machines are able to effectively represent the state- independent contextual outcome behaviour. Here we consider spatial efficiency, rather than temporal efficiency as considered by D. Gottesmana, for the partic- ular measurement dynamics in systems of quantum bits. Extensions of cases found in the adjacent study of Kleinmann et al.b are established by which upper bounds on memory complexity for particular scenarios are found. Furthermore, an optimal machine structure for simulating any n-partite system of quantum bits is found, by which a lower bound for the memory complexity is found for each n N. Within this finite-state machine approach questions of foundational concerns2 on quantum mechanics were sought to be addressed. Alas, nothing of novel thought on such concerns is here reported on.
    [Show full text]
  • 1 Objectives of the Workshop 2 Open Problem Discussion
    Final Report: BIRS Workshop 16w5029 Quantum Computer Science April 17–22, 2016 Co-organizers: Michele Mosca, Martin Roetteler, and Peter Selinger 1 Objectives of the workshop Shor’s famous quantum algorithms for integer factoring and to compute discrete logarithms helped to kick-start the field of quantum computing. A topic that has received significantly less attention is that of actually translating quantum algorithms into elementary instructions that can then be carried out on a future large-scale quantum computer. This leads to questions about automation of the translation process, a question that gives rise to several challenges that arise naturally from there, for instance: how to program a quantum computer? How to model the underlying instructions? How to compile and optimize code that has been written in a high level of abstraction? This interdisciplinary workshop aimed at making progress on these questions and brought to- gether over 40 researchers from a diverse set of research communities: those working in quan- tum computing, and those working on the mathematical foundations of programming languages and their implementations. We anticipate a vibrant exchange of novel ideas, to tackle important problems such as the optimization of large-scale quantum algorithms, and their synthesis into the instruction set of a fault-tolerant quantum computer. On the first day there was a very lively open problems debate, a summary of which is provided in this report. The problems ranged from big challenges that likely will remain open for some time, to concrete problems, some of which were tackled during the workshop. Besides the open problem discussion and a plethora of talks on recent topics of interests, salient features of the workshop were various software demo sessions in which some of the participants performed live demos of their software programs, and two tutorials about quantum programming languages.
    [Show full text]
  • Lecture 8 Measurement-Based Quantum Computing
    Introduction to quantum computation and simulability Ernesto F. Galvão Instituto de Física, Universidade Federal Fluminense (Niterói, Brazil) 1−ε 0 + ε 1 q = ε p 0 p 0 U ! 0 ICTP-SAIFR – IFT/UNESP , October 15th-19th, 2018 Introduction to quantum computation and simulability Lecture 8 : Measurement-based QC (MBQC) II Outline: • Applications of MBQC: • models for quantum spacetime • blind quantum computation • Time-ordering in MBQC • MBQC without adaptativity: • Clifford circuits • IQP circuits • Introduction to quantum contextuality • Contextuality as a computational resource • in magic state distillation • in MBQC • For slides and links to related material, see Application: blind quantum computation • Classical/quantum separation in MBQC allow for implementation of novel protocols – such as blind quantum computation • Here, client has limited quantum capabilities, and uses a server to do computation for her. • Blind = server doesn’t know what’s being computed. Broadbent, Fitzsimons, Kashefi, axiv:0807.4154 [quant-ph] Application: model for quantum spacetime • MBQC can serve as a discrete toy model for quantum spacetime: quantum space-time MBQC quantum substrate graph states events measurements principle establishing global determinism requirement space-time structure for computations [Raussendorf et al., arxiv:1108.5774] • Even closed timelike curves (= time travel) have analogues in MBQC! [Dias da Silva, Kashefi, Galvão PRA 83, 012316 (2011)] Time-ordering in MBQC from: Proc. Int. School of Physics "Enrico Fermi" on "Quantum Computers,
    [Show full text]
  • A Practical Phase Gate for Producing Bell Violations in Majorana Wires
    PHYSICAL REVIEW X 6, 021005 (2016) A Practical Phase Gate for Producing Bell Violations in Majorana Wires David J. Clarke, Jay D. Sau, and Sankar Das Sarma Department of Physics, Condensed Matter Theory Center, University of Maryland, College Park, Maryland 20742, USA and Joint Quantum Institute, University of Maryland, College Park, Maryland 20742, USA (Received 9 October 2015; published 8 April 2016) Carrying out fault-tolerant topological quantum computation using non-Abelian anyons (e.g., Majorana zero modes) is currently an important goal of worldwide experimental efforts. However, the Gottesman- Knill theorem [1] holds that if a system can only perform a certain subset of available quantum operations (i.e., operations from the Clifford group) in addition to the preparation and detection of qubit states in the computational basis, then that system is insufficient for universal quantum computation. Indeed, any measurement results in such a system could be reproduced within a local hidden variable theory, so there is no need for a quantum-mechanical explanation and therefore no possibility of quantum speedup [2]. Unfortunately, Clifford operations are precisely the ones available through braiding and measurement in systems supporting non-Abelian Majorana zero modes, which are otherwise an excellent candidate for topologically protected quantum computation. In order to move beyond the classically simulable subspace, an additional phase gate is required. This phase gate allows the system to violate the Bell-like Clauser- Horne-Shimony-Holt (CHSH) inequality that would constrain a local hidden variable theory. In this article, we introduce a new type of phase gate for the already-existing semiconductor-based Majorana wire systems and demonstrate how this phase gate may be benchmarked using CHSH measurements.
    [Show full text]
  • Limitations on Transversal Computation Through Quantum
    Limitations on Transversal Computation through Quantum Homomorphic Encryption Michael Newman1 and Yaoyun Shi2 1Department of Mathematics 2Department of Electrical Engineering and Computer Science University of Michigan, Ann Arbor, MI 48109, USA [email protected], [email protected] Abstract Transversality is a simple and effective method for implementing quantum computation fault- tolerantly. However, no quantum error-correcting code (QECC) can transversally implement a quantum universal gate set (Eastin and Knill, Phys. Rev. Lett., 102, 110502). Since reversible classical computation is often a dominating part of useful quantum computation, whether or not it can be implemented transversally is an important open problem. We show that, other than a small set of non-additive codes that we cannot rule out, no binary QECC can transversally implement a classical reversible universal gate set. In particular, no such QECC can implement the Toffoli gate transversally. We prove our result by constructing an information theoretically secure (but inefficient) quan- tum homomorphic encryption (ITS-QHE) scheme inspired by Ouyang et al. (arXiv:1508.00938). Homomorphic encryption allows the implementation of certain functions directly on encrypted data, i.e. homomorphically. Our scheme builds on almost any QECC, and implements that code’s transversal gate set homomorphically. We observe a restriction imposed by Nayak’s bound (FOCS 1999) on ITS-QHE, implying that any ITS quantum fully homomorphic scheme (ITS-QFHE) implementing the full set of classical reversible functions must be highly ineffi- cient. While our scheme incurs exponential overhead, any such QECC implementing Toffoli transversally would still violate this lower bound through our scheme. arXiv:1704.07798v3 [quant-ph] 13 Aug 2017 1 Introduction 1.1 Restrictions on transversal gates Transversal gates are surprisingly ubiquitous objects, finding applications in quantum cryptography [29], [25], quantum complexity theory [11], and of course quantum fault-tolerance.
    [Show full text]
  • Keisuke Fujii Photon Science Center, the University of Tokyo /PRESTO, JST 2017.1.16-20 QIP2017 Seattle, USA
    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 theorem for quantum supremacy arXiv:1610.03632 (ascendancy) Keisuke Fujii Photon Science Center, The University of Tokyo /PRESTO, JST Outline • Motivations • Hardness proof by postselection • Threshold theorem for quantum supremacy • Applications: 3D topological cluster computation & 2D surface code • Summary Quantum supremacy with near-term quantum devices “QUANTUM COMPUTING AND THE ENTANGLEMENT FRONTIER” by J Preskill The 25th Solvay Conference on Physics 19-22 October 2011; arXiv:1203.5813 How can we best achieve quantum supremacy with the relatively small systems that may be experimentally accessible fairly soon, systems with of order 100 qubits? and Talk by S. Boixo et al https://www.technologyreview.com/s/601668/google-reports-progress-on-a-shortcut-to- quantum-supremacy/ Intermediate models for non-universal quantum computation Intermediate models for non-universal quantum computation Boson Sampling Aaronson-Arkhipov ‘13 Universal linear optics Science (2015) Linear optical quantum computation Experimental demonstrations J. B. Spring et al. Science 339, 798 (2013) M. A. Broome, Science 339, 794 (2013) M. Tillmann et al., Nature Photo. 7, 540 (2013) A. Crespi et al., Nature Photo. 7, 545 (2013) N. Spagnolo et al., Nature Photo. 8, 615 (2014) J. Carolan et al., Science 349, 711 (2015) Intermediate models for non-universal quantum computation IQP Boson Sampling Aaronson-Arkhipov ‘13 (commuting circuits) Bremner-Jozsa-Shepherd ‘11 Universal linear optics Science (2015) + | i T + | i + | i T + | i … … Linear optical quantum computation + T | i Experimental demonstrations Ising type interaction J.
    [Show full text]
  • On Graph Approaches to Contextuality and Their Role in Quantum Theory
    SPRINGER BRIEFS IN MATHEMATICS Barbara Amaral · Marcelo Terra Cunha On Graph Approaches to Contextuality and their Role in Quantum Theory 123 SpringerBriefs in Mathematics Series editors Nicola Bellomo Michele Benzi Palle Jorgensen Tatsien Li Roderick Melnik Otmar Scherzer Benjamin Steinberg Lothar Reichel Yuri Tschinkel George Yin Ping Zhang SpringerBriefs in Mathematics showcases expositions in all areas of mathematics and applied mathematics. Manuscripts presenting new results or a single new result in a classical field, new field, or an emerging topic, applications, or bridges between new results and already published works, are encouraged. The series is intended for mathematicians and applied mathematicians. More information about this series at http://www.springer.com/series/10030 SBMAC SpringerBriefs Editorial Board Carlile Lavor University of Campinas (UNICAMP) Institute of Mathematics, Statistics and Scientific Computing Department of Applied Mathematics Campinas, Brazil Luiz Mariano Carvalho Rio de Janeiro State University (UERJ) Department of Applied Mathematics Graduate Program in Mechanical Engineering Rio de Janeiro, Brazil The SBMAC SpringerBriefs series publishes relevant contributions in the fields of applied and computational mathematics, mathematics, scientific computing, and related areas. Featuring compact volumes of 50 to 125 pages, the series covers a range of content from professional to academic. The Sociedade Brasileira de Matemática Aplicada e Computacional (Brazilian Society of Computational and Applied Mathematics,
    [Show full text]
  • Non-Deterministic Semantics for Quantum States
    entropy Article Non-Deterministic Semantics for Quantum States Juan Pablo Jorge 1 and Federico Holik 2,* 1 Physics Department, University of Buenos Aires, Buenos Aires 1428, Argentina; [email protected] 2 Instituto de Física La Plata, UNLP, CONICET, Facultad de Ciencias Exactas, 1900 La Plata, Argentina * Correspondence: [email protected] Received: 16 October 2019; Accepted: 27 January 2020; Published: 28 January 2020 Abstract: In this work, we discuss the failure of the principle of truth functionality in the quantum formalism. By exploiting this failure, we import the formalism of N-matrix theory and non-deterministic semantics to the foundations of quantum mechanics. This is done by describing quantum states as particular valuations associated with infinite non-deterministic truth tables. This allows us to introduce a natural interpretation of quantum states in terms of a non-deterministic semantics. We also provide a similar construction for arbitrary probabilistic theories based in orthomodular lattices, allowing to study post-quantum models using logical techniques. Keywords: quantum states; non-deterministic semantics; truth functionality 1. Introduction According to the principle of truth-functionality or composability (TFP), the truth-value of a complex formula is uniquely determined by the truth-values of its subformulas. It is a basic principle of logic. However, as explained in [1], many real-world situations involve dealing with information that is incomplete, vague or uncertain. This is especially true for quantum phenomena, where only probabilistic assertions about possible events can be tested in the lab. These situations pose a threat to the application of logical systems obeying the principle of truth-functionality in those problems.
    [Show full text]
  • Continuous Variable Nonloclality and Contextuality
    Continuous-variable nonlocality and contextuality Rui Soares Barbosa Tom Douce Department of Computer Science Laboratoire d’Informatique de Paris 6 University of Oxford CNRS and Sorbonne Universite´ [email protected] School of Informatics University of Edinburgh [email protected] Pierre-Emmanuel Emeriau Elham Kashefi Shane Mansfield Laboratoire d’Informatique de Paris 6 Laboratoire d’Informatique de Paris 6 Laboratoire d’Informatique de Paris 6 CNRS and Sorbonne Universite´ CNRS and Sorbonne Universite´ CNRS and Sorbonne Universite´ [email protected] School of Informatics [email protected] University of Edinburgh [email protected] Contextuality is a non-classical behaviour that can be exhibited by quantum systems. It is increas- ingly studied for its relationship to quantum-over-classical advantages in informatic tasks. To date, it has largely been studied in discrete variable scenarios, where observables take values in discrete and usually finite sets. Practically, on the other hand, continuous-variable scenarios offer some of the most promising candidates for implementing quantum computations and informatic protocols. Here we set out a framework for treating contextuality in continuous-variable scenarios. It is shown that the Fine–Abramsky–Brandenburger theorem extends to this setting, an important consequence of which is that nonlocality can be viewed as a special case of contextuality, as in the discrete case. The contextual fraction, a quantifiable measure of contextuality that bears a precise relationship to Bell inequality violations and quantum advantages, can also be defined in this setting. It is shown to be a non-increasing monotone with respect to classical operations that include binning to discretise data.
    [Show full text]