Search

Photonic integrated circuits (PICs) offer ultra-broad optical bandwidths that enable unprecedented data throughputs for signal processing applications. Dynamic reconfigurability enables compensation of fabrication flaws and fluctuating external environments, tuning for adaptive equalization and training of optical neural networks. The initial step in PIC reconfiguration entails measuring its dynamic performance, often described by its frequency response. While measuring the amplitude response is straightforward, e.g. using a tunable laser and optical power meter, measuring the phase response presents challenges due to various factors, including phase variations in test connections and instrumentation limitations. To address these challenges, a universal and robust characterization technique is proposed, which uses an on-chip reference path coupled to the signal processing core (SPC), with a delay larger or smaller than the total delay across the signal processing paths. A Fourier transform of the chip's power response reveals the SPC's impulse response. The method is more robust against low reference-path power and imprecise delays. Experiments using a finite-impulse-response (FIR) structure demonstrate rapid SPC training, overcoming thermal crosstalk and device imperfections. This approach offers a promising solution for PIC characterization, facilitating expedited physical parameter training for advanced applications in communications and optical neural networks.

Two-time expectation values of sequential measurements of dichotomic observables are known to be time symmetric for closed quantum systems. Namely, if a system evolves unitarily between sequential measurements of dichotomic observables $\mathscr{O}_{A}$ followed by $\mathscr{O}_{B}$, then it necessarily follows that $\langle\mathscr{O}_{A}\,,\mathscr{O}_{B}\rangle=\langle\mathscr{O}_{B}\,,\mathscr{O}_{A}\rangle$, where $\langle\mathscr{O}_{A}\,,\mathscr{O}_{B}\rangle$ is the two-time expectation value corresponding to the product of the measurement outcomes of $\mathscr{O}_{A}$ followed by $\mathscr{O}_{B}$, and $\langle\mathscr{O}_{B}\,,\mathscr{O}_{A}\rangle$ is the two-time expectation value associated with the time reversal of the unitary dynamics, where a measurement of $\mathscr{O}_{B}$ precedes a measurement of $\mathscr{O}_{A}$. In this work, we show that a quantum Bayes' rule implies a time symmetry for two-time expectation values associated with open quantum systems, which evolve according to a general quantum channel between measurements. Such results are in contrast with the view that processes associated with open quantum systems -- which may lose information to their environment -- are not reversible in any operational sense. We give an example of such time-symmetric correlations for the amplitude-damping channel, and we propose an experimental protocol for the potential verification of the theoretical predictions associated with our results., Comment: 17 pages, 5 figures. Comments welcome!

While quantum correlations between two spacelike-separated systems are fully encoded by the bipartite density operator associated with the joint system, we prove that there does not exist an operator representation for general quantum correlations across space and time. This is in stark contrast to the case of classical random variables, which make no distinction between spacelike and timelike correlations. Despite this, we show that in the restricted setting of spatiotemporal correlations between light-touch observables (i.e., observables with only one singular value), there exists a unique operator representation of such spatiotemporal correlations for arbitrary timelike-separated quantum systems. A special case of our result reproduces generalized Pauli observables and pseudo-density matrices, which have, up until now, only been defined for multi-qubit systems. In the case of qutrit systems, we use our results to illustrate an intriguing connection between light-touch observables and symmetric, informationally complete, positive operator-valued measures (SIC-POVMs)., Comment: 22 pages + appendix + references. Comments are highly encouraged!

In statistical inference, retrodiction is the act of inferring potential causes in the past based on knowledge of the effects in the present and the dynamics leading to the present. Retrodiction is applicable even when the dynamics is not reversible, and it agrees with the reverse dynamics when it exists, so that retrodiction may be viewed as an extension of inversion, i.e., time-reversal. Recently, an axiomatic definition of retrodiction has been made in a way that is applicable to both classical and quantum probability using ideas from category theory. Almost simultaneously, a framework for information flow in in terms of semicartesian categories has been proposed in the setting of categorical probability theory. Here, we formulate a general definition of retrodiction to add to the information flow axioms in semicartesian categories, thus providing an abstract framework for retrodiction beyond classical and quantum probability theory. More precisely, we extend Bayesian inference, and more generally Jeffrey's probability kinematics, to arbitrary semicartesian categories., Comment: 20.5 pages + references, some diagrams

