DOCSLIB.ORG

Quantum Computation with Supplementary Information

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Computation with Supplementary Information Vol. 1 IPSJ Digital Courier Oct. 2005 Invited Paper Quantum Computation with Supplementary Information Harumichi Nishimura† The notion of advised computation was introduced by Karp and Lipton to represent non- uniform complexity in terms of Turing machines. Since then, advised computation has been one of the basic concepts of computational complexity. Recently, the research of advised computation has been originated also in the field of quantum computing. This paper reviews the study of advised quantum computation. quantum computation are not yet so many, 1. Introduction but the author believes that hereafter the the- Turing machines and Boolean circuits are ory of advised quantum computation should be used mostly as computing models to study furthermore developed from the importance of the uniform and non-uniform complexity, re- non-uniform computation in complexity theory. spectively. We can take two approaches to In this belief, this article surveys the research compare between these two computing models. of quantum computation with advice. One approach is to restrict how to construct This article is organized as follows. In Sec- Boolean circuits, which means that the fam- tion 2, we give uniform complexity classes that ilies of Boolean circuits should satisfy a uni- appear in this article. In Section 3 we introduce form condition. The other is to supplement quantum advice complexity classes and com- Turing machines with non-uniform information, pare them and their basic results with classical called advice. As the latter approach, Karp advice classes. In Section 4, we discuss the am- and Lipton 17) initiated the notion of complex- plitudes of quantum Turing machines from the ity classes with advice in 1980. Since then, the viewpoint of non-uniform quantum complexity study of advised computation has been elabo- classes. Some relation of advised computation rated to understand the power and the limit to one-way communication complexity is seen in of non-uniform computation, and the notion of Section 5. In Section 6 we consider a separation advice complexity classes has appeared in many between the two quantum complexity classes phrases of computational complexity. with polynomial classical advice and with poly- After Shor’s excellent quantum algorithm for nomial quantum advice. In Section 7 we review the factoring problem, a number of complex- quantum complexity classes with short advice. ity notions were imported from classical com- Comparisons among uniform complexity classes plexity theory to quantum computing; non- and quantum advice classes are reviewed in Sec- deterministic computation, finite automata, in- tion 8. Finally, we look at the future work with teractive proof systems, and so on. The no- several open problems. tion of advice is not an exception for this trend. 2. Uniform Complexity Classes The research of advised quantum computation was started just a few years ago. In quantum To classify the power of uniform machines, computation, we have two choices as the sup- a multiplicity of complexity classes for recog- plementary information that is given to quan- nizing sets (that is, computing Boolean func- tum Turing machines; classical advice (binary tions) have been introduced in complexity the- strings) and quantum advice (quantum states). ory. They are often called uniform complexity While classical advice is suitable to character- classes compared to complexity classes with ad- ize polynomial-size quantum circuits, quantum vice, called non-uniform complexity classes.In advice is considered to be a natural quantum what follows, let Σ = {0, 1}. Also, we assume analogue of the non-uniform measure of compu- the familiarity with basics of structural com- tation. The results obtained so far on advised plexity 13) and quantum computing 14),22). First, let us recall several classical uniform † ERATO Quantum Computation and Information complexity classes. Let P (NP, resp.) denote Project, Japan Science and Technology Agency the class of sets recognized by polynomial-time 407 408 IPSJ Digital Courier Oct. 2005 deterministic (nondeterministic, resp.) Turing ally bounded if there exists a polynomial p machines. Let BPP be the class of sets recog- such that f(n) ≤ p(n) for any n ∈ N). It nized with bounded error (say, with probability is well-known that P/poly exactly character- ≥ 2/3) by polynomial-time probabilistic Turing izes the class of sets recognized by polynomial- machines. Let PP be the class of sets recognized size Boolean circuits 17). According to Defini- with unbounded error (that is, with probability tion 3.1, we can also consider a quantum ad- > 1/2) by polynomial-time probabilistic Tur- vice class BQP/poly. However, it is not known ing machines. Let PSPACE (ESPACE, resp.) whether BQP/poly characterizes the class of be the class of sets recognized by deterministic sets recognized by polynomial-size quantum cir- Turing machines in polynomial space (in space cuits. In fact, it can be easily seen that all sets 2O(n),resp.). in BQP/poly are recognized by polynomial-size The quantum Turing machine, an analogue quantum circuits similar to the classical case of the probabilistic Turing machine, is a math- while the converse fails to show by the follow- ematical model of the quantum computer. Each ing method of the classical case: transition of a quantum Turing machine M is To simulate a polynomial-size circuit by a de- determined by a complex-valued finite transi- terministic Turing machine, the code of the cir- tion function δ as follows: if the inner state cuit is given as advice, and then the set rec- of M is p and the tape head of M scans σ, ognized by the circuit can be also recognized by then the inner state becomes q,andthetape the deterministic Turing machine in polynomial head changes σ to τ and moves to direction time. d with (probability) amplitude δ(p, σ, q, τ, d). The reason why this method fails for Let BQP 7) denote the class of sets recognized BQP/poly is that polynomial-size quantum cir- with bounded error by polynomial-time quan- cuits do not always satisfy the bounded-error tum Turing machines. (In fact, the transition condition. In addition, Definition 3.1 is not amplitudes taken by quantum Turing machines meant for extending advice strings h(n)to are restricted to a subset of complex numbers, quantum states without considering the com- as discussed in Section 4). Since quantum Tur- plexity class of quantum states. Thus, at ing machines can simulate probabilistic Turing present, the definition of the quantum com- machines, BPP is included in BQP 7).More- plexity class with advice is given based on the over, the relationships among the above uni- bounded-error quantum computer 1),24). form complexity classes are given as follows. Definition 3.2 Let f be any function from N Fact 2.1 The following relations hold 3),7),13). to N and let F be any set of functions mapping 1) P ⊆ BPP ⊆ BQP ⊆ PP ⊆ PSPACE ⊆ from N to N. ESPACE. 1. A set A is in BQP/∗f if there exist a 2) P ⊆ NP ⊆ PP. polynomial-time quantum Turing machine M and a function h from N to Σ∗ such that M 3. Quantum Advice Complexity on input (x, h(|x|)) produces A(x)withprob- Classes ∗ ability at least 2/3 for every x ∈ Σ ,where ∗ ∗ Now we introduce advice complexity classes. |h(n)| = f(n). Let BQP/ F = f∈F BQP/ f. First, we recall a general advice complexity 2. A set A is in BQP/∗Qf if there exist a class by Karp and Lipton 17), which is defined polynomial-time quantum Turing machine M based on the uniform complexity class. and a function h from N to the set of (pure) Definition 3.1 Let C be a class of sets, and quantum states such that M on input (x, h(|x|)) let f be a function from N to N.AsetA is in produces A(x) with probability at least 2/3for ∗ the Karp-Lipton advice class C/f if there exist every x ∈ Σ ,where h(n)isanf(n)-qubit state. ∗ ∗ ∗ asetB ∈Cand a function h from N to Σ Let BQP/ QF = f∈F BQP/ Qf. such that A = {x |x, h(|x|)∈B} provided Under Definition 3.2, we can exactly char- that |h(n)| = f(n) for all n ∈ N.LetC/F = acterize polynomial-size quantum circuits in f∈F C/f for any set of functions F from N to terms of the quantum advice complexity class N. BQP/∗poly . For the class P and the set poly of poly- Proposition 3.3 AsetA is in BQP/∗poly if nomially bounded functions, we obtain the most representative advice class P/poly. (A In Ref. 1), BQP/∗poly and BQP/∗Qpoly are respec- function f from N to N is called polynomi- tively denoted by BQP/poly and BQP/qpoly. Vol. 1 Quantum Computation with Supplementary Information 409 and only if A can be recognized with probabil- BQPC. According to this line, the uniform con- ity at least 2/3 by a polynomial-size quantum dition of quantum circuit families is defined as circuit family. follows 23): (i) all circuits are constructed using The class P/poly has another characteriza- elementary gates whose matrix representations tion to clarify the relationship between obtain- have polynomial-time computable components; ing non-uniform information from polynomi- and (ii) the construction of each circuit is com- ally long advices and obtaining it from ora- puted in time polynomial in the length of the in- cles. Let TALLY be the collection of subsets put. Using Yao’s simulation of quantum Turing of {0n | n ∈ N}. Then, P/poly = PTALLY . machines by quantum circuits 33),itisshown Similarly, we can see that BQP/∗poly coincides that BQP equals the class of sets recognized with BQPTALLY .
Load more

