08/19: GHz momentum computing simulation #1

August 18, 2025

nb: attempting a daily posting cadence as weekly clearly doesn't work. adjust quality priors accordingly

Momentum computing is, as far as I can tell, a reversible computing paradigm which circumvents Landauer's limit by embedding the memory state transitions of some computing device in a physical system which equilibriates slower than the time it takes to do an individual bit-swap, so that the memory state transitions themselves can store information in their "instantaneous momenta" and subsequently perform bit-swaps with near-zero net work.1

In particular, one can construct toy theoretical energy potentials which implement a ΔW=0 Fredkin gate.2 Consider a particle (x,p) in the 1D potential VB(x)=αx4βx2. The two minimal states are located at x=±β/2α, and as transitioning from the x<0 regime to the x>0 regime is exponentially prohibitive in the value of V(0), the system "stores" a bit {0,1} depending on the sign of the particle's position.

Now imagine that VB encodes a thermal bath in which the particle (x,p) is embedded in, and assume that the particle's motion follows harmonic oscillation in the absence of external influence. When the bath is active, the particle's potential is described by VB. But when the bath is disengaged, the particle behaves according to VH(x)=kx2/2, which induces a trajectory x(t)=Acos(tk/m+ϕ), which is periodic in time τ=2πm/k. Therefore, disengaging the bath for time τ/2 swaps the sign of the particle's position, effectively performing a bit-swap.

This theoretical "bit-swap" comes at no work cost because there is no change in potential energy from time 0 to τ/2.3 However, any physical implementation of this concept must contend with the fact that changing the potentials in a physical system requires energy to be expended, likely in an inefficient manner. How does one get around this? Superconductors!

gradiometric flux logic cells

The theoretical guarantees above require complete & efficient decoupling of the system from the bath. You can get similar results by simply ensuring that the relevant computational timescale is significantly smaller than the energy flux rate between the system and its bath, so that "from the perspective of the computation" there is no coupling.

[RC22] chooses to implement such a system with gradiometric flux logic cells, a kind of circuit utilizing Josephson junctions designed particularly to withstand global magnetic noise fluctuations [I do not really understand GFLCs very well, that will be a topic for another day's post].

GFLC

With suitable assumptions & parametrizations [such will be the subject of yet another day's post], the GFLCs follow "significantly underdamped Langevin dynamics", which can be described with the following equation: dv=λvdtθxU+νr(t)2dt where the potential U evolves according to U(t)=(ϕϕx(t))2/2+γ(ϕdcϕxdc(t))2/2+βcosϕcos(ϕdc/2)+δβsinϕsin(ϕdc/2) where x=(ϕ,ϕdc),v=(ϕ˙,ϕdc˙), ϕ=(ϕ1+ϕ2)/2π, ϕdc=(ϕ2ϕ1), and ϕ1,ϕ2 are the phases of the individual Josephson junctions Ic1,Ic2 in the above figure [I think]. ϕx=2πψx/Φ0π and ϕxdc=2πψxdc/Φ0 are functions of the external magnetic fluxes ψx,ψxdc applied to the circuit.

The details of this are very interesting, still confusing to me, and this is by no means an exhaustive parametrization of the underlying models. However, below (Fig. 2) showcases that varying ϕ and ϕdc, the sum and difference of the Josephson phase parameters, recovers the potential geometry associated with costless bitswaps.

GFLC

further considerations

All credit goes to the coauthors of the two papers cited in this post.

1

This is probably wrong and definitely imprecise, but it reflects my current level of understanding.

2

Setting taken from [RWBC21].

3

Here we describe the one-dimensional case for intuition, but the paper details the Fredkin gate implementation with this method, which requires three-dimensional potentials to encode 101110 and No Change otherwise.