scholarly journals Yuri Manin on Biomolecules as Quantum Computers

2021 ◽  
Vol 2021 (02) ◽  
pp. 0205
Author(s):  
Terry Bollinger
Keyword(s):  
Quantum Computing ◽  
Biological Molecules ◽  
Product Decomposition ◽  
Quantum Automata ◽  
Von Neumann ◽  
Finite Dimensional ◽  
Naturally Occurring ◽  
Neumann Model ◽  
Initial Focus ◽  
Finite Dimensional Hilbert Space

In 1980, Russian mathematician Yuri Manin published Computable and Uncomputable. On pages 14 and 15 of his introduction, Manin suggests that “Molecular biology furnishes examples of the behavior of natural (not engineered by humans) systems which we have to describe in terms initially devised for discrete automata.” Manin then describes the remarkable energy efficiency of naturally occurring biomolecular processes such as DNA replication. He proposes modeling such behaviors in terms of unitary rotations in a finite-dimensional Hilbert space. The decomposition of such systems then corresponds to the tensor product decomposition of the state space, that is, to quantum entanglement. Manin’s initial focus on biological molecules as examples of highly energy-efficient quantum automata is unique among quantum computing’s founding figures since both he and other early leaders quickly moved to the then-new and exciting concept of von Neumann automata. The von Neumann formalism reinterpreted molecular quantum computing in terms of qubits, which made it possible to imagine the power of quantum computing as not much more than a superposition of virtual binary computers. This paper provides the original excerpt of Manin’s molecular computing argument. A useful analytical feature of Manin’s pre-von-Neumann model of quantum computation is its openness to new formalisms that avoid accidentally making classical physics dominant over the quantum world by expressing quantum states only in terms of concepts such as automata that assume extreme classical precision and complexity.

scholarly journals Essential Commutants of Semicrossed Products

2015 ◽  
Vol 58 (1) ◽  
pp. 91-104 ◽  
Author(s):  
Kei Hasegawa
Keyword(s):  
Hilbert Space ◽  
Toeplitz Operators ◽  
Von Neumann Algebra ◽  
Compact Operators ◽  
Von Neumann ◽  
Finite Dimensional ◽  
Famous Result ◽  
Essential Commutant ◽  
Countable Abelian Group ◽  
Finite Dimensional Hilbert Space

AbstractLet α: G ↷ M be a spatial action of a countable abelian group on a “spatial” von Neumann algebra M and let S be its unital subsemigroup with G = S-1S. We explicitly compute the essential commutant and the essential fixed-points, modulo the Schatten p-class or the compact operators, of the w*-semicrossed product of M by S when M' contains no non-zero compact operators. We also prove a weaker result when M is a von Neumann algebra on a finite dimensional Hilbert space and (G, S) = (ℤ, ℤ+), which extends a famous result due to Davidson (1977) for the classical analytic Toeplitz operators.

scholarly journals Quantum logic as motivated by quantum computing

2005 ◽  
Vol 70 (2) ◽  
pp. 353-359 ◽  
Author(s):  
J. Michael Dunn ◽  
Tobias J. Hagge ◽  
Lawrence S. Moss ◽  
Zhenghan Wang
Keyword(s):  
Hilbert Space ◽  
Quantum Mechanics ◽  
Quantum Computing ◽  
Computer Science ◽  
Quantum Logic ◽  
Theoretical Computer Science ◽  
Von Neumann ◽  
Infinite Dimensional ◽  
Finite Dimensional ◽  
Definition Of