The quantum no-broadcasting theorem states that it is impossible to produce perfect copies of an arbitrary quantum state, even if the copies are allowed to be correlated. Here we show that, although quantum broadcasting cannot be achieved by any physical process, it can be achieved by a virtual process, described by a Hermitian-preserving trace-preserving map. This virtual process is canonical: it is the only map that broadcasts all quantum states, is covariant under unitary evolution, is invariant under permutations of the copies, and reduces to the classical broadcasting map when subjected to decoherence. We show that the optimal physical approximation to the canonical broadcasting map is the optimal universal quantum cloning, and we also show that virtual broadcasting can be achieved by a virtual measure-and-prepare protocol, where a virtual measurement is performed, and, depending on the outcomes, two copies of a virtual quantum state are generated. Finally, we use canonical virtual broadcasting to prove a uniqueness result for quantum states over time., Comment: 5 pages + appendices

In this paper, we introduce a new quantity called SVD entanglement entropy. This is a generalization of entanglement entropy in that it depends on two different states, as in pre- and post-selection processes. This SVD entanglement entropy takes non-negative real values and is bounded by the logarithm of the Hilbert space dimensions. The SVD entanglement entropy can be interpreted as the average number of Bell pairs distillable from intermediates states. We observe that the SVD entanglement entropy gets enhanced when the two states are in the different quantum phases in an explicit example of the transverse-field Ising model. Moreover, we calculate the R\'enyi SVD entropy in various field theories and examine holographic calculations using the AdS/CFT correspondence., Comment: 42 pages, 23 figures, V2: minor adjustments

In this work, we use the theory of quantum states over time to define an entropy $S(\rho,\mathcal{E})$ associated with quantum processes $(\rho,\mathcal{E})$, where $\rho$ is a state and $\mathcal{E}$ is a quantum channel responsible for the dynamical evolution of $\rho$. The entropy $S(\rho,\mathcal{E})$ is a generalization of the von Neumann entropy in the sense that $S(\rho,\mathrm{id})=S(\rho)$ (where $\mathrm{id}$ denotes the identity channel), and is a dynamical analogue of the quantum joint entropy for bipartite states. Such an entropy is then used to define dynamical formulations of the quantum conditional entropy and quantum mutual information, and we show such information measures satisfy many desirable properties, such as a quantum entropic Bayes' rule. We also use our entropy function to quantify the information loss/gain associated with the dynamical evolution of quantum systems, which enables us to formulate a precise notion of information conservation for quantum processes., Comment: Comments welcome!

Bayes' rule $\mathbb{P}(B|A)\mathbb{P}(A)=\mathbb{P}(A|B)\mathbb{P}(B)$ is one of the simplest yet most profound, ubiquitous, and far-reaching results of classical probability theory, with applications in any field utilizing statistical inference. Many attempts have been made to extend this rule to quantum systems, the significance of which we are only beginning to understand. In this work, we develop a systematic framework for defining Bayes' rule in the quantum setting, and we show that a vast majority of the proposed quantum Bayes' rules appearing in the literature are all instances of our definition. Moreover, our Bayes' rule is based upon a simple relationship between the notions of state over time and a time-reversal symmetry map, both of which are introduced here., Comment: Some adjustments and organizational changes, typos fixed, new tables added; 24 pages total

We propose a category-theoretic definition of retrodiction and use it to exhibit a time-reversal symmetry for all quantum channels. We do this by introducing retrodiction families and functors, which capture many intuitive properties that retrodiction should satisfy and are general enough to encompass both classical and quantum theories alike. Classical Bayesian inversion and all rotated and averaged Petz recovery maps define retrodiction families in our sense. However, averaged rotated Petz recovery maps, including the universal recovery map of Junge-Renner-Sutter-Wilde-Winter, do not define retrodiction functors, since they fail to satisfy some compositionality properties. Among all the examples we found of retrodiction families, the original Petz recovery map is the only one that defines a retrodiction functor. In addition, retrodiction functors exhibit an inferential time-reversal symmetry consistent with the standard formulation of quantum theory. The existence of such a retrodiction functor seems to be in stark contrast to the many no-go results on time-reversal symmetry for quantum channels. One of the main reasons is because such works defined time-reversal symmetry on the category of quantum channels alone, whereas we define it on the category of quantum channels and quantum states. This fact further illustrates the importance of a prior in time-reversal symmetry.

