Quantum Channels, Kraus Operators, Povms
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Differentiation of Operator Functions in Non-Commutative Lp-Spaces B
ARTICLE IN PRESS Journal of Functional Analysis 212 (2004) 28–75 Differentiation of operator functions in non-commutative Lp-spaces B. de Pagtera and F.A. Sukochevb,Ã a Department of Mathematics, Faculty ITS, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands b School of Informatics and Engineering, Flinders University of South Australia, Bedford Park, 5042 SA, Australia Received 14 May 2003; revised 18 September 2003; accepted 15 October 2003 Communicated by G. Pisier Abstract The principal results in this paper are concerned with the description of differentiable operator functions in the non-commutative Lp-spaces, 1ppoN; associated with semifinite von Neumann algebras. For example, it is established that if f : R-R is a Lipschitz function, then the operator function f is Gaˆ teaux differentiable in L2ðM; tÞ for any semifinite von Neumann algebra M if and only if it has a continuous derivative. Furthermore, if f : R-R has a continuous derivative which is of bounded variation, then the operator function f is Gaˆ teaux differentiable in any LpðM; tÞ; 1opoN: r 2003 Elsevier Inc. All rights reserved. 1. Introduction Given an arbitrary semifinite von Neumann algebra M on the Hilbert space H; we associate with any Borel function f : R-R; via the usual functional calculus, the corresponding operator function a/f ðaÞ having as domain the set of all (possibly unbounded) self-adjoint operators a on H which are affiliated with M: This paper is concerned with the study of the differentiability properties of such operator functions f : Let LpðM; tÞ; with 1pppN; be the non-commutative Lp-space associated with ðM; tÞ; where t is a faithful normal semifinite trace on the von f Neumann algebra M and let M be the space of all t-measurable operators affiliated ÃCorresponding author. -
1 Postulate (QM4): Quantum Measurements
Part IIC Lent term 2019-2020 QUANTUM INFORMATION & COMPUTATION Nilanjana Datta, DAMTP Cambridge 1 Postulate (QM4): Quantum measurements An isolated (closed) quantum system has a unitary evolution. However, when an exper- iment is done to find out the properties of the system, there is an interaction between the system and the experimentalists and their equipment (i.e., the external physical world). So the system is no longer closed and its evolution is not necessarily unitary. The following postulate provides a means of describing the effects of a measurement on a quantum-mechanical system. In classical physics the state of any given physical system can always in principle be fully determined by suitable measurements on a single copy of the system, while leaving the original state intact. In quantum theory the corresponding situation is bizarrely different { quantum measurements generally have only probabilistic outcomes, they are \invasive", generally unavoidably corrupting the input state, and they reveal only a rather small amount of information about the (now irrevocably corrupted) input state identity. Furthermore the (probabilistic) change of state in a quantum measurement is (unlike normal time evolution) not a unitary process. Here we outline the associated mathematical formalism, which is at least, easy to apply. (QM4) Quantum measurements and the Born rule In Quantum Me- chanics one measures an observable, i.e. a self-adjoint operator. Let A be an observable acting on the state space V of a quantum system Since A is self-adjoint, its eigenvalues P are real. Let its spectral projection be given by A = n anPn, where fang denote the set of eigenvalues of A and Pn denotes the orthogonal projection onto the subspace of V spanned by eigenvectors of A corresponding to the eigenvalue Pn. -
Quantum Circuits with Mixed States Is Polynomially Equivalent in Computational Power to the Standard Unitary Model
Quantum Circuits with Mixed States Dorit Aharonov∗ Alexei Kitaev† Noam Nisan‡ February 1, 2008 Abstract Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally with several central issues: measurements in the middle of the computation; decoherence and noise, using probabilistic subroutines, and more. It turns out, that the restriction to unitary gates and pure states is unnecessary. In this paper we generalize the formal model of quantum circuits to a model in which the state can be a general quantum state, namely a mixed state, or a “density matrix”, and the gates can be general quantum operations, not necessarily unitary. The new model is shown to be equivalent in computational power to the standard one, and the problems mentioned above essentially disappear. The main result in this paper is a solution for the subroutine problem. The general function that a quantum circuit outputs is a probabilistic function. However, the question of using probabilistic functions as subroutines was not previously dealt with, the reason being that in the language of pure states, this simply can not be done. We define a natural notion of using general subroutines, and show that using general subroutines does not strengthen the model. As an example of the advantages of analyzing quantum complexity using density ma- trices, we prove a simple lower bound on depth of circuits that compute probabilistic func- arXiv:quant-ph/9806029v1 8 Jun 1998 tions. Finally, we deal with the question of inaccurate quantum computation with mixed states. -
Pilot Quantum Error Correction for Global
Pilot Quantum Error Correction for Global- Scale Quantum Communications Laszlo Gyongyosi*1,2, Member, IEEE, Sandor Imre1, Member, IEEE 1Quantum Technologies Laboratory, Department of Telecommunications Budapest University of Technology and Economics 2 Magyar tudosok krt, H-1111, Budapest, Hungary 2Information Systems Research Group, Mathematics and Natural Sciences Hungarian Academy of Sciences H-1518, Budapest, Hungary *[email protected] Real global-scale quantum communications and quantum key distribution systems cannot be implemented by the current fiber and free-space links. These links have high attenuation, low polarization-preserving capability or extreme sensitivity to the environment. A potential solution to the problem is the space-earth quantum channels. These channels have no absorption since the signal states are propagated in empty space, however a small fraction of these channels is in the atmosphere, which causes slight depolarizing effect. Furthermore, the relative motion of the ground station and the satellite causes a rotation in the polarization of the quantum states. In the current approaches to compensate for these types of polarization errors, high computational costs and extra physical apparatuses are required. Here we introduce a novel approach which breaks with the traditional views of currently developed quantum-error correction schemes. The proposed solution can be applied to fix the polarization errors which are critical in space-earth quantum communication systems. The channel coding scheme provides capacity-achieving communication over slightly depolarizing space-earth channels. I. Introduction Quantum error-correction schemes use different techniques to correct the various possible errors which occur in a quantum channel. In the first decade of the 21st century, many revolutionary properties of quantum channels were discovered [12-16], [19-22] however the efficient error- correction in quantum systems is still a challenge. -
A Mini-Introduction to Information Theory
A Mini-Introduction To Information Theory Edward Witten School of Natural Sciences, Institute for Advanced Study Einstein Drive, Princeton, NJ 08540 USA Abstract This article consists of a very short introduction to classical and quantum information theory. Basic properties of the classical Shannon entropy and the quantum von Neumann entropy are described, along with related concepts such as classical and quantum relative entropy, conditional entropy, and mutual information. A few more detailed topics are considered in the quantum case. arXiv:1805.11965v5 [hep-th] 4 Oct 2019 Contents 1 Introduction 2 2 Classical Information Theory 2 2.1 ShannonEntropy ................................... .... 2 2.2 ConditionalEntropy ................................. .... 4 2.3 RelativeEntropy .................................... ... 6 2.4 Monotonicity of Relative Entropy . ...... 7 3 Quantum Information Theory: Basic Ingredients 10 3.1 DensityMatrices .................................... ... 10 3.2 QuantumEntropy................................... .... 14 3.3 Concavity ......................................... .. 16 3.4 Conditional and Relative Quantum Entropy . ....... 17 3.5 Monotonicity of Relative Entropy . ...... 20 3.6 GeneralizedMeasurements . ...... 22 3.7 QuantumChannels ................................... ... 24 3.8 Thermodynamics And Quantum Channels . ...... 26 4 More On Quantum Information Theory 27 4.1 Quantum Teleportation and Conditional Entropy . ......... 28 4.2 Quantum Relative Entropy And Hypothesis Testing . ......... 32 4.3 Encoding -
Introduction to Operator Spaces
Lecture 1: Introduction to Operator Spaces Zhong-Jin Ruan at Leeds, Monday, 17 May , 2010 1 Operator Spaces A Natural Quantization of Banach Spaces 2 Banach Spaces A Banach space is a complete normed space (V/C, k · k). In Banach spaces, we consider Norms and Bounded Linear Maps. Classical Examples: ∗ C0(Ω),M(Ω) = C0(Ω) , `p(I),Lp(X, µ), 1 ≤ p ≤ ∞. 3 Hahn-Banach Theorem: Let V ⊆ W be Banach spaces. We have W ↑ & ϕ˜ ϕ V −−−→ C with kϕ˜k = kϕk. It follows from the Hahn-Banach theorem that for every Banach space (V, k · k) we can obtain an isometric inclusion (V, k · k) ,→ (`∞(I), k · k∞) ∗ ∗ where we may choose I = V1 to be the closed unit ball of V . So we can regard `∞(I) as the home space of Banach spaces. 4 Classical Theory Noncommutative Theory `∞(I) B(H) Banach Spaces Operator Spaces (V, k · k) ,→ `∞(I)(V, ??) ,→ B(H) norm closed subspaces of B(H)? 5 Matrix Norm and Concrete Operator Spaces [Arveson 1969] Let B(H) denote the space of all bounded linear operators on H. For each n ∈ N, n H = H ⊕ · · · ⊕ H = {[ξj]: ξj ∈ H} is again a Hilbert space. We may identify ∼ Mn(B(H)) = B(H ⊕ ... ⊕ H) by letting h i h i X Tij ξj = Ti,jξj , j and thus obtain an operator norm k · kn on Mn(B(H)). A concrete operator space is norm closed subspace V of B(H) together with the canonical operator matrix norm k · kn on each matrix space Mn(V ). -
Quantum Information Theory
Lecture Notes Quantum Information Theory Renato Renner with contributions by Matthias Christandl February 6, 2013 Contents 1 Introduction 5 2 Probability Theory 6 2.1 What is probability? . .6 2.2 Definition of probability spaces and random variables . .7 2.2.1 Probability space . .7 2.2.2 Random variables . .7 2.2.3 Notation for events . .8 2.2.4 Conditioning on events . .8 2.3 Probability theory with discrete random variables . .9 2.3.1 Discrete random variables . .9 2.3.2 Marginals and conditional distributions . .9 2.3.3 Special distributions . 10 2.3.4 Independence and Markov chains . 10 2.3.5 Functions of random variables, expectation values, and Jensen's in- equality . 10 2.3.6 Trace distance . 11 2.3.7 I.i.d. distributions and the law of large numbers . 12 2.3.8 Channels . 13 3 Information Theory 15 3.1 Quantifying information . 15 3.1.1 Approaches to define information and entropy . 15 3.1.2 Entropy of events . 16 3.1.3 Entropy of random variables . 17 3.1.4 Conditional entropy . 18 3.1.5 Mutual information . 19 3.1.6 Smooth min- and max- entropies . 20 3.1.7 Shannon entropy as a special case of min- and max-entropy . 20 3.2 An example application: channel coding . 21 3.2.1 Definition of the problem . 21 3.2.2 The general channel coding theorem . 21 3.2.3 Channel coding for i.i.d. channels . 24 3.2.4 The converse . 24 2 4 Quantum States and Operations 26 4.1 Preliminaries . -
Models of Quantum Complexity Growth
Models of quantum complexity growth Fernando G.S.L. Brand~ao,a;b;c;d Wissam Chemissany,b Nicholas Hunter-Jones,* e;b Richard Kueng,* b;c John Preskillb;c;d aAmazon Web Services, AWS Center for Quantum Computing, Pasadena, CA bInstitute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA 91125 cDepartment of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA 91125 dWalter Burke Institute for Theoretical Physics, California Institute of Technology, Pasadena, CA 91125 ePerimeter Institute for Theoretical Physics, Waterloo, ON N2L 2Y5 *Corresponding authors: [email protected] and [email protected] Abstract: The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the size of the shortest quantum computation that executes the unitary or prepares the state. It is reasonable to expect that the complexity of a quantum state governed by a chaotic many- body Hamiltonian grows linearly with time for a time that is exponential in the system size; however, because it is hard to rule out a short-cut that improves the efficiency of a computation, it is notoriously difficult to derive lower bounds on quantum complexity for particular unitaries or states without making additional assumptions. To go further, one may study more generic models of complexity growth. We provide a rigorous connection between complexity growth and unitary k-designs, ensembles which capture the randomness of the unitary group. This connection allows us to leverage existing results about design growth to draw conclusions about the growth of complexity. -
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. -
Lecture 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 Shannon theory. It is a fundamentally \quantum" theorem in that it demonstrates that a fundamentally quantum information quantity, the coherent information, is an achievable rate for quantum com- munication over a quantum channel. The fact that the coherent information does not have a strong analog in classical Shannon theory truly separates the quantum and classical theories of information. The no-cloning theorem provides the intuition behind quantum error correction. The goal of any quantum communication protocol is for Alice to establish quantum correlations with the receiver Bob. We know well now that every quantum channel has an isometric extension, so that we can think of another receiver, the environment Eve, who is at a second output port of a larger unitary evolution. Were Eve able to learn anything about the quantum information that Alice is attempting to transmit to Bob, then Bob could not be retrieving this information|otherwise, they would violate the no-cloning theorem. Thus, Alice should figure out some subspace of the channel input where she can place her quantum information such that only Bob has access to it, while Eve does not. That the dimensionality of this subspace is exponential in the coherent information is perhaps then unsurprising in light of the above no-cloning reasoning. The coherent information is an entropy difference H(B) − H(E)|a measure of the amount of quantum correlations that Alice can establish with Bob less the amount that Eve can gain. -
Spectral Properties of the Koopman Operator in the Analysis of Nonstationary Dynamical Systems
UNIVERSITY of CALIFORNIA Santa Barbara Spectral Properties of the Koopman Operator in the Analysis of Nonstationary Dynamical Systems A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mechanical Engineering by Ryan M. Mohr Committee in charge: Professor Igor Mezi´c,Chair Professor Bassam Bamieh Professor Jeffrey Moehlis Professor Mihai Putinar June 2014 The dissertation of Ryan M. Mohr is approved: Bassam Bamieh Jeffrey Moehlis Mihai Putinar Igor Mezi´c,Committee Chair May 2014 Spectral Properties of the Koopman Operator in the Analysis of Nonstationary Dynamical Systems Copyright c 2014 by Ryan M. Mohr iii To my family and dear friends iv Acknowledgements Above all, I would like to thank my family, my parents Beth and Jim, and brothers Brennan and Gralan. Without their support, encouragement, confidence and love, I would not be the person I am today. I am also grateful to my advisor, Professor Igor Mezi´c,who introduced and guided me through the field of dynamical systems and encouraged my mathematical pursuits, even when I fell down the (many) proverbial (mathematical) rabbit holes. I learned many fascinating things from these wandering forays on a wide range of topics, both contributing to my dissertation and not. Our many interesting discussions on math- ematics, research, and philosophy are among the highlights of my graduate school career. His confidence in my abilities and research has been a constant source of encouragement, especially when I felt uncertain in them myself. His enthusiasm for science and deep, meaningful work has set the tone for the rest of my career and taught me the level of research problems I should consider and the quality I should strive for. -
Quantum Zeno Dynamics from General Quantum Operations
Quantum Zeno Dynamics from General Quantum Operations Daniel Burgarth1, Paolo Facchi2,3, Hiromichi Nakazato4, Saverio Pascazio2,3, and Kazuya Yuasa4 1Center for Engineered Quantum Systems, Dept. of Physics & Astronomy, Macquarie University, 2109 NSW, Australia 2Dipartimento di Fisica and MECENAS, Università di Bari, I-70126 Bari, Italy 3INFN, Sezione di Bari, I-70126 Bari, Italy 4Department of Physics, Waseda University, Tokyo 169-8555, Japan June 30, 2020 We consider the evolution of an arbitrary quantum dynamical semigroup of a finite-dimensional quantum system under frequent kicks, where each kick is a generic quantum operation. We develop a generalization of the Baker- Campbell-Hausdorff formula allowing to reformulate such pulsed dynamics as a continuous one. This reveals an adiabatic evolution. We obtain a general type of quantum Zeno dynamics, which unifies all known manifestations in the literature as well as describing new types. 1 Introduction Physics is a science that is often based on approximations. From high-energy physics to the quantum world, from relativity to thermodynamics, approximations not only help us to solve equations of motion, but also to reduce the model complexity and focus on im- portant effects. Among the largest success stories of such approximations are the effective generators of dynamics (Hamiltonians, Lindbladians), which can be derived in quantum mechanics and condensed-matter physics. The key element in the techniques employed for their derivation is the separation of different time scales or energy scales. Recently, in quantum technology, a more active approach to condensed-matter physics and quantum mechanics has been taken. Generators of dynamics are reversely engineered by tuning system parameters and device design.