§1. Introduction. Our understanding of Nature comes in layers, so should the development of logic. Classic logic is an indispensable part of our knowledge, and its interactions with computer science have recently dramatically changed our life. A new layer of logic has been developing ever since the discovery of quantum mechanics. G. D. Birkhoff and von Neumann introduced quantum logic in a seminal paper in 1936 [1]. But the definition of quantum logic varies among authors (see [2]). How to capture the logic structure inherent in quantum mechanics is very interesting and challenging. Given the close connection between classical logic and theoretical computer science as exemplified by the coincidence of computable functions through Turing machines, recursive function theory, and λ-calculus, we are interested in how to gain some insights about quantum logic from quantum computing. In this note we make some observations about quantum logic as motivated by quantum computing (see [5]) and hope more people will explore this connection.The quantum logic as envisioned by Birkhoff and von Neumann is based on the lattice of closed subspaces of a Hilbert space, usually an infinite dimensional one. The quantum logic of a fixed Hilbert space ℍ in this note is the variety of all the true equations with finitely many variables using the connectives meet, join and negation. Quantum computing is theoretically based on quantum systems with finite dimensional Hilbert spaces, especially the states space of a qubit ℂ2. (Actually the qubit is merely a convenience.

scholarly journals Approximate Tensorization of the Relative Entropy for Noncommuting Conditional Expectations

2021 ◽  
Author(s):  
Ivan Bardet ◽  
Ángela Capel ◽  
Cambyse Rouzé
Keyword(s):  
Relative Entropy ◽  
Von Neumann Algebras ◽  
Logarithmic Sobolev Inequality ◽  
Spin Systems ◽  
Von Neumann ◽  
Strong Subadditivity ◽  
Finite Dimensional ◽  
Lattice Spin ◽  
Lattice Spin Systems ◽  
Conditional Expectations

AbstractIn this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. This generalisation, referred to as approximate tensorization of the relative entropy, consists in a lower bound for the sum of relative entropies between a given density and its respective projections onto two intersecting von Neumann algebras in terms of the relative entropy between the same density and its projection onto an algebra in the intersection, up to multiplicative and additive constants. In particular, our inequality reduces to the so-called quasi-factorization of the entropy for commuting algebras, which is a key step in modern proofs of the logarithmic Sobolev inequality for classical lattice spin systems. We also provide estimates on the constants in terms of conditions of clustering of correlations in the setting of quantum lattice spin systems. Along the way, we show the equivalence between conditional expectations arising from Petz recovery maps and those of general Davies semigroups.

Ergodic actions of group extensions on von Neumann algebras

1989 ◽  
Vol 112 (1-2) ◽  
pp. 71-112
Author(s):  
Klaus Thomsen
Keyword(s):  
Fixed Point ◽  
Von Neumann Algebras ◽  
Locally Compact Group ◽  
Locally Compact Groups ◽  
Compact Groups ◽  
Locally Compact ◽  
Von Neumann ◽  
Finite Dimensional ◽  
Fixed Point Algebra ◽  
Atomic Centre

SynopsisWe consider automorphic actions on von Neumann algebras of a locally compact group E given as a topological extension 0 → A → E → G → 0, where A is compact abelian and second countable. Motivated by the wish to describe and classify ergodic actions of E when G is finite, we classify (up to conjugacy) first the ergodic actions of locally compact groups on finite-dimensional factors and then compact abelian actions with the property that the fixed-point algebra is of type I with atomic centre. We then handle the case of ergodic actions of E with the property that the action is already ergodic when restricted to A, and then, as a generalisation, the case of (not necessarily ergodic) actions of E with the property that the restriction to A is an action with abelian atomic fixed-point algebra. Both these cases are handled for general locally compact-countable G. Finally, we combine the obtained results to classify the ergodic actions of E when G is finite, provided that either the extension is central and Hom (G, T) = 0, or G is abelian and either cyclic or of an order not divisible by a square.

The problem of measuring the quantity of output in the input–output model by W. Leontief in modeling the trends in economic reproduction of nations and regions

2021 ◽  
Vol 19 (8) ◽  
pp. 1568-1592
Author(s):  
Nikolai I. KURYSHEV
Keyword(s):  
Input Output ◽  
Von Neumann ◽  
Output Matrix ◽  
Production And Consumption ◽  
Production Quantity ◽  
Mathematical Analyses ◽  
Neumann Model ◽  
Product Output ◽  
The Relationship ◽  
Cost Characteristics

Subject. This article deals with the problem of constructing a Leontief's input–output matrix. Objectives. The article aims to determine the rules for constructing a Leontief's input–output matrix on the basis of data on production time and quantity of product output. Methods. For the study, I used the methods of logical and mathematical analyses. Results. The article formulates the rules for constructing a Leontief's input–output matrix, taking into account differences in the time of production, quantity of output, as well as the conditions for the reproduction of the resources expended. It summarizes these rules for the J. von Neumann model. Conclusions. The proposed approach to the analysis of the material mechanism of economic reproduction defines the relationship between the quantitative and cost characteristics of the production and consumption of products and resources. This relationship opens up new opportunities for the application of input–output models to create simple and accurate algorithms for identifying and predicting the macroeconomic trends.

Alternating projections and interpolation of stationary processes

1992 ◽  
Vol 29 (4) ◽  
pp. 921-931 ◽  
Author(s):  
Mohsen Pourahmadi
Keyword(s):  
Missing Values ◽  
Stationary Process ◽  
Dimensional Space ◽  
Stationary Processes ◽  
Finite Dimensional Space ◽  
Alternating Projections ◽  
Von Neumann ◽  
Finite Dimensional ◽  
Explicit Formulae ◽  
Linear Interpolator

By using the alternating projection theorem of J. von Neumann, we obtain explicit formulae for the best linear interpolator and interpolation error of missing values of a stationary process. These are expressed in terms of multistep predictors and autoregressive parameters of the process. The key idea is to approximate the future by a finite-dimensional space.

Linear Algebra and the Dirac Notation

2006 ◽  
Author(s):  
Phillip Kaye ◽  
Raymond Laflamme ◽  
Michele Mosca
Keyword(s):  
Hilbert Space ◽  
Quantum Mechanics ◽  
Quantum Computing ◽  
Linear Algebra ◽  
Hilbert Spaces ◽  
Vector Spaces ◽  
Complex Vector ◽  
Dual Vector ◽  
Finite Dimensional ◽  
Basic Facts

We assume the reader has a strong background in elementary linear algebra. In this section we familiarize the reader with the algebraic notation used in quantum mechanics, remind the reader of some basic facts about complex vector spaces, and introduce some notions that might not have been covered in an elementary linear algebra course. The linear algebra notation used in quantum computing will likely be familiar to the student of physics, but may be alien to a student of mathematics or computer science. It is the Dirac notation, which was invented by Paul Dirac and which is used often in quantum mechanics. In mathematics and physics textbooks, vectors are often distinguished from scalars by writing an arrow over the identifying symbol: e.g a⃗. Sometimes boldface is used for this purpose: e.g. a. In the Dirac notation, the symbol identifying a vector is written inside a ‘ket’, and looks like |a⟩. We denote the dual vector for a (defined later) with a ‘bra’, written as ⟨a|. Then inner products will be written as ‘bra-kets’ (e.g. ⟨a|b⟩). We now carefully review the definitions of the main algebraic objects of interest, using the Dirac notation. The vector spaces we consider will be over the complex numbers, and are finite-dimensional, which significantly simplifies the mathematics we need. Such vector spaces are members of a class of vector spaces called Hilbert spaces. Nothing substantial is gained at this point by defining rigorously what a Hilbert space is, but virtually all the quantum computing literature refers to a finite-dimensional complex vector space by the name ‘Hilbert space’, and so we will follow this convention. We will use H to denote such a space. Since H is finite-dimensional, we can choose a basis and alternatively represent vectors (kets) in this basis as finite column vectors, and represent operators with finite matrices. As you see in Section 3, the Hilbert spaces of interest for quantum computing will typically have dimension 2n, for some positive integer n. This is because, as with classical information, we will construct larger state spaces by concatenating a string of smaller systems, usually of size two.

Perturbations of AF-Algebras

1979 ◽  
Vol 31 (5) ◽  
pp. 1012-1016 ◽  
Author(s):  
John Phillips ◽  
Iain Raeburn
Keyword(s):  
Hilbert Space ◽  
Unit Ball ◽  
Von Neumann Algebra ◽  
Unitary Operator ◽  
Affirmative Answer ◽  
Positive Answer ◽  
Von Neumann ◽  
Finite Dimensional ◽  
Image Position ◽  
Af Algebras

Let A and B be C*-algebras acting on a Hilbert space H, and letwhere A1 is the unit ball in A and d(a, B1) denotes the distance of a from B1. We shall consider the following problem: if ‖A – B‖ is sufficiently small, does it follow that there is a unitary operator u such that uAu* = B?Such questions were first considered by Kadison and Kastler in [9], and have received considerable attention. In particular in the case where A is an approximately finite-dimensional (or hyperfinite) von Neumann algebra, the question has an affirmative answer (cf [3], [8], [12]). We shall show that in the case where A and B are approximately finite-dimensional C*-algebras (AF-algebras) the problem also has a positive answer.

Sign in / Sign up

Export Citation Format

Share Document