Programmable photonic integrated circuits (PICs), offering diverse signal processing functions within a single chip, are promising solutions for applications ranging from optical communications to artificial intelligence. While the scale and complexity of programmable PICs is increasing, the characterization, and thus calibration, of them becomes increasingly challenging. Here we demonstrate a phase retrieval method for programmable PICs using an on-chip fractional-delay reference path. The impulse response of the chip can be uniquely and precisely identified from only the insertion loss using a standard complex Fourier transform. We demonstrate our approach experimentally with a 4-tap finite-impulse-response chip. The results match well with expectations and verifies our approach as effective for individually determining the taps' weights without the need for additional ports and photodiodes.

In 2017, D. Horsman, C. Heunen, M. Pusey, J. Barrett, and R. Spekkens proved that there is no physically reasonable assignment that takes a quantum channel and an initial state and produces a joint state on the tensor product of the input and output spaces. The interpretation was that there is a clear distinction between space and time in the quantum setting that is not visible classically, where in the latter, one can freely use Bayes' theorem to go between joint states and marginals with noisy channels. In this paper, we prove that there actually is such a physically reasonable assignment, bypassing the no-go result of Horsman et al., and we illustrate that this is achievable by restricting the domain of their assignment to a domain which represents the given data more faithfully., Comment: v3: minor clarifications added

We show that conditional expectations, optimal hypotheses, disintegrations, and adjoints of unital completely positive maps, are all instances of Bayesian inverses. We study the existence of the latter by means of the Tomita-Takesaki modular group and we provide extensions of a theorem of Takesaki as well as a theorem of Accardi and Cecchini to the setting of not necessarily faithful states on finite-dimensional $C^*$-algebras.

The adiabatic connection that has as weak-interaction expansion the M{\o}ller-Plesset perturbation series has been recently shown to have a large coupling-strength expansion in terms of functionals of the Hartree-Fock density with a clear physical meaning. In this work we accurately evaluate these density functionals and we extract second-order gradient coefficients from the data for neutral atoms, following ideas similar to the ones used in the literature for exchange, with some modifications. These new gradient expansions will be the key ingredient for performing interpolations that have already been shown to reduce dramatically MP2 errors for large non-covalent complexes. As a byproduct, our investigation of neutral atoms with large number of electrons $N$ indicates that the second-order gradient expansion for exchange grows as $N\log(N)$ rather than as $N$ as often reported in the literature., Comment: 35 pages, 9 figures, 2 tables

Although basing instruction on a learning trajectory (LT) is often recommended, there is little direct evidence to support the premise of a "LT approach"--that to be maximally meaningful, engaging, and effective, instruction is best presented one LT level beyond a child's present level of thinking. The present report serves to address the question: Is it necessary to teach each contiguous level of a LT or can instruction be similarly or more effective when skipping levels, provided the necessary exemplars are made? In a multimethod research study that included individual teaching experiments embedded inside of a quasi-experimental research design, one group of 13 kindergartners received instruction based on an empirically-validated LT for addition and subtraction (the "LT" treatment). The counterfactual, "skip" treatment (n = 12), received instruction focused mainly on levels at least two levels above their present level for the same amount of time as the LT treatment. More children in the LT treatment exhibited greater addition and subtraction learning during sessions and from pretest to posttest than children in the skip treatment. Implications for future study are discussed. [This paper was published in "ZDM Mathematics Education" v52 n4 p637-648 2020 (EJ1261937).]

We provide a stochastic extension of the Baez-Fritz-Leinster characterization of the Shannon information loss associated with a measure-preserving function. This recovers the conditional entropy and a closely related information-theoretic measure that we call conditional information loss. Although not functorial, these information measures are semi-functorial, a concept we introduce that is definable in any Markov category. We also introduce the notion of an entropic Bayes' rule for information measures, and we provide a characterization of conditional entropy in terms of this rule., Comment: 31 pages; Typos fixed in Defn 2.12 and the proofs of Prop 4.2 iii) and Prop 6.8 (numbering scheme differs from published version)

We introduce a differential extension of algebraic K-theory of an algebra using Karoubi's Chern character. In doing so, we develop a necessary theory of secondary transgression forms as well as a differential refinement of the smooth Serre--Swan correspondence. Our construction subsumes the differential K-theory of a smooth manifold when the algebra is complex-valued smooth functions. Furthermore, our construction fits into a noncommutative differential cohomology hexagon diagram., Comment: 65 pages

