Results 61 to 70 of about 137,153 (176)
Compile‐Once Block Encodings for Masked Similarity‐Transformed Effective Hamiltonians
Composer transforms structured electronic‐structure operators into a reusable quantum‐circuit fabric. Once compiled, the same block‐encoding architecture is re‐dialed through coefficients, rotation angles, and masks to generate similarity‐transformed effective Hamiltonians across related problem instances, avoiding repeated structural recompilation ...
Bo Peng, Yuan Liu, Karol Kowalski
wiley +1 more source
Aggregation and the Structure of Value
ABSTRACT Roughly, the view I call “Additivism” sums up value across time and people. Given some standard assumptions, I show that Additivism follows from two principles. The first says that how lives align in time cannot, in itself, matter. The second says, roughly, that a world cannot be better unless it is better within some period or another.
Weng Kin San
wiley +1 more source
Convergence and combinatorics of the Reverse algorithm
Abstract We study the Reverse algorithm, a multidimensional continued fraction algorithm, which is not unimodular. We show that the Reverse algorithm is ergodic and, by proving that its second Lyapunov exponent is negative, that it is a.e. exponentially convergent.
Hiroaki Ito +2 more
wiley +1 more source
Itô’s stochastic calculus and Heisenberg commutation relations
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A new functional calculus for noncommuting operators
In this paper we use the notion of slice monogenic functions \cite{slicecss} to define a new functional calculus for an $n$-tuple $T$ of not necessarily commuting operators. This calculus is different from the one discussed in \cite{jefferies} and it allows the explicit construction of the eigenvalue equation for the $n$-tuple $T$ based on a new notion
Struppa, D. +5 more
openaire +5 more sources
The DGA of planar loops when 2n=4$2n=4$
Abstract The DGA of planar loops is a pictorial chain complex introduced in a recent paper of the author, Boyd, Randal‐Williams and Sroka, where a minimal model for it was given. In the first non‐trivial case, 2n=4$2n=4$, we give a new model which incorporates two natural ‘reflection’ involutions, as well as a more explicit description of the existing ...
Guy Boyde
wiley +1 more source
When weak convergence in von Neumann algebras implies almost uniform convergence?
Abstract We show that weak sequential convergence in a semifinite von Neumann algebra M$\mathcal {M}$ equipped with a faithful normal semifinite trace τ$\tau$ implies almost uniform convergence if and only if M$\mathcal {M}$ is of type Ifin$\mathrm{I}_{\rm fin}$ with τ(1)<∞;$\tau (\mathbf {1})<\infty;$ and that weak sequential convergence in a finite ...
Yerlan Nessipbayev +2 more
wiley +1 more source
Commutator Calculus and Symbolic Differentiation of Matrix Functions
For an application to the logarithmic corotational derivative, see https://doi.org/10.48550/arXiv.2504 ...
openaire +2 more sources
On tested Bousfield–Friedlander localizations
Abstract We show that a Bousfield–Friedlander localization of a model category of functors with respect to a set of test morphisms, as introduced by Bandklayder, Bergner, Griffiths, Johnson and Santhanam, can be characterized as a left Bousfield localization at a specific tensoring of the set of homotopy generators.
Niall Taggart
wiley +1 more source
Modeling SpaceWire networks with network calculus [PDF]
The SpaceWire network standard is promoted by the ESA and is scheduled to be used as the sole on-board network for future satellites. This network uses a wormhole routing mechanism that can lead to packet blocking in routers and consequently to variable ...
Frances, Fabrice +5 more
core +1 more source