Recommended publications
  • Quantum Computer: Quantum Model and Reality
    Quantum Computer: Quantum Model and Reality Vasil Penchev, [email protected] Bulgarian Academy of Sciences: Institute of Philosophy and Sociology: Dept. of Logical Systems and Models Abstract. Any computer can create a model of reality. The hypothesis that quantum computer can generate such a model designated as quantum, which coincides with the modeled reality, is discussed. Its reasons are the theorems about the absence of “hidden variables” in quantum mechanics. The quantum modeling requires the axiom of choice. The following conclusions are deduced from the hypothesis. A quantum model unlike a classical model can coincide with reality. Reality can be interpreted as a quantum computer. The physical processes represent computations of the quantum computer. Quantum information is the real fundament of the world. The conception of quantum computer unifies physics and mathematics and thus the material and the ideal world. Quantum computer is a non-Turing machine in principle. Any quantum computing can be interpreted as an infinite classical computational process of a Turing machine. Quantum computer introduces the notion of “actually infinite computational process”. The discussed hypothesis is consistent with all quantum mechanics. The conclusions address a form of neo-Pythagoreanism: Unifying the mathematical and physical, quantum computer is situated in an intermediate domain of their mutual transformations. Key words: model, quantum computer, reality, Turing machine Eight questions: There are a few most essential questions about the philosophical interpretation of quantum computer. They refer to the fundamental problems in ontology and epistemology rather than philosophy of science or that of information and computation only. The contemporary development of quantum mechanics and the theory of quantum information generate them.
    [Show full text]
  • Restricted Versions of the Two-Local Hamiltonian Problem
    The Pennsylvania State University The Graduate School Eberly College of Science RESTRICTED VERSIONS OF THE TWO-LOCAL HAMILTONIAN PROBLEM A Dissertation in Physics by Sandeep Narayanaswami c 2013 Sandeep Narayanaswami Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy August 2013 The dissertation of Sandeep Narayanaswami was reviewed and approved* by the following: Sean Hallgren Associate Professor of Computer Science and Engineering Dissertation Adviser, Co-Chair of Committee Nitin Samarth Professor of Physics Head of the Department of Physics Co-Chair of Committee David S Weiss Professor of Physics Jason Morton Assistant Professor of Mathematics *Signatures are on file in the Graduate School. Abstract The Hamiltonian of a physical system is its energy operator and determines its dynamics. Un- derstanding the properties of the ground state is crucial to understanding the system. The Local Hamiltonian problem, being an extension of the classical Satisfiability problem, is thus a very well-motivated and natural problem, from both physics and computer science perspectives. In this dissertation, we seek to understand special cases of the Local Hamiltonian problem in terms of algorithms and computational complexity. iii Contents List of Tables vii List of Tables vii Acknowledgments ix 1 Introduction 1 2 Background 6 2.1 Classical Complexity . .6 2.2 Quantum Computation . .9 2.3 Generalizations of SAT . 11 2.3.1 The Ising model . 13 2.3.2 QMA-complete Local Hamiltonians . 13 2.3.3 Projection Hamiltonians, or Quantum k-SAT . 14 2.3.4 Commuting Local Hamiltonians . 14 2.3.5 Other special cases . 15 2.3.6 Approximation Algorithms and Heuristics .
    [Show full text]
  • STRONGLY UNIVERSAL QUANTUM TURING MACHINES and INVARIANCE of KOLMOGOROV COMPLEXITY (AUGUST 11, 2007) 2 Such That the Aforementioned Halting Conditions Are Satisfied
    STRONGLY UNIVERSAL QUANTUM TURING MACHINES AND INVARIANCE OF KOLMOGOROV COMPLEXITY (AUGUST 11, 2007) 1 Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity Markus M¨uller Abstract—We show that there exists a universal quantum Tur- For a compact presentation of the results by Bernstein ing machine (UQTM) that can simulate every other QTM until and Vazirani, see the book by Gruska [4]. Additional rele- the other QTM has halted and then halt itself with probability one. vant literature includes Ozawa and Nishimura [5], who gave This extends work by Bernstein and Vazirani who have shown that there is a UQTM that can simulate every other QTM for necessary and sufficient conditions that a QTM’s transition an arbitrary, but preassigned number of time steps. function results in unitary time evolution. Benioff [6] has As a corollary to this result, we give a rigorous proof that worked out a slightly different definition which is based on quantum Kolmogorov complexity as defined by Berthiaume et a local Hamiltonian instead of a local transition amplitude. al. is invariant, i.e. depends on the choice of the UQTM only up to an additive constant. Our proof is based on a new mathematical framework for A. Quantum Turing Machines and their Halting Conditions QTMs, including a thorough analysis of their halting behaviour. Our discussion will rely on the definition by Bernstein and We introduce the notion of mutually orthogonal halting spaces and show that the information encoded in an input qubit string Vazirani. We describe their model in detail in Subsection II-B.
    [Show full text]
  • On the Simulation of Quantum Turing Machines
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 304 (2003) 103–128 www.elsevier.com/locate/tcs On the simulation ofquantum turing machines Marco Carpentieri Universita di Salerno, 84081 Baronissi (SA), Italy Received 20 March 2002; received in revised form 11 December 2002; accepted 12 December 2002 Communicated by G. Ausiello Abstract In this article we shall review several basic deÿnitions and results regarding quantum compu- tation. In particular, after deÿning Quantum Turing Machines and networks the paper contains an exposition on continued fractions and on errors in quantum networks. The topic of simulation ofQuantum Turing Machines by means ofobvious computation is introduced. We give a full discussion ofthe simulation ofmultitape Quantum Turing Machines in a slight generalization of the class introduced by Bernstein and Vazirani. As main result we show that the Fisher-Pippenger technique can be used to give an O(tlogt) simulation ofa multi-tape Quantum Turing Machine by another belonging to the extended Bernstein and Vazirani class. This result, even ifregarding a slightly restricted class ofQuantum Turing Machines improves the simulation results currently known in the literature. c 2003 Published by Elsevier B.V. 1. Introduction Even ifthe present technology does consent realizing only very simple devices based on the principles ofquantum mechanics, many authors considered to be worth it ask- ing whether a theoretical model ofquantum computation could o:er any substantial beneÿts over the correspondent theoretical model based on the assumptions ofclas- sical physics. Recently, this question has received considerable attention because of the growing beliefthat quantum mechanical processes might be able to performcom- putation that traditional computing machines can only perform ine;ciently.
    [Show full text]
  • A Quantum Computer Foundation for the Standard Model and Superstring Theories*
    A Quantum Computer Foundation for the Standard Model and SuperString Theories* By Stephen Blaha** * Excerpted from the book Cosmos and Consciousness by Stephen Blaha (1stBooks Library, Bloomington, IN, 2000) available from amazon.com and bn.com. ** Associate of the Harvard University Physics Department. ABSTRACT 1. SuperString Theory can naturally be based on a Quantum Computer foundation. This provides a totally new view of SuperString Theory. 2. The Standard Model of elementary particles can be viewed as defining a Quantum Computer Grammar and language. 3. A Quantum Computer can be represented in part as a second-quantized Fermi field. 4. A Quantum Computer in a certain limit naturally forms a Superspace upon which Supersymmetry rotations can be defined – a Continuum Quantum Computer. 5. A representation of Quantum Computers exists that is similar to Turing Machines - a Quantum Turing Machine. As part of this development we define various types of Quantum Grammars. 6. High level Quantum Computer languages are described for the first time. New linguistic views of the most fundamental theories of Physics, the Standard Model and SuperString Theory are described. In these new linguistic representations particles become literally symbols or letters, and particle interactions become grammar rules. This view is NOT the same as the often-expressed view that Mathematics is the language of Physics. The linguistic representation is a specific new mathematical construct. We show how to create a SuperString Quantum Computer that naturally provides a framework for SuperStrings in general and heterotic SuperStrings in particular. There are also a number of new developments relating to Quantum Computers and Quantum Turing Machines that are of interest to Computer Science.
    [Show full text]
  • Quantum Computing : a Gentle Introduction / Eleanor Rieffel and Wolfgang Polak
    QUANTUM COMPUTING A Gentle Introduction Eleanor Rieffel and Wolfgang Polak The MIT Press Cambridge, Massachusetts London, England ©2011 Massachusetts Institute of Technology All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. For information about special quantity discounts, please email [email protected] This book was set in Syntax and Times Roman by Westchester Book Group. Printed and bound in the United States of America. Library of Congress Cataloging-in-Publication Data Rieffel, Eleanor, 1965– Quantum computing : a gentle introduction / Eleanor Rieffel and Wolfgang Polak. p. cm.—(Scientific and engineering computation) Includes bibliographical references and index. ISBN 978-0-262-01506-6 (hardcover : alk. paper) 1. Quantum computers. 2. Quantum theory. I. Polak, Wolfgang, 1950– II. Title. QA76.889.R54 2011 004.1—dc22 2010022682 10987654321 Contents Preface xi 1 Introduction 1 I QUANTUM BUILDING BLOCKS 7 2 Single-Qubit Quantum Systems 9 2.1 The Quantum Mechanics of Photon Polarization 9 2.1.1 A Simple Experiment 10 2.1.2 A Quantum Explanation 11 2.2 Single Quantum Bits 13 2.3 Single-Qubit Measurement 16 2.4 A Quantum Key Distribution Protocol 18 2.5 The State Space of a Single-Qubit System 21 2.5.1 Relative Phases versus Global Phases 21 2.5.2 Geometric Views of the State Space of a Single Qubit 23 2.5.3 Comments on General Quantum State Spaces
    [Show full text]
  • Computational Power of Observed Quantum Turing Machines
    Computational Power of Observed Quantum Turing Machines Simon Perdrix PPS, Universit´eParis Diderot & LFCS, University of Edinburgh New Worlds of Computation, January 2009 Quantum Computing Basics State space in a classical world of computation: countable A. inaquantumworld: Hilbertspace CA ket map . : A CA | i → s.t. x , x A is an orthonormal basis of CA {| i ∈ } Arbitrary states Φ = αx x | i x A X∈ 2 s.t. x A αx =1 ∈ | | P Quantum Computing Basics bra map . : A L(CA, C) h | → s.t. x, y A, ∀ ∈ 1 if x = y y x = “ Kronecker ” h | | i (0 otherwise v,t A, v t : CA CA: ∀ ∈ | ih | → v if t = x ( v t ) x = v ( t x )= | i “ v t t v ” | ih | | i | i h | | i (0 otherwise | ih |≈ 7→ Evolution of isolated systems: Linear map U L(CA, CA) ∈ U = ux,y y x | ih | x,y A X∈ which is an isometry (U †U = I). Observation Let Φ = αx x | i x A X∈ (Full) measurement in standard basis: 2 The probability to observe a A is αa . ∈ | | If a A is observed, the state becomes Φa = a . ∈ | i Partial measurement in standard basis: Let K = Kλ, λ Λ be a partition of A. { ∈ } 2 The probability to observe λ Λ is pλ = a Kλ αa ∈ ∈ | | If λ Λ is observed, the state becomes P ∈ 1 1 Φλ = PλΦ = αa a √pλ √pλ | i a Kλ X∈ where Pλ = a Kλ a a . ∈ | ih | P Observation Let Φ = αx x | i x A X∈ (Full) measurement in standard basis: 2 The probability to observe a A is αa .
    [Show full text]
  • Quantum Computational Complexity Theory Is to Un- Derstand the Implications of Quantum Physics to Computational Complexity Theory
    Quantum Computational Complexity John Watrous Institute for Quantum Computing and School of Computer Science University of Waterloo, Waterloo, Ontario, Canada. Article outline I. Definition of the subject and its importance II. Introduction III. The quantum circuit model IV. Polynomial-time quantum computations V. Quantum proofs VI. Quantum interactive proof systems VII. Other selected notions in quantum complexity VIII. Future directions IX. References Glossary Quantum circuit. A quantum circuit is an acyclic network of quantum gates connected by wires: the gates represent quantum operations and the wires represent the qubits on which these operations are performed. The quantum circuit model is the most commonly studied model of quantum computation. Quantum complexity class. A quantum complexity class is a collection of computational problems that are solvable by a cho- sen quantum computational model that obeys certain resource constraints. For example, BQP is the quantum complexity class of all decision problems that can be solved in polynomial time by a arXiv:0804.3401v1 [quant-ph] 21 Apr 2008 quantum computer. Quantum proof. A quantum proof is a quantum state that plays the role of a witness or certificate to a quan- tum computer that runs a verification procedure. The quantum complexity class QMA is defined by this notion: it includes all decision problems whose yes-instances are efficiently verifiable by means of quantum proofs. Quantum interactive proof system. A quantum interactive proof system is an interaction between a verifier and one or more provers, involving the processing and exchange of quantum information, whereby the provers attempt to convince the verifier of the answer to some computational problem.
    [Show full text]
  • Models of Quantum Computation and Quantum Programming Languages
    Models of quantum computation and quantum programming languages Jaros law Adam MISZCZAK Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, Ba ltycka 5, 44-100 Gliwice, Poland The goal of the presented paper is to provide an introduction to the basic computational mod- els used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counter- parts. We also provide an introduction to quantum programming languages, which are developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations. I. INTRODUCTION of existing models of quantum computation is biased towards the models interesting for the development of Computational process must be studied using the fixed quantum programming languages. Thus we neglect some model of computational device. This paper introduces models which are not directly related to this area (e.g. the basic models of computation used in quantum in- quantum automata or topological quantum computa- formation theory. We show how these models are defined tion). by extending classical models. We start by introducing some basic facts about clas- A. Quantum information theory sical and quantum Turing machines. These models help to understand how useful quantum computing can be. It can be also used to discuss the difference between Quantum information theory is a new, fascinating field quantum and classical computation. For the sake of com- of research which aims to use quantum mechanical de- pleteness we also give a brief introduction to the main res- scription of the system to perform computational tasks.
    [Show full text]
  • Quantum Information Science
    Quantum Information Science Seth Lloyd Professor of Quantum-Mechanical Engineering Director, WM Keck Center for Extreme Quantum Information Theory (xQIT) Massachusetts Institute of Technology Article Outline: Glossary I. Definition of the Subject and Its Importance II. Introduction III. Quantum Mechanics IV. Quantum Computation V. Noise and Errors VI. Quantum Communication VII. Implications and Conclusions 1 Glossary Algorithm: A systematic procedure for solving a problem, frequently implemented as a computer program. Bit: The fundamental unit of information, representing the distinction between two possi- ble states, conventionally called 0 and 1. The word ‘bit’ is also used to refer to a physical system that registers a bit of information. Boolean Algebra: The mathematics of manipulating bits using simple operations such as AND, OR, NOT, and COPY. Communication Channel: A physical system that allows information to be transmitted from one place to another. Computer: A device for processing information. A digital computer uses Boolean algebra (q.v.) to processes information in the form of bits. Cryptography: The science and technique of encoding information in a secret form. The process of encoding is called encryption, and a system for encoding and decoding is called a cipher. A key is a piece of information used for encoding or decoding. Public-key cryptography operates using a public key by which information is encrypted, and a separate private key by which the encrypted message is decoded. Decoherence: A peculiarly quantum form of noise that has no classical analog. Decoherence destroys quantum superpositions and is the most important and ubiquitous form of noise in quantum computers and quantum communication channels.
    [Show full text]
  • Quantum Logarithmic Space and Post-Selection
    Quantum Logarithmic Space and Post-selection Fran¸cois Le Gall1 Harumichi Nishimura2 Abuzer Yakaryılmaz3,4 1Graduate School of Mathematics, Nagoya University, Nagoya, Japan 2Graduate School of Informatics, Nagoya University, Nagoya, Japan 3Center for Quantum Computer Science, University of Latvia, R¯ıga, Latvia 4QWorld Association, https://qworld.net Emails: [email protected], [email protected], [email protected] Abstract Post-selection, the power of discarding all runs of a computation in which an undesirable event occurs, is an influential concept introduced to the field of quantum complexity theory by Aaronson (Proceedings of the Royal Society A, 2005). In the present paper, we initiate the study of post-selection for space-bounded quantum complexity classes. Our main result shows the identity PostBQL = PL, i.e., the class of problems that can be solved by a bounded- error (polynomial-time) logarithmic-space quantum algorithm with post-selection (PostBQL) is equal to the class of problems that can be solved by unbounded-error logarithmic-space classical algorithms (PL). This result gives a space-bounded version of the well-known result PostBQP = PP proved by Aaronson for polynomial-time quantum computation. As a by- product, we also show that PL coincides with the class of problems that can be solved by bounded-error logarithmic-space quantum algorithms that have no time bound. 1 Introduction Post-selection. Post-selection is the power of discarding all runs of a computation in which an undesirable event occurs. This concept was introduced to the field of quantum complexity theory by Aaronson [1]. While unrealistic, post-selection turned out to be an extremely useful tool to obtain new and simpler proofs of major results about classical computation, and also prove new results about quantum complexity classes.
    [Show full text]
  • Physics of Quantum Computation V
    XJ0300180 Письма в ЭЧАЯ. 2003. № 1 [116] Particles and Nuclei, Letters. 2003. No. 1[116] PHYSICS OF QUANTUM COMPUTATION V. V. Belokurov, O. A. Khrustalev, V. A. Sadovnichy, O. D. Timofeevskaya Lomonosov Moscow State University, Moscow INTRODUCTION As many other significant discoveries in physics, the invention of quantum computer was a result of the battle against thermodynamic laws. It was the middle of the 19th century when Maxwell proposed his demon — a creature with unique perceptivity able to detect every molecule and control its motion. Separating fast and slow molecules of a gas in different parts of a box, Maxwell's demon could have changed the temperature in these parts without producing any work. Thus, the intelligent machine could prevent thermal death. Later Smoluchowski proved that measuring molecular velocities and storing the informa- tion demon would increase entropy. Therefore, the perpetuum mobile of the second type could not be created. It became a common opinion that any physical measurement was irreversible. In the 1950s von Neumann applied these arguments to his computer science. He supposed that the penalty for computer operation was energy scattering with the rate of energy loss kT In 2 per one step of computation. This estimation was considered as convincing. However at the beginning of the 1960s Landauer proved that energy dissipation in computers was closely related to logical irreversibility of computation. There were no rigorous arguments for correctness of von Neumann's conclusion in the case of reversible computation. A hope ap- peared that if Maxwell's demon learned to perform reversible computations, the construction of reversible computers would become real.
    [Show full text]