A Bayesian functorial characterization of the classical relative entropy (KL divergence) of finite probabilities was recently obtained by Baez and Fritz. This was then generalized to standard Borel spaces by Gagn\'e and Panangaden. Here, we provide preliminary calculations suggesting that the finite-dimensional quantum (Umegaki) relative entropy might be characterized in a similar way. Namely, we explicitly prove that it defines an affine functor in the special case where the relative entropy is finite. A recent non-commutative disintegration theorem provides a key ingredient in this proof., Comment: 8 pages, submission to GSI'21 (post-print)

We consider a rod that is heated/cooled and sensed at multiple point locations. To stabilize it to a constant temperature we set up a Linear Quadratic Regulator that we explicitly solve by the method of completing the square to find the optimal linear state feedback for the point actuators. But we don't assume that the whole state is mesureable so we construct an infinite dimensional Kalman filter to estimate the whole state from a finite number of noisy point measurements. These two components yield a Linear Quadratic Gaussian (LQG) Synthesis for the heat equation under point actuation and point sensing.

We present and solve a Linear Quadratic Regulator (LQR) for the boundary control of the beam equation. We use the simple technique of completing the square to get an explicit solution. By decoupling the spatial frequencies we are able to reduce an infinite dimensional LQR to an infinte family of two two dimensional LQRs each of which can be solved explicitly.

Conditional distributions, as defined by the Markov category framework, are studied in the setting of matrix algebras (quantum systems). Their construction as linear unital maps are obtained via a categorical Bayesian inversion procedure. Simple criteria establishing when such linear maps are positive are obtained. Several examples are provided, including the standard EPR scenario, where the EPR correlations are reproduced in a purely compositional (categorical) manner. A comparison between the Bayes map, the Petz recovery map, and the Leifer-Spekkens acausal belief propagation is provided, illustrating some similarities and key differences., Comment: In Proceedings QPL 2021, arXiv:2109.04886

We consider the Linear Quadratic Regulation for the boundary control of the one dimensional linear wave equation under both Dirichlet and Neumann activation. For each activation we present a Riccati partial differential equation that we explicitly solve. The derivation the Riccati partial differential equations is by the simple and explicit technique of completing the square.

The two contributions of this paper are as follows. The first is the solution of an infinite dimensional, boundary controlled Linear Quadratic Regulator by the simple and constructive method of completing the square. The second contribution is the extension of Al'brekht's method to the optimal stabilization of a boundary controlled, nonlinear Reaction Diffusion system.

This paper describes a CNN where all CNN style 2D convolution operations that lower to matrix matrix multiplication are fully binary. The network is derived from a common building block structure that is consistent with a constructive proof outline showing that binary neural networks are universal function approximators. 71.24% top 1 accuracy on the 2012 ImageNet validation set was achieved with a 2 step training procedure and implementation strategies optimized for binary operands are provided.

Although basing instruction on learning trajectories (LTs) is often recommended, there is little direct evidence regarding the premise of an LT approach--that instruction should be presented (only) one LT level beyond a child's present level. We evaluated this hypothesis in the domain of early shape composition. One group of preschoolers, who were at least two levels below the target instructional LT level, received instruction based on an empirically-validated LT. The counterfactual, skip-levels, group received an equal amount of instruction focused only on the target level. At posttest, children in the LT condition exhibited significantly greater learning than children in the skip-levels condition, mainly on near-transfer items; no child-level variables were significant moderators. Implications for theory and practice are discussed. [This article will be published in the "American Educational Research Journal."]

Using convex Grothendieck fibrations, we characterize the von Neumann entropy as a functor from finite-dimensional non-commutative probability spaces and state-preserving *-homomorphisms to real numbers. Our axioms reproduce those of Baez, Fritz, and Leinster characterizing the Shannon entropy difference. The existence of disintegrations for classical probability spaces plays a crucial role in our characterization., Comment: 30 pages; slightly reorganized and more concise

Using a diagrammatic reformulation of Bayes' theorem, we provide a necessary and sufficient condition for the existence of Bayesian inference in the setting of finite-dimensional $C^*$-algebras. In other words, we prove an analogue of Bayes' theorem in the joint classical and quantum context. Our analogue is justified by recent advances in categorical probability theory, which have provided an abstract formulation of the classical Bayes' theorem. In the process, we further develop non-commutative almost everywhere equivalence and illustrate its important role in non-commutative Bayesian inversion. The construction of such Bayesian inverses, when they exist, involves solving a positive semidefinite matrix completion problem for the Choi matrix. This gives a solution to the open problem of constructing Bayesian inversion for completely positive unital maps acting on density matrices that do not have full support. We illustrate how the procedure works for several examples relevant to quantum information theory., Comment: Comments welcome!

