A Posttermination Ribosomal Complex Is the Guanine Nucleotide Exchange Factor for Peptide Release Factor RF3

AbstractThe mechanism by which peptide release factor RF3 recycles RF1 and RF2 has been clarified and incorporated in a complete scheme for translation termination. Free RF3 is in vivo stably bound to GDP, and ribosomes in complex with RF1 or RF2 act as guanine nucleotide exchange factors (GEF). Hydrolysis of peptidyl-tRNA by RF1 or RF2 allows GTP binding to RF3 on the ribosome. This induces an RF3 conformation with high affinity for ribosomes and leads to rapid dissociation of RF1 or RF2. Dissociation of RF3 from the ribosome requires GTP hydrolysis. Our data suggest that RF3 and its eukaryotic counterpart, eRF3, have mechanistic principles in common

Rational adversaries? evidence from randomised trials in one day cricket

In cricket, the right to make an important decision (bat first or field first) is assigned via a coin toss. These "randomised trials" allow us to examine the consistency of choices made by teams with strictly opposed preferences, and the effects of these choices upon game outcomes. Random assignment allows us to consistently aggregate across matches, ensuring that our tests have power. We find significant evidence of inconsistency, with teams often agreeing on who is to bat first. Choices are often poorly made and reduce the probability of the team winning, a surprising finding given the intense competition and learning opportunities. Keywords: interactive decision theory, zero sum situation, randomised trial, treatment effects

Projective toric designs, difference sets, and quantum state designs

Trigonometric cubature rules of degree $t$ are sets of points on the torus over which sums reproduce integrals of degree $t$ monomials over the full torus. They can be thought of as $t$-designs on the torus. Motivated by the projective structure of quantum mechanics, we develop the notion of $t$-designs on the projective torus, which, surprisingly, have a much more restricted structure than their counterparts on full tori. We provide various constructions of these projective toric designs and prove some bounds on their size and characterizations of their structure. We draw connections between projective toric designs and a diverse set of mathematical objects, including difference and Sidon sets from the field of additive combinatorics, symmetric, informationally complete positive operator valued measures (SIC-POVMs) and complete sets of mutually unbiased bases (MUBs) (which are conjectured to relate to finite projective geometry) from quantum information theory, and crystal ball sequences of certain root lattices. Using these connections, we prove bounds on the maximal size of dense $B_t \bmod m$ sets. We also use projective toric designs to construct families of quantum state designs. Finally, we discuss many open questions about the properties of these projective toric designs and how they relate to other questions in number theory, geometry, and quantum information.Comment: 11+5 pages, 1 figur

Calculation of the Aharonov-Bohm wave function

A calculation of the Aharonov-Bohm wave function is presented. The result is a series of confluent hypergeometric functions which is finite at the forward direction.Comment: 12 pages in LaTeX, and 3 PostScript figure

Page curves and typical entanglement in linear optics

Bosonic Gaussian states are a special class of quantum states in an infinite dimensional Hilbert space that are relevant to universal continuous-variable quantum computation as well as to near-term quantum sampling tasks such as Gaussian Boson Sampling. In this work, we study entanglement within a set of squeezed modes that have been evolved by a random linear optical unitary. We first derive formulas that are asymptotically exact in the number of modes for the R\'enyi-2 Page curve (the average R\'enyi-2 entropy of a subsystem of a pure bosonic Gaussian state) and the corresponding Page correction (the average information of the subsystem) in certain squeezing regimes. We then prove various results on the typicality of entanglement as measured by the R\'enyi-2 entropy by studying its variance. Using the aforementioned results for the R\'enyi-2 entropy, we upper and lower bound the von Neumann entropy Page curve and prove certain regimes of entanglement typicality as measured by the von Neumann entropy. Our main proofs make use of a symmetry property obeyed by the average and the variance of the entropy that dramatically simplifies the averaging over unitaries. In this light, we propose future research directions where this symmetry might also be exploited. We conclude by discussing potential applications of our results and their generalizations to Gaussian Boson Sampling and to illuminating the relationship between entanglement and computational complexity.Comment: 29 pages; 2 figures. Version 2: small updates to match journal versio

Complexity phase diagram for interacting and long-range bosonic Hamiltonians

Recent years have witnessed a growing interest in topics at the intersection of many-body physics and complexity theory. Many-body physics aims to understand and classify emergent behavior of systems with a large number of particles, while complexity theory aims to classify computational problems based on how the time required to solve the problem scales as the problem size becomes large. In this work, we use insights from complexity theory to classify phases in interacting many-body systems. Specifically, we demonstrate a "complexity phase diagram" for the Bose-Hubbard model with long-range hopping. This shows how the complexity of simulating time evolution varies according to various parameters appearing in the problem, such as the evolution time, the particle density, and the degree of locality. We find that classification of complexity phases is closely related to upper bounds on the spread of quantum correlations, and protocols to transfer quantum information in a controlled manner. Our work motivates future studies of complexity in many-body systems and its interplay with the associated physical phenomena

Complexity phase diagram for interacting and long-range bosonic Hamiltonians

We classify phases of a bosonic lattice model based on the computational complexity of classically simulating the system. We show that the system transitions from being classically simulable to classically hard to simulate as it evolves in time, extending previous results to include on-site number-conserving interactions and long-range hopping. Specifically, we construct a "complexity phase diagram" with "easy" and "hard" phases, and derive analytic bounds on the location of the phase boundary with respect to the evolution time and the degree of locality. We find that the location of the phase transition is intimately related to upper bounds on the spread of quantum correlations and protocols to transfer quantum information. Remarkably, although the location of the transition point is unchanged by on-site interactions, the nature of the transition point changes dramatically. Specifically, we find that there are two kinds of transitions, sharp and coarse, broadly corresponding to interacting and noninteracting bosons, respectively. Our work motivates future studies of complexity in many-body systems and its interplay with the associated physical phenomena.Comment: 15 pages, 5 figures. v2: 19 pages, 7 figure