In 1961 E. G. Albrekht presented a method for the optimal stabilization of smooth, nonlinear, finite dimensional, continuous time control systems. This method has been extended to similar systems in discrete time and to some stochastic systems in continuous and discrete time. In this paper we extend Albrekht's method to the optimal stabilization of some smooth, nonlinear, infinite dimensional, continuous time control systems whose nonlinearities are described by Fredholm integral operators.

We introduce quantum Markov categories as a structure that refines and extends a synthetic approach to probability theory and information theory so that it includes quantum probability and quantum information theory. In this broader context, we analyze three successively more general notions of reversibility and statistical inference: ordinary inverses, disintegrations, and Bayesian inverses. We prove that each one is a strictly special instance of the latter for certain subcategories, providing a categorical foundation for Bayesian inversion as a generalization of reversing a process. We unify the categorical and $C^*$-algebraic notions of almost everywhere (a.e.) equivalence. As a consequence, we prove many results including a universal no-broadcasting theorem for S-positive categories, a generalized Fisher--Neyman factorization theorem for a.e. modular categories, a relationship between error correcting codes and disintegrations, and the relationship between Bayesian inversion and Umegaki's non-commutative sufficiency., Comment: substantial changes, 91 pages, comments welcome!

Motivated by advances in categorical probability, we introduce non-commutative almost everywhere (a.e.) equivalence and disintegrations in the setting of C*-algebras. We show that C*-algebras (resp. W*-algebras) and a.e. equivalence classes of 2-positive (resp. positive) unital maps form a category. We prove non-commutative disintegrations are a.e. unique whenever they exist. We provide an explicit characterization for when disintegrations exist in the setting of finite-dimensional C*-algebras, and we give formulas for the associated disintegrations., Comment: slight reorganization, 51 pages, comments welcome!

A standard way of finding a feedback law that stabilizes a control system to an operating point is to recast the problem as an infinite horizon optimal control problem. If the optimal cost and the optmal feedback can be found on a large domain around the operating point then a Lyapunov argument can be used to verify the asymptotic stability of the closed loop dynamics. The problem with this approach is that is usually very difficult to find the optimal cost and the optmal feedback on a large domain for nonlinear problems with or without constraints. Hence the increasing interest in Model Predictive Control (MPC). In standard MPC a finite horizon optimal control problem is solved in real time but just at the current state, the first control action is implimented, the system evolves one time step and the process is repeated. A terminal cost and terminal feedback found by Al'brekht's methoddefined in a neighborhood of the operating point is used to shorten the horizon and thereby make the nonlinear programs easier to solve because they have less decision variables. Adaptive Horizon Model Predictive Control (AHMPC) is a scheme for varying the horizon length of Model Predictive Control (MPC) as needed. Its goal is to achieve stabilization with horizons as small as possible so that MPC methods can be used on faster and/or more complicated dynamic processes., Comment: arXiv admin note: text overlap with arXiv:1602.08619

In this paper we consider discrete time stochastic optimal control problems over infinite and finite time horizons. We show that for a large class of such problems the Taylor polynomials of the solutions to the associated Dynamic Programming Equations can be computed degree by degree., Comment: arXiv admin note: text overlap with arXiv:1806.04120

Pseudo-parabolic equations have been used to model unsaturated fluid flow in porous media. In this paper it is shown how a pseudo-parabolic equation can be upscaled when using a spatio-temporal decomposition employed in the Peszyn'ska-Showalter-Yi paper [8]. The spatial-temporal decomposition transforms the pseudo-parabolic equation into a system containing an elliptic partial differential equation and a temporal ordinary differential equation. To strengthen our argument, the pseudo-parabolic equation has been given advection/convection/drift terms. The upscaling is done with the technique of periodic homogenization via two-scale convergence. The well-posedness of the extended pseudo-parabolic equation is shown as well. Moreover, we argue that under certain conditions, a non-local-in-time term arises from the elimination of an unknown., Comment: 6 pages, 0 figures

Given a representation of a unital $C^*$-algebra $\mathcal{A}$ on a Hilbert space $\mathcal{H}$, together with a bounded linear map $V:\mathcal{K}\to\mathcal{H}$ from some other Hilbert space, one obtains a completely positive map on $\mathcal{A}$ via restriction using the adjoint action associated to $V$. We show this restriction forms a natural transformation from a functor of $C^*$-algebra representations to a functor of completely positive maps. We exhibit Stinespring's construction as a left adjoint of this restriction. Our Stinespring adjunction provides a universal property associated to minimal Stinespring dilations and morphisms of Stinespring dilations. We use these results to prove the purification postulate for all finite-dimensional $C^*$-algebras., Comment: 33 pages + appendices

IIn this paper we show that some HJB equations arising from both finite and infinite horizon stochastic optimal control problems have a regular singular point at the origin. This makes them amenable to solution by power series techniques. This extends the work of Al'brecht who showed that the HJB equations of an infinite horizon deterministic optimal control problem can have a regular singular point at the origin, Al'brekht solved the HJB equations by power series, degree by degree. In particular, we show that the infinite horizon stochastic optimal control problem with linear dynamics, quadratic cost and bilinear noise leads to a new type of algebraic Riccati equation which we call the Stochastic Algebraic Riccati Equation (SARE). If SARE can be solved then one has a complete solution to this infinite horizon stochastic optimal control problem. We also show that a finite horizon stochastic optimal control problem with linear dynamics, quadratic cost and bilinear noise leads to a Stochastic Differential Riccati Equation (SDRE) that is well known. If these problems are the linear-quadratic-bilinear part of a nonlinear finite horizon stochastic optimal control problem then we show how the higher degree terms of the solutions can be computed degree by degree. To our knowledge this computation is new.

Telomeres, the nucleoprotein complexes at the termini of linear chromosomes, are essential for the processes of end replication, end protection, and chromatin segregation. The Mre11 complex is involved in multiple cellular roles in DNA repair and structure in the regulation and function of telomere size homeostasis. In this study, we characterize yeast telomere chromatin structure, phenotypic heritability, and chromatin segregation in both wild-type [MRE11] and A470 motif alleles. MRE11 strains confer a telomere size of 300 base pairs of G+T irregular simple sequence repeats. This DNA and a portion of subtelomeric DNA is embedded in a telosome: a MNase-resistant non-nucleosomal particle. Chromatin immunoprecipitation shows a three to four-fold lower occupancy of Mre11A470T proteins than wild-type proteins in telosomes. Telosomes containing the Mre11A470T protein confer a greater resistance to MNase digestion than wild-type telosomes. The integration of a wild-type MRE11 allele into an ectopic locus in the genome of an mre11A470T mutant and the introduction of an mre11A470T allele at an ectopic site in a wild-type strain lead to unexpectedly differing results. In each case, the replicated sister chromatids inherit telosomes containing only the protein encoded by the genomic mre11 locus, even in the presence of protein encoded by the opposing ectopic allele. We hypothesize that the telosome segregates by a conservative mechanism. These data support a mechanism for the linkage between sister chromatid replication and maintenance of either identical mutant or identical wild-type telosomes after replication of sister chromatids. These data suggest the presence of an active mechanism for chromatin segregation in yeast., Comment: This was intended as a replacement of arXiv:1705.06595 and was submitted as a new paper by mistake

We provide a visual and intuitive introduction to effectively calculating in 2-groups along with explicit examples coming from non-abelian 1- and 2-form gauge theory. In particular, we utilize string diagrams, tools similar to tensor networks, to compute the parallel transport along a surface using approximations on a lattice. Although this work is mainly intended as expository, we prove a convergence theorem for the surface transport in the continuum limit. Locality is used to define infinitesimal parallel transport and two- dimensional algebra is used to derive finite versions along arbitrary surfaces with sufficient orientation data. The correct surface ordering is dictated by two-dimensional algebra and leads to an interesting diagrammatic picture for gauge fields interacting with particles and strings on a lattice. The surface ordering is inherently complicated, but we prove a simplification theorem confirming earlier results of Schreiber and Waldorf. Assuming little background, we present a simple way to understand some abstract concepts of higher category theory. In doing so, we review all the necessary categorical concepts from the tensor network point of view as well as many aspects of higher gauge theory., Comment: 85 pages, 132 figures, updated version of a part of the author's PhD thesis

Although basing instruction on a learning trajectory (LT) is often recommended, there is little evidence regarding the premise of a LT approach--that to be maximally meaningful, engaging, and effective, instruction is best presented one LT level beyond a child's present level of thinking. This hypothesis was evaluated for an empirically-validated LT for early arithmetic, using with 291 kindergartners from four schools in a Mountain West state. Students randomly assigned to the LT condition received one-on-one instruction one level above their present level of thinking. Students in the counterfactual condition received one-on-one instruction that involved solving story problems three levels above their initial level of thinking (a teach-to-target approach). At posttest, children in the LT condition exhibited significantly greater learning, including target knowledge, than children in the teach-to-target condition, particularly those with low entry knowledge of arithmetic. Child gender and dosage were not significant moderators of the effects. [This paper was published in "Journal of Educational Psychology" v113 n7 p1323-1337 2021 (EJ1318761).]

We introduce a category of stochastic maps (certain Markov kernels) on compact Hausdorff spaces, construct a stochastic analogue of the Gelfand spectrum functor, and prove a stochastic version of the commutative Gelfand-Naimark Theorem. This relates concepts from algebra and operator theory to concepts from topology and probability theory. For completeness, we review stochastic matrices, their relationship to positive maps on commutative $C^*$-algebras, and the Gelfand-Naimark Theorem. No knowledge of probability theory nor $C^*$-algebras is assumed and several examples are drawn from physics., Comment: 74 pages, 5 figures, minor edits and clarifications added since v1, comments welcome

Telomeres, the nucleoprotein complexes at the termini of linear chromosomes, are essential for the processes of end replication, end-protection, and chromatin segregation. The Mre11 complex is involved in multiple cellular roles in DNA repair and structure in the regulation and function of telomere size homeostasis. In this study, we characterize yeast telomere chromatin structure, phenotypic heritability, and chromatin segregation in both wild-type [MRE11] and A470 motif alleles. MRE11 strains confer a telomere size of 300 base pairs of G+T irregular simple sequence repeats. This DNA and a portion of subtelomeric DNA is embedded in a telosome: an MNase-resistant non-nucleosomal particle. Chromatin immunoprecipitation shows a three to four-fold lower occupancy of Mre11A470T proteins than wild-type proteins in telosomes. Telosomes containing the Mre11A470T protein confer a greater resistance to MNase digestion than wild-type telosomes. The integration of a wild-type MRE11 allele into an ectopic locus in the genome of a mre11A470T mutant and the introduction of a mre11A470T allele at an ectopic site in a wild-type strain lead to unexpectedly differing results. In each case, the replicated sister chromatids inherit telosomes containing only the protein encoded by the genomic mre11 locus, even in the presence of protein encoded by the opposing ectopic allele. We hypothesize that the telosome segregates by a conservative mechanism. These data support a mechanism for the linkage between sister chromatid replication and maintenance of either identical mutant or identical wild-type telosomes after replication of sister chromatids. These data suggest the presence of an active mechanism for chromatin segregation in yeast., Comment: 30 ds pages, 9 regular figures, 6 supplementary figures, raw data, iupdate of submit/1892479

We study the weak solvability of a nonlinearly coupled system of parabolic and pseudo-parabolic equations describing the interplay between mechanics, chemical reactions, diffusion and flow in a mixture theory framework. Our approach relies on suitable discrete-in-time energy-like estimates and discrete Gronwall inequalities. In selected parameter regimes, these estimates ensure the convergence of the Rothe method for the discretized partial differential equations., Comment: 35 pages, 0 figures, submitted to European Journal of Applied Mathematics on February 7th 2017

We propose occupying guard-bands in closely-spaced WDM systems with redundant signal spectral components, to increase tolerance to frequency misalignment and channel shaping from multiplexing elements. By cyclically repeating the spectrum of a modulated signal, we show improved tolerance to impairments due to add/drop multiplexing with a commercial wavelength selective switch, in systems using 5-20% guard bands on a 50-GHz DWDM grid., Comment: draft, unsubmitted

Given a representation of a C*-algebra, thought of as an abstract collection of physical observables, together with a unit vector, one obtains a state on the algebra via restriction. We show that the Gelfand-Naimark-Segal (GNS) construction furnishes a left adjoint of this restriction. To properly formulate this adjoint, it must be viewed as a weak natural transformation, a 1-morphism in a suitable 2-category, rather than as a functor between categories. Weak naturality encodes the functoriality and the universal property of adjunctions encodes the characterizing features of the GNS construction. Mathematical definitions and results are accompanied by physical interpretations., Comment: 30 pages + appendix; post-peer-review, pre-copyedit version of an article published in Applied Categorical Structures