Introduction
Nobody knows whether gravity obeys the rules of quantum mechanics. Every other force of nature does, but gravity is so feeble between small objects that its quantum side has never been seen. A way to look for it without a particle accelerator was proposed a few years ago[1 , 2 ] . Take two small masses and put each of them in a superposition of two places: in two places at once, as quantum mechanics allows. If gravity can then entangle the two masses, so that their joint state cannot be described by a separate pure state for each mass, the gravitational pull between them cannot be something that two separate laboratories could imitate with ordinary measurements and classical messages. Many regard this as a decisive tabletop test, and it has become the goal of a growing experimental effort[3 , 4 , 5 ] . Related witnesses quantify the nonclassicality of mediated interactions through the correlations they generate[6 ] .
The mechanism is easy to picture (Figure 1 a). With each mass in two places at once, there are four combinations of positions, and the two masses are a different distance apart in each. Gravity is stronger when they are closer, so each combination picks up a slightly different quantum phase, a kind of internal clock reading. Wait long enough, and the four clocks drift apart in a way that leaves the two masses entangled.
Figure 1. The experiment, the obstacle and three speed limits. a, Two masses, each in two places at once inside its own region of radius r r r ; the regions are a distance d d d apart. The four combinations of positions put the masses at four distances, gravity acts differently on each, and the masses become entangled. b, Random kicks from the surroundings and the pull of the partner mass both act on the position of a mass. A scheme that hides the position from the kicks hides it from gravity too. c, The results of this paper, as a sketch. Without noise, the fastest possible entanglement falls as 1 / d 3 1/d^{3} 1/ d 3 . Under strong random forces, no strategy can beat a rate that falls as 1 / d 4 1/d^{4} 1/ d 4 . With exact error correction, the best rate falls as 1 / d 7 1/d^{7} 1/ d 7 , and a six-position code nearly reaches it.
“Long enough” is the problem. Gravity has been measured between gold spheres two millimetres across[7 ] , and molecules of tens of thousands of atomic mass units have been put in two places at once[8 ] , but the entanglement test needs both at the same time: objects heavy enough to gravitate, in superpositions wide enough for gravity to tell the branches apart. For the masses usually discussed, specks a couple of micrometres across held a few hair-widths from each other, the gravitational effect takes many seconds to build up. All the while, stray gas molecules, electric fields and vibrations give the masses small random kicks, and a random kick is exactly what destroys a superposition of two places.
There is a well-known cure for noise in quantum devices, called error correction. One stores the quantum state not in two positions but in a cleverly chosen pattern of several positions, a code. The information then sits in the shape of the pattern, not in where the mass is, so that a random kick shifts the mass without learning or spoiling what is stored, and its damage can be undone. Codes of this kind are used in quantum sensing[9 , 10 , 11 , 12 ] and were recently proposed for gravitational entanglement by Wang, Pedernales and Plenio[13 ] . But here the cure has a side effect (Figure 1 b). A random kick and the pull of the partner mass grip the mass by the same handle: its position. A code that hides position from the noise hides it from gravity as well. Wang and colleagues showed that exact correction cancels the leading gravitational effect and found codes that keep a weaker, shorter-ranged remnant[13 ] . A related fact was known for unprotected masses: if the random forces are strong enough, the leading gravitational effect can be imitated by classical means and creates no entanglement[14 , 15 ] .
These observations raise three plain questions, and this paper answers them. How fast can gravity entangle two masses when nothing disturbs them? How much of that speed does noise take away, whatever one does about it? And if one shields the masses by error correction, how much speed can the best possible shield keep? The answers are three speed limits (Figure 1 c). Each is stated for the complete Newtonian pull between two masses that are free to move inside two separate regions, and each holds for every strategy of the kind it describes, including ones nobody has thought of.
Results
A speed limit for gravity
We begin with the ideal case of no noise at all. Two masses, m A m_A m A and m B m_B m B , are each free to be anywhere inside a spherical region of radius r r r ; the centres of the two regions are a distance d > 2 r d > 2r d > 2 r apart (Figure 1 a). The only thing that connects the two laboratories is Newton’s gravitational energy,
V ( a , b ) = − G m A m B ∣ d e z + b − a ∣ (1) V(\mathbf{a},\mathbf{b})=-\frac{Gm_A m_B}{\lvert d\mathbf{e}_z+\mathbf{b}-\mathbf{a}\rvert} \tag*{(1)} V ( a , b ) = − ∣ d e z + b − a ∣ G m A m B (1)
where a \mathbf{a} a and b \mathbf{b} b are the positions of the masses relative to the centres of their regions and e z \mathbf{e}_z e z points from one centre to the other. Everything else is allowed and costs nothing. Each laboratory may prepare any quantum state of its mass, use extra quantum systems as memories, measure, and send classical messages to the other. The two laboratories start out unentangled.
We measure entanglement in Bell pairs. A Bell pair is the basic unit of entanglement, as the bit is the basic unit of information: two quantum bits, one on each side, as entangled as two quantum bits can be. The entangling capacity is the largest number of Bell pairs per second that the laboratories can produce, averaged over a long experiment in which many pairs are made[16 ] . It is a speed limit: no protocol, however elaborate, entangles faster.
Two quantities set the scale of everything that follows. One is a rate, g 0 = G m A m B / ( ℏ d ) g_0=Gm_A m_B/(\hbar d) g 0 = G m A m B / ( ℏ d ) : the gravitational energy of the pair, turned into a frequency by dividing by Planck’s constant ℏ \hbar ℏ . For the masses we have in mind
it is a fraction of one per second. The other is the ratio u = r / d u=r/d u = r / d of the size of the regions to their separation, a number below one half. Our first result is the exact capacity. Whenever the regions are not too close, d ≥ ( 1 + 5 ) r ≈ 3.24 r d\geq(1+\sqrt{5})r\approx3.24r d ≥ ( 1 + 5 ) r ≈ 3.24 r ,
C G = β g 0 2 u 2 1 − 4 u 2 , β = 1.9123 … (2) C_G=\beta g_0\frac{2u^2}{1-4u^2},\qquad\beta=1.9123\ldots \tag*{(2)} C G = β g 0 1 − 4 u 2 2 u 2 , β = 1.9123 … (2)
where β \beta β is a constant known from the theory of the simplest interaction between two quantum bits[17 , 18 , 19 ] .
The remarkable part is how little is needed. The best strategy is the simplest one: put each mass in two places at once, as two narrow wavepackets (well-localized lumps of the mass’s quantum wave) at the two ends of the diameter that points to the partner. Their four combinations sit at distances d − 2 r d-2r d − 2 r , d + 2 r d+2r d + 2 r , d d d , and d d d , and the mismatch between these distances is all the entangling power there is. Superpositions of many positions, motion sideways, entanglement with local memories: none of it beats two points on a line. That two points reach this rate was known; what is new is the proof that nothing else does. At large separation the speed limit falls as the cube of the distance, C G ≈ 2 β G m A m B r 2 / ( ℏ d 3 ) C_G\approx2\beta Gm_A m_Br^2/(\hbar d^3) C G ≈ 2 β G m A m B r 2 / ( ℏ d 3 ) .
To make this concrete, use one example throughout: two masses of 10 − 14 k g 10^{-14}\,\mathrm{kg} 1 0 − 14 kg in regions of radius r = 125 μ m r=125\,\mu\mathrm{m} r = 125 μ m whose centres are d = 450 μ m d=450\,\mu\mathrm{m} d = 450 μ m apart. Then Eq. (2) gives 0.060 Bell pairs per second. At the very best, gravity delivers one Bell pair every 17 seconds.
Why can cleverness not help? In the proof (Methods), every possible position of a mass is assigned a point in an abstract space, in such a way that the gravitational energy of two positions is given by how their points line up[20 ] . The entangling power available to any quantum state is limited by how far apart these points can be[21 , 22 ] . All of them lie inside a ball, and the two ends of the axial diameter sit at opposite ends of it. Nothing can be farther apart than that, which is why two positions are enough. Two caveats: the capacity assumes ideal control with no limit on energy, and a fixed kinetic-energy budget lowers it in the collinear equal-mass model; and when the two regions nearly touch, a third position helps (Supplementary Sections S2 and S8).
Enough noise closes gravity's main channel
Now let the random kicks in. We model them in the simplest way: as a random force that is the same everywhere in a region and has no memory from one moment to the next. The forces on the two masses are independent, and nobody keeps a record of them. Such noise is described by one number, its strength Λ \Lambda Λ , and what it does is easy to state: a mass in two places a distance L L L apart loses its quantum coherence at the rate Λ L 2 \Lambda L^2 Λ L 2 . Wider superpositions are more fragile, by the square of their width. (A force with two-sided spectral density S F S_F S F per Cartesian component has Λ = S F / 2 ℏ 2 \Lambda= S_F/2\hbar^2 Λ = S F /2 ℏ 2 .)
Gravity’s leading effect depends on size in the same way. When the masses are far apart compared with the width of their superpositions, the gravitational energy that distinguishes the four combinations of positions is proportional to the product of the two widths: make each superposition L L L wide, and the entangling effect grows as L 2 L^2 L 2 . Gravity and noise scale alike, the size of the superposition cancels out, and the contest between them is decided by a threshold that involves nothing but the two masses and their separation,
Λ c = G m A m B ℏ d 3 . (3) \Lambda_c = \frac{Gm_A m_B}{\hbar d^3}. \tag*{(3)} Λ c = ℏ d 3 G m A m B . (3)
What happens at this threshold is striking (Figure 2 a). Gravity’s leading effect, the one behind the 1 / d 3 1/d^3 1/ d 3 law, couples the position of one mass to the position of the other. When the noise on the two masses satisfies Λ A Λ B ≥ Λ c \sqrt{\Lambda_A\Lambda_B} \ge\Lambda_c Λ A Λ B ≥ Λ c , this coupling together with the noise can be imitated exactly by a mundane procedure: each laboratory keeps measuring where its mass is, sends the result to the other as an ordinary, classical message, and the other gives its mass a matching push[14 , 15 ] . Laboratories that only measure and exchange classical messages can never create entanglement; that is what makes entanglement a quantum resource. So above the threshold gravity’s main channel is closed: it is still there, but nothing quantum can pass through it.
Figure 2. Enough noise closes gravity’s main channel. a, Above a threshold of noise, gravity’s leading pull together with the random kicks is indistinguishable from two laboratories that measure the positions of their masses, exchange the results as classical messages and push their masses accordingly. Such a procedure cannot create entanglement. b, How fast entanglement can be made (vertical axis, as a fraction of the noiseless speed limit C G C_G C G ) against the strength of the noise (horizontal axis, in units of the threshold Λ c \Lambda_c Λ c of Eq. (3) ), for regions ten radii apart. Grey: the limit for every strategy; the shaded area is impossible. The limit drops as the noise approaches the threshold, because the main channel closes and only the weaker effects of the potential are left (Eq. (4) and Methods). Blue: a rate achievable with two unprotected positions per mass; noise slows it, and beyond the marked point this scheme produces no entanglement at all. Orange: the six-position error-correcting code described below, which is immune to this noise but slow. Above the threshold, the best possible rate lies between the orange and grey lines. c, The noise at the threshold in laboratory units (newtons per root hertz; smaller is quieter), against separation, for three masses. Above each line the main channel is closed. The dot marks the running example.
This much was known for the leading effect alone. The real potential has further, weaker effects, and experimenters have further options: codes, feedback, memories, keeping a record of which errors occurred. Our second result covers all of it. Above the threshold, whatever the two laboratories do, the capacity of the complete Newtonian interaction obeys
C n o i s e ≤ β g 0 B ( u ) , C_{\mathrm{noise}} \le\beta g_0 B(u), C noise ≤ β g 0 B ( u ) ,
B ( u ) ≈ 9 2 ( r d ) 3 ( u → 0 ) . (4) B(u) \approx\frac{9}{2}\left(\frac{r}{d}\right)^3 \qquad(u \to0). \tag*{(4)} B ( u ) ≈ 2 9 ( d r ) 3 ( u → 0 ) . (4)
with the complete expression given in Methods. The rate now falls at least as fast as 1 / d 4 1/d^4 1/ d 4 : no ingenuity brings back the 1 / d 3 1/d^3 1/ d 3 law. Compared with the noiseless speed limit, the most that any strategy can reach is 54% at d = 6 r d=6r d = 6 r and 28% at d = 10 r d=10r d = 10 r , and the percentage keeps falling in proportion to r / d r/d r / d (Figure 2 b). The idea of the proof is to split the true evolution into the part that measuring and messaging can imitate and a remainder, and to bound the entanglement that the remainder can produce while the laboratories do whatever they like in between (Methods and Supplementary Section S3).
Below the threshold the main channel is open, and two unprotected positions per mass do become entangled, although the noise slows them down (Figure 2 b, blue). The threshold is not a knife edge. It marks where gravity’s leading effect stops working; the weaker effects let unprotected superpositions entangle slightly beyond it (Methods).
In laboratory terms, the threshold for the running example is Λ c = 6.9 × 10 5 m − 2 s − 1 \Lambda_c = 6.9 \times10^5\ \mathrm{m}^{-2}\,\mathrm{s}^{-1} Λ c = 6.9 × 1 0 5 m − 2 s − 1 , which corresponds to a force noise of 1.2 × 10 − 5 N H z − 1 / 2 1.2 \times10^{-5}\ \mathrm{N\,Hz}^{-1/2} 1.2 × 1 0 − 5 N Hz − 1/2 (Figure 2 c): in a band of one hertz, fluctuations of less than a hundred-thousandth of the weight of a single hydrogen atom. The threshold rises with the product of the masses and falls with the cube of their separation, so heavier and closer masses can afford more noise.
A shield that hides too much
If the noise is too strong for unprotected masses, the natural response is to shield them with error correction. To see what a shield does to gravity, look at what a code must hide (Figure 3 a).
Figure 3. A shield against noise also hides a mass from gravity. a, The two encoded states of a code (0 and 1) are patterns of positions. Without a shield they may differ in average position. To detect random kicks they must share their average position and can first differ in spread; to correct kicks they must share the spread as well and can first differ in their three-lobed shape. Gravity can use only what differs, so the interaction between the encoded states falls as 1 / d 3 1/d^3 1/ d 3 , 1 / d 5 1/d^5 1/ d 5 and 1 / d 7 1/d^7 1/ d 7 . b, The six-position code: the encoded states are the two triangles of a hexagon, and the partner mass carries the mirror image. c, The fastest possible entanglement against separation; the labels give the slopes, that is, the powers of distance. Blue: the exact noiseless limit of Eq. (2) (dashed where its proof does not apply). Green and orange: codes that detect and codes that correct random kicks. Each band runs from an explicit code (four positions on a square, six on a hexagon) up to the limit that no code can exceed, so the best possible value lies inside the band. For correcting codes this is a rate that can be reached under noise; for detecting codes it is only the interaction between the encoded states. d, Why a hexagon beats a line. Gravity looks at a code from every direction ϕ \phi ϕ around the line joining the masses; the distance from the centre of the plot shows how strong a three-lobed signal it sees from each direction. The best code on a line shows 1 / 4 1/4 1/4 from all directions, the hexagon ( 1 + 3 cos 2 ϕ ) / 4 (1 + 3\cos^2\phi)/4 ( 1 + 3 cos 2 ϕ ) /4 , and no code can show more than 0.713 on (root-mean-square) average (dashed).
A code stores one quantum bit in two states of a mass, the encoded states 0 and 1; each is a pattern of positions. Protection comes in two standard grades[23 ] . A code detects a random kick if one can always tell that a kick has happened without disturbing what is stored. For that, the two encoded states must have the same average position; otherwise the kick, which acts on position, would treat them differently. A code corrects a kick if the damage can also be undone. For that the two states must, in addition, have the same spread in every direction.
Gravity recognizes a mass by these same features. From a distance, a pattern of positions pulls on its partner first through its average position (physicists say its dipole), then through its spread (its quadrupole), then through its three-lobed shape (its octupole), and so on, each feature reaching less far than the one before. And a feature can help to entangle the two encoded bits only if it differs between the encoded states; a feature they share tells the partner nothing about which state is present.
Put the two together, and the consequence can be read off Figure 3 a. Without a shield, gravity uses the average positions, and the encoded bits interact with a strength that falls as 1 / d 3 1/d^3 1/ d 3 . If kicks can be detected, the average positions are hidden; the first usable feature is the spread, and the interaction falls as 1 / d 5 1/d^5 1/ d 5 . If kicks can be corrected, averages and spreads are both hidden; only the three-lobed shapes remain, and the interaction falls as 1 / d 7 1/d^7 1/ d 7 . The shield and the price are one and the same thing, and each further grade of protection costs two more powers of r / d r/d r / d . (Detection by itself does not remove the noise. It is the stepping stone that explains what correction costs.)
That the leading effect cancels under exact correction was shown by Wang and colleagues, who also found the faster fall-off in one family of codes[13 ] . The question we now answer is whether a better code could avoid the loss.
The best possible shield
It cannot. Take any code that corrects random kicks exactly. It may use any number of positions, store more than one quantum bit, and enlist extra quantum memories in its laboratory. Let the correction be applied as often as one likes, with the record of the errors discarded after each round, which is the simplest way to use a code. Our third result is that, at large separation, the best capacity C p r o t C_{\mathrm{prot}} C prot of all such codes satisfies
295 32 ≤ C p r o t β g 0 u 6 ≤ 10.177583 … + O ( u ) . (5) \frac{295}{32} \le\frac{C_{\mathrm{prot}}}{\beta g_0 u^6} \le10.177583\ldots+ O(u). \tag*{(5)} 32 295 ≤ β g 0 u 6 C prot ≤ 10.177583 … + O ( u ) . (5)
So the best shielded rate falls as 1 / d 7 1/d^7 1/ d 7 , four powers of distance faster than the unshielded limit, and the number in front is known to about 10%. A slightly weaker limit of the same form holds at every separation, not only far away (Figure 3 c), and the pattern continues: codes that correct stronger classes of position errors lose four further powers of r / d r/d r / d for each class (Methods).
The lower value in Eq. (5) comes from a code of appealing simplicity (Figure 3 b). Take six positions at the corners of a regular hexagon, in a plane that contains the line between the masses, and let the two encoded states be the two triangles formed by alternate corners. Each triangle is the other one reflected through the centre. Such a reflection leaves averages and spreads unchanged and reverses every three-lobed feature. The two triangles therefore share their average position and their spread, as correction demands, and have opposite three-lobed shapes, which is all that gravity can still use. With the mirror-image hexagon at the partner mass, the two encoded bits interact with a strength of at least
g h e x ≥ 295 32 g 0 u 6 , (6) g_{\mathrm{hex}} \ge\frac{295}{32} g_0 u^6, \tag*{(6)} g hex ≥ 32 295 g 0 u 6 , (6)
and entangle at the rate β g h e x \beta g_{\mathrm{hex}} β g hex . This is not only a property of an idealized code: with smooth wavepackets and sufficiently frequent ideal correction, the rate is approached under the uniform random forces of the previous section, whatever their strength (Supplementary Section S4). Polygon arrangements of this kind have been studied before under the name of quantum spherical codes[24 ] .
How good is the hexagon? Among all codes whose positions lie in a plane, however tilted and however much they store, 295 / 32 295/32 295/32 is the best possible number in Eq. (5) . Over all codes in three dimensions the number cannot exceed 10.18, so at large separation the hexagon delivers at least 90% of what any code could. Codes confined to the line between the masses, by contrast, cannot do better than 5 / 4 5/4 5/4 in place of 295 / 32 295/32 295/32 , a value reached by a code from quantum sensing[12 ] : the hexagon beats every one of them by a factor of 59 / 8 ≈ 7.4 59/8 \approx7.4 59/8 ≈ 7.4 .
This last number has a pleasing explanation (Figure 3 d). Gravity inspects the three-lobed shape of a code from every direction around the line joining the masses, and the rate depends on the average of the square of what it finds. A code on the line looks the same from all sides and offers a signal of 1 / 4 1/4 1/4 . The hexagon, seen from an angle ϕ \phi ϕ to its own plane, offers ( 1 + 3 cos 2 ϕ ) / 4 (1 + 3\cos^2\phi)/4 ( 1 + 3 cos 2 ϕ ) /4 : four times as much face-on, and never less. Averaging the square gives exactly 59 / 8 59/8 59/8 .
The statement “within 10%” concerns large separations. In the running example, where d = 3.6 r d = 3.6\,r d = 3.6 r , the hexagon runs at 2.2% of the noiseless speed limit, while the general limit allows correcting codes up to 15.5%: there the hexagon is within a factor of seven of the best possible code, and the gap narrows to 10% only as the masses move apart. Exact correction with discarded error records is one strategy among many. Above the noise threshold it achieves a rate falling as 1 / d 7 1/d^7 1/ d 7 , while Eq. (4) forbids only rates above 1 / d 4 1/d^4 1/ d 4 . Whether some other strategy can do better in between is open.
The bill, in seconds
Entanglement has to be demonstrated, not just made, and the speed limits also say how long a demonstration must take. Suppose an experiment ends with a test. The test may raise a false alarm, reporting entanglement when there is none, with probability at most α \alpha α ; and it detects entanglement with probability p p p when the experiment works as intended. We prove that the time for which the masses interact, averaged over many repetitions of the experiment, must satisfy
T ‾ ≥ 1 C [ p log 2 p α + ( 1 − p ) log 2 1 − p 1 − α ] , (7) \overline{T} \ge\frac{1}{C}\left[p\log_2\frac{p}{\alpha} + (1-p)\log_2\frac{1-p}{1-\alpha}\right], \tag*{(7)} T ≥ C 1 [ p log 2 α p + ( 1 − p ) log 2 1 − α 1 − p ] , (7)
where C C C is the speed limit that applies (C G C_G C G without a shield). The bracket counts the bits of evidence that the test provides; for 1% false alarms and 95% detection it is 6.0 bits. The bound allows any measurement, feedback and stopping rule. Without a shield it is essentially the truth: as α \alpha α becomes small, the least possible time approaches ( p / C G ) log 2 ( 1 / α ) (p/C_G)\log_2(1/\alpha) ( p / C G ) log 2 ( 1/ α ) , and we give protocols that reach it.
Table I lists what this means for the running example. Without a shield, no experiment can make its case in less than 100 seconds of interaction, noise or no noise, and an explicit protocol with smooth finite-energy wavepackets and purely local measurements does it in 300 seconds (Supplementary Section S6). With a shield, every fixed exactly correcting code with discarded error records needs at least 648 seconds (Figure 4 a). The hexagon’s coupling needs 1,119 seconds to turn two unentangled encoded bits into one Bell pair, where two unshielded positions need 25 seconds.
Figure 4. The bill. a, Least interaction time needed to demonstrate entanglement with 1% false alarms and 95% detection, for two masses of 10 − 14 10^{-14} 1 0 − 14 kg in regions of radius 125 μ \mu μ m, against their separation. Lines are limits from Eq. (7) : no experiment of the stated kind can be faster. Filled circles: the limits at 450 μ \mu μ m. Open squares: explicit protocols, without a shield and without noise (300 s), and with a shield in the presence of noise (19.6 h). b, An imperfect shield. Horizontal axis: the calibrated correction imperfection δ \delta δ (Methods). Vertical axis: an upper bound on the coherent entangling rate retained by the code, in units of β g 0 \beta g_0 β g 0 . For a good shield the bound approaches the flat 1 / d 7 1/d^7 1/ d 7 ceiling. Beyond δ ≈ ( r / d ) 2 \delta\approx(r/d)^2 δ ≈ ( r / d ) 2 , its allowance for gravity’s main coupling (dotted lines) takes over.
Two rules of thumb summarize the bill. In time, shielding against random forces with the hexagon costs a factor that grows as ( d / r ) 4 (d/r)^4 ( d / r ) 4 : 45 in the running example, about 2,200 at d = 10 r d = 10r d = 10 r . In mass, since every rate grows as the product of the masses, the lost speed is bought back by making both masses heavier by a factor that grows as ( d / r ) 2 (d/r)^2 ( d / r ) 2 : 6.7 in the running example, 47 at d = 10 r d = 10r d = 10 r .
When the shield is imperfect
No real shield is perfect, infinitely fast, or faced only with uniform forces. Three further results show how the picture bends (Methods and Supplementary Section S7). First, a leaky shield leaks in both directions. If a code hides the average position and the spread only approximately, gravity’s main coupling leaks back in (Figure 4 b). The 1 / d 7 1/d^7 1/ d 7 law describes shields whose calibrated correction imperfection δ \delta δ (defined in Methods) is below about ( r / d ) 2 (r/d)^2 ( r / d ) 2 . A leakier code keeps some of the stronger 1 / d 3 1/d^3 1/ d 3 coupling, but in the codes we construct it also lets the noise back in.
Second, the kind of noise matters. A uniform random force is removed completely by the hexagon code. Noise that can tell the six positions apart, such as scattering events that reveal where the mass is, is not: it leaves a residual loss of coherence that no speed of correction removes, and for the continuously corrected hexagon, two equal logical superpositions become entangled only if the coupling exceeds half the residual rate on each mass, when those rates are equal. The residual loss belongs to the hexagon, not to the noise: we construct another family of codes that approaches a perfect Bell pair for any finite strength of the Gaussian localization noise considered here, at fixed geometry and bounded average kinetic energy, at the price of longer interaction times and ever finer control.
Table 1. The bill for the running example. Two masses of 10 − 14 10^{-14} 1 0 − 14 kg, r = 125 μ m r = 125\,\mu\mathrm{m} r = 125 μ m , d = 450 μ m d = 450\,\mu\mathrm{m} d = 450 μ m . The first two rows refer to a demonstration of entanglement with 1% false alarms and 95% detection (96% for the 19.6-hour protocol).
Third, correcting at a finite rate is a balancing act. Wait too long between corrections and errors pile up; correct too often and the imperfections of the corrections pile up instead. A fully worked example, with noise that resolves the positions, shows the scale of the task. About 28,000 corrections, one every 0.04 seconds and each with a complete-cycle error below one part in a million, yield a Bell pair of fidelity at least 0.817; a value above 0.5 certifies entanglement, and 1 is a perfect pair. Repeating this independently 63 times, 19.6 hours of interaction in
all, demonstrates entanglement with 1% false alarms and 96% detection, provided that the final readout is ideal and each run is prepared within trace distance 0.1% of its target. These figures are requirements on a future apparatus, not a claim that one exists.
Discussion
We set out with three questions and found three speed limits (Table II). Left undisturbed, gravity entangles two masses at a rate that is now known exactly; it falls as the cube of their separation, and two positions per mass are all it takes. Random forces above a threshold fixed by the masses and their separation close gravity’s main channel, and whatever is done about it the rate then falls at least as the fourth power. Shielding the masses by exact, continuously applied error correction removes the noise but hides the masses from each other, so that the rate falls as the seventh power, and six positions on a hexagon deliver, at large separation, nearly all that any such shield can.
One idea runs through all three. Gravity and random forces act on a mass through its position, so that whatever takes position away from the noise takes it away from gravity. Strong noise does this crudely, by scrambling the position until the leading gravitational effect could as well be a classical message. Error correction does it deliberately, by storing the quantum bit in features of the mass that a kick cannot reach, and gravity can barely reach them either. Seen this way, the limits are not peculiar to gravity. They use only the inverse-distance form of the interaction, and so apply equally to the electric force between two charges under the same model assumptions. Gravity is simply the case in which the interaction is so weak that the price decides whether an experiment is possible.
For those planning experiments, the results amount to a set of signposts. If the random forces are below the threshold of Eq. (3) , no shield is required in principle, and the target is the noiseless limit of Eq. (2) , reduced by the noise. If they are above it, the 1 / d 3 1/d^3 1/ d 3 law is gone for good. Exact correction then offers a rate that is immune to the noise but smaller by roughly ( r / d ) 4 (r/d)^4 ( r / d ) 4 , to be won back with heavier masses or with superpositions that are wider relative to their separation. The best design also changes shape: without a shield, the useful superposition lies along the line between the masses; with one, it spreads into a plane.
Our results rest on earlier ones. The imitation of the leading gravitational effect by measurement and messaging is due to Kafri, Taylor and Milburn[14 ] , and its noise condition in general form to Li, Miki and Chen[15 ] ; we extend it from the leading effect to the complete potential and to every strategy. The cancellation under exact correction and the recoverability of entanglement under noise are due to Wang, Pedernales and Plenio[13 ] ; we add the limits that hold for all codes and the code that nearly reaches them. The codes themselves come from quantum sensing and from quantum spherical codes[12 , 24 ] , and larger superpositions and other geometries have been explored before[25 , 26 ] .
The limits also have edges, and it is as well to mark them. They concern Newton’s potential between masses confined to two regions, with ideal local control. The noise threshold assumes random forces that are uniform, memoryless and independent for the two masses. The shielded limit assumes fixed codes that correct exactly and continuously, with error records discarded. Within these assumptions the limits are proved; beyond them they are reference points. Noise with memory can change quantum-correlation dynamics and state-evolution speed limits[27 ] .
The most interesting open question lies between two of our limits. Above the noise threshold, no strategy can beat 1 / d 4 1/d^4 1/ d 4 , and exact correction reaches 1 / d 7 1/d^7 1/ d 7 . Strategies that only detect errors and discard the runs in which one occurred, or that keep the error record, might do better;
caption: TABLE II. Three speed limits. Rates are in Bell pairs per unit time; g 0 = G m A m B / ℏ d g_0=Gm_Am_B/\hbar d g 0 = G m A m B /ℏ d is the natural gravitational rate of the pair, u = r / d u=r/d u = r / d the ratio of region size to separation, and β = 1.9123 \beta=1.9123 β = 1.9123 . The second and third rows show the behaviour at large separation; the complete expressions are in Methods.
deciding this means counting the failed attempts and following what happens to the runs that survive. Also open are the exact number in front of the shielded limit, which lies between 295 / 32 295/32 295/32 and 10.18 10.18 10.18 , the capacity when the regions nearly touch, and the effect of a common limit on energy or on the speed of control. Above all, a physical way to carry out the correction on the motion of a mass, with the accuracy that our examples demand, has yet to be invented. Gravity’s pull between two specks of matter is the faintest thing anyone has proposed to entangle with. The limits found here say how quickly that can happen at best, and what it costs to listen for it through the noise.
Methods
a. Model and capacity. The two laboratories contain the masses, confined to balls of radius r r r with centre separation d > 2 r d>2r d > 2 r , and arbitrary auxiliary systems. The only coupling is Eq. (1) . Local Hamiltonians, including kinetic and confining terms, local operations, measurements and classical communication are unrestricted. The initial state is separable; any entangled resource that a protocol uses must be generated by the interaction, and its time is counted. The capacity is the supremum of achievable rates of Bell pairs per unit interaction time with vanishing error[16 ] . Protocols with continuous position are limits of finite protocols using wavepackets of finite energy; no common bound on energy is imposed along the sequence. We use G = 6.67430 × 10 − 11 G=6.67430\times10^{-11} G = 6.67430 × 1 0 − 11 and ℏ = 1.054571817 × 10 − 34 \hbar=1.054571817\times10^{-34} ℏ = 1.054571817 × 1 0 − 34 in SI units. In the running example g 0 = 0.1406 s − 1 g_0=0.1406\,\mathrm{s}^{-1} g 0 = 0.1406 s − 1 and u = 1 / 3.6 u=1/3.6 u = 1/3.6 ; the capacity and the 100-second bound are evaluated with r = 125.001 μ m r=125.001\,\mathrm{\mu m} r = 125.001 μ m , which leaves room for packets of width 1 nm centred at 125 μ m 125\,\mathrm{\mu m} 125 μ m .
b. Entanglement rate of a sum of products. All bounds rest on one inequality. Suppose that, apart from terms acting on one laboratory only, the interaction is H = ∑ ν A ν ⊗ B ν H=\sum_\nu A_\nu\otimes B_\nu H = ∑ ν A ν ⊗ B ν (or an integral of this form) with ∑ ν A ν 2 ≤ Q A 2 \sum_\nu A_\nu^2\le Q_A^2 ∑ ν A ν 2 ≤ Q A 2 and ∑ ν B ν 2 ≤ Q B 2 \sum_\nu B_\nu^2\le Q_B^2 ∑ ν B ν 2 ≤ Q B 2 . For a pure state of the two laboratories with Schmidt decomposition ∑ i p i ∣ u i ⟩ ∣ v i ⟩ \sum_i\sqrt{p_i}\lvert u_i\rangle\lvert v_i\rangle ∑ i p i ∣ u i ⟩ ∣ v i ⟩ , the Cauchy–Schwarz inequality gives ∑ j ∣ ⟨ u i v i ∣ H ∣ u j v j ⟩ ∣ ≤ Q A Q B \sum_j\lvert\langle u_i v_i\lvert H\lvert u_j v_j\rangle\rvert\le Q_AQ_B ∑ j ∣⟨ u i v i ∣ H ∣ u j v j ⟩∣ ≤ Q A Q B , and with 2 p i p j ∣ log 2 ( p i / p j ) ∣ ≤ β ( p i + p j ) 2\sqrt{p_ip_j}\lvert\log_2(p_i/p_j)\rvert\le\beta(p_i+p_j) 2 p i p j ∣ log 2 ( p i / p j )∣ ≤ β ( p i + p j ) the entanglement entropy S S S obeys
∣ d S d t ∣ ≤ β Q A Q B ℏ , \left\lvert\frac{dS}{dt}\right\rvert\le\frac{\beta Q_AQ_B}{\hbar}, d t d S ≤ ℏ β Q A Q B ,
β = max 0 < q < 1 / 2 2 q ( 1 − q ) log 2 1 − q q = 1.9123 … (8) \beta=\max_{0<q<1/2}2\sqrt{q(1-q)}\log_2\frac{1-q}{q}
=1.9123\ldots \tag*{(8)} β = 0 < q < 1/2 max 2 q ( 1 − q ) log 2 q 1 − q = 1.9123 … (8)
The bound does not depend on the dimensions of the systems or of their memories[18 , 21 , 22 ] . Local operations with recorded outcomes do not increase the average entropy of the resulting pure states, and producing n n n Bell pairs requires entropy n − o ( n ) n-o(n) n − o ( n ) , so the capacity is at most β Q A Q B / ℏ \beta Q_AQ_B/\hbar β Q A Q B /ℏ . Unbounded local Hamiltonians and infinite-dimensional systems are treated in Supplementary Section S2.
c. Noiseless capacity. Reflect the axial coordinate of B B B , c = ( b ⊥ , − b z ) c=(b_\perp,-b_z) c = ( b ⊥ , − b z ) . For a two-dimensional wavevector k k k , define f a ( k ) = e ( − d / 2 − a z ) k ∣ ( cos k ⋅ a ⊥ , sin k ⋅ a ⊥ ) ⟩ f_a(k)=e^{(-d/2-a_z)k}\lvert(\cos k\cdot a_\perp,\sin k\cdot a_\perp)\rangle f a ( k ) = e ( − d /2 − a z ) k ∣( cos k ⋅ a ⊥ , sin k ⋅ a ⊥ )⟩ . With the measure d 2 k / ( 2 π ∣ k ∣ ) d^2k/(2\pi\lvert k\rvert) d 2 k / ( 2 π ∣ k ∣) , ⟨ f a , f c ⟩ = 1 / ∣ d e z + b − a ∣ \langle f_a,f_c\rangle=1/\lvert d e_z+b-a\rvert ⟨ f a , f c ⟩ = 1/ ∣ d e z + b − a ∣ [20 ] . Subtracting the common function c 0 = ( f r e z + f − r e z ) / 2 c_0=(f_{re_z}+f_{-re_z})/2 c 0 = ( f r e z + f − r e z ) /2 changes only local terms. We show that ∥ f a − c 0 ∥ 2 ≤ 1 4 [ 1 d − 2 r + 1 d + 2 r − 2 d ] \lVert f_a-c_0\rVert^2\le\frac14\left[\frac1{d-2r}+\frac1{d+2r}-\frac2d\right] ∥ f a − c 0 ∥ 2 ≤ 4 1 [ d − 2 r 1 + d + 2 r 1 − d 2 ] for every a a a with d ≥ ( 1 + 5 ) r d\ge(1+\sqrt5)r d ≥ ( 1 + 5 ) r . Equation (8) then gives C G ≤ β κ G C_G\le\beta\kappa_G C G ≤ β κ G , κ G = G m A m B 4 ℏ [ 1 d − 2 r + 1 d + 2 r − 2 d ] = g 0 2 u 2 / ( 1 − 4 u 2 ) \kappa_G=\frac{Gm_Am_B}{4\hbar}\left[\frac1{d-2r}+\frac1{d+2r}-\frac2d\right]=g_0\,2u^2/(1-4u^2) κ G = 4ℏ G m A m B [ d − 2 r 1 + d + 2 r 1 − d 2 ] = g 0 2 u 2 / ( 1 − 4 u 2 ) . Two packets at ± r e z \pm re_z ± r e z on each mass realize the interaction ℏ κ G Z ⊗ Z \hbar\kappa_G Z\otimes Z ℏ κ G Z ⊗ Z between their labels, whose capacity is β κ G \beta\kappa_G β κ G [16 , 18 , 19 ] . The full proof, the approximation by packets of finite energy, the strict loss of capacity under a history-wise kinetic-energy budget for equal masses on a line, and the near-contact advantage of three positions are in Supplementary Sections S2 and S8.
d. Noise threshold and the bound for every strategy. The noise changes the state ρ \rho ρ of the two masses at the rate
− ∑ i = x , y , z ( Λ A [ a i , [ a i , ρ ] ] + Λ B [ b i , [ b i , ρ ] ] ) , -\sum_{i=x,y,z}\left(\Lambda_A[a_i,[a_i,\rho]]+\Lambda_B[b_i,[b_i,\rho]]\right), − i = x , y , z ∑ ( Λ A [ a i , [ a i , ρ ]] + Λ B [ b i , [ b i , ρ ]] ) ,
with the environment inaccessible. The leading term of the potential is
V d i p = ( G m A m B / d 3 ) ( 2 a z b z − a x b x − a y b y ) . V_{\mathrm{dip}}=(Gm_Am_B/d^3)(2a_zb_z-a_xb_x-a_yb_y). V dip = ( G m A m B / d 3 ) ( 2 a z b z − a x b x − a y b y ) .
Consider one component, with operators X X X on A A A and Y Y Y on B B B , coupling ℏ g X ⊗ Y \hbar gX\otimes Y ℏ g X ⊗ Y and eigenvalues x , η x,\eta x , η . Over a time t t t the coupling and the noise multiply the matrix element between ( x , η ) (x,\eta) ( x , η ) and ( x ′ , η ′ ) (x',\eta') ( x ′ , η ′ ) by exp { t [ − i g ( x η − x ′ η ′ ) − Λ A ( x − x ′ ) 2 − Λ B ( η − η ′ ) 2 ] } \exp\{t[-ig(x\eta-x'\eta')-\Lambda_A(x-x')^2-\Lambda_B(\eta-\eta')^2]\} exp { t [ − i g ( x η − x ′ η ′ ) − Λ A ( x − x ′ ) 2 − Λ B ( η − η ′ ) 2 ]} . Let A A A perform the measurement with operators M y ∝ exp [ − k t ( X − y ) 2 ] M_y\propto\exp[-kt(X-y)^2] M y ∝ exp [ − k t ( X − y ) 2 ] , announce the outcome y y y , and let B B B apply exp ( − i g t y Y ) \exp(-igtyY) exp ( − i g t y Y ) . Averaged over y y y , this multiplies the same element by exp { t [ − k 2 ( x − x ′ ) 2 − g 2 8 k ( x + x ′ ) 2 − g 2 8 k ( η − η ′ ) 2 ] } \exp\{t[-\frac{k}{2}(x-x')^2-\frac{g^2}{8k}(x+x')^2-\frac{g^2}{8k}(\eta-\eta')^2]\} exp { t [ − 2 k ( x − x ′ ) 2 − 8 k g 2 ( x + x ′ ) 2 − 8 k g 2 ( η − η ′ ) 2 ]} . Composing it with the mirror-image procedure of strength k ′ k' k ′ reproduces the phase exactly, with dampings k 2 + g 2 8 k \frac{k}{2}+\frac{g^2}{8k} 2 k + 8 k g 2 and k ′ 2 + g 2 8 k ′ \frac{k'}{2}+\frac{g^2}{8k'} 2 k ′ + 8 k ′ g 2 . With k k ′ = g 2 / 4 kk'=g^2/4 k k ′ = g 2 /4 these are k k k and k ′ k' k ′ , which can be kept below Λ A \Lambda_A Λ A and Λ B \Lambda_B Λ B if and only if Λ A Λ B ≥ g 2 / 4 \Lambda_A\Lambda_B\ge g^2/4 Λ A Λ B ≥ g 2 /4 ; what is left is local dephasing[14 , 15 , 28 ] . The strongest requirement, for the z z z component, is Eq. (3) .
During a period in which only the potential and the noise act, all position operators commute, so the evolution factors into this locally imitable channel, local phases and the unitary generated by the remainder W = V − V d i p W=V-V_{\rm dip} W = V − V dip . Equation (8) bounds the entropy produced by W W W ; local operations with recorded outcomes, including those that imitate the leading term, do not increase it on average. The terms of W W W linear in a a a are − ( G m A m B / d 2 ) a ⋅ q ( b ) -(Gm_A m_B/d^2)\,a\cdot\mathbf{q}(b) − ( G m A m B / d 2 ) a ⋅ q ( b ) , where q \mathbf{q} q is the field d 2 ( d e z + b ) ∣ d e z + b ∣ 3 \frac{d^2(d\mathbf{e}_z+b)}{|d\mathbf{e}_z+b|^3} ∣ d e z + b ∣ 3 d 2 ( d e z + b ) without its constant and linear parts; a constant vector may be subtracted from q \mathbf{q} q at the cost of a local term. With q ∗ ( u ) = min c max ∣ b ∣ ≤ r ∣ q ( b ) − c ∣ q_*(u)=\min_c\max_{|b|\le r}|\mathbf{q}(b)-c| q ∗ ( u ) = min c max ∣ b ∣ ≤ r ∣ q ( b ) − c ∣ , the same for the terms linear in b b b , and the series S 2 S_2 S 2 defined below for the rest, B ( u ) = 2 u q ∗ ( u ) + S 2 ( u ) B(u)=2u q_*(u)+S_2(u) B ( u ) = 2 u q ∗ ( u ) + S 2 ( u ) with q ∗ = 9 4 u 2 + O ( u 3 ) q_*=\frac{9}{4}u^2+O(u^3) q ∗ = 4 9 u 2 + O ( u 3 ) . Summing instead all terms of the expansion (9) except the leading one gives the closed form R ( u ) = 2 u 3 ( 3 − 2 u ) / [ ( 1 − 2 u ) ( 1 − u ) ] R(u)=2u^3(3-2u)/[(1-2u)(1-u)] R ( u ) = 2 u 3 ( 3 − 2 u ) / [( 1 − 2 u ) ( 1 − u )] , and the bound proved is C n o i s e ≤ β g 0 min { B ( u ) , R ( u ) } C_{\rm noise}\le\beta g_0\min\{B(u),R(u)\} C noise ≤ β g 0 min { B ( u ) , R ( u )} ; R R R alone gives 32 / 45 32/45 32/45 of the noiseless capacity at d = 6 r d=6r d = 6 r . Evaluating the finite-separation bound gives upper values of B ( u ) / [ 2 u 2 / ( 1 − 4 u 2 ) ] B(u)/[2u^2/(1-4u^2)] B ( u ) / [ 2 u 2 / ( 1 − 4 u 2 )] of 0.98 0.98 0.98 , 0.70 0.70 0.70 , 0.54 0.54 0.54 , 0.37 0.37 0.37 , 0.28 0.28 0.28 and 0.13 0.13 0.13 for d / r = 4 , 5 , 6 , 8 , 10 d/r=4,5,6,8,10 d / r = 4 , 5 , 6 , 8 , 10 and 20 20 20 . The conversion of the entropy bound into a bound on Bell pairs delivered to finite registers, the inclusion of the motion of the masses during the interaction, and the general statement, in which a noise ratio λ = Λ A Λ B / Λ c < 1 \lambda=\sqrt{\Lambda_A\Lambda_B}/\Lambda_c<1 λ = Λ A Λ B / Λ c < 1 adds 2 ( 1 − λ ) u 2 2(1-\lambda)u^2 2 ( 1 − λ ) u 2 to min { B , R } \min\{B,R\} min { B , R } , are proved in Supplementary Section S3; the grey curve of Figure 2 b shows this bound. Below the threshold, two narrow packets at ± s e z \pm s\mathbf{e}_z ± s e z interact with strength κ ( s ) ≥ 2 G m A m B s 2 / ( ℏ d 3 ) \kappa(s)\ge2Gm_A m_Bs^2/(\hbar d^3) κ ( s ) ≥ 2 G m A m B s 2 / ( ℏ d 3 ) and each loses coherence at the rate γ = 4 Λ s 2 \gamma=4\Lambda s^2 γ = 4Λ s 2 ; their state is entangled at some time if and only if γ < 2 κ \gamma<2\kappa γ < 2 κ , and entangled states of two quantum bits can be distilled[29 ] . The blue curve of Figure 2 b is the rate of the hashing protocol[30 ] for this state, maximized over the interaction time; for d = 10 r d=10r d = 10 r it reaches zero at about 0.2 Λ c 0.2\Lambda_c 0.2 Λ c , although the state itself remains entangled at some time for all Λ < Λ c / [ 1 − 4 ( s / d ) 2 ] \Lambda<\Lambda_c/[1-4(s/d)^2] Λ < Λ c / [ 1 − 4 ( s / d ) 2 ] .
e. Shielded codes. Let ζ ϕ ( a ) = a x + i ( a x cos ϕ + a y sin ϕ ) \zeta_\phi(a)=a_x+i(a_x\cos\phi+a_y\sin\phi) ζ ϕ ( a ) = a x + i ( a x cos ϕ + a y sin ϕ ) , so that ∣ ζ ϕ ∣ ≤ r |\zeta_\phi|\le r ∣ ζ ϕ ∣ ≤ r , and let ⟨ ⋅ ⟩ ϕ \langle\cdot\rangle_\phi ⟨ ⋅ ⟩ ϕ denote the average over ϕ \phi ϕ . For d > 2 r d>2r d > 2 r ,
1 ∣ d e z + b − a ∣ = 1 d ∑ j , k ≥ 0 ( j + k j ) ⟨ [ ζ ϕ ( a ) ] j [ − ζ ϕ ( b ) ] k ⟩ ϕ d j + k (9) \frac{1}{|d\mathbf{e}_z+b-a|}=\frac{1}{d}\sum_{j,k\ge0}\binom{j+k}{j}\frac{\left\langle[\zeta_\phi(a)]^j[-\zeta_\phi(b)]^k\right\rangle_\phi}{d^{j+k}} \tag*{(9)} ∣ d e z + b − a ∣ 1 = d 1 j , k ≥ 0 ∑ ( j j + k ) d j + k ⟨ [ ζ ϕ ( a ) ] j [ − ζ ϕ ( b ) ] k ⟩ ϕ (9)
with absolute convergence. The function ζ ϕ j \zeta_\phi^j ζ ϕ j is a harmonic polynomial of degree j j j , a combination of multipole moments of order j j j . Let P P P project onto a code, which may include local auxiliary systems. The code looks alike below order M M M if P h P PhP P h P is a multiple of P P P for every harmonic polynomial h h h of degree less than M M M . Detection of force errors, P q i P ∝ P Pq_iP\propto P P q i P ∝ P , gives M = 2 M=2 M = 2 ; exact correction of force errors, that is, P q i P ∝ P Pq_iP\propto P P q i P ∝ P and P q i q j P ∝ P Pq_iq_jP\propto P P q i q j P ∝ P [23 ] , gives M = 3 M=3 M = 3 ; correction of polynomial errors up to degree N N N gives M = 2 N + 1 M=2N+1 M = 2 N + 1 . Correcting a set of errors amounts to detecting all of their products, which is why each corrected order costs four powers of r / d r/d r / d and each detected order two. With arbitrarily frequent recovery and discarded error records, the encoded systems evolve under ( P A ⊗ P B ) V ( P A ⊗ P B ) (P_A\otimes P_B)V(P_A\otimes P_B) ( P A ⊗ P B ) V ( P A ⊗ P B ) up to local terms[13 ] . Every term of Eq. (9) with j < M j<M j < M or k < M k<M k < M is then local, and each remaining term is the real part of a product of two contractions, which Eq. (8) bounds by β \beta β per unit coefficient. Hence the capacity of the encoded interaction is at most β g 0 S M ( u ) \beta g_0S_M(u) β g 0 S M ( u ) , with S M ( u ) = ∑ j , k ≥ M ( j + k j ) u j + k S_M(u)=\sum_{j,k\ge M}\binom{j+k}{j}u^{j+k} S M ( u ) = ∑ j , k ≥ M ( j j + k ) u j + k .
For the matching codes, take corners r ( sin θ n , cos θ n ) r(\sin\theta_n,\cos\theta_n) r ( sin θ n , cos θ n ) , θ n = n π / M \theta_n=n\pi/M θ n = nπ / M , encoded states the equal superpositions over even and over odd n n n , and the mirror image at the partner. On a corner, ζ ϕ = r ( A e i ϕ + B e − i ϕ ) \zeta_\phi=r(Ae^{i\phi}+Be^{-i\phi}) ζ ϕ = r ( A e i ϕ + B e − i ϕ ) with A = ( 1 + cos ϕ ) / 2 A=(1+\cos\phi)/2 A = ( 1 + cos ϕ ) /2 and B = ( 1 − cos ϕ ) / 2 B=(1-\cos\phi)/2 B = ( 1 − cos ϕ ) /2 . Averaging ζ ϕ j \zeta_\phi^j ζ ϕ j over M M M equally spaced corners keeps only terms e i m ϕ e^{im\phi} e im ϕ with m m m a multiple of M M M ; for j < M j<M j < M these agree for the two encoded states, and for j = M j=M j = M they differ in sign and give the signal r M ( A M + B M ) r^M(A^M+B^M) r M ( A M + B M ) . The ( M , M ) (M,M) ( M , M ) term of Eq. (9) is therefore an interaction ⊗ ⊗ \otimes\otimes ⊗ ⊗ of strength g 0 ( 2 M M ) ( A M + B M ) 2 ϕ u 2 M = g 0 K M u 2 M g_0{2M\choose M}(A^M+B^M)^2\phi^{u2M}=g_0K_Mu^{2M} g 0 ( M 2 M ) ( A M + B M ) 2 ϕ u 2 M = g 0 K M u 2 M , with K M = 2 ( 2 M M ) [ ( 4 M 2 M ) + ( 2 M M ) ] / 16 M K_M=2{2M\choose M}[{4M\choose2M}+{2M\choose M}]/16^M K M = 2 ( M 2 M ) [ ( 2 M 4 M ) + ( M 2 M ) ] /1 6 M , and all further terms add with the same sign. For M = 3 M=3 M = 3 the signal is A 3 + B 3 = ( 1 + 3 cos 2 ϕ ) / 4 A^3+B^3=(1+3\cos^2\phi)/4 A 3 + B 3 = ( 1 + 3 cos 2 ϕ ) /4 and K 3 = 295 / 32 K_3=295/32 K 3 = 295/32 ; a code of six axes has the signal 1 / 4 1/4 1/4 for every ϕ \phi ϕ , which gives 5 / 4 5/4 5/4 ; K 2 = 57 / 16 K_2=57/16 K 2 = 57/16 and K 1 = 2 K_1=2 K 1 = 2 . The ceiling 10.18 10.18 10.18 , the optimality of 295 / 32 295/32 295/32 among planar codes and among interactions that are a single product, the bound for codes on the axis, the realization with smooth wavepackets under white force noise, and the hierarchy for all M M M are proved in Supplementary Sections S4 and S5. At d = 3.6 r d=3.6r d = 3.6 r every exactly correcting code has a rate of at most 0.1548 C G 0.1548C_G 0.1548 C G (Supplementary Section S4); the orange band of Figure 3 c uses a sharper series from the same section. Evaluating the full potential at d = 3.6 r d=3.6r d = 3.6 r gives a hexagon coupling 18% above the leading term of Eq. (6) .
f. Time needed for a test. Resolve a protocol into pure branches ψ h \psi_h ψ h with probabilities w h w_h w h . Equation (8) gives ∑ h w h S ( ψ h ) ≤ C T \sum_h w_hS(\psi_h)\le C T ∑ h w h S ( ψ h ) ≤ C T . Removing the coherence of each branch in its Schmidt basis gives a separable state at relative entropy S ( ψ h ) S(\psi_h) S ( ψ h ) from it. Joint convexity of the relative entropy, and the fact that a measurement cannot increase it, give Eq. (7) for any test whose false-alarm probability is bounded for all separable states of the complete laboratories. The overall necessary capacity bound is attained to leading order by generating log 2 ( 1 / α ) + O ( 1 ) \log_2(1/\alpha)+O(1) log 2 ( 1/ α ) + O ( 1 ) Bell pairs with probability close to p p p and verifying them with local measurements[31 , 32 ] (Supplementary § 1.24 ). For exactly correcting codes the same argument with the bound β g 0 S 3 ( u ) \beta g_0 S_3(u) β g 0 S 3 ( u ) gives the time quoted in the text (Supplementary § 1.14 and § 1.24 ).
g. Imperfect shields and worked examples. For each fixed code, apply the position-error calibration channel defined in Supplementary Section S7 § 1.33 . Let δ \delta δ bound the half-diamond distance of its complementary channel from a constant channel, after encoding. Thus δ \delta δ measures how much the calibration environment can learn about the encoded state. For two codes with defect at most δ \delta δ , the coherent capacity of the compressed interaction is at most
β g 0 [ 16 δ 2 u 2 ( 1 − 2 u ) 3 + 16 2 δ u 4 ( 1 − 2 u ) 5 + 20 u 6 ( 1 − 2 u ) 7 ] , (10) \beta g_0 \left[\frac{16\delta^2 u^2}{(1-2u)^3}+\frac{16\sqrt{2}\,\delta u^4}{(1-2u)^5}+\frac{20u^6}{(1-2u)^7}\right], \tag*{(10)} β g 0 [ ( 1 − 2 u ) 3 16 δ 2 u 2 + ( 1 − 2 u ) 5 16 2 δ u 4 + ( 1 − 2 u ) 7 20 u 6 ] , (10)
which is plotted in Figure 4 b. This bound, the codes that attain its first and last terms, the residual loss of coherence under noise that resolves the positions, the finite-rate correction example (Gaussian localization noise, 27,986 intervals, complete-cycle error at most 10 − 6 10^{-6} 1 0 − 6 , Bell fidelity at least 0.817, 51 passes in 63 runs) and the twelve-run unshielded protocol are derived in Supplementary § 1.24 and S7. A recovery of the calibration channel with worst-case entanglement infidelity ε \varepsilon ε has δ ≤ ε \delta\le\sqrt{\varepsilon} δ ≤ ε ; this does not identify δ \delta δ with a physical cycle-failure probability. In the worked example, coherences separated by L L L decay at rate Γ ( L ) = Λ 0 [ 1 − e − L 2 / ( 4 r c 2 ) ] \Gamma(L)=\Lambda_0[1-e^{-L^2/(4r_c^2)}] Γ ( L ) = Λ 0 [ 1 − e − L 2 / ( 4 r c 2 ) ] , with r c = 1.397542486 r_c=1.397542486 r c = 1.397542486 mm and Γ ( r c ) = 0.025 s − 1 \Gamma(r_c)=0.025\,\mathrm{s}^{-1} Γ ( r c ) = 0.025 s − 1 . The complete joint-cycle error is a half-diamond distance, including drift, reset, leakage and recorded flags. The Bell fidelity and detection probability assume trusted ideal logical readout, independent target preparations and initialization within trace distance 0.001. All 63 runs are counted, and at least 51 passes are required.
Acknowledgments
E.P. acknowledges support by the project skQCI (Slovak Quantum Communication Infrastructure), co-funded by the European Union under the Digital Europe Programme, grant agreement No. 101091548, as part of the EuroQCI initiative.
How to read the Supplement
We follow the questions in the article. Section S2 proves the noiseless speed limit; Section S3 adds force noise and bounds what any local strategy can retain. Sections S4 and S5 explain what an exactly correcting code hides from gravity and why a hexagon retains nearly the largest possible rate. We then turn rates into finite records in Section S6, and examine finite recovery, localization noise and imperfect correction in Section S7. Section S8 supplies the extensions to other geometries, energy constraints and finite confinement.
The physical model and units
Each laboratory contains one mass and any local auxiliary systems it needs. In the three-dimensional model the mass positions are a \mathbf{a} a and b \mathbf{b} b , measured from the centres of balls of radius r r r . The centres are separated by d > 2 r d > 2r d > 2 r along the unit vector e z \mathbf{e}_z e z . The only interaction between laboratories is
V ( a , b ) = − G m A m B ∣ d e z + b − a ∣ . V(\mathbf{a},\mathbf{b})=-\frac{Gm_A m_B}{\lvert d\mathbf{e}_z+\mathbf{b}-\mathbf{a}\rvert}. V ( a , b ) = − ∣ d e z + b − a ∣ G m A m B .
Here G G G is Newton’s constant and m A , m B m_A,m_B m A , m B are the masses. The condition d > 2 r d > 2r d > 2 r keeps the denominator positive throughout the allowed position domains. Terms that act on only one laboratory can change its local state, but cannot create entanglement between laboratories. We therefore remove such terms when bounding the entangling rate, and state explicitly whenever a later estimate must control them as well.
Two scales recur:
u = r d < 1 2 , g 0 = G m A m B ℏ d . u=\frac{r}{d}<\frac{1}{2},\qquad g_0=\frac{Gm_A m_B}{\hbar d}. u = d r < 2 1 , g 0 = ℏ d G m A m B .
The ratio u u u is dimensionless. The rate g 0 g_0 g 0 has units of inverse seconds. Consequently g 0 u 2 g_0u^2 g 0 u 2 , g 0 u 3 g_0u^3 g 0 u 3 and g 0 u 6 g_0u^6 g 0 u 6 scale respectively as d − 3 d^{-3} d − 3 , d − 4 d^{-4} d − 4 and d − 7 d^{-7} d − 7 when the masses and region sizes are fixed. We sometimes write G = G m A m B \mathcal{G}=Gm_A m_B G = G m A m B to shorten formulas. In the collinear model the position coordinates are x , y ∈ [ − r , r ] x,y\in[-r,r] x , y ∈ [ − r , r ] and the potential is − G / ( d + y − x ) -\mathcal{G}/(d+y-x) − G / ( d + y − x ) . A result proved only for that model is identified as collinear.
What a rate, an error and a time mean
Entanglement is measured in bits: one ideal Bell pair contains one bit of entanglement. The capacity C G C_G C G of the article is also denoted C G ( 3 ) C_G^{(3)} C G ( 3 ) in the three-dimensional proof. It is the supremum of asymptotic Bell-pair rates, with vanishing output error, per unit time during which the interaction acts. The numerical constant β = 1.9123 … \beta=1.9123\ldots β = 1.9123 … converts the strength κ \kappa κ of a two-qubit interaction ℏ κ Z ⊗ Z \hbar\kappa Z\otimes Z ℏ κ Z ⊗ Z into its capacity β κ \beta\kappa β κ ; Section S2 defines the optimization that gives β \beta β . A Bell-pair preparation time, an asymptotic capacity and the time needed to reject a classical alternative are distinct quantities. Section S6 connects them.
Local operations and classical communication, abbreviated LOCC, are free in the capacity model. The laboratories begin in a separable state. An entangled resource used later must first be generated, and that interaction time is counted. Local control is otherwise unrestricted unless a result explicitly imposes an energy, cycle-error or duration constraint. In particular, a limit of finite-energy packet protocols does not impose one common energy bound on the entire sequence.
Logarithms denoted log 2 \log_2 log 2 give information in bits; ln \ln ln denotes the natural logarithm. Later channel-testing sections sometimes use natural relative entropy and state that convention locally. A factor ln 2 \ln2 ln 2 converts bits to natural-log units. Trace distance means 1 2 ∥ ρ − σ ∥ 1 \frac{1}{2}\lVert\rho-\sigma\rVert_1 2 1 ∥ ρ − σ ∥ 1 . The half-diamond distance between channels includes arbitrary reference systems; it bounds the change of any outcome probability when one channel replaces the other. An initialization error, a calibration-channel defect and a physical recovery-cycle error concern different maps and are defined separately where used.
Interaction times add over all attempts, including failures. Thus the 19.6-hour example is aggregate interaction time across 63 trials. A mean-time bound allows a random stopping rule and averages over the resulting records; a hard-time bound limits every record. Neither quantity includes a laboratory clock time for local operations unless that time is explicitly charged.
Which kind of noise is being corrected?
The white-force model describes independent, spatially uniform random forces on the masses. A coherence between positions separated by L L L decays at rate Λ L 2 \Lambda L^2 Λ L 2 , where Λ \Lambda Λ has units m − 2 s − 1 \mathrm{m}^{-2}\mathrm{s}^{-1} m − 2 s − 1 . With a two-sided force spectral density S F S_F S F per Cartesian component, Λ = S F / ( 2 ℏ 2 ) \Lambda= S_F/(2\hbar^2) Λ = S F / ( 2 ℏ 2 ) . Its leading error operators are the three position coordinates. Exact correction requires the Knill–Laflamme conditions for these coordinates and their pairwise products, as derived in § 1.14 .
A finite-correlation-length localization process can resolve the individual positions within a code and is a different noise model. Its coherence-decay kernel Γ ( L ) \Gamma(L) Γ ( L ) is introduced in Section S7. The hexagon removes the leading uniform-force term but need not remove this whole kernel. The fixed-mean-energy recovery construction there concerns the specified Gaussian localization kernel with finite rate and positive correlation length.
The protected-capacity bounds concern fixed codes, arbitrarily frequent ideal local recovery, discarded recovery records and the retained logical systems. Their effective Hamiltonian is the potential compressed onto the codes. The all-strategy noisy bound in § 1.11 has a wider scope: it also allows retained quantum recovery systems. Keeping these two settings distinct explains why the noisy upper rate can fall as d − 4 d^{-4} d − 4 while the best fixed, exactly corrected rate falls as d − 7 d^{-7} d − 7 .
The noiseless speed limit
We first prove the noiseless capacity for two sufficiently separated three-dimensional position domains. We bound the entropy production of any state, including local memories, and then approach that bound with two axial packets per mass. The geometric step is to represent the inverse distance as an inner product and bound the radius occupied by these position features. We subsequently give the simulation argument for collinear supports, where the entire interaction can be replaced by an Ising interaction at a specified rate.
Three-dimensional position domains
Let each mass occupy a three-dimensional ball of radius r r r , with centre separation d > 2 r d > 2r d > 2 r . We denote their displacements from the respective centres by a \mathbf{a} a and b \mathbf{b} b , and the unit vector from Alice’s centre to Bob’s by z ^ \hat{\mathbf{z}} z ^ . Their only quantum interaction is the Newtonian potential energy
V ( a , b ) = − G ∣ d z ^ + b − a ∣ , G = G m A m B , ∣ a ∣ , ∣ b ∣ ≤ r . V(\mathbf{a},\mathbf{b})=-\frac{\mathcal{G}}{\lvert d\hat{\mathbf{z}}+\mathbf{b}-\mathbf{a}\rvert},\qquad\mathcal{G}=Gm_A m_B,\qquad\lvert\mathbf{a}\rvert,\lvert\mathbf{b}\rvert\le r. V ( a , b ) = − ∣ d z ^ + b − a ∣ G , G = G m A m B , ∣ a ∣ , ∣ b ∣ ≤ r .
Local confinement is maintained throughout. We retain the ideal-control capacity convention: local operations, noiseless memories and classical communication are free, seed entanglement is generated and counted, and finite protocols are closed in output error. Packet energies are finite in each approximation, without a common energy or bandwidth bound. For extended spherical bodies the minimum centre separation d − 2 r d-2r d − 2 r must also exceed the sum of their physical radii.
Here G G G is Newton’s gravitational constant and m A , m B m_A,m_B m A , m B are the masses. Put β = max 0 < q < 1 / 2 2 q ( 1 − q ) log 2 [ ( 1 − q ) / q ] = 1.91227328895 , … \beta=\max_{0<q<1/2}2\sqrt{q(1-q)}\log_2[(1-q)/q]=1.91227328895,\ldots β = max 0 < q < 1/2 2 q ( 1 − q ) log 2 [( 1 − q ) / q ] = 1.91227328895 , … , the established Ising entropy-rate constant, including arbitrary local ancillas[18 , 19 ] . The variable q q q is a two-level Schmidt probability. The same maximization will bound each pair of Schmidt coefficients of an arbitrary state.
Theorem S1 (Capacity for sufficiently separated equal balls). If d ≥ ( 1 + 5 ) r d \ge(1+\sqrt{5})r d ≥ ( 1 + 5 ) r , then the ideal asymptotic entanglement-generation capacity per aggregate interaction time is
C E ( 3 ) = β G Q 2 ℏ , Q 2 = 1 4 [ 1 d − 2 r + 1 d + 2 r − 2 d ] . (11) C_{E}^{(3)}=\frac{\beta GQ^{2}}{\hbar}, \qquad Q^{2}=\frac{1}{4}\left[\frac{1}{d-2r}+\frac{1}{d+2r}-\frac{2}{d}\right]. \tag*{(11)} C E ( 3 ) = ℏ β G Q 2 , Q 2 = 4 1 [ d − 2 r 1 + d + 2 r 1 − d 2 ] . (11) Axial two-position encodings approach this supremum. No larger spatial encoding or local ancillary memory increases it within the stated class. The separation condition is sufficient; it is not a proved transition point. This theorem determines entanglement capacity, not reversible simulation of the entire three-dimensional interaction.
A real Coulomb feature representation
To bound every spatial encoding at once, we assign a vector f a f_a f a to each allowed position. We choose the vectors so that their inner products reproduce the inverse distance. This converts the spatial optimization into a bound on vector norms. Reflect Bob’s longitudinal coordinate and write c = ( b ⊥ , − b z ) \mathbf{c}=(\mathbf{b}_{\perp},-b_z) c = ( b ⊥ , − b z ) , where ⊥ \perp ⊥ denotes the two coordinates perpendicular to the separation axis. On the real Hilbert space with two components and measure d μ ( k ) = d 2 k / ( 2 π ∣ k ∣ ) d\mu(\mathbf{k})=d^{2}\mathbf{k}/(2\pi\lvert\mathbf{k}\rvert) d μ ( k ) = d 2 k / ( 2 π ∣ k ∣) , where k \mathbf{k} k is a transverse wave vector, define
f a ( k ) = e − ( d / 2 − a z ) ∣ k ∣ ( cos ( k ⋅ a ⊥ ) , sin ( k ⋅ a ⊥ ) ) . f_a(\mathbf{k})=e^{-(d/2-a_z)\lvert\mathbf{k}\rvert}\bigl(\cos(\mathbf{k}\cdot\mathbf{a}_{\perp}),\sin(\mathbf{k}\cdot\mathbf{a}_{\perp})\bigr). f a ( k ) = e − ( d /2 − a z ) ∣ k ∣ ( cos ( k ⋅ a ⊥ ) , sin ( k ⋅ a ⊥ ) ) .
The angular integral over k \mathbf{k} k produces the zeroth-order Bessel function J 0 J_0 J 0 . For h > 0 h>0 h > 0 and u ≥ 0 u\ge0 u ≥ 0 , the polar-coordinate identity ∫ 0 ∞ e − h z J 0 ( u z ) d z = ( h 2 + u 2 ) − 1 / 2 \int_{0}^{\infty}e^{-hz}J_0(uz)\,dz=(h^2+u^2)^{-1/2} ∫ 0 ∞ e − h z J 0 ( u z ) d z = ( h 2 + u 2 ) − 1/2 gives
⟨ f a , f c ⟩ = 1 ( d − a z − c z ) 2 + ∣ a ⊥ − c ⊥ ∣ 2 . (12) \langle f_a,f_c\rangle=\frac{1}{\sqrt{(d-a_z-c_z)^2+\lvert\mathbf{a}_{\perp}-\mathbf{c}_{\perp}\rvert^2}}. \tag*{(12)} ⟨ f a , f c ⟩ = ( d − a z − c z ) 2 + ∣ a ⊥ − c ⊥ ∣ 2 1 . (12)
Here d − a z − c z > 0 d-a_z-c_z>0 d − a z − c z > 0 by d > 2 r d>2r d > 2 r . This is a direct Fourier–Laplace identity; reflection positivity is an established representation principle. For the Coulomb kernel, see Frank and Lieb, Lemma 2.1 and Eq. (2.2)[20 ] ; we have written its real Fourier form explicitly to fix the normalization.
The two axial endpoints suggest the centre c 0 = ( f r z ^ + f − r z ^ ) / 2 \mathbf{c}_0=(f_{r\hat{\mathbf{z}}}+f_{-r\hat{\mathbf{z}}})/2 c 0 = ( f r z ^ + f − r z ^ ) /2 . Their squared distance from this centre is Q 2 Q^2 Q 2 in Eq. (11) . We show that every allowed position lies within that same feature-space radius:
∥ f a − c 0 ∥ 2 ≤ Q 2 ( ∣ a ∣ ≤ r ) . (13) \lVert f_a-\mathbf{c}_0\rVert^2\le Q^2 \qquad(\lvert\mathbf{a}\rvert\le r). \tag*{(13)} ∥ f a − c 0 ∥ 2 ≤ Q 2 (∣ a ∣ ≤ r ) . (13)
Since ∥ f a ∥ 2 = ( d − 2 a z ) − 1 \lVert f_a\rVert^2=(d-2a_z)^{-1} ∥ f a ∥ 2 = ( d − 2 a z ) − 1 and ⟨ f r z ^ , f − r z ^ ⟩ = d − 1 \langle f_{r\hat{\mathbf{z}}},f_{-r\hat{\mathbf{z}}}\rangle=d^{-1} ⟨ f r z ^ , f − r z ^ ⟩ = d − 1 , this is equivalent to
1 d − 2 a z + 1 d ≤ 1 ( d − a z − r ) 2 + ρ 2 + 1 ( d − a z + r ) 2 + ρ 2 , (14) \frac{1}{d-2a_z}+\frac{1}{d}\le\frac{1}{\sqrt{(d-a_z-r)^2+\rho^2}}+\frac{1}{\sqrt{(d-a_z+r)^2+\rho^2}}, \tag*{(14)} d − 2 a z 1 + d 1 ≤ ( d − a z − r ) 2 + ρ 2 1 + ( d − a z + r ) 2 + ρ 2 1 , (14)
where ρ = ∣ a ⊥ ∣ \rho=\lvert\mathbf{a}_{\perp}\rvert ρ = ∣ a ⊥ ∣ . At fixed a z a_z a z the right side decreases with ρ \rho ρ , so it suffices to put ρ 2 = r 2 − a z 2 \rho^2=r^2-a_z^2 ρ 2 = r 2 − a z 2 . We now prove this scalar inequality on the boundary of the physical ball. Measure lengths in units of r r r and set D = d / r D=d/r D = d / r , t = a z / r t=a_z/r t = a z / r , P = D ( D − 2 t ) P=D(D-2t) P = D ( D − 2 t ) and ζ = 1 + 4 ( 1 − t 2 ) / P 2 \zeta=\sqrt{1+4(1-t^2)/P^2} ζ = 1 + 4 ( 1 − t 2 ) / P 2 . Both sides of Eq. (14) are positive. Squaring and simplifying reduces it to
( ζ 2 − 1 ) B ( P , ζ ) ≥ 0 , B ( P , ζ ) = P 2 ζ 2 − 2 P − 4 − 2 P ζ ζ + 1 . (\zeta^2-1)B(P,\zeta)\ge0,\qquad B(P,\zeta)=P^2\zeta^2-2P-4-\frac{2P\zeta}{\zeta+1}. ( ζ 2 − 1 ) B ( P , ζ ) ≥ 0 , B ( P , ζ ) = P 2 ζ 2 − 2 P − 4 − ζ + 1 2 P ζ .
The two squared denominators on the right are P + 2 ± 2 ( D − t ) P+2\pm2(D-t) P + 2 ± 2 ( D − t ) , whose product is P 2 ζ 2 P^2\zeta^2 P 2 ζ 2 ; this supplies the stated reduction without any sign ambiguity. Now ζ ≥ 1 \zeta\ge1 ζ ≥ 1 and P ≥ D ( D − 2 ) ≥ 4 P\ge D(D-2)\ge4 P ≥ D ( D − 2 ) ≥ 4 . Moreover
∂ ζ B = 2 P 2 ζ − 2 P ( ζ + 1 ) 2 > 0 , B ( P , 1 ) = ( P − 4 ) ( P + 1 ) ≥ 0. \partial_{\zeta}B=2P^2\zeta-\frac{2P}{(\zeta+1)^2}>0,\qquad B(P,1)=(P-4)(P+1)\ge0. ∂ ζ B = 2 P 2 ζ − ( ζ + 1 ) 2 2 P > 0 , B ( P , 1 ) = ( P − 4 ) ( P + 1 ) ≥ 0.
This proves Eq. (13) , including the boundary d = ( 1 + 5 ) r d=(1+\sqrt{5})r d = ( 1 + 5 ) r .
An ancilla-assisted entropy-rate bound
We use the feature radius to bound matrix elements of the interaction in any Schmidt basis. Such a bound controls how fast the interaction can change the Schmidt probabilities, and therefore how fast it can generate entanglement. Subtracting c 0 c_0 c 0 from both features changes the potential only by local Hamiltonians and a scalar. Write the centered interaction as
H n l = − G ∫ A λ ⊗ B λ d μ ( λ ) , ∫ A λ 2 d μ ≤ Q 2 I , ∫ B λ 2 d μ ≤ Q 2 I . H_{\mathrm{nl}}=-\mathcal{G}\int A_\lambda\otimes B_\lambda\,\mathrm{d}\mu(\lambda),\qquad\int A_\lambda^2\mathrm{d}\mu\le Q^2 I,\qquad\int B_\lambda^2\mathrm{d}\mu\le Q^2 I. H nl = − G ∫ A λ ⊗ B λ d μ ( λ ) , ∫ A λ 2 d μ ≤ Q 2 I , ∫ B λ 2 d μ ≤ Q 2 I .
Here A λ A_\lambda A λ and B λ B_\lambda B λ multiply a position wavefunction by the corresponding centred feature component. The index λ \lambda λ includes the transverse wave vector and cosine/sine component, and the factors are real self-adjoint multiplication operators. Local interaction pictures preserve the two operator inequalities. They also hold after tensoring arbitrary local ancillary identities.
For any Schmidt vectors ∣ u i ⟩ , ∣ v i ⟩ \lvert u_i\rangle,\lvert v_i\rangle ∣ u i ⟩ , ∣ v i ⟩ set h i j = ⟨ u i v i ∣ H n l ∣ u j v j ⟩ h_{ij}=\langle u_i v_i\lvert H_{\mathrm{nl}}\rvert u_j v_j\rangle h ij = ⟨ u i v i ∣ H nl ∣ u j v j ⟩ . Triangle inequality, Cauchy–Schwarz over ( j , λ ) (j,\lambda) ( j , λ ) and completeness of local bases give the dimension-independent row bound
∑ j ∣ h i j ∣ ≤ G [ ∑ j ∫ ∣ ⟨ u i ∣ A λ ∣ u j ⟩ ∣ 2 d μ ] 1 / 2 [ ∑ j ∫ ∣ ⟨ v i ∣ B λ ∣ v j ⟩ ∣ 2 d μ ] 1 / 2 ≤ G Q 2 . (15) \sum_j\lvert h_{ij}\rvert\le\mathcal{G}\left[\sum_j\int\lvert\langle u_i\lvert A_\lambda\rvert u_j\rangle\rvert^2\mathrm{d}\mu\right]^{1/2}\left[\sum_j\int\lvert\langle v_i\lvert B_\lambda\rvert v_j\rangle\rvert^2\mathrm{d}\mu\right]^{1/2}
\le\mathcal{G}Q^2. \tag*{(15)} j ∑ ∣ h ij ∣ ≤ G [ j ∑ ∫ ∣⟨ u i ∣ A λ ∣ u j ⟩ ∣ 2 d μ ] 1/2 [ j ∑ ∫ ∣⟨ v i ∣ B λ ∣ v j ⟩ ∣ 2 d μ ] 1/2 ≤ G Q 2 . (15)
An incomplete Schmidt family can be extended to local orthonormal bases.
For squared Schmidt weights p i p_i p i with ∑ i p i = 1 \sum_i p_i=1 ∑ i p i = 1 , let S = − ∑ i p i log 2 p i S=-\sum_i p_i\log_2p_i S = − ∑ i p i log 2 p i be the entropy of entanglement in bits. Grouping its derivative into pairs yields
∣ S ˙ ∣ ≤ 2 ℏ ∑ i < j p i p j ∣ log 2 p i p j ∣ ∣ h i j ∣ . \lvert\dot{S}\rvert\le\frac{2}{\hbar}\sum_{i<j}\sqrt{p_i p_j}\left\lvert\log_2\frac{p_i}{p_j}\right\rvert\lvert h_{ij}\rvert. ∣ S ˙ ∣ ≤ ℏ 2 i < j ∑ p i p j log 2 p j p i ∣ h ij ∣ .
Each pair transfers probability between two Schmidt components. Applying the definition of β \beta β to their normalized probabilities gives the scalar inequality 2 p i p j ∣ log 2 ( p i / p j ) ∣ ≤ β ( p i + p j ) 2\sqrt{p_i p_j}\lvert\log_2(p_i/p_j)\rvert\le\beta(p_i+p_j) 2 p i p j ∣ log 2 ( p i / p j )∣ ≤ β ( p i + p j ) . Combining it with Eq. (15) yields
∣ S ˙ ∣ ≤ β ℏ ∑ i p i ∑ j ≠ i ∣ h i j ∣ ≤ β G Q 2 ℏ . \lvert\dot{S}\rvert\le\frac{\beta}{\hbar}\sum_i p_i\sum_{j\ne i}\lvert h_{ij}\rvert\le\frac{\beta\mathcal{G}Q^2}{\hbar}. ∣ S ˙ ∣ ≤ ℏ β i ∑ p i j = i ∑ ∣ h ij ∣ ≤ ℏ β G Q 2 .
This is the row-sum entropy method underlying the known Ising/product capacity proof[18 ] ; the Coulomb feature radius is the additional geometric input. Local instruments cannot increase average pure-branch entropy, so the rate bounds arbitrary admissible protocols, including local ancillas, noise and feedback.
The row estimate is uniform in dimension, but we must also connect it to continuous positions without assuming that their entropy is continuous. First approximate each ball by a finite partition with representatives inside the ball. If both position errors are bounded by ϵ A , ϵ B \epsilon_A,\epsilon_B ϵ A , ϵ B , then ∥ V − V h ∥ ≤ G ( ϵ A + ϵ B ) / ( d − 2 r ) 2 \lVert V-V_h\rVert\le\mathcal{G}(\epsilon_A+\epsilon_B)/(d-2r)^2 ∥ V − V h ∥ ≤ G ( ϵ A + ϵ B ) / ( d − 2 r ) 2 . The finite label systems satisfy the feature inequality exactly; cell multiplicities are local spectator systems. Prove the rate and finite-output bound there and pass fixed protocol outputs under bounded-perturbation convergence. This does not assume uniform continuity of entropy on the full bosonic space. Normal protocol limits retain the same support and resource-control assumptions as in the collinear result.
To approach the upper bound, it suffices to reproduce the endpoint Ising interaction on a finite logical register. Take two smooth packets per laboratory centered at ± ( r − w ) z ^ \pm(r-w)\hat{\mathbf{z}} ± ( r − w ) z ^ , of radius w w w . Identical translated local wells make their reference profiles stationary. The axial branch Hamiltonian has Ising coefficient approaching G Q 2 / ℏ \mathcal{G}Q^2/\hbar G Q 2 /ℏ . The difference from its branch-center potential is bounded on the well rectangles by a quantity tending to zero with w w w ; Duhamel’s estimate on the stationary code keeps the full local kinetic Hamiltonians. For each finite encoded Ising block choose nonzero w w w sufficiently small, then take the coding limit. One consistent packet choice is the product of three smooth one-dimensional bumps, each of halfwidth w / 3 w/\sqrt{3} w / 3 . Its cube lies inside a radius-w w w ball and its kinetic energy is finite, scaling as w − 2 w^{-2} w − 2 . For the same nominal w w w , the initial kinetic energy is nine times the one-dimensional value in the construction of § 1.26 . Seed entanglement is generated and amortized using the established capacity construction. This proves Theorem S1 as an operational supremum, without a uniform energy, control-rate or memory bound.
Ising simulation, entanglement capacity and finite-confidence time
We now restrict the position coordinates to intervals x A ∈ [ − ℓ A , ℓ A ] x_A \in[-\ell_A,\ell_A] x A ∈ [ − ℓ A , ℓ A ] and x B ∈ [ − ℓ B , ℓ B ] x_B \in[-\ell_B,\ell_B] x B ∈ [ − ℓ B , ℓ B ] on the centre-to-centre axis, with d min = d − ℓ A − ℓ B > 0 d_{\min}=d-\ell_A-\ell_B>0 d m i n = d − ℓ A − ℓ B > 0 . Let κ \kappa κ be the magnitude of the endpoint Ising frequency: it is G / ( 4 ℏ ) G/(4\hbar) G / ( 4ℏ ) times [ d − ℓ A − ℓ B ] − 1 + [ d + ℓ A + ℓ B ] − 1 − [ d − ℓ A + ℓ B ] − 1 − [ d + ℓ A − ℓ B ] − 1 [d-\ell_A-\ell_B]^{-1}+[d+\ell_A+\ell_B]^{-1}-[d-\ell_A+\ell_B]^{-1}-[d+\ell_A-\ell_B]^{-1} [ d − ℓ A − ℓ B ] − 1 + [ d + ℓ A + ℓ B ] − 1 − [ d − ℓ A + ℓ B ] − 1 − [ d + ℓ A − ℓ B ] − 1 . For equal intervals ℓ A = ℓ B = r \ell_A=\ell_B=r ℓ A = ℓ B = r , this is G Q 2 / ℏ GQ^2/\hbar G Q 2 /ℏ . In this collinear setting we can prove a stronger statement than equality of capacities: finite interaction protocols can be simulated in either direction.
The product factors in Eq. (161) share the same extremal position states. We use this alignment to connect the confined Newtonian interaction to an Ising interaction. Reversible simulation of product Hamiltonians, including ancillas, is established by Childs, Leung and Vidal[19 ] , Theorems 3 and 6. Their Appendix, Corollary 9, treats a two-term sum with common two-dimensional extremal spaces and, in their normalization, equal Hilbert–Schmidt overlaps of the traceless restricted factors on Alice’s and Bob’s sides; that simulation allows catalytic entanglement. Here the normalized factors are already aligned on the endpoint code: all restricted terms are multiples of one Ising operator with the same sign, so no catalyst is required. We control the passage from finite position grids to continuous support below.
For convenience we recall the entropy-rate constant used in this comparison:
β = max 0 < q < 1 / 2 2 q ( 1 − q ) log 2 1 − q q = 1.91227328895 … (16) \beta=\max_{0<q<1/2}2\sqrt{q(1-q)}\log_2\frac{1-q}{q}=1.91227328895\ldots \tag*{(16)} β = 0 < q < 1/2 max 2 q ( 1 − q ) log 2 q 1 − q = 1.91227328895 … (16)
Here Z Z Z is the Pauli operator with eigenvalues + 1 +1 + 1 and − 1 -1 − 1 . The Hamiltonian ℏ Z ⊗ Z \hbar Z\otimes Z ℏ Z ⊗ Z has asymptotic entanglement capacity β \beta β ebits per unit time; the same constant bounds its instantaneous entropy production with arbitrary local ancillas[18 ] . For a finite-dimensional product Hamiltonian ℏ h X ⊗ Y \hbar hX\otimes Y ℏ h X ⊗ Y , the corresponding rate is β ∣ h ∣ Δ X Δ Y / 4 \beta|h|\Delta_X\Delta_Y/4 β ∣ h ∣ Δ X Δ Y /4 , where Δ X \Delta_X Δ X and Δ Y \Delta_Y Δ Y are spectral diameters[19 ] . These rates use free local control and count net generated entanglement. Initial seed entanglement is prepared and its cost amortized in the established capacity construction[16 ] .
Proposition S2 (Capacity in the ideal supported model). The confined Newtonian interaction is reversibly equivalent to ℏ κ Z ⊗ Z \hbar\kappa Z\otimes Z ℏ κ Z ⊗ Z in the closure of finite protocols with arbitrarily accurate local control. Its asymptotic entanglement-generation capacity per aggregate interaction time is
C E = β κ ebits per unit time. (17) C_E=\beta\kappa\quad\text{ebits per unit time.} \tag*{(17)} C E = β κ ebits per unit time. (17) Every finite endpoint-encoding approximation may use smooth packets with finite kinetic energy. The supremum permits local energy, memory and control requirements to grow with the requested accuracy and block length.
Proof. We first simulate the potential using Ising interactions. Replace each position operator by a finite-spectrum step function X δ , Y δ X_\delta,Y_\delta X δ , Y δ with values in its allowed interval; δ \delta δ labels the mesh refinement. The smallest allowed separation d min d_{\min} d m i n controls the sensitivity of the reciprocal distance to these replacements:
∥ V ( x A , x B ) − V ( X δ , Y δ ) ∥ ≤ G d min 2 ( ∥ x A − X δ ∥ + ∥ x B − Y δ ∥ ) . (18) \lVert V(x_A,x_B)-V(X_\delta,Y_\delta)\rVert\leq\frac{G}{d_{\min}^2}\left(\lVert x_A-X_\delta\rVert+\lVert x_B-Y_\delta\rVert\right). \tag*{(18)} ∥ V ( x A , x B ) − V ( X δ , Y δ )∥ ≤ d m i n 2 G ( ∥ x A − X δ ∥ + ∥ x B − Y δ ∥ ) . (18)
The approximating potential acts on finitely many cell labels. The within-cell Hilbert spaces are local spectator systems. On the finite labels, Eq. (161) has product-strength sum at most κ \kappa κ . Its integral can be replaced by a finite convex decomposition of normalized product matrices with the same budget: the matrices form a compact set after taking their limiting values, and their integral belongs to its finite-dimensional convex hull.
Each product term can be simulated at its spectral-diameter cost by an Ising interaction[19 ] . Time sharing and the product formula simulate the sum, with total Ising strength-time at most κ T \kappa T κ T . For a fixed finite-duration protocol, replacing the potential changes its output by a quantity tending to zero with T ∥ V − V δ ∥ / ℏ T\lVert V-V_\delta\rVert/\hbar T ∥ V − V δ ∥ /ℏ . Local maps and ancillary systems do not increase this channel error. We choose the grid and product-formula accuracy separately for each finite block. Hence any rate exceeding β κ \beta\kappa β κ for the continuous potential would exceed the established Ising capacity on finite output registers. No uniform continuity of infinite-dimensional entropy is used.
For the reverse simulation, choose two narrow packets at each laboratory, with centres ± ( ℓ A − w A ) \pm(\ell_A-w_A) ± ( ℓ A − w A ) and ± ( ℓ B − w B ) \pm(\ell_B-w_B) ± ( ℓ B − w B ) and halfwidths w A , w B w_A,w_B w A , w B . Keep their local kinetic Hamiltonians, with identical translated wells so that the reference packets are stationary. On the full confined two-well Hilbert space of each laboratory, replace the potential by the constant centre value on each entire branch rectangle. Its restriction to the branch qubits is a diagonal Hamiltonian locally equivalent to ℏ κ w Z ⊗ Z \hbar\kappa_w Z\otimes Z ℏ κ w Z ⊗ Z , where κ w = κ ( ℓ A − w A , ℓ B − w B ) → κ \kappa_w=\kappa(\ell_A-w_A,\ell_B-w_B)\to\kappa κ w = κ ( ℓ A − w A , ℓ B − w B ) → κ . Writing r w = d − ℓ A − ℓ B + w A + w B r_w=d-\ell_A-\ell_B+w_A+w_B r w = d − ℓ A − ℓ B + w A + w B for the minimum separation of packet centres, let ϵ w \epsilon_w ϵ w denote the operator-norm error in this constant-on-branches replacement. The reciprocal-distance estimate gives
ϵ w ≤ G ( w A + w B ) r w [ r w − w A − w B ] . (19) \epsilon_w \le\frac{G(w_A+w_B)}{r_w[r_w-w_A-w_B]}. \tag*{(19)} ϵ w ≤ r w [ r w − w A − w B ] G ( w A + w B ) . (19)
The full kinetic-plus-potential evolutions differ in state norm by at most T ϵ w / ℏ T\epsilon_w/\hbar T ϵ w /ℏ . Local logical operations act on the branch labels and preserve the reference within-well coordinate. The same error bound therefore holds through any fixed finite Ising protocol.
For each finite block of an Ising capacity protocol, choose nonzero widths small enough that its error vanishes and κ w \kappa_w κ w approaches κ \kappa κ . The explicit packets in § 1.24 § 1.26 have finite kinetic energy at every such choice. Applying the Ising protocol then gives rates approaching β κ \beta\kappa β κ . Its seed is generated using the interaction and accounted for before taking the capacity limit. This proves the reverse inequality and the simulation statement. □
The supremum in Eq. (17) imposes no common kinetic energy or control-bandwidth bound. Endpoint localization can require increasing energy and need not remain within a uniformly nonrelativistic experimental regime. Equality also assumes that noise can be absent; local noise remains allowed in the upper-bound class. A fixed compulsory bath, finite barriers or a specified memory lifetime define further physical constraints.
The noise threshold and the full-potential bound
We now ask how much of the noiseless capacity survives independent random forces. We first simulate the noisy dipole interaction by local measurements and classical feedback, then bound the entanglement produced by the remaining terms of the full potential. The last part converts this instantaneous bound into a bound on finite Bell registers and constructs entangled outputs below, and slightly above, the dipole threshold.
A Bell-rate bound for the full interaction under white force noise
We allow the parties to use the entire position space, local memories and the quantum systems that carry their recovery syndromes, without requiring them to remain in a fixed code. Under sufficiently strong white force noise, the dipole Hamiltonian together with the noise can be implemented by local operations and classical communication (LOCC). The higher terms of the Newtonian potential then bound the rate at which the parties can generate Bell pairs.
We retain the full Newtonian potential V = − G / ∣ d e z + b − a ∣ V=-\mathcal{G}/\lvert d\mathbf{e}_z+\mathbf{b}-\mathbf{a}\rvert V = − G / ∣ d e z + b − a ∣ on two balls of radius r r r with centre separation d > 2 r d>2r d > 2 r , using e z \mathbf{e}_z e z for the separation direction. Write u = r / d u=r/d u = r / d , g 0 = G / ( ℏ d ) g_0=\mathcal{G}/(\hbar d) g 0 = G / ( ℏ d ) , and let β \beta β be the Ising entropy-rate constant in Eq. (16) . We allow independent isotropic noise strengths Λ A , Λ B ≥ 0 \Lambda_A,\Lambda_B\ge0 Λ A , Λ B ≥ 0 , so that the generator during a free dwell is − i [ V , ⋅ ] / ℏ + L f -\mathrm{i}[V,\cdot]/\hbar+\mathcal{L}_f − i [ V , ⋅ ] /ℏ + L f , where
L f ( ρ ) = − ∑ i = x , y , z ( Λ A [ a i , [ a i , ρ ] ] + Λ B [ b i , [ b i , ρ ] ] ) . (20) \mathcal{L}_f(\rho)=-\sum_{i=x,y,z}\left(\Lambda_A[a_i,[a_i,\rho]]+\Lambda_B[b_i,[b_i,\rho]]\right). \tag*{(20)} L f ( ρ ) = − i = x , y , z ∑ ( Λ A [ a i , [ a i , ρ ]] + Λ B [ b i , [ b i , ρ ]] ) . (20)
With the two-sided white force spectral density S F , Q S_{F,Q} S F , Q per Cartesian component, Λ Q = S F , Q / ( 2 ℏ 2 ) \Lambda_Q=S_{F,Q}/(2\hbar^2) Λ Q = S F , Q / ( 2 ℏ 2 ) . The force environment is inaccessible, and the free dwells use this Markov channel on the masses tensored with the identity on local memories. The double commutator damps a position coherence separated by Δ q \Delta q Δ q in laboratory Q Q Q at rate Λ Q ∣ Δ q ∣ 2 \Lambda_Q\lvert\Delta q\rvert^2 Λ Q ∣ Δ q ∣ 2 ; this fixes the noise normalization.
A finite protocol interleaves such dwells with arbitrary normal local operations and classical communication. The laboratories start in a normal separable state, with any subsequently generated seed entanglement charged to the protocol. Ancillas and local instruments are unrestricted within the usual separable Hilbert spaces and standard Borel outcome spaces. Later controls and dwell times can depend on the observed outcomes. A protocol can retain or discard quantum syndromes locally. Its cost is the mean of the sum T i n t T_{\mathrm{int}} T int of the dwell durations, including time spent on failed attempts. We include limits of finite protocols for which the state on each specified pair of finite output registers converges in trace norm and the mean costs converge. Continuous local controls, including local Hamiltonian evolution during a dwell, are admitted when their outputs and costs arise as such limits with the same support constraint.
Before deriving the rate, we verify that this protocol definition also includes kinetic motion during an interaction. The issue is that the kinetic Hamiltonian is unbounded, whereas the confined potential and force-noise operators are bounded. For example, let K Q = − ℏ 2 Δ / ( 2 m Q ) K_Q=-\hbar^2\Delta/(2m_Q) K Q = − ℏ 2 Δ/ ( 2 m Q ) be the Dirichlet kinetic Hamiltonian on laboratory Q Q Q ’s ball. On trace class, write A \mathcal{A} A for the generator of the strongly continuous local conjugation group U t U_t U t of K A + K B K_A+K_B K A + K B , and B = − i [ V , ⋅ ] / ℏ + L f \mathcal{B}=-\mathrm{i}[V,\cdot]/\hbar+\mathcal{L}_f B = − i [ V , ⋅ ] /ℏ + L f for the bounded position generator. The full evolution e t ( A + B ) e^{t(\mathcal{A}+\mathcal{B})} e t ( A + B ) is the strong trace-norm limit of ( U t / n e ( t / n ) B ) n (U_{t/n}e^{(t/n)\mathcal{B}})^n ( U t / n e ( t / n ) B ) n . In the local interaction picture, B ( s ) = U − s B U s \mathcal{B}(s)=U_{-s}\mathcal{B}U_s B ( s ) = U − s B U s is strongly continuous and uniformly bounded. The interaction-picture product uses B ( s ) \mathcal{B}(s) B ( s ) frozen at the start of each step. Its time-ordered series converges on each trace-class input to the series with the continuous B ( s ) \mathcal{B}(s) B ( s ) by termwise dominated convergence, with norm bounds ( t ∥ B ∥ ) j / j ! (t\lVert\mathcal{B}\rVert)^j/j! ( t ∥ B ∥ ) j / j ! at order j j j . This gives the stated limit, also with an identity on any local reference. Each factor preserves the supported Hilbert spaces, and the position dwells sum to t t t .
For a finite adaptive protocol the same replacement can be made at every dwell. In a telescoping comparison, the exact preceding history gives a conditional input and a duration, and the subsequent instruments contract the trace norm including their classical outputs. Dominated convergence over the preceding history then gives convergence of the joint quantum and classical output. To handle unbounded durations with finite mean cost, first stop before exceeding a fixed total time and supply local placeholder outputs on those histories. The mean cost of the capped protocol is a bounded function of its record and converges under the product approximation. Removing the cap recovers the original output by the vanishing truncation probability and the original mean cost by monotone convergence.
Write C Λ A , Λ B C_{\Lambda_A,\Lambda_B} C Λ A , Λ B for the supremum of the asymptotic rates of producing L → ∞ L\to\infty L → ∞ Bell pairs on specified local registers with fidelity tending to one, per mean interaction time. The fidelity convention here is f = Tr ( Φ 2 L ρ o u t ) f=\operatorname{Tr}(\Phi_{2^L}\rho_{\mathrm{out}}) f = Tr ( Φ 2 L ρ out ) , with Φ 2 L \Phi_{2^L} Φ 2 L the maximally entangled projector for the two registers. Since local force dephasing can be added freely to noiseless dwells, C Λ A , Λ B C_{\Lambda_A,\Lambda_B} C Λ A , Λ B is at most the noiseless capacity. For d ≥ ( 1 + 5 ) r d\ge(1+\sqrt{5})r d ≥ ( 1 + 5 ) r that capacity is C E ( 3 ) = 2 β g 0 u 2 / ( 1 − 4 u 2 ) C_E^{(3)}=2\beta g_0u^2/(1-4u^2) C E ( 3 ) = 2 β g 0 u 2 / ( 1 − 4 u 2 ) by Theorem S1.
To estimate the first terms left after removing the dipole interaction, we expand the dimensionless Newtonian field F \mathbf{F} F through first order. Its residual q \mathbf{q} q begins at quadratic order. Let v \mathbf{v} v be a dimensionless displacement and D F ( 0 ) D\mathbf{F}(0) D F ( 0 ) the field’s Jacobian matrix at the origin. We define
F ( v ) = e z + v ∣ e z + v ∣ 3 , q ( v ) = F ( v ) − F ( 0 ) − D F ( 0 ) v , \mathbf{F}(\mathbf{v})=\frac{\mathbf{e}_z+\mathbf{v}}{\lvert\mathbf{e}_z+\mathbf{v}\rvert^3},\qquad\mathbf{q}(\mathbf{v})=\mathbf{F}(\mathbf{v})-\mathbf{F}(0)-D\mathbf{F}(0)\mathbf{v}, F ( v ) = ∣ e z + v ∣ 3 e z + v , q ( v ) = F ( v ) − F ( 0 ) − D F ( 0 ) v ,
q ∗ ( u ) = min c ∈ R 3 sup ∣ v ∣ ≤ u ∣ q ( v ) − c ∣ , B ( u ) = 2 u q ∗ ( u ) + S 2 ( u ) , (21) q_*(u)=\min_{\mathbf{c}\in\mathbb{R}^3}\sup_{\lvert\mathbf{v}\rvert\leq u}\lvert\mathbf{q}(\mathbf{v})-\mathbf{c}\rvert,\qquad B(u)=2u q_*(u)+S_2(u), \tag*{(21)} q ∗ ( u ) = c ∈ R 3 min ∣ v ∣ ≤ u sup ∣ q ( v ) − c ∣ , B ( u ) = 2 u q ∗ ( u ) + S 2 ( u ) , (21)
Here q ∗ ( u ) q_*(u) q ∗ ( u ) is the radius of the smallest ball containing all residual field values, with its centre c \mathbf{c} c varied freely. Subtracting such a centre will remove only a local Hamiltonian. The tail S 2 ( u ) = ∑ j , k ≥ 2 ( j + k j ) u j + k S_2(u)=\sum_{j,k\geq2}\binom{j+k}{j}u^{j+k} S 2 ( u ) = ∑ j , k ≥ 2 ( j j + k ) u j + k collects terms that are at least quadratic in both positions; its general form is given in Eq. (36) . The two contributions u q ∗ ( u ) u q_*(u) u q ∗ ( u ) come from terms linear on one side and at least quadratic on the other. An alternative bound estimates these terms without centring the field and uses the elementary function
R ( u ) = 2 u 3 ( 3 − 2 u ) ( 1 − 2 u ) ( 1 − u ) . (22) R(u)=\frac{2u^3(3-2u)}{(1-2u)(1-u)}. \tag*{(22)} R ( u ) = ( 1 − 2 u ) ( 1 − u ) 2 u 3 ( 3 − 2 u ) . (22)
Theorem S3 (Dipole threshold and Bell-pair rate). Set Λ c = G / ( ℏ d 3 ) \Lambda_c=\mathcal{G}/(\hbar d^3) Λ c = G / ( ℏ d 3 ) , λ = Λ A Λ B / Λ c \lambda=\sqrt{\Lambda_A\Lambda_B}/\Lambda_c λ = Λ A Λ B / Λ c , and η = min { 1 , λ } \eta=\min\{1,\lambda\} η = min { 1 , λ } . Every admissible protocol with output fidelity f f f to L L L Bell pairs satisfies
( 1 − 1 − f ) L − h 2 ( min { 1 − f , 1 / 2 } ) ≤ U E T i n t , U = β g 0 min { B ( u ) , R ( u ) } + 2 ( 1 − η ) u 2 , (23) (1-\sqrt{1-f})L-h_2\left(\min\{\sqrt{1-f},1/2\}\right)\leq UET_{\mathrm{int}},\qquad U=\frac{\beta g_0}{\min\{B(u),R(u)\}+2(1-\eta)u^2}, \tag*{(23)} ( 1 − 1 − f ) L − h 2 ( min { 1 − f , 1/2 } ) ≤ U E T int , U = min { B ( u ) , R ( u )} + 2 ( 1 − η ) u 2 β g 0 , (23) where h 2 h_2 h 2 is binary entropy in bits. In particular,
C Λ A , Λ B ≤ U , B ( u ) = 9 2 u 3 + O ( u 4 ) . (24) C_{\Lambda_A,\Lambda_B}\leq U,\qquad B(u)=\frac{9}{2}u^3+O(u^4). \tag*{(24)} C Λ A , Λ B ≤ U , B ( u ) = 2 9 u 3 + O ( u 4 ) . (24) When λ ≥ 1 \lambda\geq1 λ ≥ 1 , the upper bound at d / r = 6 d/r=6 d / r = 6 is at most 32 / 45 32/45 32/45 of the noiseless capacity, and as u → 0 u\to0 u → 0 the ratio is at most 9 4 u + O ( u 2 ) \frac{9}{4}u+O(u^2) 4 9 u + O ( u 2 ) . At any fixed pair of individual ratios Λ A / Λ c , Λ B / Λ c \Lambda_A/\Lambda_c,\Lambda_B/\Lambda_c Λ A / Λ c , Λ B / Λ c with λ < 1 \lambda<1 λ < 1 , the rate is Θ ( g 0 u 2 ) \Theta(g_0u^2) Θ ( g 0 u 2 ) as u → 0 u\to0 u → 0 .
A finite-time bilinear channel
Kafri, Taylor and Milburn use measurement and feedback to simulate a bilinear Hamiltonian with force dephasing[14 ] . Li, Miki and Chen derive state-independent conditions for bilinear entanglement generation under white noise[15 ] . We need an identity for a finite dwell, so that the simulated channel can be inserted into an adaptive protocol. Let X , Y X,Y X , Y be bounded local self-adjoint operators and let g g g be their real coupling coefficient in the Hamiltonian divided by ℏ \hbar ℏ . Suppressing identities on the other laboratory, write
K = − i g [ X ⊗ Y , ⋅ ] − Λ A [ X , [ X , ⋅ ] ] − Λ B [ Y , [ Y , ⋅ ] ] . (25) \mathcal{K}=-ig[X\otimes Y,\mathord{\cdot}]-\Lambda_A[X,[X,\mathord{\cdot}]]-\Lambda_B[Y,[Y,\mathord{\cdot}]]. \tag*{(25)} K = − i g [ X ⊗ Y , ⋅ ] − Λ A [ X , [ X , ⋅ ]] − Λ B [ Y , [ Y , ⋅ ]] . (25)
If Λ A Λ B ≥ g 2 / 4 \Lambda_A\Lambda_B\geq g^2/4 Λ A Λ B ≥ g 2 /4 , then exp ( t K ) \exp(t\mathcal{K}) exp ( t K ) is LOCC for each t ≥ 0 t\geq0 t ≥ 0 . For g = 0 g=0 g = 0 it is local dephasing, and for t = 0 t=0 t = 0 it is the identity. Otherwise choose positive measurement strengths k , k ′ k,k' k , k ′ as specified below, and let Alice apply M y = ( 2 k t / π ) 1 / 4 exp [ − k t ( X − y ) 2 ] M_y=(2kt/\pi)^{1/4}\exp[-kt(X-y)^2] M y = ( 2 k t / π ) 1/4 exp [ − k t ( X − y ) 2 ] with real outcome y y y . The instrument is normalized since ∫ M y † M y d y = I \int M_y^\dagger M_y\,\mathrm{d}y=I ∫ M y † M y d y = I . She sends y y y to Bob, who applies exp ( − i g t y Y ) \exp(-igtyY) exp ( − i g t y Y ) . In the spectral representation of X , Y X,Y X , Y , use ( x , e ) (x,e) ( x , e ) and ( x ′ , e ′ ) (x',e') ( x ′ , e ′ ) for the two sets of coordinates of a matrix element. Completing the square about ( x + x ′ ) / 2 (x+x')/2 ( x + x ′ ) /2 and integrating over y y y gives its multiplier
exp [ t ( − k 2 ( x − x ′ ) 2 − i g 2 ( x + x ′ ) ( e − e ′ ) − g 2 8 k ( e − e ′ ) 2 ) ] . (26) \exp\left[t\left(-\frac{k}{2}(x-x')^2-\frac{ig}{2}(x+x')(e-e')-\frac{g^2}{8k}(e-e')^2\right)\right]. \tag*{(26)} exp [ t ( − 2 k ( x − x ′ ) 2 − 2 i g ( x + x ′ ) ( e − e ′ ) − 8 k g 2 ( e − e ′ ) 2 ) ] . (26)
The reverse instrument, with measurement strength k ′ k' k ′ , interchanges the two spectral variables. The two phases add to − i g t ( x e − x ′ e ′ ) -ig t(xe-x'e') − i g t ( x e − x ′ e ′ ) , and the two damping coefficients are k / 2 + g 2 / ( 8 k ′ ) k/2+g^2/(8k') k /2 + g 2 / ( 8 k ′ ) and k ′ / 2 + g 2 / ( 8 k ) k'/2+g^2/(8k) k ′ /2 + g 2 / ( 8 k ) . Taking k k ′ = g 2 / 4 kk'=g^2/4 k k ′ = g 2 /4 makes these coefficients k , k ′ k,k' k , k ′ . The assumed noise product allows k ≤ Λ A k\leq\Lambda_A k ≤ Λ A and k ′ ≤ Λ B k'\leq\Lambda_B k ′ ≤ Λ B .
Independent random local phases with variances 2 t ( Λ A − k ) 2t(\Lambda_A-k) 2 t ( Λ A − k ) and 2 t ( Λ B − k ′ ) 2t(\Lambda_B-k') 2 t ( Λ B − k ′ ) complete the required noise. The proof applies equally to discrete and continuous spectra by the spectral calculus. Thus the product condition is precisely what allows both measurements and feedback kicks to fit within the available local dephasing strengths.
For X = Y = Z X=Y=Z X = Y = Z , the Pauli matrix, the same threshold is necessary for the channel to preserve separability for all times. Local Hadamards rotate the input ∣ + + ⟩ |++\rangle ∣ + + ⟩ to ∣ 00 ⟩ |00\rangle ∣00 ⟩ and the Hamiltonian to ℏ g X P ⊗ X P \hbar gX_{\mathrm{P}}\otimes X_{\mathrm{P}} ℏ g X P ⊗ X P , with X P X_{\mathrm{P}} X P the Pauli bit flip. The block of the partial transpose on ∣ 01 ⟩ , ∣ 10 ⟩ |01\rangle,|10\rangle ∣01 ⟩ , ∣10 ⟩ is
t ( 2 Λ B i g − i g 2 Λ A ) + O ( t 2 ) . t\begin{pmatrix} 2\Lambda_B & ig \\ -ig & 2\Lambda_A \end{pmatrix}+O(t^2). t ( 2 Λ B − i g i g 2 Λ A ) + O ( t 2 ) .
Its determinant is negative to order t 2 t^2 t 2 whenever Λ A Λ B < g 2 / 4 \Lambda_A\Lambda_B<g^2/4 Λ A Λ B < g 2 /4 . The output is then entangled for sufficiently small positive t t t .
b. Separating the full Newtonian potential. The angular expansion derived in Eq. (40) organizes the potential by degrees ( j , k ) (j,k) ( j , k ) in Alice’s and Bob’s positions. Terms with either degree zero are local. The lowest term with both degrees nonzero, ( 1 , 1 ) (1,1) ( 1 , 1 ) , is the dipole interaction
V d i p = ℏ ∑ i = x , y , z g i a i b i , g z = 2 Λ c , g x = g y = − Λ c . (27) V_{\mathrm{dip}}=\hbar\sum_{i=x,y,z}g_i a_i b_i,\qquad g_z=2\Lambda_c,\quad g_x=g_y=-\Lambda_c. \tag*{(27)} V dip = ℏ i = x , y , z ∑ g i a i b i , g z = 2 Λ c , g x = g y = − Λ c . (27)
For each component, Λ A Λ B ≥ ( η g i ) 2 / 4 \Lambda_A\Lambda_B\ge(\eta g_i)^2/4 Λ A Λ B ≥ ( η g i ) 2 /4 . Apply the bilinear channel construction to the three components with the couplings η g i \eta g_i η g i , using Λ A , Λ B \Lambda_A,\Lambda_B Λ A , Λ B for each component’s dephasing. All position multipliers commute. Consequently, for any decomposition V = η V d i p + W + V l o c V=\eta V_{\mathrm{dip}}+W+V_{\mathrm{loc}} V = η V dip + W + V loc with position multipliers W , V l o c W,V_{\mathrm{loc}} W , V loc and V l o c V_{\mathrm{loc}} V loc local, the exact dwell channel factors as the LOCC channel for η V d i p \eta V_{\mathrm{dip}} η V dip with noise, conjugation by exp ( − i t W / ℏ ) \exp(-itW/\hbar) exp ( − i t W /ℏ ) , and local position phases. Each factor uses the full dwell duration t t t in this identity. The instrument outcomes used in the LOCC representation are auxiliary variables in the proof. The parties’ subsequent controls depend on their own recorded outcomes.
After simulating the fraction η \eta η of the dipole interaction locally, only W W W can increase entanglement. We bound W W W using a row sum that is uniform in local ancillas. For any paired orthonormal families ∣ u j ⟩ , ∣ v j ⟩ |u_j\rangle,|v_j\rangle ∣ u j ⟩ , ∣ v j ⟩ on the two laboratories, let w i j = ⟨ u i v i ∣ W ∣ u j v j ⟩ w_{ij}=\langle u_i v_i|W|u_j v_j\rangle w ij = ⟨ u i v i ∣ W ∣ u j v j ⟩ . If W = ∫ A ν ⊗ B ν d μ ( ν ) W=\int A_\nu\otimes B_\nu\,\mathrm{d}\mu(\nu) W = ∫ A ν ⊗ B ν d μ ( ν ) with self-adjoint factors and positive measure μ \mu μ , then
sup i ∑ j ∣ w i j ∣ ≤ ∥ ∫ A ν 2 d μ ( ν ) ∥ 1 / 2 ∥ ∫ B ν 2 d μ ( ν ) ∥ 1 / 2 . (28) \sup_i\sum_j|w_{ij}|\le\left\lVert\int A_\nu^2\,\mathrm{d}\mu(\nu)\right\rVert^{1/2}\left\lVert\int B_\nu^2\,\mathrm{d}\mu(\nu)\right\rVert^{1/2}. \tag*{(28)} i sup j ∑ ∣ w ij ∣ ≤ ∫ A ν 2 d μ ( ν ) 1/2 ∫ B ν 2 d μ ( ν ) 1/2 . (28)
Indeed Cauchy–Schwarz over ( j , ν ) (j,\nu) ( j , ν ) bounds the sum of the products of matrix elements, and Bessel’s inequality bounds each sum of squares. Signs can be included in either self-adjoint factor. Row bounds add under summation. In particular, a complex tensor product of contractions has a real part with row bound one by Eq. (41) . These estimates also apply to norm-convergent decompositions with summable row bounds by taking the limit in each entry and using Fatou’s lemma on the row sums.
The residual dipole ( 1 − η ) V d i p (1-\eta)V_{\mathrm{dip}} ( 1 − η ) V dip has row bound at most 2 ( 1 − η ) ℏ Λ c 2 2(1-\eta)\hbar\Lambda_c^2 2 ( 1 − η ) ℏ Λ c 2 . To see this, put ∣ g i ∣ \sqrt{|g_i|} ∣ g i ∣ in each position factor, place the sign of g i g_i g i on one side and use ∑ i ∣ g i ∣ a i 2 ≤ 2 Λ c 2 I \sum_i|g_i|a_i^2\le2\Lambda_c^2 I ∑ i ∣ g i ∣ a i 2 ≤ 2 Λ c 2 I and the analogous bound on Bob’s side. For the higher terms, the strip j = 1 , k ≥ 2 j=1,k\ge2 j = 1 , k ≥ 2 of Eq. (40) is − ( G / d ) ( a / d ) ⋅ q ( b / d ) -(\mathcal{G}/d)(a/d)\cdot\mathbf{q}(b/d) − ( G / d ) ( a / d ) ⋅ q ( b / d ) . This follows by differentiating V V V in a / d a/d a / d at zero and subtracting the constant and linear terms of F F F . Subtracting a constant c \mathbf{c} c from q \mathbf{q} q adds only a local term. The squared position factors sum to at most u 2 I u^2I u 2 I , so the strip has row bound ( G / d ) u q ∗ ( u ) (\mathcal{G}/d)u\mathcal{q}_*(u) ( G / d ) u q ∗ ( u ) with the minimizing centre. The strip j ≥ 2 , k = 1 j\ge2,k=1 j ≥ 2 , k = 1 is related by ( a , b ) ↦ ( − b , − a ) (\mathbf{a},\mathbf{b})\mapsto(-\mathbf{b},-\mathbf{a}) ( a , b ) ↦ ( − b , − a ) and has the same bound. The terms with j , k ≥ 2 j,k\ge2 j , k ≥ 2 contribute at most ( G / d ) S 2 ( u ) (\mathcal{G}/d)S_2(u) ( G / d ) S 2 ( u ) by the real and imaginary factor decomposition. This gives the row bound ( G / d ) B ( u ) (\mathcal{G}/d)B(u) ( G / d ) B ( u ) beyond the dipole.
Alternatively, bound each degree separately before choosing any centres. Write S 1 ( u ) = ∑ j , k ≥ 1 ( j + k ) u j + k S_1(u)=\sum_{j,k\ge1}^{(j+k)}u^{j+k} S 1 ( u ) = ∑ j , k ≥ 1 ( j + k ) u j + k for the corresponding series including the dipole. The entire series with j , k ≥ 1 j,k\ge1 j , k ≥ 1 except ( 1 , 1 ) (1,1) ( 1 , 1 ) contributes at most ( G / d ) [ S 1 ( u ) − 2 u 2 ] (\mathcal{G}/d)[S_1(u)-2u^2] ( G / d ) [ S 1 ( u ) − 2 u 2 ] . Summing the unrestricted binomial series and removing the two axes gives
S 1 ( u ) − 2 u 2 = 1 1 − 2 u − 2 1 − u + 1 − 2 u 2 = R ( u ) . S_1(u)-2u^2=\frac{1}{1-2u}-\frac{2}{1-u}+1-2u^2=R(u). S 1 ( u ) − 2 u 2 = 1 − 2 u 1 − 1 − u 2 + 1 − 2 u 2 = R ( u ) .
The subtracted axes are the purely local terms, and 2 u 2 2u^2 2 u 2 is the dipole contribution. The two decompositions can differ by local position terms, and we choose the one giving the smaller bound at the specified separation. At u = 1 / 6 u=1/6 u = 1/6 the ratio of R ( u ) R(u) R ( u ) to 2 u 2 / ( 1 − 4 u 2 ) 2u^2/(1-4u^2) 2 u 2 / ( 1 − 4 u 2 ) is 32 / 45 32/45 32/45 .
To obtain the leading coefficient of B ( u ) B(u) B ( u ) , expand q \mathbf{q} q uniformly on the ball. With v ⊥ \mathbf{v}_{\perp} v ⊥ the transverse part of v \mathbf{v} v , its quadratic part is
q 2 ( v ) = ( 3 v z 2 − 3 2 ∣ v ⊥ ∣ 2 ) e z − 3 v z v ⊥ . \mathbf{q}_2(\mathbf{v})=\left(3v_z^2-\frac{3}{2}\lvert\mathbf{v}_{\perp}\rvert^2\right)\mathbf{e}_z-3v_z\mathbf{v}_{\perp}. q 2 ( v ) = ( 3 v z 2 − 2 3 ∣ v ⊥ ∣ 2 ) e z − 3 v z v ⊥ .
The polar and equatorial boundary points have images 3 u 2 e z 3u^2\mathbf{e}_z 3 u 2 e z and − 3 2 u 2 e z -\frac{3}{2}u^2\mathbf{e}_z − 2 3 u 2 e z , so any enclosing ball has radius at least 9 u 2 / 4 9u^2/4 9 u 2 /4 . The centre 3 4 u 2 e z \frac{3}{4}u^2\mathbf{e}_z 4 3 u 2 e z attains that radius. In fact, with s = ∣ v ∣ 2 / u 2 s=\lvert\mathbf{v}\rvert^2/u^2 s = ∣ v ∣ 2 / u 2 and x = v z 2 / u 2 x=v_z^2/u^2 x = v z 2 / u 2 , the squared distance to this centre in units of u 4 u^4 u 4 is
( 9 2 x − 3 2 s − 3 4 ) 2 + 9 x ( s − x ) . \left(\frac{9}{2}x-\frac{3}{2}s-\frac{3}{4}\right)^2+9x(s-x). ( 2 9 x − 2 3 s − 4 3 ) 2 + 9 x ( s − x ) .
Here s s s is the squared radial coordinate and x x x its longitudinal contribution, so 0 ≤ x ≤ s ≤ 1 0\le x\le s\le1 0 ≤ x ≤ s ≤ 1 . The expression is convex in x x x at fixed s s s and takes values at most ( 9 / 4 ) 2 (9/4)^2 ( 9/4 ) 2 at x = 0 x=0 x = 0 and x = s x=s x = s for 0 ≤ s ≤ 1 0\le s\le1 0 ≤ s ≤ 1 . The uniform Taylor remainder is O ( u 3 ) O(u^3) O ( u 3 ) and changes the enclosing radius by at most its supremum norm. Thus q ∗ ( u ) = 9 u 2 / 4 + O ( u 3 ) q_*(u)=9u^2/4+O(u^3) q ∗ ( u ) = 9 u 2 /4 + O ( u 3 ) , and S 2 ( u ) = O ( u 4 ) S_2(u)=O(u^4) S 2 ( u ) = O ( u 4 ) . This determines the leading coefficient of the bound B ( u ) B(u) B ( u ) .
c . c. c . Finite-separation bounds. An explicit upper bound on q ∗ ( u ) q_*(u) q ∗ ( u ) suffices for the finite-separation values. Fix any real number c c c and use the axial centre c e z c\mathbf{e}_z c e z . We first reduce the spatial supremum to the boundary, then control the error of replacing that boundary by a finite grid. Each component of q \mathbf{q} q is harmonic on the open unit ball, since F ( v ) = − ∇ v ∣ e z + v ∣ − 1 \mathbf{F}(\mathbf{v})=-\nabla_{\mathbf{v}}\lvert\mathbf{e}_z+\mathbf{v}\rvert^{-1} F ( v ) = − ∇ v ∣ e z + v ∣ − 1 . Consequently ∣ q − c e z ∣ 2 \lvert\mathbf{q}-c\mathbf{e}_z\rvert^2 ∣ q − c e z ∣ 2 is subharmonic, and its maximum over ∣ v ∣ ≤ u < 1 \lvert\mathbf{v}\rvert\le u<1 ∣ v ∣ ≤ u < 1 occurs on the sphere. Rotational symmetry reduces this maximum to v ( θ ) = u ( sin θ , 0 , cos θ ) \mathbf{v}(\theta)=u(\sin\theta,0,\cos\theta) v ( θ ) = u ( sin θ , 0 , cos θ ) , 0 ≤ θ ≤ π 0\le\theta\le\pi 0 ≤ θ ≤ π .
Here is an explicit discretization allowance. For f ( w ) = w / ∣ w ∣ 3 \mathbf{f}(\mathbf{w})=\mathbf{w}/\lvert\mathbf{w}\rvert^3 f ( w ) = w / ∣ w ∣ 3 with w ≠ 0 \mathbf{w}\ne0 w = 0 and a unit vector h \mathbf{h} h , put s = ( h ⋅ w ) 2 / ∣ w ∣ 2 s=(\mathbf{h}\cdot\mathbf{w})^2/\lvert\mathbf{w}\rvert^2 s = ( h ⋅ w ) 2 / ∣ w ∣ 2 . Here D 2 f [ h , h ] D^2\mathbf{f}[\mathbf{h},\mathbf{h}] D 2 f [ h , h ] is the second directional derivative, and s ∈ [ 0 , 1 ] s\in[0,1] s ∈ [ 0 , 1 ] is the squared cosine of the angle between h \mathbf{h} h and w \mathbf{w} w . Direct differentiation gives
∣ D 2 f ( w ) [ h , h ] ∣ 2 = ∣ w ∣ − 8 ( 45 s 2 − 18 s + 9 ) ≤ 36 ∣ w ∣ − 8 . \lvert D^2\mathbf{f}(\mathbf{w})[\mathbf{h},\mathbf{h}]\rvert^2=\lvert\mathbf{w}\rvert^{-8}(45s^2-18s+9)\le36\lvert\mathbf{w}\rvert^{-8}. ∣ D 2 f ( w ) [ h , h ] ∣ 2 = ∣ w ∣ − 8 ( 45 s 2 − 18 s + 9 ) ≤ 36 ∣ w ∣ − 8 .
The same bound applies to the bilinear operator norm: after fixing a unit output direction, the scalar Hessian is a real symmetric matrix, whose norm is attained on repeated unit inputs. Integrating this Hessian bound on the segment from 0 0 0 to v \mathbf{v} v bounds the change D F ( v ) − D F ( 0 ) = D q ( v ) D\mathbf{F}(\mathbf{v})-D\mathbf{F}(0)=D\mathbf{q}(\mathbf{v}) D F ( v ) − D F ( 0 ) = D q ( v ) and yields
∥ D q ( v ) ∥ ≤ 6 ∣ v ∣ ∫ 0 1 ( 1 − t ∣ v ∣ ) − 4 d t = 2 [ ( 1 − ∣ v ∣ ) − 3 − 1 ] . \lVert D\mathbf{q}(\mathbf{v})\rVert\le6\lvert\mathbf{v}\rvert\int_0^1(1-t\lvert\mathbf{v}\rvert)^{-4}\,dt=2[(1-\lvert\mathbf{v}\rvert)^{-3}-1]. ∥ D q ( v )∥ ≤ 6 ∣ v ∣ ∫ 0 1 ( 1 − t ∣ v ∣ ) − 4 d t = 2 [( 1 − ∣ v ∣ ) − 3 − 1 ] .
The spherical curve has speed u u u , and every angle is at most π / ( 2 N ) \pi/(2N) π / ( 2 N ) from a grid point when [ 0 , π ] [0,\pi] [ 0 , π ] is divided into N N N equal intervals. Multiplying these two factors by the derivative bound gives the allowance added to the sampled maximum:
q ∗ ( u ) ≤ Q N ( u , c ) : = max 0 ≤ j ≤ N ∣ q ( u sin ( j π N ) , 0 , u cos ( j π N ) ) − c e z ∣ + π u N [ ( 1 − u ) − 3 − 1 ] . (29) q_*(u)\le Q_N(u,c):=\max_{0\le j\le N}\left\lvert\mathbf{q}\left(u\sin\left(\frac{j\pi}{N}\right),0,u\cos\left(\frac{j\pi}{N}\right)\right)-c\mathbf{e}_z\right\rvert+\frac{\pi u}{N}\left[(1-u)^{-3}-1\right]. \tag*{(29)} q ∗ ( u ) ≤ Q N ( u , c ) := 0 ≤ j ≤ N max q ( u sin ( N j π ) , 0 , u cos ( N j π ) ) − c e z + N π u [ ( 1 − u ) − 3 − 1 ] . (29)
The maximization is now finite. The added term covers every position between grid points, so a sampled value alone is never used as an upper bound. Any centre c c c gives a valid bound; minimizing the sampled maximum is only a way of choosing it. A truncation of S 2 ( u ) S_2(u) S 2 ( u ) through total degree L L L has positive remainder at most ( 2 u ) L + 1 / ( 1 − 2 u ) (2u)^{L+1}/(1-2u) ( 2 u ) L + 1 / ( 1 − 2 u ) . Thus replacing q ∗ q_* q ∗ by Q N Q_N Q N and adding this remainder gives the upper value
B N , L ( u ) = 2 u Q N ( u , c ) + ∑ j , k ≥ 2 , j + k ≤ L ( j + k j ) u j + k + ( 2 u ) L + 1 1 − 2 u . B_{N,L}(u)=2uQ_N(u,c)+\sum_{j,k\ge2,\ j+k\le L}\binom{j+k}{j}u^{j+k}+\frac{(2u)^{L+1}}{1-2u}. B N , L ( u ) = 2 u Q N ( u , c ) + j , k ≥ 2 , j + k ≤ L ∑ ( j j + k ) u j + k + 1 − 2 u ( 2 u ) L + 1 .
For N = 8192 N=8192 N = 8192 and L = 200 L=200 L = 200 , the following choices give the stated upper values. The last column is rounded upwards; in particular it gives the 54% and 28% limits used in the article.
Table 2.
After division by the noiseless capacity, the bound on the noisy-capacity ratio can consequently use
min { 1 , min { B N , L ( u ) , R ( u ) } + 2 [ 1 − min { 1 , λ } ] u 2 2 u 2 / ( 1 − 4 u 2 ) } . \min\left\{1,\frac{\min\{B_{N,L}(u),R(u)\}+2[1-\min\{1,\lambda\}]u^2}{2u^2/(1-4u^2)}\right\}. min { 1 , 2 u 2 / ( 1 − 4 u 2 ) min { B N , L ( u ) , R ( u )} + 2 [ 1 − min { 1 , λ }] u 2 } .
where the cap at one uses the noiseless capacity in its stated separation range.
From the dwell bound to finite Bell registers
Write H ∗ = ℏ U / β H_*=\hbar U/\beta H ∗ = ℏ U / β for the bound on the rows of W W W . For a pure state ∣ ψ ⟩ |\psi\rangle ∣ ψ ⟩ of the complete laboratories, we first show that evolution under W W W for time t t t increases its entropy of entanglement by at most U t Ut U t . To handle infinite Schmidt rank, take the reduced state σ \sigma σ on Alice’s side and use a smooth entropy whose derivative remains bounded at a zero eigenvalue:
S ϵ ( σ ) = Tr f ϵ ( σ ) , f ϵ ( p ) = − p log 2 [ ( p + ϵ ) / ( 1 + ϵ ) ] , ϵ > 0. S_\epsilon(\sigma)=\operatorname{Tr}f_\epsilon(\sigma),\qquad f_\epsilon(p)=-p\log_2[(p+\epsilon)/(1+\epsilon)],\qquad\epsilon>0. S ϵ ( σ ) = Tr f ϵ ( σ ) , f ϵ ( p ) = − p log 2 [( p + ϵ ) / ( 1 + ϵ )] , ϵ > 0.
This quantity increases to the entropy S ( σ ) S(\sigma) S ( σ ) as ϵ \epsilon ϵ decreases to zero. The trace-norm derivative of σ \sigma σ exists since W W W is bounded. The trace derivative of S ϵ S_\epsilon S ϵ is Tr ( f ϵ ′ ( σ ) σ ˙ ) \operatorname{Tr}(f'_\epsilon(\sigma)\dot{\sigma}) Tr ( f ϵ ′ ( σ ) σ ˙ ) , which follows by expanding the logarithm in powers of ( I − σ ) / ( 1 + ϵ ) (I-\sigma)/(1+\epsilon) ( I − σ ) / ( 1 + ϵ ) . With the factor σ \sigma σ in f ϵ ( σ ) f_\epsilon(\sigma) f ϵ ( σ ) the series and its trace derivatives converge, since ∥ ( I − σ ) / ( 1 + ϵ ) ∥ < 1 \lVert(I-\sigma)/(1+\epsilon)\rVert<1 ∥( I − σ ) / ( 1 + ϵ )∥ < 1 and σ ˙ \dot{\sigma} σ ˙ is trace class. Thus we can evaluate the derivative in any Schmidt bases at the current time, with squared Schmidt weights p i p_i p i . We compare the regularized derivative difference with the logarithmic difference of the ordinary entropy. The curvature bound below makes that comparison possible, and the second inequality supplies the Ising constant:
∣ f ϵ ′ ′ ( p ) ∣ = p + 2 ϵ ( p + ϵ ) 2 ln 2 ≤ 1 p ln 2 ( p > 0 ) , 2 p i p j ∣ log 2 ( p i / p j ) ∣ ≤ β ( p i + p j ) . |f''_\epsilon(p)|=\frac{p+2\epsilon}{(p+\epsilon)^2\ln2}\leq\frac{1}{p\ln2}\quad(p>0),\qquad2\sqrt{p_i p_j}|\log_2(p_i/p_j)|\leq\beta(p_i+p_j). ∣ f ϵ ′′ ( p ) ∣ = ( p + ϵ ) 2 ln 2 p + 2 ϵ ≤ p ln 2 1 ( p > 0 ) , 2 p i p j ∣ log 2 ( p i / p j ) ∣ ≤ β ( p i + p j ) .
In the derivative, diagonal elements of σ ˙ \dot{\sigma} σ ˙ corresponding to zero Schmidt weights vanish. Pairing the other terms by ( i , j ) (i,j) ( i , j ) gives
∣ d d t S ϵ ( σ ) ∣ ≤ 2 ℏ ∑ i < j p i p j ∣ f ϵ ′ ( p i ) − f ϵ ′ ( p j ) ∣ ∣ w i j ∣ ≤ β ℏ ∑ i p i ∑ j ≠ i ∣ w i j ∣ ≤ U . (30) \begin{aligned}
\left|\frac{d}{dt}S_\epsilon(\sigma)\right|\leq\frac{2}{\hbar}\sum_{i<j}\sqrt{p_i p_j}|f'_\epsilon(p_i)-f'_\epsilon(p_j)||w_{ij}| \\
&\leq\frac{\beta}{\hbar}\sum_i p_i\sum_{j\ne i}|w_{ij}|\leq U. \tag*{(30)}
\end{aligned} d t d S ϵ ( σ ) ≤ ℏ 2 i < j ∑ p i p j ∣ f ϵ ′ ( p i ) − f ϵ ′ ( p j ) ∣∣ w ij ∣ ≤ ℏ β i ∑ p i j = i ∑ ∣ w ij ∣ ≤ U . (30)
Integrating the curvature inequality between p i p_i p i and p j p_j p j bounds ∣ f ϵ ′ ( p i ) − f ϵ ′ ( p j ) ∣ |f'_\epsilon(p_i)-f'_\epsilon(p_j)| ∣ f ϵ ′ ( p i ) − f ϵ ′ ( p j ) ∣ by ∣ log 2 ( p i / p j ) ∣ |\log_2(p_i/p_j)| ∣ log 2 ( p i / p j ) ∣ when both weights are positive. The row bound also gives absolute convergence of the paired series. Integrate the inequality and take ϵ ↓ 0 \epsilon\downarrow0 ϵ ↓ 0 to obtain the entropy increment bound for any finite initial entropy.
An initial normal separable state has a probability-measure decomposition into pure product states[33 ] . We keep this ensemble and refine it through the finite protocol. Each simulated LOCC factor has a pure-state refinement, indexed by its Gaussian outcomes or local phase variables. Local control instruments also have such refinements. One can use a local Stinespring dilation and resolve the discarded environment in a basis. For continuous outcomes, the normal instrument dilation resolves the pointer as a direct integral, with an additional basis resolution in its multiplicity spaces[34 ] . Only the prescribed outcomes are available to the controls. All retained systems remain in their laboratory. A pure branch can therefore be followed at every step and its average gives the specified state’s statistics.
A local step on Alice’s side leaves Bob’s reduced state unchanged on averaging. Concavity of entropy then bounds the average of the pure output entropies by the pure input entropy. This remains valid for continuous outcomes: in an eigenbasis of Bob’s input state, each conditional entropy is at most the Shannon entropy of its diagonal, and concavity of Shannon entropy bounds the average by the entropy of the input diagonal. The same argument applies to a local step on Bob’s side. The initial branch entropies are zero. Applying Eq. (30) to each remainder unitary and averaging over the actual and auxiliary histories bounds the final average pure-branch entropy by U E T i n t UET_{\mathrm{int}} U E T int . In particular, if the cost is finite, the entropy is finite almost surely at every step. Dwell durations may be chosen from the recorded history since the increment inequality holds conditionally for every chosen duration.
At extraction, resolve every system being discarded in a local basis, again solely for the entropy proof. This gives a pure ensemble on the two finite Bell registers with average entropy still at most U E T i n t UET_{\mathrm{int}} U E T int . Let D = 2 L D=2^L D = 2 L . A pure output branch with fidelity f ω f_\omega f ω to Φ D \Phi_D Φ D has a reduced state at trace distance at most 1 − f ω \sqrt{1-f_\omega} 1 − f ω from I D / D I_D/D I D / D . Denote the total variation distance between its eigenvalue distribution and uniform by z ω z_\omega z ω . A coupling of the two distributions with disagreement probability z ω z_\omega z ω bounds their entropy difference by h 2 ( z ω ) + z ω log 2 D h_2(z_\omega)+z_\omega\log_2 D h 2 ( z ω ) + z ω log 2 D : condition on agreement and bound the entropy on disagreement by log 2 D \log_2 D log 2 D . Thus the branch entropy is at least L − h 2 ( z ω ) − z ω L L-h_2(z_\omega)-z_\omega L L − h 2 ( z ω ) − z ω L . The mean of z ω z_\omega z ω is at most 1 − f \sqrt{1-f} 1 − f by concavity of the square root and linearity of fidelity with the pure target. Concavity of h 2 h_2 h 2 and its maximum at 1 / 2 1/2 1/2 now give Eq. (23) . The proof uses entropy of pure branches and the specified finite registers throughout.
For a countable adaptive protocol with almost-sure stopping and finite mean cost, truncate after a finite number of steps, supplying local placeholder outputs on branches still running. The output trace distance is at most the probability of truncation and the mean cost converges by monotone convergence. For any admitted normal protocol limit, apply Eq. (23) to the fixed finite output registers. Their fidelities converge, and the inequality passes to the limit with the mean cost. Applying the finite-output bound to every member of an asymptotic Bell-generation sequence yields the rate converse in Eq. (24) .
e. Unprotected states below and near the dipole threshold. The upper bound removes the leading rate at the threshold. To determine whether that threshold is also the end of entanglement generation, we now examine a two-position protocol for the full potential. Take two positions ± s e z \pm s e_z ± s e z in each ball with 0 < s < r 0<s<r 0 < s < r , and use ∣ + ⟩ |+\rangle ∣ + ⟩ on the two position labels, where ∣ + ⟩ = ( ∣ 0 ⟩ + ∣ 1 ⟩ ) / 2 |+\rangle=(|0\rangle+|1\rangle)/\sqrt{2} ∣ + ⟩ = ( ∣0 ⟩ + ∣1 ⟩) / 2 assigns equal amplitude to both positions. After removal of local phases, the point-mode Hamiltonian is ℏ κ Z A Z B \hbar\kappa Z_AZ_B ℏ κ Z A Z B and the off-diagonal elements on side Q Q Q decay at rate γ Q \gamma_Q γ Q , with
κ = G 4 ℏ [ 1 d − 2 s + 1 d + 2 s − 2 d ] = 2 Λ c s 2 1 − 4 ( s / d ) 2 , γ Q = 4 Λ Q s 2 . (31) \kappa=\frac{G}{4\hbar}\left[\frac{1}{d-2s}+\frac{1}{d+2s}-\frac{2}{d}\right]=\frac{2\Lambda_c s^2}{1-4(s/d)^2},\qquad\gamma_Q=4\Lambda_Qs^2. \tag*{(31)} κ = 4ℏ G [ d − 2 s 1 + d + 2 s 1 − d 2 ] = 1 − 4 ( s / d ) 2 2 Λ c s 2 , γ Q = 4 Λ Q s 2 . (31)
The Pauli partial-transpose calculation after Eq. (26) applies with strengths γ Q / 4 \gamma_Q/4 γ Q /4 . It gives entanglement at small positive time when γ A γ B < 2 κ \sqrt{\gamma_A\gamma_B}<2\kappa γ A γ B < 2 κ , equivalently λ < 1 / [ 1 − 4 ( s / d ) 2 ] \lambda<1/[1-4(s/d)^2] λ < 1/ [ 1 − 4 ( s / d ) 2 ] .
A fixed positive margin below the dipole threshold gives a rate of order g 0 u 2 g_0u^2 g 0 u 2 . To see this, take s = α r s=\alpha r s = α r for a fixed 0 < α < 1 0<\alpha<1 0 < α < 1 and write λ Q = Λ Q / Λ c \lambda_Q=\Lambda_Q/\Lambda_c λ Q = Λ Q / Λ c . The ratio γ Q / κ = 2 λ Q [ 1 − 4 ( s / d ) 2 ] \gamma_Q/\kappa=2\lambda_Q[1-4(s/d)^2] γ Q / κ = 2 λ Q [ 1 − 4 ( s / d ) 2 ] can be increased to 2 λ Q 2\lambda_Q 2 λ Q by adding local dephasing. At fixed λ A , λ B \lambda_A,\lambda_B λ A , λ B with λ A λ B < 1 \lambda_A\lambda_B<1 λ A λ B < 1 , choose a small positive dimensionless time τ = κ t \tau=\kappa t τ = κ t for which this padded two-qubit state is entangled. Its state is independent of u u u , so it has a fixed positive two-way distillation yield D λ A , λ B D_{\lambda_A,\lambda_B} D λ A , λ B ebits per copy. This uses the distillability theorem for entangled two-qubit states [29 ] : local filtering and a finite number of recurrence steps reach positive hashing yield with nonzero total success fraction. Independent preparation and distillation give a rate at least D λ A , λ B κ / τ = Ω ( g 0 u 2 ) D_{\lambda_A,\lambda_B}\kappa/\tau=\Omega(g_0u^2) D λ A , λ B κ / τ = Ω ( g 0 u 2 ) . The noiseless capacity supplies the matching upper order. For equal noise, this lower bound can be taken uniformly over 0 ≤ λ ≤ 1 − δ 0\leq\lambda\leq1-\delta 0 ≤ λ ≤ 1 − δ with any fixed 0 < δ < 1 0<\delta<1 0 < δ < 1 by padding to the same ratios 2 ( 1 − δ ) 2(1-\delta) 2 ( 1 − δ ) . (24) also shows that λ ( u ) → 1 \lambda(u)\to1 λ ( u ) → 1 forces a rate o ( g 0 u 2 ) o(g_0u^2) o ( g 0 u 2 ) , including approach from below.
At each finite separation the full axial coupling in Eq. (31) exceeds its dipole approximation. For equal noise, γ A = γ B = γ \gamma_A=\gamma_B=\gamma γ A = γ B = γ , the negative-partial-transpose criterion from Eq. (106) is ∣ sin ( 2 κ t ) ∣ > sinh ( γ t ) |\sin(2\kappa t)|>\sinh(\gamma t) ∣ sin ( 2 κ t ) ∣ > sinh ( γ t ) . For a concrete example, take s / d = 1 / 10 s/d = 1/10 s / d = 1/10 , r / d > 1 / 10 r/d > 1/10 r / d > 1/10 , and Λ A = Λ B = ( 51 / 50 ) Λ c \Lambda_A = \Lambda_B = (51/50)\Lambda_c Λ A = Λ B = ( 51/50 ) Λ c . Then γ / κ = 1.9584 \gamma/\kappa= 1.9584 γ / κ = 1.9584 exactly. At κ t = 1 / 10 \kappa t = 1/10 κ t = 1/10 ,
sin ( 0.2 ) > sinh ( 0.19584 ) , λ min ( ρ T B ) = e − 0.19584 2 [ sinh ( 0.19584 ) − sin ( 0.2 ) ] ≃ − 6.47 × 10 − 4 . \sin(0.2) > \sinh(0.19584), \qquad\lambda_{\min}(\rho^{T_B}) = \frac{e^{-0.19584}}{2}\left[\sinh(0.19584) - \sin(0.2)\right] \simeq-6.47 \times10^{-4}. sin ( 0.2 ) > sinh ( 0.19584 ) , λ m i n ( ρ T B ) = 2 e − 0.19584 [ sinh ( 0.19584 ) − sin ( 0.2 ) ] ≃ − 6.47 × 1 0 − 4 .
This produces unprotected entanglement above the dipole threshold. The strict inequality also follows from the alternating lower bound sin x ≥ x − x 3 / 6 \sin x \ge x - x^3/6 sin x ≥ x − x 3 /6 at x = 0.2 x = 0.2 x = 0.2 and the upper bound sinh y ≤ y + y 3 / [ 6 ( 1 − y 2 / 20 ) ] \sinh y \le y + y^3/[6(1-y^2/20)] sinh y ≤ y + y 3 / [ 6 ( 1 − y 2 /20 )] at y = 0.19584 y = 0.19584 y = 0.19584 , obtained by bounding the ratios of successive series terms beginning with the cubic term.
Both arguments admit finite-energy packets. Centre disjoint, smooth, compactly supported packets at the two positions in each laboratory. On the union of the packet supports, replace each position operator by its packet-centre value and V V V by the corresponding position-label potential. The two generators converge in trace-class operator norm, also after tensoring an identity on references. Indeed ∥ [ H , ⋅ ] ∥ 1 → 1 ≤ 2 ∥ H ∥ \|[H,\cdot]\|_{1\to1} \le2\|H\| ∥ [ H , ⋅ ] ∥ 1 → 1 ≤ 2∥ H ∥ , the difference between two bounded double commutators is bounded by 4 ( ∥ X ∥ + ∥ X ′ ∥ ) ∥ X − X ′ ∥ 4(\|X\|+\|X'\|)\|X-X'\| 4 ( ∥ X ∥ + ∥ X ′ ∥ ) ∥ X − X ′ ∥ , and the position and potential supremum errors vanish as the widths decrease. Both dwell channels preserve the packet-support subspace, so the integrated generator error bounds the trace-norm error at any fixed dwell time. The two support regions can be decoded locally into a position label and an internal spatial register. Tracing out the latter gives convergence to the two-qubit point-mode state. For the example at r = d / 6 r = d/6 r = d /6 , one explicit choice is support radius w = 10 − 6 d w = 10^{-6}d w = 1 0 − 6 d . The potential error is at most 2 G w / ( d − 2 r ) 2 2Gw/(d-2r)^2 2 Gw / ( d − 2 r ) 2 and each coordinate error is at most w w w . The corresponding trace-norm generator error is at most ( 429 / 25 ) g 0 w / d (429/25)g_0w/d ( 429/25 ) g 0 w / d . Since κ = g 0 / 48 \kappa= g_0/48 κ = g 0 /48 here, the dwell lasts 24 / ( 5 g 0 ) 24/(5g_0) 24/ ( 5 g 0 ) and the trace-norm output error is less than 8.3 × 10 − 5 8.3 \times10^{-5} 8.3 × 1 0 − 5 . Partial transposition preserves the Hilbert–Schmidt norm, so the change in the minimum partial-transpose eigenvalue is bounded by this trace-norm error. The series inequalities above and e − 0.19584 ≥ 1 − 0.19584 e^{-0.19584} \ge1 - 0.19584 e − 0.19584 ≥ 1 − 0.19584 bound the point-mode eigenvalue above by − 6 × 10 − 4 -6 \times10^{-4} − 6 × 1 0 − 4 , proving strict negativity for these smooth packets. In a distillation block, widths may be chosen small enough to make the total approximation error vanish along the sequence of blocks. Each packet has finite kinetic energy under the stated ideal-control convention.
These unprotected packet dwells can also be approached if physical evolution includes the Dirichlet kinetic Hamiltonians. After each short physical dwell h h h , undo its local kinetic unitary with the free local controls. The resulting map is F h = U − h e h ( B + B ) F_h = U_{-h}^{e^{h(\mathcal{B}+\mathcal{B})}} F h = U − h e h ( B + B ) . Its interaction-picture integral equation gives ( F h − I ) / h → B (F_h-I)/h \to\mathcal{B} ( F h − I ) / h → B strongly on trace class, with a uniform bound on these difference quotients for small h h h . This convergence is uniform on the compact trajectory { e s B ρ : 0 ≤ s ≤ t } \{e^{s\mathcal{B}}\rho: 0 \le s \le t\} { e s B ρ : 0 ≤ s ≤ t } for any fixed input ρ \rho ρ . Comparing F h F_h F h with e h B e^{h\mathcal{B}} e h B at successive points of that trajectory gives F t / n n ρ → e t B ρ F_{t/n}^n\rho\to e^{t\mathcal{B}}\rho F t / n n ρ → e t B ρ by contractivity and telescoping. The physical dwell times sum to t t t . Thus the strict packet witness persists after sufficiently many finite local pulses. A finite distillation block is approximated by choosing the pulse count for its desired error.
Thus the dipole threshold removes the order g 0 u 2 g_0u^2 g 0 u 2 contribution to the capacity. The ideal exact force-recovery protocol retains a rate of order g 0 u 6 g_0u^6 g 0 u 6 , and above the threshold the all-protocol upper bound is of order g 0 u 3 g_0u^3 g 0 u 3 . The optimal subleading rate is open.
What error detection and correction remove
We now restrict attention to a code that is restored after each short interaction, with the quantum error record discarded. We derive the projected Hamiltonian, identify which position moments exact correction removes, and bound the rate left in the full Newtonian series. Alternating polygon codes attain the resulting distance exponent. We then separate moment detection from correction and verify that smooth packets approach the corrected dynamics even when kinetic evolution is retained.
Noise protection and the geometry of the retained interaction
Random forces couple to the position of each mass. To correct these forces, we must encode a logical state in distributions whose first and second position moments agree. The Newtonian interaction then distinguishes the logical states through higher moments. We first bound the rate that survives polynomial position-error correction in three dimensions. We then show that protection changes the useful geometry: a planar code produces a larger protected entangling rate than every axial code, as proved in Section S5. Here we establish the moment cancellations and recovery limit needed for that comparison.
Protected logical dynamics
Let G = G m A m B \mathcal{G}=Gm_A m_B G = G m A m B , and let the two allowed position balls have radius r r r and centres separated by d > 2 r d>2r d > 2 r . Local position operators are measured from their respective centres. We first consider independent white force noise,
L f o r c e ( ρ ) = − Λ ∑ Q = A , B ∑ i = x , y , z [ q Q , i , [ q Q , i , ρ ] ] , (32) \mathcal{L}_{\mathrm{force}}(\rho)=-\Lambda\sum_{Q=A,B}\sum_{i=x,y,z}[q_{Q,i},[q_{Q,i},\rho]], \tag*{(32)} L force ( ρ ) = − Λ Q = A , B ∑ i = x , y , z ∑ [ q Q , i , [ q Q , i , ρ ]] , (32)
Here q Q , i q_{Q,i} q Q , i is Cartesian position component i i i in laboratory Q Q Q , and Λ ≥ 0 \Lambda\geq0 Λ ≥ 0 is the force-dephasing strength defined in § 1.11 . Let P Q P_Q P Q denote the orthogonal projector onto a fixed local protected subspace, including any local ancillary system used in the encoding. This code corrects the infinitesimal error span { I , q Q , x , q Q , y , q Q , z } \{I,q_{Q,x},q_{Q,y},q_{Q,z}\} { I , q Q , x , q Q , y , q Q , z } precisely when the Knill–Laflamme conditions hold:
P Q q Q , i P Q = μ Q , i P Q , P Q q Q , i q Q , j P Q = μ Q , i j P Q . (33) P_Qq_{Q,i}P_Q=\mu_{Q,i}P_Q,\qquad P_Qq_{Q,i}q_{Q,j}P_Q=\mu_{Q,ij}P_Q. \tag*{(33)} P Q q Q , i P Q = μ Q , i P Q , P Q q Q , i q Q , j P Q = μ Q , ij P Q . (33)
The numbers μ Q , i \mu_{Q,i} μ Q , i and μ Q , i j \mu_{Q,ij} μ Q , ij are independent of the logical state. Thus the first and second moments cannot reveal which state the code stores, and the off-diagonal logical matrix elements of these observables vanish. These operator conditions apply to an arbitrary logical dimension, not only to two chosen codewords. We recover locally after every dwell and reset or discard the quantum syndrome systems. In the limit of vanishing dwell, the retained logical system evolves under
H L = ( P A ⊗ P B ) V ( P A ⊗ P B ) , V = − G ∣ d e z + b − a ∣ . (34) H_L=(P_A\otimes P_B)V(P_A\otimes P_B),\qquad V=-\frac{\mathcal{G}}{\lvert d\mathbf{e}_z+\mathbf{b}-\mathbf{a}\rvert}. \tag*{(34)} H L = ( P A ⊗ P B ) V ( P A ⊗ P B ) , V = − ∣ d e z + b − a ∣ G . (34)
Here a = q A \mathbf{a}=\mathbf{q}_A a = q A and b = q B \mathbf{b}=\mathbf{q}_B b = q B are the local positions and e z \mathbf{e}_z e z is the separation direction. The logical evolution is specified up to local Hamiltonians. This follows either by expanding one recovered cycle to first order or by the local recovery limit used in Ref. [13 ] . Exact correction here concerns the infinitesimal error span; finite dwells are treated below.
The protected entangling rate is the ideal ancilla-assisted capacity of H L H_L H L , allowing local controls within the protected logical systems. The bounds below apply to every fixed subspace satisfying Eq. (33) , and hence also to time sharing between such subspaces. They concern the retained logical output with quantum syndromes reset, rather than entanglement stored in discarded error spaces. An axial code means that both masses are confined to the line joining the two centres, with each local coordinate in [ − r , r ] [-r,r] [ − r , r ] .
A universal rate bound for polynomial position-error correction
Correcting more position errors removes more of the gravitational interaction. Wang and colleagues identify the surviving higher Newtonian order for a particular oscillator encoding[13 ] . We now bound the entangling rate of every code in the three-dimensional balls, including codes with ancillary systems. A family of planar codes then shows that the distance exponent in this bound is attainable.
Let N ≥ 1 N \ge1 N ≥ 1 be an integer. At each laboratory, suppose that the fixed code corrects all Cartesian position monomials of total degree at most N N N . Products of these errors span the polynomials of degree at most 2 N 2N 2 N , so the Knill–Laflamme conditions are equivalent to
P Q p ( q Q ) P Q = c Q , p P Q , deg p ≤ 2 N , Q = A , B . (35) P_Q p(q_Q) P_Q = c_{Q,p}P_Q,\qquad\deg p \le2N,\qquad Q=A,B. \tag*{(35)} P Q p ( q Q ) P Q = c Q , p P Q , deg p ≤ 2 N , Q = A , B . (35)
We retain the projected logical dynamics in Eq. (34) , with quantum syndromes reset. All gravitational seed preparation is included in the interaction time. Let C p r o t ( N ) ( d , r ) C_{\mathrm{prot}}^{(N)}(d,r) C prot ( N ) ( d , r ) be the supremum of the ideal capacities over these fixed local codes and their finite-protocol limits. Local controls preserve the codes, and arbitrary local memories are allowed. Finite packet realizations have finite kinetic energy, with no common bound on energy or recovery bandwidth along an approximating sequence.
Write M = 2 N + 1 M=2N+1 M = 2 N + 1 for the first degree not required to be scalar by correction, u = r / d < 1 / 2 u=r/d<1/2 u = r / d < 1/2 , and let β \beta β have its value in Eq. (16) . The series S M S_M S M bounds all interaction terms of degree at least M M M on both sides; K M K_M K M will be the coefficient attained by the alternating polygon construction. We define them by
S M ( u ) = ∑ j , k ≥ M ( j + k j ) u j + k . (36) S_M(u)=\sum_{j,k\ge M}\binom{j+k}{j}u^{j+k}. \tag*{(36)} S M ( u ) = j , k ≥ M ∑ ( j j + k ) u j + k . (36)
K M = 2 2 M ( 2 M M ) 16 M [ ( 4 M 2 M ) + ( 2 M M ) ] . (37) K_M=\frac{2^{2M}\binom{2M}{M}}{16^M}\left[\binom{4M}{2M}+\binom{2M}{M}\right]. \tag*{(37)} K M = 1 6 M 2 2 M ( M 2 M ) [ ( 2 M 4 M ) + ( M 2 M ) ] . (37)
Theorem S4 (Universal protected rate and its distance scaling). For d > 2 r d>2r d > 2 r , the protected capacities satisfy
β G ℏ d K M u 2 M ≤ C p r o t ( N ) ( d , r ) ≤ β G ℏ d S M ( u ) . (38) \frac{\beta\mathcal{G}}{\hbar d}K_Mu^{2M}\le C_{\mathrm{prot}}^{(N)}(d,r)\le\frac{\beta\mathcal{G}}{\hbar d}S_M(u). \tag*{(38)} ℏ d β G K M u 2 M ≤ C prot ( N ) ( d , r ) ≤ ℏ d β G S M ( u ) . (38) The upper bound applies to each code of arbitrary logical dimension, including arbitrary local ancillary systems. The series obeys
S M ( u ) ≤ min { ( 2 u ) 2 M 1 − 2 u , ( 2 M M ) u 2 M ( 1 − 2 u ) 2 } , S M ( u ) = ( 2 M M ) u 2 M + O ( u 2 M + 1 ) . (39) S_M(u)\le\min\left\{\frac{(2u)^{2M}}{1-2u},\frac{\binom{2M}{M}u^{2M}}{(1-2u)^2}\right\},\qquad S_M(u)=\binom{2M}{M}u^{2M}+O(u^{2M+1}). \tag*{(39)} S M ( u ) ≤ min { 1 − 2 u ( 2 u ) 2 M , ( 1 − 2 u ) 2 ( M 2 M ) u 2 M } , S M ( u ) = ( M 2 M ) u 2 M + O ( u 2 M + 1 ) . (39) Consequently, for fixed N N N and r r r , the optimal protected rate scales as G r 4 N + 2 / ( ℏ d 4 N + 3 ) \mathcal{G}r^{4N+2}/(\hbar d^{4N+3}) G r 4 N + 2 / ( ℏ d 4 N + 3 ) as d / r → ∞ d/r\to\infty d / r → ∞ , up to positive constants depending on N N N . The lower bound holds at every finite separation d > 2 r d>2r d > 2 r as a supremum of finite-energy packet constructions.
Proof. We first express the potential as a convergent sum of separated position factors. In this form a corrected local moment removes an entire class of bipartite terms. For the transverse angle 0 ≤ ϕ < 2 π 0\le\phi<2\pi 0 ≤ ϕ < 2 π , define
ζ ϕ ( a ) = a z + i ( a x cos ϕ + a y sin ϕ ) , ∣ ζ ϕ ( a ) ∣ ≤ r , \zeta_\phi(\mathbf{a})=a_z+i(a_x\cos\phi+a_y\sin\phi),\qquad|\zeta_\phi(\mathbf{a})|\le r, ζ ϕ ( a ) = a z + i ( a x cos ϕ + a y sin ϕ ) , ∣ ζ ϕ ( a ) ∣ ≤ r ,
and use ⟨ ⋅ ⟩ ϕ \langle\cdot\rangle_\phi ⟨ ⋅ ⟩ ϕ for uniform angular averaging. The complex coordinate combines the longitudinal position with its projection onto a transverse direction. Expanding its exponentials will separate Alice’s and Bob’s powers. The Laplace–Bessel identity gives
1 ∣ d e z + b − a ∣ = ∫ 0 ∞ e − d t ⟨ e t ζ ϕ ( a ) e − t ζ ϕ ( b ) ⟩ ϕ d t = 1 d ∑ j , k ≥ 0 ( j + k j ) ⟨ ζ ϕ ( a ) j [ − ζ ϕ ( b ) ] k ⟩ ϕ d j + k . (40) \begin{aligned}
\frac{1}{|d\mathbf{e}_z+\mathbf{b}-\mathbf{a}|}
=\int_0^\infty e^{-dt}\left\langle e^{t\zeta_\phi(\mathbf{a})}e^{-t\zeta_\phi(\mathbf{b})}\right\rangle_\phi\,dt \\
&=\frac{1}{d}\sum_{j,k\ge0}\binom{j+k}{j}\frac{\left\langle\zeta_\phi(\mathbf{a})^j[-\zeta_\phi(\mathbf{b})]^k\right\rangle_\phi}{d^{j+k}}. \tag*{(40)}
\end{aligned} ∣ d e z + b − a ∣ 1 = ∫ 0 ∞ e − d t ⟨ e t ζ ϕ ( a ) e − t ζ ϕ ( b ) ⟩ ϕ d t = d 1 j , k ≥ 0 ∑ ( j j + k ) d j + k ⟨ ζ ϕ ( a ) j [ − ζ ϕ ( b ) ] k ⟩ ϕ . (40)
Here t t t is the nonnegative Laplace integration variable, with units of inverse length, and j , k j,k j , k are the powers on Alice’s and Bob’s sides. For the first equality, the angular average is e t ( a z − b z ) J 0 ( t ∣ a ⊥ − b ⊥ ∣ ) e^{t(a_z-b_z)}J_0(t|\mathbf{a}_\perp-\mathbf{b}_\perp|) e t ( a z − b z ) J 0 ( t ∣ a ⊥ − b ⊥ ∣ ) , whose Laplace transform is the inverse distance. The bound d > 2 r d > 2r d > 2 r allows both the integral and the series to converge absolutely in operator norm.
Put A j = P A ( ζ ϕ / r ) j P A A_j = P_A(\zeta_\phi/r)^j P_A A j = P A ( ζ ϕ / r ) j P A and B k = P B ( − ζ ϕ / r ) k P B B_k = P_B(-\zeta_\phi/r)^k P_B B k = P B ( − ζ ϕ / r ) k P B , acting on their respective code spaces. They are contractions, meaning operators of norm at most one, because ∣ ζ ϕ ∣ ≤ r |\zeta_\phi| \le r ∣ ζ ϕ ∣ ≤ r and compression cannot increase the norm. Equation (S25) makes all terms with j < M j < M j < M or k < M k < M k < M local or scalar. Moreover, replacing ϕ \phi ϕ by ϕ + π \phi+\pi ϕ + π conjugates the multiplication factors. Thus the remaining interaction is the sum in Eq. (40) with j , k ≥ M j,k \ge M j , k ≥ M and Hermitian factors Re ( A j ⊗ B k ) \operatorname{Re}(A_j \otimes B_k) Re ( A j ⊗ B k ) .
To bound their entangling rate, we use real separated operators. For any contractions A , B A,B A , B , write
Re ( A ⊗ B ) = A R ⊗ B R − A I ⊗ B I , A R 2 + A I 2 = A † A + A A † 2 ≤ I (41) \operatorname{Re}(A \otimes B) = A_R \otimes B_R - A_I \otimes B_I, \qquad A_R^2 + A_I^2 = \frac{A^\dagger A + AA^\dagger}{2} \le I \tag*{(41)} Re ( A ⊗ B ) = A R ⊗ B R − A I ⊗ B I , A R 2 + A I 2 = 2 A † A + A A † ≤ I (41)
where A R = ( A + A † ) / 2 A_R = (A + A^\dagger)/2 A R = ( A + A † ) /2 , A I = ( A − A † ) / ( 2 i ) A_I = (A - A^\dagger)/(2i) A I = ( A − A † ) / ( 2 i ) , and similarly for B B B . For a pure state of the complete laboratories, write S 2 S_2 S 2 for its von Neumann entanglement entropy with logarithms in base two; the subscript denotes the logarithm base, not a Rényi order. The expectation values below are in this state. The product-Hamiltonian moment bound (S164) gives
∣ S ˙ 2 ∣ ≤ β ℏ [ ⟨ A R 2 ⟩ ⟨ B R 2 ⟩ + ⟨ A I 2 ⟩ ⟨ B I 2 ⟩ ] ≤ β ℏ ⟨ A R 2 + A I 2 ⟩ ⟨ B R 2 + B I 2 ⟩ ≤ β ℏ (42) \begin{aligned}
|\dot{S}_2| \le\frac{\beta}{\hbar}\left[\sqrt{\langle A_R^2\rangle\langle B_R^2\rangle}+\sqrt{\langle A_I^2\rangle\langle B_I^2\rangle}\right] \\
&\le\frac{\beta}{\hbar}\sqrt{\langle A_R^2+A_I^2\rangle\langle B_R^2+B_I^2\rangle} \le\frac{\beta}{\hbar} \tag*{(42)}
\end{aligned} ∣ S ˙ 2 ∣ ≤ ℏ β [ ⟨ A R 2 ⟩ ⟨ B R 2 ⟩ + ⟨ A I 2 ⟩ ⟨ B I 2 ⟩ ] ≤ ℏ β ⟨ A R 2 + A I 2 ⟩ ⟨ B R 2 + B I 2 ⟩ ≤ ℏ β (42)
The middle step is Cauchy–Schwarz. Compression need not preserve normality of A A A or B B B ; the contraction identity above still holds. Summing the positive coefficients of the separated expansion proves the upper rate in Eq. (38) . This step uses the product structure and second moments, rather than the operator norm of an unrestricted bipartite Hamiltonian.
For arbitrary normal states and code spaces, we use the entropy regularization described in Section S8 § 1.40 . The regularized Schmidt-pair logarithms have smaller magnitude, so Eq. (42) is uniform in the regularization parameter. Concavity controls averages over local measurement outcomes, and Fatou’s lemma gives the final entropy bound. The interaction series has summable operator norms. Every finite initially separable protocol therefore has average final pure-branch entropy at most β G S M ( u ) E T i n t / ( ℏ d ) \beta G S_M(u) E T_{\mathrm{int}}/(\hbar d) β G S M ( u ) E T int / ( ℏ d ) . Producing L L L Bell pairs with vanishing error requires at least L − o ( L ) L-o(L) L − o ( L ) entropy on their finite output registers. This proves the capacity bound and its extension to normal limits of finite protocols with convergent output probabilities and interaction costs. The same bound also holds under time sharing between admissible codes.
For the series estimates, summing the full binomial row at total degree n n n gives 2 n 2^n 2 n , proving the first bound in Eq. (39) . At degree 2 M + n 2M+n 2 M + n , each of the n + 1 n+1 n + 1 retained binomial coefficients is at most 2 n ( 2 M M ) 2^n \binom{2M}{M} 2 n ( M 2 M ) : the largest binomial coefficient grows by at most a factor two when its row index increases by one. Summing ( n + 1 ) ( 2 u ) n (n+1)(2u)^n ( n + 1 ) ( 2 u ) n proves the second bound. A truncation after total degree L L L has remainder at most ( 2 u ) L + 1 / ( 1 − 2 u ) (2u)^{L+1}/(1-2u) ( 2 u ) L + 1 / ( 1 − 2 u ) .
We next construct codes that attain the distance exponent. Take the same orientation of a regular 2 M 2M 2 M -gon of radius a < r a<r a < r at both laboratories,
a j = b j = a ( sin θ j , 0 , cos θ j ) , θ j = π j / M , j = 0 , … , 2 M − 1 , (43) \mathbf{a}_j=\mathbf{b}_j=a(\sin\theta_j,0,\cos\theta_j), \qquad\theta_j=\pi j/M,\qquad j=0,\ldots,2M-1, \tag*{(43)} a j = b j = a ( sin θ j , 0 , cos θ j ) , θ j = π j / M , j = 0 , … , 2 M − 1 , (43)
where ∣ j ⟩ |j\rangle ∣ j ⟩ labels the orthogonal position mode at vertex j j j . We form the two logical states by assigning alternate vertices to each:
∣ 0 L ⟩ = 1 M ∑ j e v e n ∣ j ⟩ , ∣ 1 L ⟩ = 1 M ∑ j o d d ∣ j ⟩ . (44) |0_L\rangle=\frac{1}{\sqrt{M}}\sum_{j\ \mathrm{even}}|j\rangle,\qquad|1_L\rangle=\frac{1}{\sqrt{M}}\sum_{j\ \mathrm{odd}}|j\rangle. \tag*{(44)} ∣ 0 L ⟩ = M 1 j even ∑ ∣ j ⟩ , ∣ 1 L ⟩ = M 1 j odd ∑ ∣ j ⟩ . (44)
Polynomial moment cancellation and interleaved spatial code principles have the antecedents in Refs. [12 , 24 ] . Here a polynomial of degree less than M M M has angular Fourier frequencies below M M M , so its averages over the two parity classes agree. The codewords have disjoint support, making their off-diagonal moments zero. Thus they satisfy Eq. (35) for all three coordinates.
We evaluate the full logical coupling to show that its higher orders reinforce the leading term. Let A ( ϕ ) = ( 1 + cos ϕ ) / 2 A(\phi) = (1 + \cos\phi)/2 A ( ϕ ) = ( 1 + cos ϕ ) /2 , B ( ϕ ) = ( 1 − cos ϕ ) / 2 B(\phi) = (1 - \cos\phi)/2 B ( ϕ ) = ( 1 − cos ϕ ) /2 . On a polygon vertex, ζ ϕ / a = A ( ϕ ) e i θ j + B ( ϕ ) e − i θ j \zeta_\phi/a = A(\phi)e^{i\theta_j} + B(\phi)e^{-i\theta_j} ζ ϕ / a = A ( ϕ ) e i θ j + B ( ϕ ) e − i θ j . Let Z = ∣ 0 L ⟩ ⟨ 0 L ∣ − ∣ 1 L ⟩ ⟨ 1 L ∣ Z = |0_L\rangle\langle0_L| - |1_L\rangle\langle1_L| Z = ∣ 0 L ⟩ ⟨ 0 L ∣ − ∣ 1 L ⟩ ⟨ 1 L ∣ . For a nonnegative integer q q q , the coefficient of this logical Z Z Z in the q q q th compressed power is
d q ( ϕ ) = ∑ 0 ≤ l ≤ q q − 2 l ≡ M ( mod 2 M ) ( q l ) A ( ϕ ) q − l B ( ϕ ) l . (45) d_q(\phi) = \sum_{\substack{0 \le l \le q \\ q-2l \equiv M\;(\operatorname{mod} 2M)}} \binom{q}{l} A(\phi)^{q-l}B(\phi)^l. \tag*{(45)} d q ( ϕ ) = 0 ≤ l ≤ q q − 2 l ≡ M ( mod 2 M ) ∑ ( l q ) A ( ϕ ) q − l B ( ϕ ) l . (45)
This follows by summing the signed root-of-unity phases over the 2 M 2M 2 M vertices. The coefficient vanishes for q < M q < M q < M and for even q q q , and is nonnegative for odd q q q . In particular, d M = A ( ϕ ) M + B ( ϕ ) M d_M = A(\phi)^M + B(\phi)^M d M = A ( ϕ ) M + B ( ϕ ) M .
Since Bob’s factor in Eq. (40) contains ( − 1 ) k (-1)^k ( − 1 ) k , every surviving nonlocal term has the same sign. Writing the compressed Hamiltonian, modulo local terms, as ℏ J M Z A Z B \hbar J_M Z_A Z_B ℏ J M Z A Z B , we obtain
J M = G ℏ d ∑ j , k ≥ M ( j + k j ) ( a / d ) j + k ⟨ d j d k ⟩ ϕ ≥ G ℏ d K M ( a / d ) 2 M . (46) J_M = \frac{G}{\hbar d}\sum_{j,k \ge M}\binom{j+k}{j}(a/d)^{j+k}\langle d_jd_k\rangle_\phi\ge\frac{G}{\hbar d}K_M(a/d)^{2M}. \tag*{(46)} J M = ℏ d G j , k ≥ M ∑ ( j j + k ) ( a / d ) j + k ⟨ d j d k ⟩ ϕ ≥ ℏ d G K M ( a / d ) 2 M . (46)
All terms in this expression are nonnegative, so the lower bound holds for every d > 2 a d > 2a d > 2 a . To evaluate its leading coefficient, use
⟨ [ A ( ϕ ) M + B ( ϕ ) M ] 2 ⟩ ϕ = 2 16 M [ ( 4 M 2 M ) + ( 2 M M ) ] . \left\langle[A(\phi)^M + B(\phi)^M]^2 \right\rangle_\phi= \frac{2}{16^M}\left[\binom{4M}{2M} + \binom{2M}{M}\right]. ⟨ [ A ( ϕ ) M + B ( ϕ ) M ] 2 ⟩ ϕ = 1 6 M 2 [ ( 2 M 4 M ) + ( M 2 M ) ] .
This average is the squared size of the first logical moment, so multiplying it by ( 2 M M ) \binom{2M}{M} ( M 2 M ) gives K M K_M K M . The first contribution is the average of 2 cos 4 M ( ϕ / 2 ) 2\cos^{4M}(\phi/2) 2 cos 4 M ( ϕ /2 ) ; the cross term is the average of 2 sin 2 M ϕ / 4 M 2\sin^{2M}\phi/4^M 2 sin 2 M ϕ / 4 M . This proves Eq. (37) . Because both nonzero degrees are odd, the next total degree is 2 M + 2 2M + 2 2 M + 2 . Hence
J M = G K M a 2 M ℏ d 2 M + 1 + O ( G a 2 M + 2 ℏ d 2 M + 3 ) . (47) J_M = \frac{G K_M a^{2M}}{\hbar d^{2M+1}} + O\left(\frac{G a^{2M+2}}{\hbar d^{2M+3}}\right). \tag*{(47)} J M = ℏ d 2 M + 1 G K M a 2 M + O ( ℏ d 2 M + 3 G a 2 M + 2 ) . (47)
The established Ising capacity is β J M \beta J_M β J M , including the amortized cost of generating its seed entanglement.
Finally, we replace the point modes by normalizable states. Choose a < r a < r a < r and an identical smooth radial packet at every vertex, with support radius w < min { r − a , a sin [ π / ( 2 M ) ] } w < \min\{r-a, a\sin[\pi/(2M)]\} w < min { r − a , a sin [ π / ( 2 M )]} . The packets are disjoint and lie within the allowed balls. Each translated packet moment is a polynomial in its centre of no higher degree, so the parity cancellation and all Knill–Laflamme conditions remain exact. The Coulomb kernel is harmonic on either packet support. Averaging it against a normalized radial density therefore returns its value at the centre; applying this mean-value identity successively to both packets preserves each compressed potential entry. Each codeword has finite kinetic energy. Taking a ↑ r a \uparrow r a ↑ r with nonzero widths tending to zero proves the lower supremum in Eq. (38) . These packets realize the projected Hamiltonian; maintaining their spatial modes and correcting their internal error sectors are part of the stipulated ideal local control.
For N = 1 N = 1 N = 1 , M = 3 M = 3 M = 3 and K 3 = 295 / 32 K_3 = 295/32 K 3 = 295/32 , so this family recovers the hexagon coefficient used below. The reflected orientation used there exchanges Bob’s two logical labels and leaves the capacity unchanged. The general upper coefficient is ( 6 3 ) = 20 \binom{6}{3} = 20 ( 3 6 ) = 20 . The cubic refinement in Section S5 S5.1 reduces it to 10.17758296 … 10.17758296\ldots 10.17758296 … , placing the planar construction within 10.41 % 10.41\% 10.41% of the optimal leading coefficient over all three-dimensional codes. At the finite separation d / r = 3.6 d/r = 3.6 d / r = 3.6 , S 3 ( 1 / 3.6 ) = 0.0345517560525961 … S_3(1/3.6) = 0.0345517560525961\ldots S 3 ( 1/3.6 ) = 0.0345517560525961 … . Comparing with the bare capacity in Eq. (11) , every protected three-dimensional code has rate at most 0.154792 0.154792 0.154792 times that capacity.
The entropy proof also bounds the interaction time required by a statistical test. Let p p p be the protocol’s acceptance probability and α \alpha α its largest acceptance probability on a separable output. Write d b i n ( p ∥ α ) = p ln ( p / α ) + ( 1 − p ) ln [ ( 1 − p ) / ( 1 − α ) ] d_{\mathrm{bin}}(p\Vert\alpha) = p\ln(p/\alpha) + (1-p)\ln[(1-p)/(1-\alpha)] d bin ( p ∥ α ) = p ln ( p / α ) + ( 1 − p ) ln [( 1 − p ) / ( 1 − α )] for their binary relative entropy. If every interaction in an initially separable protocol obeys the correction conditions, a final retained-logical test of all-separable size 0 < α < p ≤ 1 0 < \alpha< p \le1 0 < α < p ≤ 1 satisfies
d b i n ( p ∥ α ) ≤ β G ℏ d S M ( u ) ln 2 E T i n t . (48) d_{\mathrm{bin}}(p\mathbin{\|}\alpha) \le\frac{\beta\mathcal{G}}{\hbar d}S_M(u)\ln2\,ET_{\mathrm{int}}. \tag*{(48)} d bin ( p ∥ α ) ≤ ℏ d β G S M ( u ) ln 2 E T int . (48)
The separable-comparator argument includes every recorded outcome. This concerns the fixed-code projected dynamics; entanglement exported into quantum syndrome memories requires a different capacity problem.
The first retained multipole under moment detection
A code that detects linear force errors has the same first moments in both logical states. It can still distinguish second moments, which appear in the quadrupole–quadrupole part of the interaction. Exact correction of linear errors also makes their products scalar and therefore first permits a cubic moment. We quantify this difference for every moment order in the projected Hamiltonian of Eq. (34) .
Let M ≥ 1 M \ge1 M ≥ 1 be an integer. At each laboratory, require P Q h ( q Q ) P Q P_Qh(\mathbf{q}_Q)P_Q P Q h ( q Q ) P Q to be scalar on the code for every real harmonic polynomial h h h of degree less than M M M . A harmonic polynomial satisfies ∇ 2 h = 0 \nabla^2 h = 0 ∇ 2 h = 0 . The same compression condition applies to complex harmonic polynomials by linearity. Let C M p r o j C_M^{\mathrm{proj}} C M proj be the supremum of the ideal entanglement-generation capacity of these projected Hamiltonians, with free local operations, ancillary systems, and seed preparation counted in the time. Here g 0 = G / ( ℏ d ) g_0 = \mathcal{G}/(\hbar d) g 0 = G / ( ℏ d ) and u = r / d u = r/d u = r / d , as in the noisy-capacity section. Unlike the preceding correction theorem, this condition allows even M M M : it specifies the moments that are invisible within the code, without asserting that a noisy evolution can be corrected.
Theorem S5 (Capacity by order of detected moments). For every integer M ≥ 1 M \ge1 M ≥ 1 and 0 < u < 1 / 2 0 < u < 1/2 0 < u < 1/2 ,
β g 0 K M u 2 M ≤ C M p r o j ≤ β g 0 S M ( u ) , K M = 2 16 M ( 2 M M ) [ ( 4 M 2 M ) + ( 2 M M ) ] . (49) \beta g_0 K_M u^{2M} \le C_M^{\mathrm{proj}} \le\beta g_0 S_M(u), \qquad K_M = \frac{2}{16^M}\binom{2M}{M}\left[\binom{4M}{2M}+\binom{2M}{M}\right]. \tag*{(49)} β g 0 K M u 2 M ≤ C M proj ≤ β g 0 S M ( u ) , K M = 1 6 M 2 ( M 2 M ) [ ( 2 M 4 M ) + ( M 2 M ) ] . (49) The upper bound holds for each admissible code, irrespective of logical dimension. The lower bound is a supremum of finite-energy packet constructions at every d > 2 r d > 2r d > 2 r .
Proof. Use the expansion in Eq. (40) with ζ ϕ ( a ) = a z + i ( a x cos ϕ + a y sin ϕ ) \zeta_\phi(\mathbf{a}) = a_z + i(a_x\cos\phi+ a_y\sin\phi) ζ ϕ ( a ) = a z + i ( a x cos ϕ + a y sin ϕ ) . The coefficient vector of this linear form has complex bilinear square zero: 1 − cos 2 ϕ − sin 2 ϕ = 0 1-\cos^2\phi-\sin^2\phi=0 1 − cos 2 ϕ − sin 2 ϕ = 0 . For j ≥ 2 j \ge2 j ≥ 2 , taking a Laplacian of the power multiplies that square by j ( j − 1 ) ζ ϕ j − 2 j(j-1)\zeta_\phi^{j-2} j ( j − 1 ) ζ ϕ j − 2 . The constant and linear cases are harmonic directly, so ζ ϕ j \zeta_\phi^j ζ ϕ j is harmonic for every j j j . Consequently every term with j < M j < M j < M or k < M k < M k < M becomes local or scalar upon compression. Each remaining compressed factor P Q ( ± ζ ϕ / r ) j P Q P_Q(\pm\zeta_\phi/r)^jP_Q P Q ( ± ζ ϕ / r ) j P Q is a contraction. Pairing ϕ \phi ϕ with ϕ + π \phi+\pi ϕ + π takes the real part of the separated product, with row bound one by Eqs. (41) and (28) . The sum of the row bounds is ( G / d ) S M ( u ) (\mathcal{G}/d)S_M(u) ( G / d ) S M ( u ) . Apply the entropy and extraction argument above with unitary dwells to obtain the upper bound.
For the lower bound, place the same regular 2 M 2M 2 M -gon of radius a < r a<r a < r in the x z xz x z plane in each laboratory, with vertices a ( sin θ n , 0 , cos θ n ) a(\sin\theta_n,0,\cos\theta_n) a ( sin θ n , 0 , cos θ n ) and θ n = π n / M \theta_n=\pi n/M θ n = π n / M , n = 0 , … , 2 M − 1 n=0,\ldots,2M-1 n = 0 , … , 2 M − 1 . The logical states are equal superpositions over the even and odd vertices, respectively. A polynomial of degree less than M M M on the vertices has angular frequencies below M M M , so its two parity-class averages agree. The two logical states have disjoint support, making all position-polynomial off-diagonal elements vanish.
On a vertex, ζ ϕ / a = A e i θ n + B e − i θ n \zeta_\phi/a=Ae^{i\theta_n}+Be^{-i\theta_n} ζ ϕ / a = A e i θ n + B e − i θ n with A = ( 1 + cos ϕ ) / 2 A=(1+\cos\phi)/2 A = ( 1 + cos ϕ ) /2 and B = ( 1 − cos ϕ ) / 2 B=(1-\cos\phi)/2 B = ( 1 − cos ϕ ) /2 . The logical Z Z Z coefficient of the compressed q q q th power of ζ ϕ / a \zeta_\phi/a ζ ϕ / a is the signed Fourier average
d q ( ϕ ) = ∑ 0 ≤ l ≤ q q − 2 l ≡ M ( m o d 2 M ) ( q l ) A q − l B l . d_q(\phi)=\sum_{\substack{0\le l\le q\\q-2l\equiv M\;(\mathrm{mod}\;2M)}}\binom{q}{l}A^{q-l}B^l. d q ( ϕ ) = 0 ≤ l ≤ q q − 2 l ≡ M ( mod 2 M ) ∑ ( l q ) A q − l B l .
Every summand is nonnegative, and a term can occur only when q ≥ M q \ge M q ≥ M and q ≡ M ( m o d 2 ) q \equiv M \pmod{2} q ≡ M ( mod 2 ) . In the full Newtonian series the sign of Bob’s surviving terms is therefore always ( − 1 ) M (-1)^M ( − 1 ) M . Thus the magnitude of the logical Ising frequency receives a nonnegative contribution from every surviving degree,
∣ J M ∣ = g 0 ∑ j , k ≥ M ( j + k j ) ( a / d ) j + k ⟨ d j d k ⟩ ϕ . \lvert J_M\rvert= g_0 \sum_{j,k\ge M} \binom{j+k}{j} (a/d)^{j+k}\langle d_jd_k\rangle_\phi. ∣ J M ∣ = g 0 j , k ≥ M ∑ ( j j + k ) ( a / d ) j + k ⟨ d j d k ⟩ ϕ .
The lowest term, at j = k = M j=k=M j = k = M , uses d M = A M + B M d_M=A^M+B^M d M = A M + B M . Integration of the powers of cos ( ϕ / 2 ) \cos(\phi/2) cos ( ϕ /2 ) and sin ϕ \sin\phi sin ϕ gives ⟨ d M 2 ⟩ ϕ = 2 [ ( 2 M M ) + ( M M ) ] / 16 M \langle d_M^2\rangle_\phi=2\left[\binom{2M}{M}+\binom{M}{M}\right]/16^M ⟨ d M 2 ⟩ ϕ = 2 [ ( M 2 M ) + ( M M ) ] /1 6 M . This term alone gives ∣ J M ∣ ≥ g 0 K M ( a / d ) 2 M \lvert J_M\rvert\ge g_0K_M(a/d)^{2M} ∣ J M ∣ ≥ g 0 K M ( a / d ) 2 M , and the projected Ising Hamiltonian has capacity β ∣ J M ∣ \beta\lvert J_M\rvert β ∣ J M ∣ .
Replace each vertex by the translate of the same smooth radial packet with support radius 0 < w < min { r − a , a sin [ π / ( 2 M ) ] } 0<w<\min\{r-a,a\sin[\pi/(2M)]\} 0 < w < min { r − a , a sin [ π / ( 2 M )]} . The averaged polynomial at a vertex is a polynomial in its centre of no higher degree, so the moment cancellation remains exact. The Coulomb kernel is harmonic separately in each position throughout the packet supports. Integrating over a normalized radial density gives its value at the centre by the harmonic mean-value identity. Applying that identity to each packet in turn preserves all compressed potential entries. The packets have finite kinetic energy and a ↑ r \uparrow r ↑ r gives the lower supremum.
Since S M ( u ) = ( 2 M M ) u 2 M + O ( u 2 M + 1 ) S_M(u)=\binom{2M}{M}u^{2M}+O(u^{2M+1}) S M ( u ) = ( M 2 M ) u 2 M + O ( u 2 M + 1 ) , the optimal projected capacity scales as G r 2 M / ( ℏ d 2 M + 1 ) Gr^{2M}/(\hbar d^{2M+1}) G r 2 M / ( ℏ d 2 M + 1 ) at fixed r r r and large d d d . For M = 1 M=1 M = 1 the exact leading coefficient in units of β g 0 u 2 \beta g_0u^2 β g 0 u 2 is two. For M = 2 M=2 M = 2 it lies between 57 / 16 57/16 57/16 and 6, with a projected rate of order d − 5 d^{-5} d − 5 . The four-vertex construction encodes one logical state at the two axial vertices and the other at the two transverse vertices. This projected result requires only P Q Q q , i P Q ∝ P Q P_QQ_{q,i}P_Q\propto P_Q P Q Q q , i P Q ∝ P Q . A noisy implementation must also account for disturbance and any rejected outcomes. If a code corrects all position errors through degree N N N , Knill–Laflamme tests their products through degree 2 N 2N 2 N and M = 2 N + 1 M=2N+1 M = 2 N + 1 . The exponent becomes 4 N + 3 4N+3 4 N + 3 in distance, as in Theorem S4. In particular, correcting linear errors yields the d − 7 d^{-7} d − 7 law under the ideal recovery convention.
a. Exact force recovery with supported kinetic evolution. The projected Hamiltonian becomes a physical limiting dynamics only if the noise disappears under the recovered cycles. We show this directly by differentiating one encoded dwell followed by a decoder. This also identifies why the kinetic and force terms contribute no logical evolution. For M = 3 M=3 M = 3 , the smooth translated packets used in the polygon construction obey the full Knill–Laflamme conditions in Eq. (33) . Here we verify that they approach the ideal projected Ising rate for every finite pair of force strengths even when the kinetic Hamiltonians act during each dwell. In each laboratory let E 0 = I E_0=I E 0 = I and E i = q i E_i=q_i E i = q i for the three position coordinates. The relations P Q E i † E j P Q = G i j P Q P_QE_i^\dagger E_jP_Q=G_{ij}P_Q P Q E i † E j P Q = G ij P Q identify the span of the error images with a logical qubit tensored with a syndrome space. Here G i j G_{ij} G ij is the scalar Gram matrix of these error images. Explicitly, E i ∣ ψ ⟩ E_i\lvert\psi\rangle E i ∣ ψ ⟩ maps isometrically to ∣ ψ ⟩ ∣ e i ⟩ \lvert\psi\rangle\lvert e_i\rangle ∣ ψ ⟩ ∣ e i ⟩ , where ⟨ e i ∣ e j ⟩ = G i j \langle e_i\vert e_j\rangle=G_{ij} ⟨ e i ∣ e j ⟩ = G ij . Extend this isometry to the whole local Hilbert space using an additional orthogonal syndrome space. Trace out the syndrome to obtain the decoder D Q D_Q D Q . A code vector is mapped to its logical vector and the fixed unit syndrome ∣ e 0 ⟩ \lvert e_0\rangle ∣ e 0 ⟩ , so every vector orthogonal to the code has zero component in that syndrome. The decoder therefore annihilates cross operators between the code and its complement.
Let E \mathcal{E} E be the joint encoding channel and D \mathcal{D} D the product decoder. We use A \mathcal{A} A for the kinetic generator and B = − i [ V , ⋅ ] / ℏ + L f o r c e \mathcal{B}=-i[V,\cdot]/\hbar+\mathcal{L}_{\mathrm{force}} B = − i [ V , ⋅ ] /ℏ + L force for the bounded position generator, as in § 1.11 ; τ \tau τ is the duration of one dwell. Every code matrix unit belongs to the trace-class generator domain because its ket and bra are smooth and supported strictly inside the balls. The expansion on these matrix units gives
D e τ ( A + B ) E = i d + τ L L + o ( τ ) , L L = − i ℏ [ P V P , ⋅ ] , \mathcal{D}e^{\tau(\mathcal{A}+\mathcal{B})}\mathcal{E}=\mathrm{id}+\tau\mathcal{L}_L+o(\tau),\qquad\mathcal{L}_L=-\frac{i}{\hbar}[PVP,\cdot], D e τ ( A + B ) E = id + τ L L + o ( τ ) , L L = − ℏ i [ P V P , ⋅ ] ,
where P = P A ⊗ P B P=P_A\otimes P_B P = P A ⊗ P B and P V P PVP P V P is represented on the logical qubits. The remainder is o ( τ ) o(\tau) o ( τ ) in diamond norm since the logical input is finite dimensional. The cross-operator cancellation compresses each Hamiltonian in the derivative. Equal radial packet profiles have equal kinetic diagonal matrix elements, and disjoint supports give zero off-diagonal ones. Thus P Q K Q P Q P_QK_QP_Q P Q K Q P Q is scalar. For each force term, decoding q i E ( ρ ) q i q_i\mathcal{E}(\rho)q_i q i E ( ρ ) q i gives G i i ρ G_{ii}\rho G ii ρ , and decoding either one-sided multiplication by q i 2 q_i^2 q i 2 also gives G i i ρ G_{ii}\rho G ii ρ by compression. These three terms cancel in the double commutator. These calculations hold with identities on memories.
Repeating the decoded cycle with a fresh local encoding at the start of each dwell converges in diamond norm to e t L e^{t\mathcal{L}} e t L as τ = t / n → 0 \tau=t/n\to0 τ = t / n → 0 , by telescoping against the ideal logical evolution and summing n o ( t / n ) n\,o(t/n) n o ( t / n ) . The syndrome is reset at each cycle and the charged time is t t t . For any finite Ising-capacity block a finite number of ideal local recoveries therefore approximates its output to any prescribed accuracy. The projected coupling is ∣ J 3 ∣ |J_3| ∣ J 3 ∣ for the inward hexagons and tends to g h e x g_{\mathrm{hex}} g hex of Eq. (77) as their centres approach the radius r r r . The rate β g h e x \beta g_{\mathrm{hex}} β g hex is attainable as a supremum in this control model.
Optimizing the protected spatial encoding
Exact force correction leaves cubic moments as the first possible logical signal. We now optimize that signal over spatial encodings. We first bound all three-dimensional codes, then determine the leading optimum for planar codes and for codes whose leading interaction is a single product. Finally, we compare the best axial coefficient with the hexagon and give a strict advantage at finite separation. Throughout, capacities refer to the retained logical Hamiltonian with the correction convention of Section S4.
A tighter three-dimensional bound for linear-force protection
For codes correcting linear position errors, the first retained interaction is cubic in each laboratory. We can bound this term more sharply by removing a linear function before estimating its size. This subtraction changes the protected Hamiltonian only by local terms. We seek separate subtraction coefficients a 0 a_0 a 0 and b 0 b_0 b 0 for the longitudinal and transverse components. The following choice makes the squared-error bound factor into nonnegative terms; s 0 s_0 s 0 will identify a latitude where equality holds, and γ \gamma γ is the resulting radius in units of r 3 r^3 r 3 :
a 0 = 1310 − 47 730 140 , b 0 = 165 − 6 730 14 , s 0 = 117 − 4 730 35 , γ = 1 − a 0 = 0.713357657814227335 … (50) \begin{aligned}
a_0 &= \frac{1310-47\sqrt{730}}{140}, &
b_0 &= \frac{165-6\sqrt{730}}{14},\\
s_0 &= \frac{117-4\sqrt{730}}{35}, &
\gamma&= 1-a_0=0.713357657814227335\ldots \tag*{(50)}
\end{aligned} a 0 s 0 = 140 1310 − 47 730 , = 35 117 − 4 730 , b 0 γ = 14 165 − 6 730 , = 1 − a 0 = 0.713357657814227335 … (50)
Only the cubic factor is improved by this subtraction. Let γ 3 = γ \gamma_3=\gamma γ 3 = γ and γ j = 1 \gamma_j=1 γ j = 1 for j ≥ 4 j\ge4 j ≥ 4 , and replace the universal series S 3 S_3 S 3 by the correspondingly weighted series
S ~ 3 ( u ) = ∑ j , k ≥ 3 ( j + k j ) γ j γ k u j + k , 0 < u < 1 2 . (51) \widetilde{S}_3(u)=\sum_{j,k\ge3}\binom{j+k}{j}\gamma_j\gamma_k u^{j+k},\qquad0<u<\frac{1}{2}. \tag*{(51)} S 3 ( u ) = j , k ≥ 3 ∑ ( j j + k ) γ j γ k u j + k , 0 < u < 2 1 . (51)
Proposition S6 (Three-dimensional cubic ceiling). For every fixed code in the two radius-r r r balls satisfying the exact linear-position correction conditions, with arbitrary logical dimension and local ancillary systems, the ideal entangling capacity of the retained logical Hamiltonian obeys
C L ≤ β G ℏ d S ~ 3 ( r / d ) . (52) C_L\le\frac{\beta G}{\hbar d}\widetilde{S}_3(r/d). \tag*{(52)} C L ≤ ℏ d β G S 3 ( r / d ) . (52) In particular, uniformly over these codes,
C L ≤ β G r 6 ℏ d 7 [ 20 γ 2 + O ( r / d ) ] , 20 γ 2 = 10.17758295924400515 … (53) C_L\le\frac{\beta G r^6}{\hbar d^7}\left[20\gamma^2+O(r/d)\right],\qquad20\gamma^2=10.17758295924400515\ldots \tag*{(53)} C L ≤ ℏ d 7 β G r 6 [ 20 γ 2 + O ( r / d ) ] , 20 γ 2 = 10.17758295924400515 … (53) Quantum syndromes are reset or discarded, as in the protected-Hamiltonian model. This is not a bound on all outputs of a finite-rate recovery protocol that retains entangled syndrome memories.
Proof. For t ϕ = a x cos ϕ + a y sin ϕ t_{\phi}=a_x\cos\phi+a_y\sin\phi t ϕ = a x cos ϕ + a y sin ϕ , write q ϕ = a z + i t ϕ q_{\phi}=a_z+it_{\phi} q ϕ = a z + i t ϕ and
f ϕ ( a ) = q ϕ 3 − r 2 ( a 0 a z + i b 0 t ϕ ) . f_{\phi}(\mathbf{a})=q_{\phi}^{3}-r^{2}(a_{0}a_z+ib_{0}t_{\phi}). f ϕ ( a ) = q ϕ 3 − r 2 ( a 0 a z + i b 0 t ϕ ) .
Here t ϕ t_{\phi} t ϕ is a transverse coordinate, not a dwell time, and f ϕ f_{\phi} f ϕ is the cubic feature after the permitted linear subtraction. Angular averages are normalized over [ 0 , 2 π ) [0,2\pi) [ 0 , 2 π ) . On ∣ a ∣ = r |\mathbf{a}|=r ∣ a ∣ = r , put s = a z 2 / r 2 s=a_z^{2}/r^{2} s = a z 2 / r 2 . Using ⟨ t ϕ 2 ⟩ = ( r 2 − a z 2 ) / 2 \langle t_{\phi}^{2}\rangle=(r^{2}-a_z^{2})/2 ⟨ t ϕ 2 ⟩ = ( r 2 − a z 2 ) /2 , ⟨ t ϕ 4 ⟩ = 3 ( r 2 − a z 2 ) 2 / 8 \langle t_{\phi}^{4}\rangle=3(r^{2}-a_z^{2})^{2}/8 ⟨ t ϕ 4 ⟩ = 3 ( r 2 − a z 2 ) 2 /8 and ⟨ t ϕ 6 ⟩ = 5 ( r 2 − a z 2 ) 3 / 16 \langle t_{\phi}^{6}\rangle=5(r^{2}-a_z^{2})^{3}/16 ⟨ t ϕ 6 ⟩ = 5 ( r 2 − a z 2 ) 3 /16 , direct expansion gives
γ 2 − r − 6 ⟨ ∣ f ϕ ( a ) ∣ 2 ⟩ ϕ = 5 16 ( 1 − s ) ( s − s 0 ) 2 ≥ 0. (54) \gamma^{2}-r^{-6}\langle|f_{\phi}(\mathbf{a})|^{2}\rangle_{\phi}=\frac{5}{16}(1-s)(s-s_{0})^{2}\geq0. \tag*{(54)} γ 2 − r − 6 ⟨ ∣ f ϕ ( a ) ∣ 2 ⟩ ϕ = 16 5 ( 1 − s ) ( s − s 0 ) 2 ≥ 0. (54)
Since 0 ≤ s ≤ 1 0\leq s\leq1 0 ≤ s ≤ 1 , the right side is nonnegative. This proves the desired root-mean-square bound on the sphere, with equality at s = 1 s=1 s = 1 and s = s 0 s=s_{0} s = s 0 . We still need the same bound at interior positions. For each ϕ \phi ϕ , both parts of f ϕ f_{\phi} f ϕ are harmonic: in the orthogonal coordinates ( a z , t ϕ ) (a_z,t_{\phi}) ( a z , t ϕ ) they are a z 3 − 3 a z t ϕ 2 − r 2 a 0 a z a_z^{3}-3a_zt_{\phi}^{2}-r^{2}a_{0}a_z a z 3 − 3 a z t ϕ 2 − r 2 a 0 a z and 3 a z 2 t ϕ − t ϕ 3 − r 2 b 0 t ϕ 3a_z^{2}t_{\phi}-t_{\phi}^{3}-r^{2}b_{0}t_{\phi} 3 a z 2 t ϕ − t ϕ 3 − r 2 b 0 t ϕ . For a real harmonic function h h h , ∇ 2 h 2 = 2 ∣ ∇ h ∣ 2 ≥ 0 \nabla^{2}h^{2}=2|\nabla h|^{2}\geq0 ∇ 2 h 2 = 2∣∇ h ∣ 2 ≥ 0 . Applying this to both parts shows that ⟨ ∣ f ϕ ∣ 2 ⟩ ϕ \langle|f_{\phi}|^{2}\rangle_{\phi} ⟨ ∣ f ϕ ∣ 2 ⟩ ϕ is subharmonic, meaning its Laplacian is nonnegative. The maximum principle extends the sphere bound to the entire ball.
Set f 3 , ϕ = f ϕ f_{3,\phi}=f_{\phi} f 3 , ϕ = f ϕ and f j , ϕ = q ϕ j f_{j,\phi}=q_{\phi}^{j} f j , ϕ = q ϕ j for j ≥ 4 j\geq4 j ≥ 4 . For a local code projector P P P , put F j , ϕ = P f j , ϕ P F_{j,\phi}=Pf_{j,\phi}P F j , ϕ = P f j , ϕ P on its code space. We next transfer the position-wise bound to arbitrary logical states. Compression of the self-adjoint real and imaginary parts gives
⟨ ( Re F j , ϕ ) 2 + ( Im F j , ϕ ) 2 ⟩ ϕ ≤ P ⟨ ∣ f j , ϕ ∣ 2 ⟩ ϕ P ≤ γ j 2 r 2 j I . (55) \left\langle(\operatorname{Re}F_{j,\phi})^{2}+(\operatorname{Im}F_{j,\phi})^{2}\right\rangle_{\phi}\leq P\langle|f_{j,\phi}|^{2}\rangle_{\phi}P\leq\gamma_{j}^{2}r^{2j}I. \tag*{(55)} ⟨ ( Re F j , ϕ ) 2 + ( Im F j , ϕ ) 2 ⟩ ϕ ≤ P ⟨ ∣ f j , ϕ ∣ 2 ⟩ ϕ P ≤ γ j 2 r 2 j I . (55)
The first inequality follows from ( P X P ) 2 ≤ P X 2 P (PXP)^{2}\leq PX^{2}P ( P X P ) 2 ≤ P X 2 P for self-adjoint X X X . It does not assume that the compressed complex operator is normal. The j ≥ 4 j\geq4 j ≥ 4 bound uses ∣ q ϕ ∣ < r |q_{\phi}|<r ∣ q ϕ ∣ < r . Tensoring arbitrary local ancillary identities preserves these inequalities.
Use the absolutely convergent angular expansion of the Newtonian kernel,
1 ∣ d e z + b − a ∣ = 1 d ∑ j , k ≥ 0 ( j + k j ) d − ( j + k ) ⟨ q ϕ ( a ) j [ − q ϕ ( b ) ] k ⟩ ϕ . \frac{1}{|d\mathbf{e}_{z}+\mathbf{b}-\mathbf{a}|}=\frac{1}{d}\sum_{j,k\geq0}\binom{j+k}{j}d^{-(j+k)}\left\langle q_{\phi}(\mathbf{a})^{j}[-q_{\phi}(\mathbf{b})]^{k}\right\rangle_{\phi}. ∣ d e z + b − a ∣ 1 = d 1 j , k ≥ 0 ∑ ( j j + k ) d − ( j + k ) ⟨ q ϕ ( a ) j [ − q ϕ ( b ) ] k ⟩ ϕ .
Exact correction makes every compressed polynomial of degree at most two scalar. Terms with j < 3 j<3 j < 3 or k < 3 k<3 k < 3 are therefore local. Replacing a cubic factor by f 3 , ϕ f_{3,\phi} f 3 , ϕ also changes only local terms, because its subtraction is linear. The factor ( − 1 ) k (-1)^{k} ( − 1 ) k and the sign in Re ( A ⊗ B ) = A R ⊗ B R − A I ⊗ B I \operatorname{Re}(A\otimes B)=A_{R}\otimes B_{R}-A_{I}\otimes B_{I} Re ( A ⊗ B ) = A R ⊗ B R − A I ⊗ B I do not affect the following estimate.
For any real separated interaction H = ∫ ∑ ν A ν , ϕ ⊗ B ν , ϕ d ϕ / ( 2 π ) H=\int\sum_{\nu}A_{\nu,\phi}\otimes B_{\nu,\phi}\,d\phi/(2\pi) H = ∫ ∑ ν A ν , ϕ ⊗ B ν , ϕ d ϕ / ( 2 π ) with ∫ ∑ ν A ν , ϕ 2 d ϕ / ( 2 π ) ≤ Q A 2 I \int\sum_{\nu}A_{\nu,\phi}^{2}\,d\phi/(2\pi)\leq Q_{A}^{2}I ∫ ∑ ν A ν , ϕ 2 d ϕ / ( 2 π ) ≤ Q A 2 I and the analogous bound Q B 2 I Q_{B}^{2}I Q B 2 I , its matrix elements in paired Schmidt bases satisfy
∑ j ∣ ⟨ u i v i ∣ H ∣ u j v j ⟩ ∣ ≤ Q A Q B . \sum_{j}\left|\langle u_{i}v_{i}|H|u_{j}v_{j}\rangle\right|\leq Q_{A}Q_{B}. j ∑ ∣ ⟨ u i v i ∣ H ∣ u j v j ⟩ ∣ ≤ Q A Q B .
This follows by Cauchy–Schwarz over ( j , ν , ϕ ) (j,\nu,\phi) ( j , ν , ϕ ) and completeness of the local bases. The Schmidt-pair entropy inequality then gives ∣ S ˙ 2 ∣ ≤ β Q A Q B / ℏ |\dot{S}_{2}|\leq\beta Q_{A}Q_{B}/\hbar ∣ S ˙ 2 ∣ ≤ β Q A Q B /ℏ . Applying this once to both real and imaginary terms of each ( j , k ) (j,k) ( j , k ) angular average, using Eq. (55) , bounds its rate by β γ j γ k r j + k / ℏ \beta\gamma_{j}\gamma_{k}r^{j+k}/\hbar β γ j γ k r j + k /ℏ . Summing the positive coefficient bounds proves Eq. (52) . No factor of two is required.
The estimates are independent of the number of Schmidt coefficients. For normal infinite-dimensional encodings, the same argument applies to the regularized entropy with derivative logarithms log 2 [ ( p i + ε ) / ( p j + ε ) ] \log_{2}[(p_{i}+\varepsilon)/(p_{j}+\varepsilon)] log 2 [( p i + ε ) / ( p j + ε )] . Their magnitudes are bounded by the unregularized logarithms. Concavity gives average monotonicity under local instruments, and Fatou’s lemma passes the integrated estimate to finite output-register entanglement as ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 . This gives the same ideal-control capacity bound with arbitrary local memories. Finally, the first term of the series is 20 γ 2 u 6 20\gamma^{2}u^{6} 20 γ 2 u 6 ; its positive tail is uniformly bounded by the corresponding geometric tail in 2 u 2u 2 u , proving Eq. (53) .
The planar code already has leading coefficient 295 / 32 = 9.21875 295/32 = 9.21875 295/32 = 9.21875 . It therefore achieves at least
295 / 32 20 γ 2 = 0.9057897181399907 … \frac{295/32}{20\gamma^2} = 0.9057897181399907\ldots 20 γ 2 295/32 = 0.9057897181399907 …
of the optimal three-dimensional protected rate in the far-separation limit. Thus its leading rate is at least 90.57% of the unrestricted protected-code optimum under these assumptions. This brackets the optimum; it does not identify the optimal coefficient or prove that the planar code is globally optimal over three-dimensional codes.
To evaluate the full-distance bound, we can sum the correction to the universal series explicitly. Only terms with j = 3 j=3 j = 3 or k = 3 k=3 k = 3 change; their intersection at ( 3 , 3 ) (3,3) ( 3 , 3 ) must be counted once. If S 3 ( u ) = ∑ j , k ≥ 3 ( j + k j ) u j + k S_3(u)=\sum_{j,k\geq3}\binom{j+k}{j}u^{j+k} S 3 ( u ) = ∑ j , k ≥ 3 ( j j + k ) u j + k , then
S ~ 3 ( u ) = S 3 ( u ) − 2 ( 1 − γ ) u 3 [ ( 1 − u ) − 4 − 1 − 4 u − 10 u 2 ] + 20 ( 1 − γ ) u 2 . (56) \widetilde{S}_3(u)=S_3(u)-2(1-\gamma)u^3\left[(1-u)^{-4}-1-4u-10u^2\right]+20(1-\gamma)u^2. \tag*{(56)} S 3 ( u ) = S 3 ( u ) − 2 ( 1 − γ ) u 3 [ ( 1 − u ) − 4 − 1 − 4 u − 10 u 2 ] + 20 ( 1 − γ ) u 2 . (56)
Truncation through total degree L ≥ 6 L\geq6 L ≥ 6 has remainder at most ( 2 u ) L + 1 / ( 1 − 2 u ) (2u)^{L+1}/(1-2u) ( 2 u ) L + 1 / ( 1 − 2 u ) . The finite-distance bound is exact as an inequality; the 90.57% comparison concerns its leading far-field coefficient.
The exact leading optimum for planar codes
The hexagon’s leading coefficient can be optimized over all planar encodings. The comparison allows arbitrary logical dimension, local ancillas and noncommuting compressed moments. We first establish the planar result, then show that the same optimum applies in three dimensions whenever the leading logical interaction is a single product.
Normalize positions by the support radius r r r . For an encoding isometry W Q W_Q W Q from the logical space into the physical laboratory, write Φ Q ( f ) = W Q † f ( x Q ) W Q \Phi_Q(f)=W_Q^\dagger f(x_Q)W_Q Φ Q ( f ) = W Q † f ( x Q ) W Q , where ∣ x Q ∣ ≤ 1 \lvert x_Q\rvert\leq1 ∣ x Q ∣ ≤ 1 and local ancillary identities are understood. The force-error correction conditions are
Φ Q ( x i ) = μ Q , i I , Φ Q ( x i x j ) = S Q , i j I . \Phi_Q(x_i)=\mu_{Q,i}I,\qquad\Phi_Q(x_ix_j)=S_{Q,ij}I. Φ Q ( x i ) = μ Q , i I , Φ Q ( x i x j ) = S Q , ij I .
The coefficients μ Q , i \mu_{Q,i} μ Q , i and S Q , i j S_{Q,ij} S Q , ij are scalar first and second moments. Put Ω = G r 6 / ( ℏ d 7 ) \Omega=\mathcal{G}r^6/(\hbar d^7) Ω = G r 6 / ( ℏ d 7 ) for the frequency scale of the first retained term. To keep its angular components together, we use a real Hilbert-space feature F F F represented by the complex function
f ϕ ( x , y , z ) = 20 [ z + i ( x cos ϕ + y sin ϕ ) ] 3 , ⟨ F ( x ) , F ( y ) ⟩ = Re ⟨ f ϕ ( x ) f ϕ ( y ) ‾ ⟩ ϕ . (57) f_\phi(x,y,z)=\sqrt{20}\left[z+i(x\cos\phi+y\sin\phi)\right]^3,\qquad\langle F(x),F(y)\rangle=\operatorname{Re}\left\langle f_\phi(x)\overline{f_\phi(y)}\right\rangle_\phi. \tag*{(57)} f ϕ ( x , y , z ) = 20 [ z + i ( x cos ϕ + y sin ϕ ) ] 3 , ⟨ F ( x ) , F ( y )⟩ = Re ⟨ f ϕ ( x ) f ϕ ( y ) ⟩ ϕ . (57)
The inner product takes the real part of the normalized angular average. Its seven real coordinates F ℓ F_\ell F ℓ in an orthonormal basis are harmonic cubic polynomials. Reflect Bob’s normalized position by R ( x , y , z ) = ( x , y , − z ) R(x,y,z)=(x,y,-z) R ( x , y , z ) = ( x , y , − z ) . The cubic-by-cubic term of the Newtonian expansion is
H 6 = − ℏ Ω ∑ ℓ Φ A ( F ℓ ) ⊗ Φ B ( F ℓ ∘ R ) modulo local terms . (58) H_6=-\hbar\Omega\sum_\ell\Phi_A(F_\ell)\otimes\Phi_B(F_\ell\circ R)\quad\text{modulo local terms}. \tag*{(58)} H 6 = − ℏΩ ℓ ∑ Φ A ( F ℓ ) ⊗ Φ B ( F ℓ ∘ R ) modulo local terms . (58)
The subscript six denotes total position degree three on each side. The coefficient 20 = 6 ! / ( 3 ! ) 2 20=6!/(3!)^2 20 = 6 ! / ( 3 ! ) 2 follows from Eq. (40) . Subtracting any polynomial of degree at most two from a feature changes only local terms after compression.
Proposition S7 (Planar optimality at leading order). Suppose each laboratory’s position support lies in an affine plane inside its unit ball. The planes may have different orientations and offsets. Under the fixed-code projected dynamics,
C ( H 6 ) ≤ β Ω K p l , K p l = 295 32 . (59) C(H_6)\leq\beta\Omega K_{\mathrm{pl}},\qquad K_{\mathrm{pl}}=\frac{295}{32}. \tag*{(59)} C ( H 6 ) ≤ β Ω K pl , K pl = 32 295 . (59) The hexagon attains this coefficient in the ideal position-mode model. No larger planar code or local ancillary system increases it.
Proof. We first consider a plane through the ball’s centre. Rotation about the separation axis allows us to parameterize its unit circle as
n ( θ ) = ( 1 − t cos θ , sin θ , t cos θ ) , 0 ≤ t ≤ 1. \mathbf{n}(\theta)=\left(\sqrt{1-t}\cos\theta,\sin\theta,\sqrt{t}\cos\theta\right),\qquad0\le t\le1. n ( θ ) = ( 1 − t cos θ , sin θ , t cos θ ) , 0 ≤ t ≤ 1.
Here θ \theta θ runs around the circle, and t t t fixes the plane’s tilt: t = 0 t=0 t = 0 is transverse to the separation axis, while t = 1 t=1 t = 1 contains it. Only the first and third angular harmonics occur in a cubic feature, so
F ( n ( θ ) ) = L c cos θ + L s sin θ + U cos 3 θ + V sin 3 θ . (60) F(\mathbf{n}(\theta))=L_c\cos\theta+L_s\sin\theta+U\cos3\theta+V\sin3\theta. \tag*{(60)} F ( n ( θ )) = L c cos θ + L s sin θ + U cos 3 θ + V sin 3 θ . (60)
The vectors L c , L s , U , V L_c,L_s,U,V L c , L s , U , V are coefficients in the feature Hilbert space. The first two terms define a linear feature L 1 L_1 L 1 on the plane and can therefore be subtracted without changing the nonlocal logical interaction. The third-harmonic vectors U , V U,V U , V contain the part we must bound. To evaluate the four coefficient vectors, put a ϕ = t + i 1 − t cos ϕ a_\phi=\sqrt{t}+i\sqrt{1-t}\cos\phi a ϕ = t + i 1 − t cos ϕ and b ϕ = i sin ϕ b_\phi=i\sin\phi b ϕ = i sin ϕ . Their representing functions are
L c : 3 20 4 ( a ϕ 3 + a ϕ b ϕ 2 ) , L s : 3 20 4 ( a ϕ 2 b ϕ + b ϕ 3 ) , U : 20 4 ( a ϕ 3 − 3 a ϕ b ϕ 2 ) , V : 20 4 ( 3 a ϕ 2 b ϕ − b ϕ 3 ) . \begin{aligned}
L_c&:\quad\frac{3\sqrt{20}}{4}\left(a_\phi^3+a_\phi b_\phi^2\right),&
L_s&:\quad\frac{3\sqrt{20}}{4}\left(a_\phi^2b_\phi+b_\phi^3\right),\\
U&:\quad\frac{\sqrt{20}}{4}\left(a_\phi^3-3a_\phi b_\phi^2\right),&
V&:\quad\frac{\sqrt{20}}{4}\left(3a_\phi^2b_\phi-b_\phi^3\right).
\end{aligned} L c U : 4 3 20 ( a ϕ 3 + a ϕ b ϕ 2 ) , : 4 20 ( a ϕ 3 − 3 a ϕ b ϕ 2 ) , L s V : 4 3 20 ( a ϕ 2 b ϕ + b ϕ 3 ) , : 4 20 ( 3 a ϕ 2 b ϕ − b ϕ 3 ) .
Angular averaging gives U ⊥ V U\perp V U ⊥ V and L c ⊥ L s L_c\perp L_s L c ⊥ L s , and
∥ U ∥ 2 = 5 64 ( 5 t 3 + 45 t 2 + 60 t + 8 ) , ∥ V ∥ 2 = ∥ U ∥ 2 − 25 t 3 64 , ∥ L c ∥ 2 = 45 64 ( 5 t 3 − 11 t 2 + 4 t + 8 ) , ∥ L s ∥ 2 = 45 64 ( 5 t 2 − 12 t + 8 ) . (61) \begin{aligned}
\lVert U\rVert^2&=\frac{5}{64}\left(5t^3+45t^2+60t+8\right),&
\lVert V\rVert^2&=\lVert U\rVert^2-\frac{25t^3}{64},\\
\lVert L_c\rVert^2&=\frac{45}{64}\left(5t^3-11t^2+4t+8\right),&
\lVert L_s\rVert^2&=\frac{45}{64}\left(5t^2-12t+8\right). \tag*{(61)}
\end{aligned} ∥ U ∥ 2 ∥ L c ∥ 2 = 64 5 ( 5 t 3 + 45 t 2 + 60 t + 8 ) , = 64 45 ( 5 t 3 − 11 t 2 + 4 t + 8 ) , ∥ V ∥ 2 ∥ L s ∥ 2 = ∥ U ∥ 2 − 64 25 t 3 , = 64 45 ( 5 t 2 − 12 t + 8 ) . (61)
These identities can be obtained by expanding the displayed functions and using
⟨ cos 2 m ϕ sin 2 n ϕ ⟩ ϕ = ( 2 m ) ! ( 2 n ) ! 4 m + n m ! n ! ( m + n ) ! , \left\langle\cos^{2m}\phi\sin^{2n}\phi\right\rangle_\phi=\frac{(2m)!(2n)!}{4^{m+n}m!n!(m+n)!}, ⟨ cos 2 m ϕ sin 2 n ϕ ⟩ ϕ = 4 m + n m ! n ! ( m + n )! ( 2 m )! ( 2 n )! ,
an odd power averages to zero.
The first polynomial in Eq. (61) increases on [ 0 , 1 ] [0,1] [ 0 , 1 ] , so ∥ U ∥ 2 , ∥ V ∥ 2 ≤ K p l \lVert U\rVert^2,\lVert V\rVert^2\le K_{\mathrm{pl}} ∥ U ∥ 2 , ∥ V ∥ 2 ≤ K pl . For the linear coefficients, 5 t 3 − 11 t 2 + 4 t + 8 ≤ 8 + 4 t − 6 t 2 ≤ 26 / 3 5t^3-11t^2+4t+8\le8+4t-6t^2\le26/3 5 t 3 − 11 t 2 + 4 t + 8 ≤ 8 + 4 t − 6 t 2 ≤ 26/3 and 5 t 2 − 12 t + 8 ≤ 8 5t^2-12t+8\le8 5 t 2 − 12 t + 8 ≤ 8 . Thus sup θ ∥ L 1 ( n ( θ ) ) ∥ 2 ≤ 195 / 32 < K p l \sup_\theta\lVert L_1(\mathbf{n}(\theta))\rVert^2\le195/32<K_{\mathrm{pl}} sup θ ∥ L 1 ( n ( θ )) ∥ 2 ≤ 195/32 < K pl . Bounding the boundary circle alone is not sufficient because subtracting L 1 L_1 L 1 destroys cubic homogeneity. For an interior point ρ n \rho\mathbf{n} ρ n , with 0 ≤ ρ ≤ 1 0\le\rho\le1 0 ≤ ρ ≤ 1 , the cubic and linear degrees give
F ( ρ n ) − L 1 ( ρ n ) = ρ 3 [ F ( n ) − L 1 ( n ) ] − ρ ( 1 − ρ 2 ) L 1 ( n ) . F(\rho\mathbf{n})-L_1(\rho\mathbf{n})=\rho^3[F(\mathbf{n})-L_1(\mathbf{n})]-\rho(1-\rho^2)L_1(\mathbf{n}). F ( ρ n ) − L 1 ( ρ n ) = ρ 3 [ F ( n ) − L 1 ( n )] − ρ ( 1 − ρ 2 ) L 1 ( n ) .
The triangle inequality therefore bounds its norm by [ ρ 3 + ρ ( 1 − ρ 2 ) ] K p l = ρ K p l ≤ K p l [\rho^3+\rho(1-\rho^2)]\sqrt{K_{\mathrm{pl}}}=\rho\sqrt{K_{\mathrm{pl}}}\le\sqrt{K_{\mathrm{pl}}} [ ρ 3 + ρ ( 1 − ρ 2 )] K pl = ρ K pl ≤ K pl throughout the disk.
For an affine plane, write x = c + v \mathbf{x}=\mathbf{c}+\mathbf{v} x = c + v , where c \mathbf{c} c is its point closest to the origin. Its available disk has radius R 0 = 1 − ∣ c ∣ 2 ≤ 1 R_0=\sqrt{1-\lvert\mathbf{c}\rvert^2}\le1 R 0 = 1 − ∣ c ∣ 2 ≤ 1 . Since F F F is cubic, F ( c + v ) − F ( v ) F(\mathbf{c}+\mathbf{v})-F(\mathbf{v}) F ( c + v ) − F ( v ) has degree at most two in v \mathbf{v} v and therefore compresses to a scalar vector. Subtract this vector polynomial and the linear term R 0 2 L 1 ( v ) R_0^2L_1(\mathbf{v}) R 0 2 L 1 ( v ) . The remaining feature G G G satisfies ∥ G ∥ 2 ≤ R 0 6 K p l ≤ K p l \lVert G\rVert^2\le R_0^6K_{\mathrm{pl}}\le K_{\mathrm{pl}} ∥ G ∥ 2 ≤ R 0 6 K pl ≤ K pl on the support. The factor R 0 6 R_0^6 R 0 6 is the square of the cubic rescaling from a unit disk to a disk of radius R 0 R_0 R 0 . The zero-radius case is local and follows by continuity.
Let A ℓ = Φ A ( G A , ℓ ) A_\ell=\Phi_A(G_{A,\ell}) A ℓ = Φ A ( G A , ℓ ) and B ℓ = Φ B ( G B , ℓ ) B_\ell=\Phi_B(G_{B,\ell}) B ℓ = Φ B ( G B , ℓ ) , with the reflected Bob plane treated in the same way. The compression inequality gives
∑ ℓ A ℓ 2 ≤ Φ A ( ∑ ℓ G A , ℓ 2 ) ≤ K p l I , ∑ ℓ B ℓ 2 ≤ K p l I . \sum_\ell A_\ell^2\le\Phi_A\left(\sum_\ell G_{A,\ell}^2\right)\le K_{\mathrm{pl}}I,\qquad\sum_\ell B_\ell^2\le K_{\mathrm{pl}}I. ℓ ∑ A ℓ 2 ≤ Φ A ( ℓ ∑ G A , ℓ 2 ) ≤ K pl I , ℓ ∑ B ℓ 2 ≤ K pl I .
Indeed, for each real multiplication operator g g g , W † g 2 W − ( W † g W ) 2 = W † g ( I − W W † ) g W ≥ 0 W^\dagger g^2W-(W^\dagger gW)^2=W^\dagger g(I-WW^\dagger)gW\ge0 W † g 2 W − ( W † g W ) 2 = W † g ( I − W W † ) g W ≥ 0 . Applying Eq. (174) to each separated term of H 6 H_6 H 6 and then Cauchy–Schwarz over ℓ \ell ℓ bounds the entropy rate by
β Ω ∑ ℓ ⟨ A ℓ 2 ⟩ ⟨ B ℓ 2 ⟩ ≤ β Ω ⟨ ∑ ℓ A ℓ 2 ⟩ ⟨ ∑ ℓ B ℓ 2 ⟩ ≤ β Ω K p l . \beta\Omega\sum_\ell\sqrt{\langle A_\ell^2\rangle\langle B_\ell^2\rangle}\le\beta\Omega\sqrt{\left\langle\sum_\ell A_\ell^2\right\rangle\left\langle\sum_\ell B_\ell^2\right\rangle}\le\beta\Omega K_{\mathrm{pl}}. β Ω ℓ ∑ ⟨ A ℓ 2 ⟩ ⟨ B ℓ 2 ⟩ ≤ β Ω ⟨ ℓ ∑ A ℓ 2 ⟩ ⟨ ℓ ∑ B ℓ 2 ⟩ ≤ β Ω K pl .
No commutativity of the compressed moments was used. The normal-protocol and finite-register limit argument of Theorem S4 proves the capacity statement.
For the vertical plane t = 1 t=1 t = 1 , the alternating hexagon code has a logical cubic feature proportional to U U U , with ∥ U ∥ 2 = 295 / 32 \lVert U\rVert^2=295/32 ∥ U ∥ 2 = 295/32 . Its leading Hamiltonian is an Ising interaction of that strength, so its capacity is β Ω K p l \beta\Omega K_{\mathrm{pl}} β Ω K pl . This proves equality in the planar position-mode model. The identical radial packets described above preserve the compressed harmonic features at their centre values and approach the same coefficient with finite energy in each approximation; their supports are thin three-dimensional regions.
We have optimized the degree-six term. To bound the full potential at a finite separation, retain the universal estimate for all higher terms and replace its degree-six coefficient 20 by K p l K_{\mathrm{pl}} K pl . Thus the planar comparison also has the finite-distance upper bound
C p l a n a r ( d , r ) ≤ β G ℏ d [ K p l u 6 + S 3 ( u ) − 20 u 6 ] , u = r / d . (62) C_{\mathrm{planar}}(d,r)\le\frac{\beta\mathcal{G}}{\hbar d}\left[K_{\mathrm{pl}}u^6+S_3(u)-20u^6\right],\qquad u=r/d. \tag*{(62)} C planar ( d , r ) ≤ ℏ d β G [ K pl u 6 + S 3 ( u ) − 20 u 6 ] , u = r / d . (62)
In particular, separation-dependent choices of planes and codes cannot increase the leading coefficient. (59) determines the leading optimum; optimizing the full finite-distance capacity is a further problem.
Single-product logical interactions in three dimensions
We can remove the planar-support restriction when the leading logical interaction is a single product Hamiltonian. The proof bounds the gravitational energy difference between two local logical states, then uses the established capacity formula for a product interaction.
Proposition S8 (Leading optimum for a product interaction). Under the force-error correction conditions, suppose that the leading logical Hamiltonian satisfies H 6 = X ⊗ Y H_6=X\otimes Y H 6 = X ⊗ Y modulo local terms, with bounded Hermitian factors X , Y X,Y X , Y . Positions may occupy the full three-dimensional balls and the logical systems may have arbitrary dimension and local ancillas. Then
C ( H 6 ) ≤ β Ω 295 32 . (63) C(H_6)\le\beta\Omega\frac{295}{32}. \tag*{(63)} C ( H 6 ) ≤ β Ω 32 295 . (63) The hexagon attains this coefficient.
Proof. Choose any two normalized local logical states and let μ 0 , μ 1 \mu_0,\mu_1 μ 0 , μ 1 be their position probability measures on the unit ball. Their half-difference ν = ( μ 0 − μ 1 ) / 2 \nu=(\mu_0-\mu_1)/2 ν = ( μ 0 − μ 1 ) /2 annihilates every polynomial of degree at most two, and its total variation is at most one. Let ι ( x ) = − x \iota(x)=-x ι ( x ) = − x and ν o = ( ν − ι ∗ ν ) / 2 \nu_o=(\nu-\iota_*\nu)/2 ν o = ( ν − ι ∗ ν ) /2 , where ι ∗ ν \iota_*\nu ι ∗ ν is the reflected measure. We keep only this odd part because F F F is odd: ∫ F d ν o = ∫ F d ν \int F\,d\nu_o=\int F\,d\nu ∫ F d ν o = ∫ F d ν . The positive and negative Jordan parts are the nonnegative measures whose difference is ν o \nu_o ν o ; they are antipodal images. If the positive part has mass m > 0 m>0 m > 0 , its normalized probability measure π \pi π therefore satisfies
∫ x d π = 0 , ∫ F d ν = 2 m ∫ F d π , 2 m ≤ 1. \int x\,d\pi=0,\qquad\int F\,d\nu=2m\int F\,d\pi,\qquad2m\le1. ∫ x d π = 0 , ∫ F d ν = 2 m ∫ F d π , 2 m ≤ 1.
The first identity follows because ν o \nu_o ν o annihilates linear functions; the other two express its feature difference and total-variation bound. The case m = 0 m=0 m = 0 has zero feature difference. Thus it suffices to bound the feature of a zero-mean probability measure. We move this measure to the sphere without changing its linear or harmonic cubic moments. An interior point x \mathbf{x} x is replaced by its Poisson harmonic measure
d ω x ( n ) = 1 − ∣ x ∣ 2 4 π ∣ n − x ∣ 3 d S ( n ) , ∣ n ∣ = 1 ; d\omega_{\mathbf{x}}(\mathbf{n}) = \frac{1-|\mathbf{x}|^2}{4\pi|\mathbf{n}-\mathbf{x}|^3}\,dS(\mathbf{n}), \qquad|\mathbf{n}|=1; d ω x ( n ) = 4 π ∣ n − x ∣ 3 1 − ∣ x ∣ 2 d S ( n ) , ∣ n ∣ = 1 ;
a boundary point is left unchanged. The harmonic representation formula preserves both types of moments. Write the resulting symmetric tensor as T i j k = E [ n i n j n k ] T_{ijk}=\mathbb{E}[n_i n_j n_k] T ij k = E [ n i n j n k ] . Since E n = 0 \mathbb{E}\mathbf{n}=0 E n = 0 and ∣ n ∣ = 1 |\mathbf{n}|=1 ∣ n ∣ = 1 , it is trace-free:
∑ i T i i k = 0. \sum_i T_{iik}=0. i ∑ T iik = 0.
For any unit vector u \mathbf{u} u , the degree-three Chebyshev inequality gives
∣ T ( u , u , u ) ∣ = ∣ E [ ( u ⋅ n ) 3 − 3 4 ( u ⋅ n ) ] ∣ ≤ 1 4 . |T(\mathbf{u},\mathbf{u},\mathbf{u})|=\left|\mathbb{E}\left[(\mathbf{u}\cdot\mathbf{n})^3-\frac{3}{4}(\mathbf{u}\cdot\mathbf{n})\right]\right|\leq\frac{1}{4}. ∣ T ( u , u , u ) ∣ = E [ ( u ⋅ n ) 3 − 4 3 ( u ⋅ n ) ] ≤ 4 1 .
Banach’s theorem for real symmetric tensors identifies the norm over three independent unit vectors with this diagonal norm [35 ] . Hence ∣ T ( u , v , w ) ∣ ≤ 1 / 4 |T(\mathbf{u},\mathbf{v},\mathbf{w})|\leq1/4 ∣ T ( u , v , w ) ∣ ≤ 1/4 for all unit u , v , w \mathbf{u},\mathbf{v},\mathbf{w} u , v , w .
We now collect four tensor norms that determine the gravitational feature. Define ( T z ) i j = T i j z (T_z)_{ij}=T_{ijz} ( T z ) ij = T ij z and ( T z z ) i = T i z z (T_{zz})_i=T_{izz} ( T z z ) i = T i z z ; the subscript z z z contracts an index with the separation direction. We write ∥ ⋅ ∥ F \|\cdot\|_F ∥ ⋅ ∥ F for the Frobenius norm, the square root of the sum of squared components. The symmetric matrix T z T_z T z is trace-free and has eigenvalues in [ − 1 / 4 , 1 / 4 ] [-1/4,1/4] [ − 1/4 , 1/4 ] . Maximizing their squared sum under these constraints gives ∥ T z ∥ F 2 ≤ 1 / 8 \|T_z\|_F^2\leq1/8 ∥ T z ∥ F 2 ≤ 1/8 , attained by eigenvalues 1 / 4 , 0 , − 1 / 4 1/4,0,-1/4 1/4 , 0 , − 1/4 . The same multilinear bound gives ∥ T z z ∥ 2 ≤ 1 / 16 \|T_{zz}\|^2\leq1/16 ∥ T z z ∥ 2 ≤ 1/16 and T z z z 2 ≤ 1 / 16 T_{zzz}^2\leq1/16 T z z z 2 ≤ 1/16 . Finally,
∥ T ∥ F 2 = E T ( n , n , n ) ≤ 1 4 . \|T\|_F^2=\mathbb{E}\,T(\mathbf{n},\mathbf{n},\mathbf{n})\leq\frac{1}{4}. ∥ T ∥ F 2 = E T ( n , n , n ) ≤ 4 1 .
In the last identity, contracting T i j k = E [ n i n j n k ] T_{ijk}=\mathbb{E}[n_i n_j n_k] T ij k = E [ n i n j n k ] with itself gives the expectation shown, and the diagonal tensor bound controls its value. Expanding Eq. (57) and using the trace-free identities gives the positive quadratic form
Q ( T ) : = ∥ E F ( n ) ∥ 2 = 5 2 ∥ T ∥ F 2 + 75 2 ∥ T z ∥ F 2 + 225 4 ∥ T z z ∥ 2 + 25 4 T z z z 2 ≤ 295 32 . (64) \begin{aligned}
Q(T)&:=\|\mathbb{E}F(\mathbf{n})\|^2
=\frac{5}{2}\|T\|_F^2+\frac{75}{2}\|T_z\|_F^2+\frac{225}{4}\|T_{zz}\|^2+\frac{25}{4}T_{zzz}^2\\
&\leq\frac{295}{32}. \tag*{(64)}
\end{aligned} Q ( T ) := ∥ E F ( n ) ∥ 2 = 2 5 ∥ T ∥ F 2 + 2 75 ∥ T z ∥ F 2 + 4 225 ∥ T z z ∥ 2 + 4 25 T z z z 2 ≤ 32 295 . (64)
One direct way to verify the identity is to expand 20 ⟨ ∣ T ( v ϕ , v ϕ , v ϕ ) ∣ 2 ⟩ ϕ 20\langle|T(\mathbf{v}_\phi,\mathbf{v}_\phi,\mathbf{v}_\phi)|^2\rangle_\phi 20 ⟨ ∣ T ( v ϕ , v ϕ , v ϕ ) ∣ 2 ⟩ ϕ with v ϕ = ( i cos ϕ , i sin ϕ , 1 ) \mathbf{v}_\phi=(i\cos\phi,i\sin\phi,1) v ϕ = ( i cos ϕ , i sin ϕ , 1 ) and use the angular moments following Eq. (61) . Since 2 m ≤ 1 2m\leq1 2 m ≤ 1 , the same norm bound holds for ∫ F d ν \int F\,d\nu ∫ F d ν . It also holds after reflecting Bob’s measure by R R R .
Apply this result to half-differences on the two laboratories. Let E u v E_{uv} E uv be the expectation of H 6 H_6 H 6 in the chosen product of local states u , v u,v u , v , with u , v ∈ { 0 , 1 } u,v\in\{0,1\} u , v ∈ { 0 , 1 } . The quarter rectangular difference ( E 00 + E 11 − E 01 − E 10 ) / 4 (E_{00}+E_{11}-E_{01}-E_{10})/4 ( E 00 + E 11 − E 01 − E 10 ) /4 cancels all local energies and has magnitude at most ℏ Ω Q ( T A ) Q ( T B ) ≤ ℏ Ω ( 295 / 32 ) \hbar\Omega\sqrt{Q(T_A)Q(T_B)}\leq\hbar\Omega(295/32) ℏΩ Q ( T A ) Q ( T B ) ≤ ℏΩ ( 295/32 ) . For H 6 = X ⊗ Y H_6=X\otimes Y H 6 = X ⊗ Y modulo local terms, choose states approaching the maximum and minimum of each factor’s spectrum. This rectangle equals Δ X Δ Y / 4 \Delta_X\Delta_Y/4 Δ X Δ Y /4 , where Δ X , Δ Y \Delta_X,\Delta_Y Δ X , Δ Y are the spectral diameters. The product-Hamiltonian capacity β Δ X Δ Y / ( 4 ℏ ) \beta\Delta_X\Delta_Y/(4\hbar) β Δ X Δ Y / ( 4ℏ ) [19 ] therefore proves Eq. (63) .
The uniform triangle with vertices ( 0 , 0 , 1 ) (0,0,1) ( 0 , 0 , 1 ) and ( ± 3 / 2 , 0 , − 1 / 2 ) (\pm\sqrt{3}/2,0,-1/2) ( ± 3 /2 , 0 , − 1/2 ) has T z z z = 1 / 4 T_{zzz}=1/4 T z z z = 1/4 , T z x x = − 1 / 4 T_{zxx}=-1/4 T z xx = − 1/4 and its symmetric permutations, with all remaining components zero. It saturates every tensor bound above. This triangle and its negative are the two parity classes of the hexagon, proving attainment.
The scalar rectangle bound does not determine the capacity of a sum of noncommuting product interactions. Indeed, force-error correction does not make the compressed cubic moments commute. On seven equally spaced points of a circle, the Fourier modes 0 0 0 and 3 3 3 span an exact correcting code: position polynomials of degree at most two have only Fourier frequencies − 2 , … , 2 -2,\ldots,2 − 2 , … , 2 and hence compress to scalar matrices. Nevertheless, the compressed operators cos 3 θ \cos3\theta cos 3 θ and sin 3 θ \sin3\theta sin 3 θ are X / 2 X/2 X /2 and − Y / 2 -Y/2 − Y /2 in this basis. Thus any improvement over the hexagon requires a nonplanar support on at least one side and a nonproduct leading interaction. The optimum over that remaining class is not fixed by the two propositions.
A bound for every protected axial code
We next compare the planar optimum with codes confined to the centre-to-centre axis. For this geometry we can bound each retained position power more tightly than by its maximum magnitude. We remove the first three Chebyshev terms from each position monomial. Their compression is scalar by Eq. (33) ; the remaining terms therefore bound the part that can entangle the logical systems.
Theorem S9 (Protected axial rate). Put u = r / d < 1 / 2 u=r/d<1/2 u = r / d < 1/2 . Let e k e_k e k be the sum of the Chebyshev coefficients left in the monomial t k t^k t k after removing degrees zero, one and two; F ( u ) F(u) F ( u ) sums the resulting bipartite bounds. Explicitly,
e k = 0 ( k = 0 , 1 , 2 ) , e_k=0\quad(k=0,1,2), e k = 0 ( k = 0 , 1 , 2 ) , e k = { 1 − 2 1 − k ( k ( k − 1 ) / 2 ) , k ≥ 3 odd , 1 − 2 − k ( k k / 2 ) − 2 1 − k ( k k / 2 − 1 ) , k ≥ 4 even . (65) e_k=
\begin{cases}
1-2^{1-k}\binom{k}{(k-1)/2}, & k\geq3\ \text{odd},\\
1-2^{-k}\binom{k}{k/2}-2^{1-k}\binom{k}{k/2-1}, & k\geq4\ \text{even}.
\end{cases} \tag*{(65)} e k = { 1 − 2 1 − k ( ( k − 1 ) /2 k ) , 1 − 2 − k ( k /2 k ) − 2 1 − k ( k /2 − 1 k ) , k ≥ 3 odd , k ≥ 4 even . (65) F ( u ) = ∑ k , l ≥ 3 ( k + l k ) e k e l u k + l . (66) F(u)=\sum_{k,l\geq3}\binom{k+l}{k}e_k e_l u^{k+l}. \tag*{(66)} F ( u ) = k , l ≥ 3 ∑ ( k k + l ) e k e l u k + l . (66) Every protected axial code, of arbitrary logical dimension and with arbitrary local ancillary systems, has entangling rate
C a x p r o t ≤ β G ℏ d F ( u ) , β = 1.912273288953718 … (67) C_{\mathrm{ax}}^{\mathrm{prot}}\leq\frac{\beta\mathcal{G}}{\hbar d}F(u),\qquad\beta=1.912273288953718\ldots \tag*{(67)} C ax prot ≤ ℏ d β G F ( u ) , β = 1.912273288953718 … (67) If F M F_M F M retains terms of total degree at most the truncation order M M M , then
0 ≤ F ( u ) − F M ( u ) ≤ ( 2 u ) M + 1 1 − 2 u . (68) 0\leq F(u)-F_M(u)\leq\frac{(2u)^{M+1}}{1-2u}. \tag*{(68)} 0 ≤ F ( u ) − F M ( u ) ≤ 1 − 2 u ( 2 u ) M + 1 . (68) The leading constant is sharp:
sup C a x p r o t = 5 β G r 6 4 ℏ d 7 [ 1 + O ( r / d ) ] ( r / d ⟶ 0 ) . (69) \sup C_{\mathrm{ax}}^{\mathrm{prot}}=\frac{5\beta\mathcal{G}r^6}{4\hbar d^7}[1+O(r/d)]\qquad(r/d\longrightarrow0). \tag*{(69)} sup C ax prot = 4ℏ d 7 5 β G r 6 [ 1 + O ( r / d )] ( r / d ⟶ 0 ) . (69) The supremum in this asymptotic statement is over the protected axial codes just defined.
Proof. Recall T j ( cos θ ) = cos ( j θ ) T_j(\cos\theta)=\cos(j\theta) T j ( cos θ ) = cos ( j θ ) , the degree-j j j Chebyshev polynomial. For t ∈ [ − 1 , 1 ] t\in[-1,1] t ∈ [ − 1 , 1 ] , the Chebyshev expansion of t k t^k t k has nonnegative coefficients. This follows by writing t = cos θ t=\cos\theta t = cos θ and expanding [ ( e i θ + e − i θ ) / 2 ] k [(e^{i\theta}+e^{-i\theta})/2]^k [( e i θ + e − i θ ) /2 ] k . Let p k , 2 p_{k,2} p k , 2 contain its T 0 , T 1 , T 2 T_0,T_1,T_2 T 0 , T 1 , T 2 terms, and write t k = p k , 2 ( t ) + R k ( t ) t^k=p_{k,2}(t)+R_k(t) t k = p k , 2 ( t ) + R k ( t ) . The sum of the coefficients retained in R k R_k R k is e k e_k e k , as given in Eq. (65) ; because ∣ T j ( t ) ∣ ≤ 1 |T_j(t)|\leq1 ∣ T j ( t ) ∣ ≤ 1 ,
∥ R k ∥ ∞ , [ − 1 , 1 ] ≤ e k . \lVert R_k\rVert_{\infty,[-1,1]}\leq e_k. ∥ R k ∥ ∞ , [ − 1 , 1 ] ≤ e k .
Compression of p k , 2 ( x / r ) p_{k,2}(x/r) p k , 2 ( x / r ) to a protected code is scalar. We can therefore write
P Q ( x Q / r ) k P Q = c Q , k P Q + A Q , k , ∥ A Q , k ∥ ≤ e k . P_Q(x_Q/r)^kP_Q=c_{Q,k}P_Q+A_{Q,k},\qquad\lVert A_{Q,k}\rVert\leq e_k. P Q ( x Q / r ) k P Q = c Q , k P Q + A Q , k , ∥ A Q , k ∥ ≤ e k .
Here c Q , k c_{Q,k} c Q , k is the scalar part and A Q , k A_{Q,k} A Q , k is the compressed remainder. The latter is Hermitian and is zero for k ≤ 2 k\leq2 k ≤ 2 . The identity holds unchanged when x Q x_Q x Q acts trivially on an ancillary factor. The axial potential has the uniformly absolutely convergent expansion
− G d + x B − x A = − G d ∑ k , l ≥ 0 ( k + l k ) ( − 1 ) l ( x A / d ) k ( x B / d ) l . -\frac{\mathcal{G}}{d+x_B-x_A}
=-\frac{\mathcal{G}}{d}\sum_{k,l\geq0}\binom{k+l}{k}(-1)^l(x_A/d)^k(x_B/d)^l. − d + x B − x A G = − d G k , l ≥ 0 ∑ ( k k + l ) ( − 1 ) l ( x A / d ) k ( x B / d ) l .
After compression, terms containing a scalar factor are local. The remaining interaction is a sum of Hermitian products whose norm products sum to at most G F ( u ) / d GF(u)/d GF ( u ) / d . For a Hermitian product A ⊗ B A \otimes B A ⊗ B , the ancilla-assisted entropy-rate inequality gives ∣ S ˙ ∣ ≤ β ∥ A ∥ ∥ B ∥ / ℏ |\dot{S}| \leq\beta\lVert A\rVert\lVert B\rVert/\hbar ∣ S ˙ ∣ ≤ β ∥ A ∥ ∥ B ∥ /ℏ [18 , 19 ] . Summing it proves Eq. (67) . Infinite ancillary dimensions can be included by finite-dimensional approximation wherever the operational entanglement rate is defined. The bound is independent of the approximation dimension. Since 0 ≤ e k ≤ 1 0 \leq e_k \leq1 0 ≤ e k ≤ 1 , all terms of total degree n n n sum to at most 2 n u n 2^n u^n 2 n u n . Summing the geometric tail proves Eq. (68) .
In particular, e 3 = 1 / 4 e_3 = 1/4 e 3 = 1/4 , e 4 = 1 / 8 e_4 = 1/8 e 4 = 1/8 , and
F ( u ) = 5 4 u 6 + 35 16 u 7 + 371 32 u 8 + O ( u 9 ) . (70) F(u) = \frac{5}{4}u^6 + \frac{35}{16}u^7 + \frac{371}{32}u^8 + O(u^9). \tag*{(70)} F ( u ) = 4 5 u 6 + 16 35 u 7 + 32 371 u 8 + O ( u 9 ) . (70)
To attain its leading term, use the four-position Chebyshev encoding associated with polynomial-error correction[12 ] :
∣ 0 L ⟩ = 2 3 ∣ − r / 2 ⟩ + 1 3 ∣ r ⟩ , ∣ 1 L ⟩ = 1 3 ∣ − r ⟩ + 2 3 ∣ r / 2 ⟩ . (71) \begin{aligned}
|0_L\rangle&= \sqrt{\frac{2}{3}}|-r/2\rangle+ \sqrt{\frac{1}{3}}|r\rangle,\\
|1_L\rangle&= \sqrt{\frac{1}{3}}|-r\rangle+ \sqrt{\frac{2}{3}}|r/2\rangle. \tag*{(71)}
\end{aligned} ∣ 0 L ⟩ ∣ 1 L ⟩ = 3 2 ∣ − r /2 ⟩ + 3 1 ∣ r ⟩ , = 3 1 ∣ − r ⟩ + 3 2 ∣ r /2 ⟩ . (71)
Both logical states have mean zero and second moment r 2 / 2 r^2/2 r 2 /2 , while their third moments are ± r 3 / 4 \pm r^3/4 ± r 3 /4 . Their disjoint supports make the off-diagonal logical position moments zero. The term k = l = 3 k=l=3 k = l = 3 in the Newtonian expansion therefore gives the logical Ising coefficient ( 5 / 4 ) G r 6 / d 7 (5/4)Gr^6/d^7 ( 5/4 ) G r 6 / d 7 . Its capacity is β \beta β times its frequency. For this code the full coefficient, after removing local terms, is
∣ g C h ∣ = G ℏ d 10 u 6 ( 2 − u 2 ) ( 4 − u 2 ) ( 1 − u 2 ) ( 1 − 4 u 2 ) ( 4 − 9 u 2 ) . (72) |g_{\mathrm{Ch}}| = \frac{G}{\hbar d}\frac{10u^6(2-u^2)}{(4-u^2)(1-u^2)(1-4u^2)(4-9u^2)}. \tag*{(72)} ∣ g Ch ∣ = ℏ d G ( 4 − u 2 ) ( 1 − u 2 ) ( 1 − 4 u 2 ) ( 4 − 9 u 2 ) 10 u 6 ( 2 − u 2 ) . (72)
Here g C h g_{\mathrm{Ch}} g Ch is the logical Ising frequency, including all orders of the potential. This follows by summing the sixteen centre-to-centre potential entries with the probabilities in Eq. (71) . Its leading term and Eq. (70) prove Eq. (69) .
A planar code beyond the axial bound
The axial code distinguishes its logical states through the third moment along one direction. A planar constellation can retain additional mixed third moments while keeping the same first and second moments. We use two interleaved triangles, a constellation also appearing in quantum spherical codes[24 ] , to exploit these additional Newtonian terms.
Let θ j = j π / 3 \theta_j = j\pi/3 θ j = j π /3 for j = 0 , … , 5 j = 0,\ldots,5 j = 0 , … , 5 , and place the local modes at
a j = r ( sin θ j , 0 , cos θ j ) , b j = r ( sin θ j , 0 , − cos θ j ) . (73) \mathbf{a}_j = r(\sin\theta_j,0,\cos\theta_j), \qquad\mathbf{b}_j = r(\sin\theta_j,0,-\cos\theta_j). \tag*{(73)} a j = r ( sin θ j , 0 , cos θ j ) , b j = r ( sin θ j , 0 , − cos θ j ) . (73)
The positions of Bob’s modes are relative to his centre. We reflect his hexagon in the transverse plane so that the leading cubic features on the two sides align in the reflected Coulomb representation. Each laboratory encodes one logical qubit as
∣ 0 L ⟩ = ∣ 0 ⟩ + ∣ 2 ⟩ + ∣ 4 ⟩ 3 , ∣ 1 L ⟩ = ∣ 1 ⟩ + ∣ 3 ⟩ + ∣ 5 ⟩ 3 . (74) |0_L\rangle= \frac{|0\rangle+|2\rangle+|4\rangle}{\sqrt{3}}, \qquad|1_L\rangle= \frac{|1\rangle+|3\rangle+|5\rangle}{\sqrt{3}}. \tag*{(74)} ∣ 0 L ⟩ = 3 ∣0 ⟩ + ∣2 ⟩ + ∣4 ⟩ , ∣ 1 L ⟩ = 3 ∣1 ⟩ + ∣3 ⟩ + ∣5 ⟩ . (74)
The local logical projector P P P obeys
P x P = P z P = P x z P = 0 , P x 2 P = P z 2 P = r 2 2 P , y = 0. (75) P x P = P z P = P x z P = 0, \qquad P x^2 P = P z^2 P = \frac{r^2}{2}P, \qquad y=0. \tag*{(75)} P x P = P z P = P x z P = 0 , P x 2 P = P z 2 P = 2 r 2 P , y = 0. (75)
These identities follow by summing the first two trigonometric moments of either equilateral triangle. Thus this six-mode encoding corrects the same three-coordinate force noise as the axial comparator.
Theorem S10 (Protected planar advantage). Put D = d / r D=d/r D = d / r . The matrix K ( D ) K(D) K ( D ) contains the inverse centre-to-centre distances in units of r r r , and v j v_j v j is the difference between the probabilities of vertex j j j in the two logical states:
K j k ( D ) = [ ( sin θ j − sin θ k ) 2 + ( D − cos θ j − cos θ k ) 2 ] − 1 / 2 , v j = ( − 1 ) j 3 . (76) K_{jk}(D)=\left[(\sin\theta_j-\sin\theta_k)^2+(D-\cos\theta_j-\cos\theta_k)^2\right]^{-1/2},\qquad v_j=\frac{(-1)^j}{3}. \tag*{(76)} K j k ( D ) = [ ( sin θ j − sin θ k ) 2 + ( D − cos θ j − cos θ k ) 2 ] − 1/2 , v j = 3 ( − 1 ) j . (76) The compressed Hamiltonian of Eq. (74) has nonlocal part ℏ J Z A Z B \hbar J Z_A Z_B ℏ J Z A Z B , with
g h e x : = ∣ J ∣ = G 4 ℏ r ∣ v T K ( D ) v ∣ . (77) g_{\mathrm{hex}}:=|J|=\frac{G}{4\hbar r}\left|v^{\mathsf{T}}K(D)v\right|. \tag*{(77)} g hex := ∣ J ∣ = 4ℏ r G v T K ( D ) v . (77) At D = 3.6 D=3.6 D = 3.6 , its protected entangling rate satisfies
β g h e x > 2.5104 β G ℏ d F ( r / d ) . (78) \beta g_{\mathrm{hex}}>2.5104\frac{\beta G}{\hbar d}F(r/d). \tag*{(78)} β g hex > 2.5104 ℏ d β G F ( r / d ) . (78) It therefore exceeds the rate of every protected axial code at the same support radius and separation. At large separation,
g h e x = 295 32 G r 6 ℏ d 7 + O ( G r 8 ℏ d 9 ) , (79) g_{\mathrm{hex}}=\frac{295}{32}\frac{G r^6}{\hbar d^7}+O\left(\frac{G r^8}{\hbar d^9}\right), \tag*{(79)} g hex = 32 295 ℏ d 7 G r 6 + O ( ℏ d 9 G r 8 ) , (79) giving a ratio 59 / 8 = 7.375 59/8=7.375 59/8 = 7.375 to the sharp axial leading coefficient.
Proof. The codewords have disjoint mode support, so H L H_L H L is diagonal in the two logical computational bases. If its four diagonal energies are E u v E_{uv} E uv , with u , v ∈ { 0 , 1 } u,v\in\{0,1\} u , v ∈ { 0 , 1 } , the Ising energy coefficient is ( E 00 + E 11 − E 01 − E 10 ) / 4 (E_{00}+E_{11}-E_{01}-E_{10})/4 ( E 00 + E 11 − E 01 − E 10 ) /4 , equal to ℏ J \hbar J ℏ J . Substitution of the nine equal probabilities in each sector gives Eq. (77) .
To evaluate the finite-separation gap, define Q A , B ( D ) = ( D 2 − A D + B ) − 1 / 2 Q_{A,B}(D)=(D^2-AD+B)^{-1/2} Q A , B ( D ) = ( D 2 − A D + B ) − 1/2 . The dimensionless coupling is
ℏ r G g h e x = 1 36 [ Q 4 , 4 + Q − 4 , 4 − 4 ( Q 3 , 3 + Q − 3 , 3 ) + 2 ( Q 2 , 1 + Q − 2 , 1 + Q 2 , 4 + Q − 2 , 4 ) + 4 ( Q 1 , 1 + Q − 1 , 1 ) − 6 Q 0 , 0 − 4 Q 0 , 3 ] . (80) \begin{aligned}
\frac{\hbar r}{G}g_{\mathrm{hex}}={}&\frac{1}{36}\bigl[Q_{4,4}+Q_{-4,4}-4(Q_{3,3}+Q_{-3,3})\\
&+2(Q_{2,1}+Q_{-2,1}+Q_{2,4}+Q_{-2,4})\\
&+4(Q_{1,1}+Q_{-1,1})-6Q_{0,0}-4Q_{0,3}\bigr]. \tag*{(80)}
\end{aligned} G ℏ r g hex = 36 1 [ Q 4 , 4 + Q − 4 , 4 − 4 ( Q 3 , 3 + Q − 3 , 3 ) + 2 ( Q 2 , 1 + Q − 2 , 1 + Q 2 , 4 + Q − 2 , 4 ) + 4 ( Q 1 , 1 + Q − 1 , 1 ) − 6 Q 0 , 0 − 4 Q 0 , 3 ] . (80)
at D = 3.6 D=3.6 D = 3.6 , where the bracket is positive. Direct evaluation gives
ℏ r G g h e x = 0.00138570517690316427 … \frac{\hbar r}{G}g_{\mathrm{hex}}=0.00138570517690316427\ldots G ℏ r g hex = 0.00138570517690316427 …
Summing Eq. (66) through total degree 120 and adding the tail in Eq. (68) gives
F ( 1 / 3.6 ) 3.6 = 0.00055197095412245984 … , \frac{F(1/3.6)}{3.6}=0.00055197095412245984\ldots, 3.6 F ( 1/3.6 ) = 0.00055197095412245984 … ,
with the upper endpoint differing from the truncated sum by less than 10 − 30 10^{-30} 1 0 − 30 . Their ratio exceeds 2.5104, proving Eq. (78) . The strict inequality has a margin far larger than the displayed numerical rounding.
The leading coefficient also has a direct multipole explanation. We compute the cubic moment seen from a transverse angle and then average its square; lower moments are scalar on the code. For ζ ϕ ( a ) = a z + i a x cos ϕ + i a y sin ϕ \zeta_\phi(a)=a_z+ia_x\cos\phi+ia_y\sin\phi ζ ϕ ( a ) = a z + i a x cos ϕ + i a y sin ϕ , the reflected Coulomb kernel has the representation
1 ∣ d e z + b − a ∣ = ∫ 0 ∞ e − d t ⟨ e t ζ ϕ ( a ) e t ζ ϕ ( c ) ⟩ ϕ d t , c = ( b x , b y , − b z ) , (81) \frac{1}{\lvert d e_z+b-a\rvert}=\int_0^\infty e^{-dt}\left\langle e^{t\zeta_\phi(a)}e^{t\zeta_\phi(c)}\right\rangle_\phi\,dt,\qquad\mathbf{c}=(b_x,b_y,-b_z), \tag*{(81)} ∣ d e z + b − a ∣ 1 = ∫ 0 ∞ e − d t ⟨ e t ζ ϕ ( a ) e t ζ ϕ ( c ) ⟩ ϕ d t , c = ( b x , b y , − b z ) , (81)
where ⟨ ⋅ ⟩ ϕ \langle\cdot\rangle_\phi ⟨ ⋅ ⟩ ϕ denotes the uniform angular average. Indeed, this angular average is e t ( a z + c z ) J 0 ( t ∣ a ⊥ − c ⊥ ∣ ) e^{t(a_z+c_z)}J_0(t\lvert a_\perp-c_\perp\rvert) e t ( a z + c z ) J 0 ( t ∣ a ⊥ − c ⊥ ∣) , whose Laplace transform is the displayed inverse distance. Absolute convergence follows from d > 2 r d>2r d > 2 r . For Alice’s coordinates and Bob’s reflected coordinates c \mathbf{c} c , the two local codes have the same cubic compression:
P ζ ϕ 3 P = r 3 4 ( 1 + 3 cos 2 ϕ ) Z . P\zeta_\phi^3P=\frac{r^3}{4}(1+3\cos^2\phi)Z. P ζ ϕ 3 P = 4 r 3 ( 1 + 3 cos 2 ϕ ) Z .
because ⟨ z 3 ⟩ = ± r 3 / 4 \langle z^3\rangle= \pm r^3/4 ⟨ z 3 ⟩ = ± r 3 /4 and ⟨ z x 2 ⟩ = ∓ r 3 / 4 \langle zx^2\rangle= \mp r^3/4 ⟨ z x 2 ⟩ = ∓ r 3 /4 , with the other odd mixed moments zero. Here Z Z Z is the logical Pauli operator defined by the two parity classes. The nonlocal term starts at degree three on each side. Since ∫ 0 ∞ t 6 e − d t d t = 720 / d 7 \int_{0}^{\infty} t^6 e^{-dt}\,\mathrm{d}t = 720/d^7 ∫ 0 ∞ t 6 e − d t d t = 720/ d 7 , its coefficient is
720 ( 3 ! ) 2 r 6 16 d 7 ⟨ ( 1 + 3 cos 2 ϕ ) 2 ⟩ ϕ = 5 r 6 4 d 7 59 8 = 295 r 6 32 d 7 . \frac{720}{(3!)^2}\frac{r^6}{16d^7}\left\langle(1+3\cos^2\phi)^2\right\rangle_\phi=\frac{5r^6}{4d^7}\frac{59}{8}=\frac{295r^6}{32d^7}. ( 3 ! ) 2 720 16 d 7 r 6 ⟨ ( 1 + 3 cos 2 ϕ ) 2 ⟩ ϕ = 4 d 7 5 r 6 8 59 = 32 d 7 295 r 6 .
The factor 720 / ( 3 ! ) 2 720/(3!)^2 720/ ( 3 ! ) 2 comes from the Laplace integral and the two cubic Taylor coefficients; 59 / 8 59/8 59/8 is the angular average of the squared factor 1 + 3 cos 2 ϕ 1+3\cos^2\phi 1 + 3 cos 2 ϕ . Multiplying this kernel coefficient by G / ℏ G/\hbar G /ℏ gives the leading frequency in Eq. (79) . Simultaneously replacing both local positions by their negatives preserves the signed kernel sum, so odd total degrees vanish. The next allowed term has degree eight, proving Eq. (79) .
At d / r = 3.6 > 1 + 5 d/r=3.6>1+\sqrt{5} d / r = 3.6 > 1 + 5 , the unprotected capacity is attained by two axial positions, as established by Theorem S1. The protected comparison therefore identifies the change caused by correction: the mixed third moments available to a planar code increase the retained interaction. The comparator covers the centre-to-centre axis; optimizing the full finite-distance rate over tilted lines or all three-dimensional protected codes is a further problem.
a. Normalizable packets. The strict separation also admits finite-kinetic-energy codewords. Place the hexagon centres at radius a < r a<r a < r , and replace each position mode by a translated, normalized, radial C ∞ C^\infty C ∞ wavefunction supported in a ball of radius w < min ( r − a , a / 2 ) w<\min(r-a,a/2) w < min ( r − a , a /2 ) . The packets are disjoint. If their coordinate variance about each packet centre is s 2 s^2 s 2 , both logical states still have zero first moments, and their second moments become
P x 2 P = P z 2 P = ( a 2 / 2 + s 2 ) P , P y 2 P = s 2 P , P x^2 P=P z^2 P=(a^2/2+s^2)P,\qquad P y^2 P=s^2P, P x 2 P = P z 2 P = ( a 2 /2 + s 2 ) P , P y 2 P = s 2 P ,
with all mixed second moments zero. Thus Eq. (33) continues to hold for all three continuous position coordinates. Every compressed potential entry equals its centre-to-centre value: the Coulomb kernel is harmonic on either packet support, and integration against a normalized radial density returns its value at the centre. Applying this mean-value identity successively to the two packets proves the statement. With a = 0.99 r a=0.99r a = 0.99 r and d = 3.6 r d=3.6r d = 3.6 r ,
ℏ r G g h e x = 0.001299212051971499 … , g h e x G F ( r / d ) / ( ℏ d ) = 2.35376887546 … . \frac{\hbar r}{G}g_{\mathrm{hex}}=0.001299212051971499\ldots,\qquad
\frac{g_{\mathrm{hex}}}{G F(r/d)/(\hbar d)}=2.35376887546\ldots. G ℏ r g hex = 0.001299212051971499 … , GF ( r / d ) / ( ℏ d ) g hex = 2.35376887546 … .
These are finite-energy realizations of the compressed-Hamiltonian comparison. Their recovery must also handle internal packet and y y y -coordinate errors. The six-mode recovery in Section S7 is a separate, finite-dimensional control model.
The time and finite data needed for evidence
A Bell-pair rate becomes an experimental time requirement only after we specify how the output will be tested. We first derive this requirement for the three-dimensional model of the main text, allowing the experiment to stop at a time chosen from its measurement record. We then give the collinear derivation and finite-packet constructions that turn a prescribed false-positive probability and detection probability into explicit counts. Throughout this section, the test includes the quantum measurement before its result is written to a classical register.
Mean time and confidence in three dimensions
Let T i n t T_{\mathrm{int}} T int be the sum of the gravitational interaction durations in one complete experiment, including unsuccessful attempts and seed preparation. A test has size α \alpha α if its acceptance probability is at most α \alpha α for every state separable across the two complete laboratories; its power p p p is the acceptance probability for the intended output. We use the three-dimensional entropy-rate bound C E ( 3 ) C_E^{(3)} C E ( 3 ) from Theorem S1, with d ≥ ( 1 + 5 ) r d \ge(1+\sqrt{5})r d ≥ ( 1 + 5 ) r . The binary relative entropy d 2 ( p ∥ α ) d_2(p\Vert\alpha) d 2 ( p ∥ α ) below measures how distinguishable the two acceptance probabilities are, in bits. We bound it by the entanglement entropy that gravity can supply during the mean interaction time.
Corollary S11 (Three-dimensional mean-time bound). Under Theorem S1, a finite protocol starting from separable complete laboratories, with unconditional power p > α p>\alpha p > α and size at most α \alpha α on every separable full-laboratory output, satisfies
d 2 ( p ∥ α ) ≤ C E ( 3 ) E T i n t , d 2 ( p ∥ α ) = p log 2 p α + ( 1 − p ) log 2 1 − p 1 − α . (82) d_2(p\Vert\alpha) \le C_E^{(3)}\mathbb{E}T_{\mathrm{int}}, \qquad d_2(p\Vert\alpha)=p\log_2\frac{p}{\alpha}+(1-p)\log_2\frac{1-p}{1-\alpha}. \tag*{(82)} d 2 ( p ∥ α ) ≤ C E ( 3 ) E T int , d 2 ( p ∥ α ) = p log 2 α p + ( 1 − p ) log 2 1 − α 1 − p . (82)
The extension to expected-duration limits requires almost-sure termination, finite mean cost and normal bounded-duration approximants converging in output probabilities and expected cost. Local noise and feedback are permitted if the supported interaction model is maintained.
Proof. We apply the instantaneous row-sum entropy bound used in Theorem S1. Resolve the preparation and local instruments into normalized pure branches ψ h \psi_h ψ h , with probabilities w h w_h w h ; S ( ψ h ) S(\psi_h) S ( ψ h ) is their Schmidt entropy in bits. Local instruments cannot increase its average, so integration over the interaction periods gives ∑ h w h S ( ψ h ) ≤ C E ( 3 ) E T i n t \sum_h w_hS(\psi_h)\le C_E^{(3)}\mathbb{E}T_{\mathrm{int}} ∑ h w h S ( ψ h ) ≤ C E ( 3 ) E T int in bits. To compare the output with a separable state, remove each branch’s coherence between its Schmidt product vectors. The resulting normalized state σ h \sigma_h σ h is separable and satisfies D ( ψ h ∥ σ h ) = S ( ψ h ) ln 2 D(\psi_h\Vert\sigma_h)=S(\psi_h)\ln2 D ( ψ h ∥ σ h ) = S ( ψ h ) ln 2 . Keeping the same probabilities and flags, σ = ∑ h w h σ h \sigma=\sum_h w_h\sigma_h σ = ∑ h w h σ h is normalized and separable. Let ρ = ∑ h w h ψ h \rho=\sum_h w_h\psi_h ρ = ∑ h w h ψ h denote the output, including its flags, and let M M M be the acceptance effect. For quantum relative entropy D D D with natural logarithms, joint convexity bounds the cost of this separable comparison. Applying the binary measurement cannot increase that cost, giving
d 2 ( p ∥ α ) ≤ D ( ρ ∥ σ ) ln 2 ≤ ∑ h w h S ( ψ h ) . d_2(p\Vert\alpha)\le\frac{D(\rho\Vert\sigma)}{\ln2}\le\sum_h w_hS(\psi_h). d 2 ( p ∥ α ) ≤ ln 2 D ( ρ ∥ σ ) ≤ h ∑ w h S ( ψ h ) .
The first inequality uses Tr ( M σ ) ≤ α < p \operatorname{Tr}(M\sigma)\le\alpha<p Tr ( M σ ) ≤ α < p . First prove this for finite-spectrum approximants and then pass only the bounded binary probabilities and expected costs to their limits, as in Section S2 § 1.10 . No uniform entropy continuity or convergent subsequence of comparison states is required. Truncating long histories to recorded nonrejection gives the stated stopping-time closure under its explicit approximation assumptions.
We next ask whether this lower bound has the optimal leading coefficient when false positives become rare. For fixed 0 < p < 1 0<p<1 0 < p < 1 , let τ ( α , p ) \tau(\alpha,p) τ ( α , p ) be the infimum mean aggregate interaction time in this ideal class. Capacity-achieving Bell-pair generation and local verification give the matching asymptotic relation
τ ( α , p ) = [ p C E ( 3 ) + o ( 1 ) ] log 2 ( 1 / α ) , α ↓ 0. (83) \tau(\alpha,p)=\left[\frac{p}{C_E^{(3)}}+o(1)\right]\log_2(1/\alpha), \qquad\alpha\downarrow0. \tag*{(83)} τ ( α , p ) = [ C E ( 3 ) p + o ( 1 ) ] log 2 ( 1/ α ) , α ↓ 0. (83)
The lower coefficient follows from Eq. (82) . For the upper coefficient, a capacity-achieving run produces a register of L = log 2 ( 1 / α ) + O ( 1 ) L=\log_2(1/\alpha)+O(1) L = log 2 ( 1/ α ) + O ( 1 ) Bell pairs in time t L = L / C E ( 3 ) + o ( L ) t_L=L/C_E^{(3)}+o(L) t L = L / C E ( 3 ) + o ( L ) , including generated seed entanglement. Its local maximally-entangled-state verifier has size b L = 2 / ( 2 L + 1 ) ≤ α b_L=2/(2^L+1)\le\alpha b L = 2/ ( 2 L + 1 ) ≤ α and target acceptance q L → 1 q_L\to1 q L → 1 [31 ] . Before any charged gravitational preparation, draw and share a classical coin: run with probability p / q L p/q_L p / q L , otherwise record nonrejection at zero interaction cost. For large L L L , q L > p q_L>p q L > p . The final effect is the local run-flag projection tensored with that same verifier. It has all-separable size at most b L ≤ α b_L\le\alpha b L ≤ α even when a separable alternative puts all its weight in the run flags. The unconditional power is p p p (or at least p p p if q L q_L q L is a certified lower bound), and mean time is ( p / q L ) t L (p/q_L)t_L ( p / q L ) t L . The verifier size must not be enlarged to α / ( p / q L ) \alpha/(p/q_L) α / ( p / q L ) : arbitrary null flags would then violate the all-separable size requirement.
Equation (S73) determines the leading mean-time coefficient, not the exact finite-error optimum or a hard-duration strong converse. It does not prove the fixed exact zero-miss endpoint p = 1 p=1 p = 1 . The vanishing-miss confidence exponent is separately C E ( 3 ) C_{E}^{(3)} C E ( 3 ) bits per aggregate time, by the same capacity verifier and Eq. (82) . At r = 125.001 μ m r=125.001\,\mu\mathrm{m} r = 125.001 μ m , d = 450 μ m d=450\,\mu\mathrm{m} d = 450 μ m and m A = m B = 10 − 14 k g m_A=m_B=10^{-14}\,\mathrm{kg} m A = m B = 1 0 − 14 kg , the far-ball condition holds and C E ( 3 ) = 0.06003424381 C_{E}^{(3)}=0.06003424381 C E ( 3 ) = 0.06003424381 ebits per second; the α = .01 \alpha=.01 α = .01 , p = .95 p=.95 p = .95 mean-time lower bound remains 100.3759025 seconds. The collinear hard-budget robustness exponential is not being asserted for arbitrary three-dimensional encodings.
For fixed codes correcting linear force errors, the same separable-comparison argument uses the protected entropy-rate bound β G S 3 ( r / d ) / ( ℏ d ) \beta\mathcal{G} S_3(r/d)/(\hbar d) β G S 3 ( r / d ) / ( ℏ d ) , as stated in Eq. (48) . Here S 3 ( u ) = ∑ j , k ≥ 3 ( j + k j ) u j + k S_3(u)=\sum_{j,k\geq3}\binom{j+k}{j}u^{j+k} S 3 ( u ) = ∑ j , k ≥ 3 ( j j + k ) u j + k bounds the retained logical interaction after the quantum syndromes are reset. At r = 125 μ m r=125\,\mu\mathrm{m} r = 125 μ m , d = 450 μ m d=450\,\mu\mathrm{m} d = 450 μ m and equal masses 10 − 14 k g 10^{-14}\,\mathrm{kg} 1 0 − 14 kg , inserting α = .01 \alpha=.01 α = .01 and p = .95 p=.95 p = .95 gives the lower mean time 648.4722 seconds. This is the all-code lower bound used in the main text; its test concerns the retained logical systems under the projected dynamics.
An entropy bound for a finite statistical decision
For the collinear model, the same argument gives the rate C E = β κ C_E=\beta\kappa C E = β κ . Here the supports are ∣ x A ∣ ≤ ℓ A |x_A|\leq\ell_A ∣ x A ∣ ≤ ℓ A and ∣ x B ∣ ≤ ℓ B |x_B|\leq\ell_B ∣ x B ∣ ≤ ℓ B , with d > ℓ A + ℓ B d>\ell_A+\ell_B d > ℓ A + ℓ B , and G = G m A m B \mathcal{G}=Gm_Am_B G = G m A m B . The frequency κ = κ ( ℓ A , ℓ B ) \kappa=\kappa(\ell_A,\ell_B) κ = κ ( ℓ A , ℓ B ) is one quarter of the magnitude of the four endpoint potential energies’ alternating sum, divided by ℏ \hbar ℏ ; its full expression and centered product decomposition are given in Eqs. (162) and (161) . We retain those model assumptions throughout this subsection. To match the natural-logarithm convention used in the hard-time bound, write the binary relative entropy as
d b i n ( p ∥ α ) = p ln p α + ( 1 − p ) ln 1 − p 1 − α , d_{\mathrm{bin}}(p\Vert\alpha)=p\ln\frac{p}{\alpha}+(1-p)\ln\frac{1-p}{1-\alpha}, d bin ( p ∥ α ) = p ln α p + ( 1 − p ) ln 1 − α 1 − p ,
with the usual limiting convention at p = 1 p=1 p = 1 .
Corollary S12 (Expected interaction time). For initially separable laboratories, a finite supported Newtonian protocol and a final test of all-separable size 0 < α < p ≤ 1 0<\alpha<p\leq1 0 < α < p ≤ 1 satisfy
d b i n ( p ∥ α ) ≤ β κ ln 2 E T i n t . (84) d_{\mathrm{bin}}(p\Vert\alpha)\leq\beta\kappa\ln2\,\mathbb{E}T_{\mathrm{int}}. \tag*{(84)} d bin ( p ∥ α ) ≤ β κ ln 2 E T int . (84) The statement extends to normal protocol limits that terminate almost surely, have finite expected interaction time, and admit bounded-duration approximants converging in output probabilities and expected cost.
Proof. Work first with finite local systems and finitely many interaction steps. Refine the separable preparation and local instruments into pure branches with probabilities w h w_h w h , retaining local purifying environments until the final discard. The entropy derivative is linear in the Hamiltonian. Applying the known ancilla-assisted product-Hamiltonian rate to finite approximants of the centered decomposition in Eq. (161) bounds each interaction’s entropy increase by β κ \beta\kappa β κ times its duration. Local instruments cannot increase average pure-state entanglement. The final Schmidt entropies, measured in bits, thus obey
∑ h w h S ( ψ h ) ≤ β κ E T i n t . (85) \sum_h w_h S(\psi_h)\leq\beta\kappa\,\mathbb{E}T_{\mathrm{int}}. \tag*{(85)} h ∑ w h S ( ψ h ) ≤ β κ E T int . (85)
The comparison state must retain the same branch probabilities, so that postselection cannot remove the cost of failed attempts. If λ h j \lambda_{hj} λ hj are the Schmidt probabilities of branch h h h , dephase that branch in its Schmidt product basis: σ h = ∑ j λ h j ∣ u h j v h j ⟩ ⟨ u h j v h j ∣ \sigma_h=\sum_j\lambda_{hj}|u_{hj}v_{hj}\rangle\langle u_{hj}v_{hj}| σ h = ∑ j λ hj ∣ u hj v hj ⟩ ⟨ u hj v hj ∣ . This is a normalized separable state and D ( ψ h ∥ σ h ) = S ( ψ h ) ln 2 D(\psi_h\Vert\sigma_h)=S(\psi_h)\ln2 D ( ψ h ∥ σ h ) = S ( ψ h ) ln 2 . Keeping the same probabilities and flags, σ = ∑ h w h σ h \sigma=\sum_h w_h\sigma_h σ = ∑ h w h σ h is normalized and separable. Joint convexity and binary data processing give
d b i n ( p ∥ α ) ≤ d b i n ( p ∥ Tr M σ ) ≤ D ( ρ ∥ σ ) ≤ ln 2 ∑ h w h S ( ψ h ) . d_{\mathrm{bin}}(p\Vert\alpha)\leq d_{\mathrm{bin}}(p\Vert\operatorname{Tr}M\sigma)\leq D(\rho\Vert\sigma)\leq\ln2\sum_h w_hS(\psi_h). d bin ( p ∥ α ) ≤ d bin ( p ∥ Tr M σ ) ≤ D ( ρ ∥ σ ) ≤ ln 2 h ∑ w h S ( ψ h ) .
The first inequality uses Tr M σ ≤ α < p \operatorname{Tr} M\sigma\le\alpha< p Tr M σ ≤ α < p . This proves Eq. (84) with every branch retained.
For bounded-duration continuum protocols, use Eq. (18) and the Ising simulation at each finite accuracy. Finite local supports and outcome truncations approximate the normal local maps and the fixed bounded final test. Apply the scalar inequality to these approximants and pass the rejection probabilities and expected costs to their limits. This step requires neither entropy continuity on the full bosonic space nor convergence of the separable comparators. For the stated stopping-time closure, terminate long histories with a recorded nonrejection. Almost-sure termination makes their rejection probabilities tend to p p p , while the truncated expected cost is at most the original one. The assumed finite approximants then give Eq. (84) by continuity.
For deterministic duration T T T , Eq. (84) implies that a vanishing-miss test, p T → 1 p_T \to1 p T → 1 , has
lim sup T → ∞ − ln α T T ≤ C E ln 2. \limsup_{T\to\infty}\frac{-\ln\alpha_T}{T}\le C_E\ln2. T → ∞ lim sup T − ln α T ≤ C E ln 2.
This exponent is attainable in the same ideal capacity class. Distil L T L_T L T Bell pairs at any rate below C E C_E C E with error tending to zero, and apply the established local maximally-entangled-state verifier Ω D = ( I + D Φ D ) / ( D + 1 ) \Omega_D=(I+D\Phi_D)/(D+1) Ω D = ( I + D Φ D ) / ( D + 1 ) , where Φ D \Phi_D Φ D is the rank-one projector onto a maximally entangled state of local dimension D = 2 L T D=2^{L_T} D = 2 L T [31 ] . Its separable ceiling is 2 / ( D + 1 ) 2/(D+1) 2/ ( D + 1 ) and its target acceptance tends to one. Thus the optimal vanishing-miss exponent is C E ln 2 C_E\ln2 C E ln 2 . At fixed p < 1 p<1 p < 1 , Eq. (84) is a lower time bound; it does not determine an exact finite-error optimum or a fixed-power strong converse.
Corollary S13 (Optimal leading mean time at fixed power). Let τ ( α , p ) \tau(\alpha,p) τ ( α , p ) be the infimum of the actual mean aggregate interaction time, including gravitational seed preparation, for initially separable protocols of all-separable size at most α \alpha α and unconditional power at least p p p . In the same ideal-control capacity class, for every fixed 0 < p < 1 0<p<1 0 < p < 1 ,
τ ( α , p ) = [ p C E + o ( 1 ) ] log 2 1 α ( α → 0 ) . (86) \tau(\alpha,p)=\left[\frac{p}{C_E}+o(1)\right]\log_2\frac{1}{\alpha}\qquad(\alpha\to0). \tag*{(86)} τ ( α , p ) = [ C E p + o ( 1 ) ] log 2 α 1 ( α → 0 ) . (86)
The mean-time saving is obtained by deciding whether to run before any charged preparation. A running history uses a full capacity protocol; the other histories terminate with a recorded nonrejection.
Proof. Equation (S74), with monotonicity in the target power, gives
C E τ ( α , p ) ≥ p log 2 1 α − h 2 ( p ) − ( 1 − p ) log 2 ( 1 − α ) . C_E\tau(\alpha,p)\ge p\log_2\frac{1}{\alpha}-h_2(p)-(1-p)\log_2(1-\alpha). C E τ ( α , p ) ≥ p log 2 α 1 − h 2 ( p ) − ( 1 − p ) log 2 ( 1 − α ) .
where h 2 h_2 h 2 is the binary entropy. This proves the lower leading coefficient. For any fixed achievable rate R < C E R<C_E R < C E , the capacity construction produces an L L L -ebit register in deterministic duration t L = L / R + o ( L ) t_L=L/R+o(L) t L = L / R + o ( L ) , including the generated seed, with error tending to zero. Choose L = ⌈ log 2 ( 2 / α − 1 ) ⌉ L=\lceil\log_2(2/\alpha-1)\rceil L = ⌈ log 2 ( 2/ α − 1 )⌉ and D = 2 L D=2^L D = 2 L . The local verifier Ω D = ( I + D Φ D ) / ( D + 1 ) \Omega_D=(I+D\Phi_D)/(D+1) Ω D = ( I + D Φ D ) / ( D + 1 ) has separable ceiling b L = 2 / ( D + 1 ) ≤ α b_L=2/(D+1)\le\alpha b L = 2/ ( D + 1 ) ≤ α and a certified lower bound q L → 1 q_L\to1 q L → 1 on its target pass probability.
Before any charged gravitational preparation, draw and broadcast a classical coin. Run the entire protocol with probability r L = p / q L r_L=p/q_L r L = p / q L and otherwise record nonrejection; q L > p q_L>p q L > p for sufficiently large L L L . The actual unconditional power is at least p p p . Let P r u n A P_{\mathrm{run}}^A P run A and P r u n B P_{\mathrm{run}}^B P run B project onto the local run flags. The final effect is
M = P r u n A ⊗ P r u n B ⊗ Ω D . M=P_{\mathrm{run}}^A\otimes P_{\mathrm{run}}^B\otimes\Omega_D. M = P run A ⊗ P run B ⊗ Ω D .
For every separable full-laboratory state σ \sigma σ , projecting onto both flags leaves a subnormalized separable register, so
Tr ( M σ ) ≤ b L Tr [ ( P r u n A ⊗ P r u n B ) σ ] ≤ b L ≤ α , \operatorname{Tr}(M\sigma)\le b_L\operatorname{Tr}\left[(P_{\mathrm{run}}^A\otimes P_{\mathrm{run}}^B)\sigma\right]\le b_L\le\alpha, Tr ( M σ ) ≤ b L Tr [ ( P run A ⊗ P run B ) σ ] ≤ b L ≤ α ,
with identities on the remaining registers understood. Thus the conditional verifier keeps size α \alpha α , even when the null places all its weight in the run sector. Its size is not relaxed to α / r L \alpha/r_L α / r L . The actual mean time is r L t L r_Lt_L r L t L , giving the upper leading coefficient p / R p/R p / R . Taking R ↑ C E R \uparrow C_E R ↑ C E proves the claim.
This result fixes the leading mean-time coefficient as α → 0 \alpha\to0 α → 0 . It leaves the exact finite-error optimum open and does not establish the endpoint p = 1 p=1 p = 1 , where r L = p / q L r_L = p/q_L r L = p / q L need not be a probability. A hard history-time budget still charges the full duration t L t_L t L on each running history.
Smooth confined packets and a local finite-count test
We give a finite-energy construction under the same exact support assumption as the Newtonian bounds. The spatial controlled phase is the established gravitational-cat mechanism[1 ] ; the local Bell verifier is also established[32 ] . The calculation here controls the full kinetic-plus-Newtonian dynamics and retains every trial in an all-separable finite-count test. We first give the collinear construction, then embed finite-width packets in three-dimensional balls with an explicit bound on all three kinetic-energy components.
We need packets whose support is known exactly and whose kinetic energy can be evaluated without a position-eigenstate limit. For mass j = A , B j=A,B j = A , B , choose centres ± a j \pm a_j ± a j and halfwidth w j < a j w_j<a_j w j < a j , with a j + w j ≤ ℓ j a_j+w_j\le\ell_j a j + w j ≤ ℓ j . Both branches use translates of the same normalized smooth profile,
f ( z ) = Z f − 1 / 2 e − 1 / ( 1 − z 2 ) 1 ∣ z ∣ < 1 , Z f = ∫ − 1 1 e − 2 / ( 1 − z 2 ) d z , f(z)=Z_f^{-1/2}e^{-1/(1-z^2)}\mathbf{1}_{|z|<1},\qquad Z_f=\int_{-1}^{1}e^{-2/(1-z^2)}\,\mathrm{d}z, f ( z ) = Z f − 1/2 e − 1/ ( 1 − z 2 ) 1 ∣ z ∣ < 1 , Z f = ∫ − 1 1 e − 2/ ( 1 − z 2 ) d z ,
and translated packets f j , ± ( x ) = w j − 1 / 2 f [ ( x ∓ a j ) / w j ] f_{j,\pm}(x)=w_j^{-1/2}f[(x\mp a_j)/w_j] f j , ± ( x ) = w j − 1/2 f [( x ∓ a j ) / w j ] . The zero extension is C ∞ C^\infty C ∞ and has finite kinetic energy
E k i n , j = ℏ 2 ν f 2 m j w j 2 , ν f = ∫ − 1 1 ∣ f ′ ( z ) ∣ 2 d z = 3.0776091312 … (87) E_{\mathrm{kin},j}=\frac{\hbar^2\nu_f}{2m_jw_j^2},\qquad\nu_f=\int_{-1}^{1}|f'(z)|^2\,\mathrm{d}z=3.0776091312\ldots \tag*{(87)} E kin , j = 2 m j w j 2 ℏ 2 ν f , ν f = ∫ − 1 1 ∣ f ′ ( z ) ∣ 2 d z = 3.0776091312 … (87)
To keep free packet spreading from obscuring the gravitational phase, we place the two translates in identical local wells. With u u u the coordinate measured from a well centre and E 0 j E_{0j} E 0 j an arbitrary common energy offset, an explicit choice is the Friedrichs realization of
H w e l l , j = − ℏ 2 2 m j d 2 d u 2 + U j ( u ) , U j ( u ) = ℏ 2 2 m j w j 2 f ′ ′ ( u / w j ) f ( u / w j ) + E 0 j . H_{\mathrm{well},j}=-\frac{\hbar^2}{2m_j}\frac{\mathrm{d}^2}{\mathrm{d}u^2}+U_j(u),\qquad U_j(u)=\frac{\hbar^2}{2m_jw_j^2}\frac{f''(u/w_j)}{f(u/w_j)}+E_{0j}. H well , j = − 2 m j ℏ 2 d u 2 d 2 + U j ( u ) , U j ( u ) = 2 m j w j 2 ℏ 2 f ( u / w j ) f ′′ ( u / w j ) + E 0 j .
The potential is bounded below and diverges positively at the endpoints; the packet is a ground state. Its kinetic and potential expectations are finite. This is ideal hard confinement. Replacing it by a finite barrier would require a separate control of tails near the Newtonian singularity.
The finite packet width makes the potential vary within each branch. We compare that variation with the constant potential evaluated at the branch centre. The parameter η \eta η below is the accumulated state-norm error of this comparison over the ideal Bell-generation time.
Proposition S14 (Controlled phase with full kinetic dynamics). Prepare the product of local equal cats ( ∣ f A , − ⟩ + ∣ f A , + ⟩ ) ( ∣ f B , − ⟩ + ∣ f B , + ⟩ ) / 2 (|f_{A,-}\rangle+|f_{A,+}\rangle)(|f_{B,-}\rangle+|f_{B,+}\rangle)/2 ( ∣ f A , − ⟩ + ∣ f A , + ⟩) ( ∣ f B , − ⟩ + ∣ f B , + ⟩) /2 . Put r = d − a A − a B r=d-a_A-a_B r = d − a A − a B , w Σ = w A + w B w_\Sigma=w_A+w_B w Σ = w A + w B , and let κ A = κ ( a A , a B ) > 0 \kappa_A=\kappa(a_A,a_B)>0 κ A = κ ( a A , a B ) > 0 . Under the full Hamiltonian H = H A + H B + V H=H_A+H_B+V H = H A + H B + V , at duration
T B = π 4 κ A , η = G T B ℏ w Σ r ( r − w Σ ) , (88) T_B=\frac{\pi}{4\kappa_A},\qquad\eta=\frac{G T_B}{\hbar}\frac{w_\Sigma}{r(r-w_\Sigma)}, \tag*{(88)} T B = 4 κ A π , η = ℏ G T B r ( r − w Σ ) w Σ , (88) deterministic local decoding yields a two-qubit state with Bell fidelity at least 1 − η 2 1-\eta^2 1 − η 2 , whenever η ≤ 1 \eta\le1 η ≤ 1 .
Proof. Work on the tensor product of the two confined two-well Hilbert spaces. We choose a reference interaction that gives the required four phases while leaving the within-well dynamics unchanged. Define D D D as multiplication by the constant v s t = − G / ( d + t a B − s a A ) v_{st}=-\mathcal{G}/(d+ta_B-sa_A) v s t = − G / ( d + t a B − s a A ) on each entire branch rectangle ( s , t ) ∈ { − 1 , + 1 } 2 (s,t)\in\{-1,+1\}^2 ( s , t ) ∈ { − 1 , + 1 } 2 , including its motional excitations. The reciprocal identity therefore gives the global bound on this space ∥ V − D ∥ ≤ G w Σ / [ r ( r − w Σ ) ] \lVert V-D\rVert\leq\mathcal{G}w_{\Sigma}/[r(r-w_{\Sigma})] ∥ V − D ∥ ≤ G w Σ / [ r ( r − w Σ )] . The bounded-perturbation Duhamel identity therefore bounds the difference between evolutions generated by H A + H B + V H_A+H_B+V H A + H B + V and H A + H B + D H_A+H_B+D H A + H B + D by η \eta η in state norm. The kinetic Hamiltonians have been retained on both sides.
The reference packets remain stationary. Their four phases have invariant ( v + + + v − − − v + − − v − + ) T B / ℏ = 4 κ a T B = π (v_{++}+v_{--}-v_{+-}-v_{-+})T_B/\hbar=4\kappa_aT_B=\pi ( v ++ + v −− − v +− − v −+ ) T B /ℏ = 4 κ a T B = π , so their branch state is maximally entangled. A local isometry separates each branch label from its within-well coordinate. Known local phase corrections and a deterministic discard of the coordinate yield the Bell qubits. Norm error at most η \eta η gives squared overlap at least 1 − η 2 1-\eta^2 1 − η 2 , and the local discard cannot reduce the stated Bell fidelity. There is no selection on a motional excitation or survival event.
We can also bound the kinetic energy throughout each interaction, rather than only at preparation. Set E 0 A = E 0 B = 0 E_{0A}=E_{0B}=0 E 0 A = E 0 B = 0 , so that H L = H A + H B ≥ 0 H_L=H_A+H_B\geq0 H L = H A + H B ≥ 0 and the initial cats have ⟨ H L ⟩ 0 = 0 \langle H_L\rangle_0=0 ⟨ H L ⟩ 0 = 0 . The branch-constant operator D D D commutes with both H L H_L H L and V V V . Conservation of H H H and D D D therefore gives
⟨ H L ⟩ t = ⟨ V − D ⟩ 0 − ⟨ V − D ⟩ t ≤ 2 ϵ V , ϵ V = G w Σ r ( r − w Σ ) . \langle H_L\rangle_t=\langle V-D\rangle_0-\langle V-D\rangle_t\leq2\epsilon_V,\qquad\epsilon_V=\frac{\mathcal{G}w_{\Sigma}}{r(r-w_{\Sigma})}. ⟨ H L ⟩ t = ⟨ V − D ⟩ 0 − ⟨ V − D ⟩ t ≤ 2 ϵ V , ϵ V = r ( r − w Σ ) G w Σ .
Since the other local Hamiltonian is nonnegative, each mass satisfies
⟨ p j 2 2 m j ⟩ t ≤ E d w e l l , j : = 2 ϵ V − inf U j , 0 ≤ t ≤ T B . (89) \left\langle\frac{p_j^2}{2m_j}\right\rangle_t\leq E_{\mathrm{dwell},j}:=2\epsilon_V-\inf U_j,\qquad0\leq t\leq T_B. \tag*{(89)} ⟨ 2 m j p j 2 ⟩ t ≤ E dwell , j := 2 ϵ V − inf U j , 0 ≤ t ≤ T B . (89)
For the chosen profile,
f ′ ′ ( z ) f ( z ) = 6 z 4 − 2 ( 1 − z 2 ) 4 , min ∣ z ∣ < 1 f ′ ′ ( z ) f ( z ) = − 8.5914976719 … \frac{f''(z)}{f(z)}=\frac{6z^4-2}{(1-z^2)^4},\qquad\min_{\lvert z\rvert<1}\frac{f''(z)}{f(z)}=-8.5914976719\ldots f ( z ) f ′′ ( z ) = ( 1 − z 2 ) 4 6 z 4 − 2 , ∣ z ∣ < 1 min f ( z ) f ′′ ( z ) = − 8.5914976719 …
with the minimum at z 2 = ( − 3 + 33 ) / 6 z^2=(-3+\sqrt{33})/6 z 2 = ( − 3 + 33 ) /6 . Hence inf U j = − 8.5914976719 … ℏ 2 / ( 2 m j w j 2 ) \inf U_j=-8.5914976719\ldots\,\hbar^2/(2m_jw_j^2) inf U j = − 8.5914976719 … ℏ 2 / ( 2 m j w j 2 ) . This estimate follows from conservation and the lower bound on the well potential; it does not infer kinetic-energy control from a small state-norm error. Independent fresh preparations give the same bound on every active history of the repeated-trial construction. Energy and work during local preparation and readout are not bounded by Eq. (89) .
The same controlled-phase construction has a finite-energy realization inside three-dimensional balls. Let σ j = w j / 3 \sigma_j=w_j/\sqrt{3} σ j = w j / 3 and take
F j , ± ( r ) = σ j − 3 / 2 ∏ k = 1 3 f ( ( r ∓ a j e z ) k σ j ) . F_{j,\pm}(\mathbf{r})=\sigma_j^{-3/2}\prod_{k=1}^{3}f\left(\frac{(\mathbf{r}\mp a_j\mathbf{e}_z)_k}{\sigma_j}\right). F j , ± ( r ) = σ j − 3/2 k = 1 ∏ 3 f ( σ j ( r ∓ a j e z ) k ) .
Each packet occupies a cube contained in the ball of radius w j w_j w j about its axial centre, hence in the allowed ball of radius ℓ j ≥ a j + w j \ell_j\geq a_j+w_j ℓ j ≥ a j + w j . Use the sum of the three translated coordinate well potentials on each cube. For the full Newtonian potential V = − G / ∣ d e z + r B − r A ∣ V=-\mathcal{G}/\lvert d\mathbf{e}_z+\mathbf{r}_B-\mathbf{r}_A\rvert V = − G / ∣ d e z + r B − r A ∣ , the displacement from a branch-centre separation is at most w Σ w_{\Sigma} w Σ . The reverse triangle inequality therefore gives exactly the same bound ∥ V − D ∥ ≤ ϵ V \lVert V-D\rVert\leq\epsilon_V ∥ V − D ∥ ≤ ϵ V . The centre phases, T B T_B T B , η \eta η and Bell-fidelity guarantee are unchanged. Here D D D is constant on the four entire pairs of confined cubes, so it still commutes with the full Hamiltonian and the dwell-energy proof applies. The three coordinate contributions give
E k i n , j ( 3 D ) = 9 E k i n , j ( 1 D ) , E d w e l l , j ( 3 D ) = 2 ϵ V − 9 inf U j ( 1 D ) . (90) E_{\mathrm{kin},j}^{(3\mathrm{D})}=9E_{\mathrm{kin},j}^{(1\mathrm{D})},\qquad E_{\mathrm{dwell},j}^{(3\mathrm{D})}=2\epsilon_V-9\inf U_j^{(1\mathrm{D})}. \tag*{(90)} E kin , j ( 3 D ) = 9 E kin , j ( 1 D ) , E dwell , j ( 3 D ) = 2 ϵ V − 9 inf U j ( 1 D ) . (90)
where the one-dimensional quantities use halfwidth w j w_j w j . Thus the three-dimensional construction includes finite transverse widths and finite transverse kinetic energies.
A count rule with fixed packet energy
The decoding gives a Bell-fidelity guarantee for each trial. To turn it into a count rule, let X , Y , Z X,Y,Z X , Y , Z be the Pauli observables on each decoded qubit and let Φ + = ∣ Φ + ⟩ ⟨ Φ + ∣ \Phi^{+}=|\Phi^{+}\rangle\langle\Phi^{+}| Φ + = ∣ Φ + ⟩ ⟨ Φ + ∣ with ∣ Φ + ⟩ = ( ∣ 00 ⟩ + ∣ 11 ⟩ ) / 2 |\Phi^{+}\rangle=(|00\rangle+|11\rangle)/\sqrt{2} ∣ Φ + ⟩ = ( ∣00 ⟩ + ∣11 ⟩) / 2 . Choose X X , − Y Y XX,-YY X X , − Y Y or Z Z ZZ Z Z uniformly and independently of the source, and record whether the product outcome is + 1 +1 + 1 . With P O + P_{O}^{+} P O + the positive-eigenvalue projector of observable O O O , this is the Bell verifier[32 ]
Ω = P X X + + P − Y Y + + P Z Z + 3 = I + 2 Φ + 3 . \Omega=\frac{P_{XX}^{+}+P_{-YY}^{+}+P_{ZZ}^{+}}{3}=\frac{I+2\Phi^{+}}{3}. Ω = 3 P X X + + P − Y Y + + P Z Z + = 3 I + 2 Φ + .
Its separable pass ceiling is b = 2 / 3 b=2/3 b = 2/3 , while the prepared target passes with probability at least q = 1 − 2 η 2 / 3 q=1-2\eta^{2}/3 q = 1 − 2 η 2 /3 . Choose fixed widths small enough that q > b q>b q > b , and fix b < ζ < q b<\zeta<q b < ζ < q . Reject separability when at least ⌈ N ζ ⌉ \lceil N\zeta\rceil ⌈ N ζ ⌉ of N N N trials pass.
The test effect includes this complete randomized verification on the decoded registers. For the independent target preparations used here, measurements of earlier pairs commute with preparation and interaction on later fresh pairs. Thus the same finite-count effect can be implemented sequentially with classical counters.
Under any state separable across the complete laboratories, local measurement and conditioning preserve separability of the remaining systems. Every conditional pass probability is therefore at most b b b . Consequently the null count is stochastically dominated by Bin ( N , b ) \operatorname{Bin}(N,b) Bin ( N , b ) , including arbitrary correlations among trials within either laboratory. Independent target preparations give a pass count dominating Bin ( N , q ) \operatorname{Bin}(N,q) Bin ( N , q ) , the binomial distribution with N N N trials and success probability q q q . The threshold ζ \zeta ζ leaves a margin ζ − b \zeta-b ζ − b against false positives and a margin q − ζ q-\zeta q − ζ against missed detections. Applying Hoeffding’s inequality to these two margins gives size at most α \alpha α and power at least p 0 ∈ ( 0 , 1 ) p_{0}\in(0,1) p 0 ∈ ( 0 , 1 ) whenever
N ≥ max { ln ( 1 / α ) 2 ( ζ − b ) 2 , ln [ 1 / ( 1 − p 0 ) ] 2 ( q − ζ ) 2 } . (91) N\geq\max\left\{\frac{\ln(1/\alpha)}{2(\zeta-b)^{2}},\frac{\ln[1/(1-p_{0})]}{2(q-\zeta)^{2}}\right\}. \tag*{(91)} N ≥ max { 2 ( ζ − b ) 2 ln ( 1/ α ) , 2 ( q − ζ ) 2 ln [ 1/ ( 1 − p 0 )] } . (91)
Rounding N N N upward and using the stated integer count threshold preserves both bounds. Thus fixed support and the uniform bound on kinetic energy in Eqs. (89) and (90) suffice for T = N T B = O [ ln ( 1 / α ) ] T=NT_{B}=O[\ln(1/\alpha)] T = N T B = O [ ln ( 1/ α )] at fixed power. Classical counters are sufficient; the construction needs no growing coherent memory. All failed trials remain in the count. An aborted preparation is assigned a nonpassing record and must be included in the target-power model.
For a modest finite record one can accept only if every trial passes. Then the size is at most ( 2 / 3 ) N (2/3)^{N} ( 2/3 ) N and the power is at least ( 1 − 2 η 2 / 3 ) N (1-2\eta^{2}/3)^{N} ( 1 − 2 η 2 /3 ) N . Maintaining fixed power with this particular rule as N → ∞ N\to\infty N → ∞ would require w j = O ( N − 1 / 2 ) w_{j}=O(N^{-1/2}) w j = O ( N − 1/2 ) and increasing kinetic energy. Equation (S81) permits occasional failures and removes that restriction.
An explicit finite calibration
Take m A = m B = 10 − 14 k g m_{A}=m_{B}=10^{-14}\,\mathrm{kg} m A = m B = 1 0 − 14 kg , d = 450 μ m d=450\,\mu\mathrm{m} d = 450 μ m , a A = a B = 125 μ m a_{A}=a_{B}=125\,\mu\mathrm{m} a A = a B = 125 μ m and w A = w B = 1 n m w_{A}=w_{B}=1\,\mathrm{nm} w A = w B = 1 nm , with ℓ A = ℓ B = 125.001 μ m \ell_{A}=\ell_{B}=125.001\,\mu\mathrm{m} ℓ A = ℓ B = 125.001 μ m . The mass and branch separations follow the illustrative scales of Ref. [1 ] . In the numerical values below, κ = κ a \kappa=\kappa_{a} κ = κ a determines the centre-phase Bell time, whereas C E = β κ ( ℓ A , ℓ B ) C_{E}=\beta\kappa(\ell_{A},\ell_{B}) C E = β κ ( ℓ A , ℓ B ) uses the slightly larger support intervals for the converse. With G = 6.67430 × 10 − 11 G=6.67430\times10^{-11} G = 6.67430 × 1 0 − 11 and ℏ = 1.054571817 × 10 − 34 \hbar=1.054571817\times10^{-34} ℏ = 1.054571817 × 1 0 − 34 in SI units,
κ = 0.03139417580 s − 1 , C E = 0.06003424381 e b i t s − 1 , T B = 25.01789966 s , η = 7.916892656 × 10 − 5 . \begin{aligned}
\kappa&=0.03139417580\,\mathrm{s}^{-1}, & C_{E}&=0.06003424381\,\mathrm{ebit\,s}^{-1},\\
T_{B}&=25.01789966\,\mathrm{s}, & \eta&=7.916892656\times10^{-5}.
\end{aligned} κ T B = 0.03139417580 s − 1 , = 25.01789966 s , C E η = 0.06003424381 ebit s − 1 , = 7.916892656 × 1 0 − 5 .
The initial collinear packet energy per mass is E k i n , j ( 1 D ) = 1.711337976 × 10 − 36 J E_{\mathrm{kin},j}^{(1\mathrm{D})}=1.711337976\times10^{-36}\,\mathrm{J} E kin , j ( 1 D ) = 1.711337976 × 1 0 − 36 J . Equation (S79) gives E d w e l l , j ( 1 D ) = 4.778063009 × 10 − 36 J E_{\mathrm{dwell},j}^{(1\mathrm{D})}=4.778063009\times10^{-36}\,\mathrm{J} E dwell , j ( 1 D ) = 4.778063009 × 1 0 − 36 J for each mass throughout every interaction. For the three-dimensional packets of Eq. (90) , the corresponding initial energy and uniform dwell bound per mass are
E k i n , j ( 3 D ) = 1.540204178 × 10 − 35 J , E d w e l l , j ( 3 D ) = 4.299722759 × 10 − 35 J . E_{\mathrm{kin},j}^{(3\mathrm{D})}=1.540204178 \times10^{-35}\,\mathrm{J},\qquad E_{\mathrm{dwell},j}^{(3\mathrm{D})}=4.299722759 \times10^{-35}\,\mathrm{J}. E kin , j ( 3 D ) = 1.540204178 × 1 0 − 35 J , E dwell , j ( 3 D ) = 4.299722759 × 1 0 − 35 J .
These bounds are independent of the number of trials. In either spatial construction, twelve independent preparations and acceptance only on twelve passes give
α 12 ≤ 0.007707346629 , p 12 ≥ 0.999999949858 , T 12 = 300.2147959 s . (92) \alpha_{12} \le0.007707346629,\qquad p_{12} \ge0.999999949858,\qquad T_{12}=300.2147959\ \mathrm{s}. \tag*{(92)} α 12 ≤ 0.007707346629 , p 12 ≥ 0.999999949858 , T 12 = 300.2147959 s . (92)
At requested size 0.01 and power 0.95, the entropy bound (S74) requires E T i n t ≥ 100.3759025 s E T_{\mathrm{int}} \ge100.3759025\ \mathrm{s} E T int ≥ 100.3759025 s ; the hard-time robustness bound gives T max ≥ 72.5274159 s T_{\max} \ge72.5274159\ \mathrm{s} T m a x ≥ 72.5274159 s . The twelve-trial record is one sufficient construction, and these bounds do not fix the optimum finite-error time.
This calibration assumes ideal confined preparation, noiseless evolution and trusted local decoding and measurements. It is not an experimental feasibility estimate: the coherence calibration in the original spatial-cat proposal does not establish a coherent 25-second realization. Preparation, readout and confinement costs are additional to the interaction duration. Each member of the construction has finite kinetic energy, while a physical finite-barrier realization and exclusion of nongravitational couplings require their own analysis.
A finite noisy record
We use the same local Pauli test for a hexagon protocol with finite recovery periods. The cycle calculation in Section S7 follows the full six-mode gravitational interaction during a dwell of length τ \tau τ , then applies local recovery and resets the quantum syndromes. Its output fidelity after n n n cycles is denoted F n F_n F n ; T ∗ = n τ = π / ( 4 g h e x ) T_* = n\tau= \pi/(4g_{\mathrm{hex}}) T ∗ = n τ = π / ( 4 g hex ) is the Bell time of the projected hexagon interaction. We state the resulting experimental count here, then derive the cycle and control bounds in that section.
For m A = m B = 10 − 14 k g m_A = m_B = 10^{-14}\,\mathrm{kg} m A = m B = 1 0 − 14 kg , r = 125 μ m r = 125\,\mu\mathrm{m} r = 125 μ m and d = 450 μ m d = 450\,\mu\mathrm{m} d = 450 μ m , the six-mode coupling and Bell dwell are
g h e x = 0.000701601306852 s − 1 , T ∗ = 1119.43657420 s . g_{\mathrm{hex}} = 0.000701601306852\,\mathrm{s}^{-1}, \qquad T_* = 1119.43657420\,\mathrm{s}. g hex = 0.000701601306852 s − 1 , T ∗ = 1119.43657420 s .
Even without noise, the finite-frequency loss is visible: 25,000 recoveries give F n = 0.9915890193 F_n = 0.9915890193 F n = 0.9915890193 , with τ = 0.04477746297 s \tau= 0.04477746297\,\mathrm{s} τ = 0.04477746297 s . Let Γ ( L ) = Λ 0 [ 1 − e − L 2 / ( 4 r c 2 ) ] \Gamma(L) = \Lambda_0[1-e^{-L^2/(4r_c^2)}] Γ ( L ) = Λ 0 [ 1 − e − L 2 / ( 4 r c 2 ) ] be the decay rate of a spatial coherence of separation L L L , where Λ 0 \Lambda_0 Λ 0 is the localization event rate and r c r_c r c is its length scale. We choose the design point
r 2 4 r c 2 = 0.002 , Γ ( r ) = 0.025 s − 1 , Γ ( 2 r ) = 0.09970069880 s − 1 . (93) \frac{r^2}{4r_c^2} = 0.002, \qquad\Gamma(r) = 0.025\,\mathrm{s}^{-1}, \qquad\Gamma(2r) = 0.09970069880\,\mathrm{s}^{-1}. \tag*{(93)} 4 r c 2 r 2 = 0.002 , Γ ( r ) = 0.025 s − 1 , Γ ( 2 r ) = 0.09970069880 s − 1 . (93)
Equivalently, r c = 1.397542486 m m r_c = 1.397542486\,\mathrm{mm} r c = 1.397542486 mm and Λ 0 = 12.51250417 s − 1 \Lambda_0 = 12.51250417\,\mathrm{s}^{-1} Λ 0 = 12.51250417 s − 1 . These are specified requirements for the noise kernel. The residual logical dephasing rate under continuous recovery is λ = [ 4 Γ ( r ) − Γ ( 2 r ) ] / 3 \lambda= [4\Gamma(r)-\Gamma(2r)]/3 λ = [ 4Γ ( r ) − Γ ( 2 r )] /3 , which here gives λ = 9.976706612 × 10 − 5 s − 1 \lambda= 9.976706612 \times10^{-5}\,\mathrm{s}^{-1} λ = 9.976706612 × 1 0 − 5 s − 1 . With n = 27 , 986 n = 27,986 n = 27 , 986 cycles, τ = T ∗ / n = 0.03999987759 s \tau= T_*/n = 0.03999987759\,\mathrm{s} τ = T ∗ / n = 0.03999987759 s , Eq. (102) gives
F n = 0.84604702249. F_n = 0.84604702249. F n = 0.84604702249.
We allow a complete joint-cycle half-diamond error of at most 10 − 6 10^{-6} 1 0 − 6 , uniformly over input states, reference systems and prior records, and preparation trace distance at most 0.001. Replacing the ideal cycles one at a time decreases the final fidelity by at most n 10 − 6 + 0.001 n\,10^{-6} + 0.001 n 1 0 − 6 + 0.001 , so
F a c t u a l ≥ 0.81706102249. (94) F_{\mathrm{actual}} \ge0.81706102249. \tag*{(94)} F actual ≥ 0.81706102249. (94)
The error budget includes pulse drift and leakage as well as the recovery operation; it has not been inferred from the cycle frequency.
After the known local basis rotations, the uniform three-setting Pauli test of the ideal Bell target ∣ ψ ∗ ⟩ \lvert\psi_*\rangle ∣ ψ ∗ ⟩ has pass effect ( I + 2 ∣ ψ ∗ ⟩ ⟨ ψ ∗ ∣ ) / 3 (I+2\lvert\psi_*\rangle\langle\psi_*\rvert)/3 ( I + 2 ∣ ψ ∗ ⟩ ⟨ ψ ∗ ∣) /3 . Every separable state therefore passes with probability at most 2 / 3 2/3 2/3 , whereas Eq. (94) gives q ≥ 0.87804068166 q \ge0.87804068166 q ≥ 0.87804068166 . In 63 independent target trials, accepting when at least 51 pass gives
α = Pr { Bin ( 63 , 2 / 3 ) ≥ 51 } = 0.009218531744 , \alpha= \Pr\{\operatorname{Bin}(63,2/3) \ge51\} = 0.009218531744, α = Pr { Bin ( 63 , 2/3 ) ≥ 51 } = 0.009218531744 ,
p ≥ Pr { Bin ( 63 , 0.87804068166 ) ≥ 51 } = 0.9612574150. (95) p \ge\Pr\{\operatorname{Bin}(63,0.87804068166) \ge51\} = 0.9612574150. \tag*{(95)} p ≥ Pr { Bin ( 63 , 0.87804068166 ) ≥ 51 } = 0.9612574150. (95)
The size bound also holds for correlated null trials whenever each conditional pass probability is at most 2 / 3 2/3 2/3 : coupling the binary outcomes to independent uniform variables gives stochastic domination by the displayed binomial count. The power calculation assumes the independent target preparations. Every recovery flag and every failed trial remains in the record. The aggregate gravitational dwell is 70,524.50417 s, or 19.59 hours; preparation, pulses and readout add the time in Eq. (117) .
The geometry theorem and this finite-cycle calculation answer different questions. The Gaussian example states the noise and complete-control requirements under which the planar protocol yields an entanglement test. Section S7 S7.4 gives a separate finite-cycle rate comparison under white-force noise and a matched reset architecture. Arbitrary imperfectly corrected axial protocols remain a larger class.
Finite recovery, localization and imperfect correction
The projected Hamiltonian describes the limit in which every error is corrected immediately. At a finite recovery period, the interaction also acts on the error spaces before they are reset. We calculate that complete cycle for the hexagon, separate residual localization from finite-period loss, and include imperfect control in the fidelity bound. This supplies the dynamics behind the finite record in § 1.24 . We then compare finite-cycle rates and study two ways in which the code itself can change: higher-order correction at fixed mean energy, and approximate correction that retains lower gravitational moments.
The full finite-cycle channel
We maintain the six position modes in Eq. (73) during each dwell of duration τ \tau τ . Their labels are j = 0 , … , 5 j = 0,\ldots,5 j = 0 , … , 5 , with angles θ j = j π / 3 \theta_j = j\pi/3 θ j = j π /3 ; P P P projects onto the two logical states formed from alternate vertices. Local motional dynamics are included in the maintained-mode assumption. Let Γ ( L ) \Gamma(L) Γ ( L ) be the decay rate of a coherence between positions a distance L L L apart. Independent isotropic Markov dephasing then acts as
∣ j ⟩ ⟨ j ′ ∣ ⟼ e − τ Γ ( ∣ a j − a j ′ ∣ ) ∣ j ⟩ ⟨ j ′ ∣ . (96) |j\rangle\langle j'| \longmapsto e^{-\tau\Gamma(|a_j-a_{j'}|)}|j\rangle\langle j'|. \tag*{(96)} ∣ j ⟩ ⟨ j ′ ∣ ⟼ e − τ Γ ( ∣ a j − a j ′ ∣ ) ∣ j ⟩ ⟨ j ′ ∣. (96)
We require Γ ( 0 ) = 0 \Gamma(0) = 0 Γ ( 0 ) = 0 and that these multiplier matrices be positive semidefinite for every τ ≥ 0 \tau\ge0 τ ≥ 0 , so they define a completely positive Markov semigroup. Both quadratic force diffusion and the Gaussian localization kernel below satisfy this requirement.
A recovery must identify the error space while preserving the logical superposition. On the x z xz x z hexagon, the constant, x x x and z z z position errors give three orthogonal copies of the logical qubit. We normalize their angular functions as f 0 ( θ ) = 1 f_0(\theta) = 1 f 0 ( θ ) = 1 , f x ( θ ) = 2 sin θ f_x(\theta) = \sqrt{2}\sin\theta f x ( θ ) = 2 sin θ and f z ( θ ) = 2 cos θ f_z(\theta) = \sqrt{2}\cos\theta f z ( θ ) = 2 cos θ . The three error spaces P P P , 2 x P / r \sqrt{2}xP/r 2 x P / r and 2 z P / r \sqrt{2}zP/r 2 z P / r are mutually orthogonal and span the six-dimensional mode space. A trace-preserving recovery has Kraus operators
K 0 = P , K x = 2 P x / r , K z = 2 P z / r . (97) K_0 = P,\qquad K_x = \sqrt{2}Px/r,\qquad K_z = \sqrt{2}Pz/r. \tag*{(97)} K 0 = P , K x = 2 P x / r , K z = 2 P z / r . (97)
Indeed, ∑ s K s † K s = I 6 \sum_s K_s^\dagger K_s = I_6 ∑ s K s † K s = I 6 , as can be checked in the six orthonormal vectors f s ( θ ) ∣ b L ⟩ f_s(\theta)|b_L\rangle f s ( θ ) ∣ b L ⟩ with s = 0 , x , z s = 0,x,z s = 0 , x , z and b = 0 , 1 b = 0,1 b = 0 , 1 . The sign change of Bob’s z z z coordinate changes only a Kraus phase. We sum over all recovery outcomes and reset their quantum records.
To compose this recovery with the diagonal physical evolution, we need its action on each position matrix unit. Write S b = { j : j m o d 2 = b } S_b = \{j : j \bmod2 = b\} S b = { j : j mod 2 = b } for the vertices of logical state b b b and W j j ′ = 1 + 2 cos ( θ j − θ j ′ ) W_{jj'} = 1 + 2\cos(\theta_j-\theta_{j'}) W j j ′ = 1 + 2 cos ( θ j − θ j ′ ) for the overlap of their three error functions. The recovery acts as
R ( ∣ j ⟩ ⟨ j ′ ∣ ) = W j j ′ 3 ∣ p ( j ) L ⟩ ⟨ p ( j ′ ) L ∣ , p ( j ) = j m o d 2. (98) \mathcal{R}(|j\rangle\langle j'|) = \frac{W_{jj'}}{3}|p(j)_L\rangle\langle p(j')_L|,\qquad p(j)=j\bmod2. \tag*{(98)} R ( ∣ j ⟩ ⟨ j ′ ∣ ) = 3 W j j ′ ∣ p ( j ) L ⟩ ⟨ p ( j ′ ) L ∣ , p ( j ) = j mod 2. (98)
For one laboratory without gravity, its logical coherence multiplier is therefore
f ( τ ) = 4 e − γ 1 τ − e − γ 2 τ 3 , γ 1 = Γ ( r ) , γ 2 = Γ ( 2 r ) . (99) f(\tau) = \frac{4e^{-\gamma_1\tau}-e^{-\gamma_2\tau}}{3},\qquad\gamma_1=\Gamma(r),\quad\gamma_2=\Gamma(2r). \tag*{(99)} f ( τ ) = 3 4 e − γ 1 τ − e − γ 2 τ , γ 1 = Γ ( r ) , γ 2 = Γ ( 2 r ) . (99)
For opposite parities, six ordered pairs have separation r r r and weight 2 2 2 , and three have separation 2 r 2r 2 r and weight − 1 -1 − 1 . Pairs at separation 3 r \sqrt{3}r 3 r have zero recovery weight. Negative coefficients in this sum arise from coherent recovery, while the Kraus instrument has nonnegative outcome probabilities.
We now retain gravity during the dwell. Let ν j k = V ( a j , b k ) / ℏ \nu_{jk}=V(a_j,b_k)/\hbar ν j k = V ( a j , b k ) /ℏ be the physical frequency of mode pair ( j , k ) (j,k) ( j , k ) , and label the four logical sectors by u = ( u A , u B ) u=(u_A,u_B) u = ( u A , u B ) and v = ( v A , v B ) v=(v_A,v_B) v = ( v A , v B ) , with all components in { 0 , 1 } \{0,1\} { 0 , 1 } . Every physical matrix unit acquires its dephasing factor and its phase difference before the recovery weights are summed. One dwell followed by the two local recoveries maps ∣ u ⟩ ⟨ v ∣ |u\rangle\langle v| ∣ u ⟩ ⟨ v ∣ to M u v ( τ ) ∣ u ⟩ ⟨ v ∣ M_{uv}(\tau)|u\rangle\langle v| M uv ( τ ) ∣ u ⟩ ⟨ v ∣ , where
M u v ( τ ) = 1 81 ∑ j ∈ S u A , j ′ ∈ S v A k ∈ S u B , k ′ ∈ S v B W j j ′ W k k ′ exp { − τ [ Γ ( ∣ a j − a j ′ ∣ ) + Γ ( ∣ b k − b k ′ ∣ ) + i ( ν j k − ν j ′ k ′ ) ] } . (100) M_{uv}(\tau)=\frac{1}{81}\sum_{\substack{j\in S_{u_A},\ j'\in S_{v_A}\\ k\in S_{u_B},\ k'\in S_{v_B}}}W_{jj'}W_{kk'}\exp\left\{-\tau\left[\Gamma\left(|a_j-a_{j'}|\right)+\Gamma\left(|b_k-b_{k'}|\right)+i\left(\nu_{jk}-\nu_{j'k'}\right)\right]\right\}. \tag*{(100)} M uv ( τ ) = 81 1 j ∈ S u A , j ′ ∈ S v A k ∈ S u B , k ′ ∈ S v B ∑ W j j ′ W k k ′ exp { − τ [ Γ ( ∣ a j − a j ′ ∣ ) + Γ ( ∣ b k − b k ′ ∣ ) + i ( ν j k − ν j ′ k ′ ) ] } . (100)
The factor 1 / 81 1/81 1/81 is the product of the encoding amplitude 1 / 9 1/9 1/9 and the two recovery factors 1 / 3 1/3 1/3 . This proves the formula directly from Eq. (98) . It includes the gravitational evolution of all 36 physical mode pairs. In particular, it includes excursions into error spaces during a dwell. The matrix M ( τ ) M(\tau) M ( τ ) is positive semidefinite with diagonal entries one, because this composition is a trace-preserving completely positive Schur channel, which acts by entrywise multiplication in the logical basis.
After n n n identical cycles, the multiplier is M u v ( τ ) n M_{uv}(\tau)^n M uv ( τ ) n . To compare this output with the intended Bell state, average the physical frequencies within each logical sector; denote these averages by ϵ u \epsilon_u ϵ u . Starting with ∣ + + ⟩ |++\rangle ∣ + + ⟩ , where each ∣ + ⟩ = ( ∣ 0 L ⟩ + ∣ 1 L ⟩ ) / 2 |+\rangle=(|0_L\rangle+|1_L\rangle)/\sqrt{2} ∣ + ⟩ = ( ∣ 0 L ⟩ + ∣ 1 L ⟩) / 2 , choose the total dwell T ∗ T_\ast T ∗ to equal the projected interaction’s Bell time:
ϵ u = 1 9 ∑ j ∈ S u A , k ∈ S u B ν j k , T ∗ = n τ = π 4 g h e x . (101) \epsilon_u=\frac{1}{9}\sum_{\substack{j\in S_{u_A},\ k\in S_{u_B}}}\nu_{jk},\qquad T_\ast=n\tau=\frac{\pi}{4g_{\mathrm{hex}}}. \tag*{(101)} ϵ u = 9 1 j ∈ S u A , k ∈ S u B ∑ ν j k , T ∗ = n τ = 4 g hex π . (101)
The projected target ∣ ψ ∗ ⟩ = 1 2 ∑ u e − i ϵ u T ∗ ∣ u ⟩ |\psi_\ast\rangle=\frac{1}{2}\sum_u e^{-i\epsilon_uT_\ast}|u\rangle ∣ ψ ∗ ⟩ = 2 1 ∑ u e − i ϵ u T ∗ ∣ u ⟩ is maximally entangled, with its local phases included. Its fidelity after the finite sequence is
F n = 1 16 ∑ u , v e i T ∗ ( ϵ u − ϵ v ) M u v ( τ ) n . (102) F_n=\frac{1}{16}\sum_{u,v}e^{iT_\ast(\epsilon_u-\epsilon_v)}M_{uv}(\tau)^n. \tag*{(102)} F n = 16 1 u , v ∑ e i T ∗ ( ϵ u − ϵ v ) M uv ( τ ) n . (102)
The sum is real by conjugate symmetry. It is finite and can be evaluated directly, without replacing the dwell Hamiltonian by H L H_L H L .
Residual localization and finite-frequency loss
For a fixed total time T = n τ T=n\tau T = n τ , the accumulated local coherence is f ( τ ) n f(\tau)^n f ( τ ) n . Its logarithm distinguishes dephasing that survives as τ → 0 \tau\to0 τ → 0 from a loss proportional to the dwell length. Expanding Eq. (99) near zero gives
log f ( τ ) = − λ τ − D n o i s e 2 τ 2 + O ( τ 3 ) , λ = 4 γ 1 − γ 2 3 , D n o i s e = 4 9 ( γ 2 − γ 1 ) 2 . (103) \log f(\tau)=-\lambda\tau-\frac{D_{\mathrm{noise}}}{2}\tau^2+O(\tau^3),\qquad\lambda=\frac{4\gamma_1-\gamma_2}{3},\qquad D_{\mathrm{noise}}=\frac{4}{9}(\gamma_2-\gamma_1)^2. \tag*{(103)} log f ( τ ) = − λ τ − 2 D noise τ 2 + O ( τ 3 ) , λ = 3 4 γ 1 − γ 2 , D noise = 9 4 ( γ 2 − γ 1 ) 2 . (103)
Complete positivity implies λ ≥ 0 \lambda\ge0 λ ≥ 0 . Quadratic diffusion, Γ ( L ) = Λ L 2 \Gamma(L)=\Lambda L^2 Γ ( L ) = Λ L 2 , has λ = 0 \lambda=0 λ = 0 : more frequent correction removes its logical dephasing. For Gaussian localization, let Λ 0 \Lambda_0 Λ 0 be the event rate and r c r_c r c the localization length. The full coherence-decay kernel is
Γ ( L ) = Λ 0 [ 1 − e − L 2 / ( 4 r c 2 ) ] . (104) \Gamma(L)=\Lambda_0\left[1-e^{-L^2/(4r_c^2)}\right]. \tag*{(104)} Γ ( L ) = Λ 0 [ 1 − e − L 2 / ( 4 r c 2 ) ] . (104)
Substitution into λ = ( 4 γ 1 − γ 2 ) / 3 \lambda=(4\gamma_1-\gamma_2)/3 λ = ( 4 γ 1 − γ 2 ) /3 leaves the rate
λ = Λ 0 3 [ 3 − 4 e − q + e − 4 q ] , q = r 2 4 r c 2 , λ = Λ 0 r 4 8 r c 4 + O ( Λ 0 r 6 r c 6 ) . (105) \lambda=\frac{\Lambda_0}{3}\left[3-4e^{-q}+e^{-4q}\right],\qquad q=\frac{r^2}{4r_c^2},\qquad\lambda=\frac{\Lambda_0r^4}{8r_c^4}+O\left(\frac{\Lambda_0r^6}{r_c^6}\right). \tag*{(105)} λ = 3 Λ 0 [ 3 − 4 e − q + e − 4 q ] , q = 4 r c 2 r 2 , λ = 8 r c 4 Λ 0 r 4 + O ( r c 6 Λ 0 r 6 ) . (105)
At fixed d d d , r c r_c r c , Λ 0 \Lambda_0 Λ 0 , shrinking this code reduces its gravitational coupling as r 6 r^6 r 6 and its residual localization as r 4 r^4 r 4 . Thus the interaction-to-residual-noise ratio decreases for sufficiently small r r r .
For equal local residual rates, the continuously recovered state from ∣ + + ⟩ |++\rangle ∣ + + ⟩ is entangled at some time if and only if
2 g h e x > λ . (106) 2g_{\mathrm{hex}}>\lambda. \tag*{(106)} 2 g hex > λ . (106)
To see this, remove the local Hamiltonian phases and apply a Hadamard to each output. The state is an X state whose potentially negative partial-transpose eigenvalue is
1 − e − 2 λ t 4 − e − λ t 2 ∣ sin ( 2 g h e x t t ) ∣ . \frac{1-e^{-2\lambda t}}{4}-\frac{e^{-\lambda t}}{2}\lvert\sin(2g_{\mathrm{hext}}t)\rvert. 4 1 − e − 2 λ t − 2 e − λ t ∣ sin ( 2 g hext t )∣ .
Negativity is therefore equivalent to ∣ sin ( 2 g h e x t t ) ∣ > sinh ( λ t ) \lvert\sin(2g_{\mathrm{hext}}t)\rvert>\sinh(\lambda t) ∣ sin ( 2 g hext t )∣ > sinh ( λ t ) . The inequalities ∣ sin ( 2 g h e x t t ) ∣ ≤ 2 g h e x t t \lvert\sin(2g_{\mathrm{hext}}t)\rvert\le2g_{\mathrm{hext}}t ∣ sin ( 2 g hext t )∣ ≤ 2 g hext t and sinh ( λ t ) ≥ λ t \sinh(\lambda t)\ge\lambda t sinh ( λ t ) ≥ λ t prove necessity; expansion near zero proves sufficiency. At T ∗ T_* T ∗ the target fidelity is
F Z e n o = ( 1 + e − λ T ∗ ) 2 4 , F Z e n o > 1 2 ⟺ λ T ∗ < log ( 1 + 2 ) . (107) F_{\mathrm{Zeno}}=\frac{(1+e^{-\lambda T_*})^2}{4},\qquad F_{\mathrm{Zeno}}>\frac{1}{2}\Longleftrightarrow\lambda T_*<\log(1+\sqrt{2}). \tag*{(107)} F Zeno = 4 ( 1 + e − λ T ∗ ) 2 , F Zeno > 2 1 ⟺ λ T ∗ < log ( 1 + 2 ) . (107)
Gravity introduces an additional finite-period loss because physical states can leave the code during a dwell. We resolve the physical frequencies into the same orthonormal error functions used by the recovery. Let h u , s t h_{u,st} h u , s t be the frequency component from logical sector u u u into error-function sector ( s , t ) (s,t) ( s , t ) , and let σ u v 2 \sigma^2_{uv} σ uv 2 sum the squared differences of these components for two logical sectors:
h u , s t = 1 9 ∑ j ∈ S u A , k ∈ S u B f s ( θ j ) f t ( θ k ) ν j k , s , t ∈ { 0 , x , z } , h_{u,st}=\frac{1}{9}\sum_{j\in S_{u_A},\,k\in S_{u_B}}f_s(\theta_j)f_t(\theta_k)\nu_{jk},\qquad s,t\in\{0,x,z\}, h u , s t = 9 1 j ∈ S u A , k ∈ S u B ∑ f s ( θ j ) f t ( θ k ) ν j k , s , t ∈ { 0 , x , z } ,
σ u v 2 = ∑ ( s , t ) ≠ ( 0 , 0 ) ( h u , s t − h v , s t ) 2 . (108) \sigma^2_{uv}=\sum_{(s,t)\ne(0,0)}(h_{u,st}-h_{v,st})^2. \tag*{(108)} σ uv 2 = ( s , t ) = ( 0 , 0 ) ∑ ( h u , s t − h v , s t ) 2 . (108)
Here h u , 00 = ϵ u h_{u,00}=\epsilon_u h u , 00 = ϵ u is the retained mean phase. The remaining components determine how much the two logical sectors differ in their excursions into error spaces. For identical local noise kernels, the logarithm of the complete coherence multiplier is
log M u v ( τ ) = − [ d H ( u , v ) λ + i ( ϵ u − ϵ v ) ] τ − τ 2 2 [ d H ( u , v ) D n o i s e + σ u v 2 ] + O ( τ 3 ) , (109) \log M_{uv}(\tau)=-[d_H(u,v)\lambda+i(\epsilon_u-\epsilon_v)]\tau-\frac{\tau^2}{2}[d_H(u,v)D_{\mathrm{noise}}+\sigma^2_{uv}]+O(\tau^3), \tag*{(109)} log M uv ( τ ) = − [ d H ( u , v ) λ + i ( ϵ u − ϵ v )] τ − 2 τ 2 [ d H ( u , v ) D noise + σ uv 2 ] + O ( τ 3 ) , (109)
where d H d_H d H is the Hamming distance of the two logical strings. On each parity triangle, the three-by-three matrix O s j = f s ( θ j ) / 3 O_{sj}=f_s(\theta_j)/\sqrt{3} O s j = f s ( θ j ) / 3 is orthogonal. Parseval’s identity therefore turns the gravitational second cumulant into the sum of squares σ u v 2 \sigma^2_{uv} σ uv 2 . For the mixed term, the row identity
∑ j ′ ∈ S 1 − b W j j ′ Γ ( ∣ a j − a j ′ ∣ ) = 4 γ 1 − γ 2 = 3 λ , j ∈ S b , \sum_{j'\in S_{1-b}}W_{jj'}\Gamma(\lvert a_j-a_{j'}\rvert)=4\gamma_1-\gamma_2=3\lambda,\qquad j\in S_b, j ′ ∈ S 1 − b ∑ W j j ′ Γ (∣ a j − a j ′ ∣) = 4 γ 1 − γ 2 = 3 λ , j ∈ S b ,
is independent of j j j . For equal parities it is zero. Consequently the mixed noise–gravity second moment cancels against the corresponding product of first moments. This proves Eq. (109) without omitting a mixed term.
To control the truncation rather than only its formal order, we bound every damping rate and frequency difference in the exact finite sum. The following Z ∗ Z_* Z ∗ bounds the modulus of each exponential’s coefficient:
Z ∗ = 2 max ( γ 1 , γ 2 ) + max j , k ν j k − min j , k ν j k . Z_*=2\max(\gamma_1,\gamma_2)+\max_{j,k}\nu_{jk}-\min_{j,k}\nu_{jk}. Z ∗ = 2 max ( γ 1 , γ 2 ) + j , k max ν j k − j , k min ν j k .
The absolute sum of the normalized weights in Eq. (100) is at most 25 / 9 25/9 25/9 . For ℜ z ≥ 0 \Re z\ge0 ℜ z ≥ 0 , the integral Taylor remainder of e − z τ e^{-z\tau} e − z τ after quadratic order has magnitude at most ∣ z τ ∣ 3 / 6 \lvert z\tau\rvert^3/6 ∣ z τ ∣ 3 /6 . Hence
∣ R u v ( 3 ) ( τ ) ∣ ≤ 25 54 ( Z ∗ τ ) 3 . (110) \lvert R^{(3)}_{uv}(\tau)\rvert\le\frac{25}{54}(Z_*\tau)^3. \tag*{(110)} ∣ R uv ( 3 ) ( τ )∣ ≤ 54 25 ( Z ∗ τ ) 3 . (110)
For parameter evaluation we use Eq. (102) ; the expansion identifies why finite recovery frequency loses signal.
Finite control errors and elapsed time
The exact F n F_n F n assumes the stated recovery is implemented perfectly. We compare each implemented cycle with that reference as a channel, so that the error estimate includes inputs entangled with arbitrary memories. Suppose each actual joint cycle, including its decoder, re-encoding, reset and any retained classical record, differs from the stated ideal cycle by at most ε \varepsilon ε in half-diamond norm. The bound is uniform over inputs, ancillary systems and prior records. Suppose also that the initial preparation has trace distance at most ε i n i t \varepsilon_{\mathrm{init}} ε init from ∣ + + ⟩ ⟨ + + ∣ \lvert+ +\rangle\langle+ +\rvert ∣ + + ⟩ ⟨ + + ∣ . Channel telescoping and contraction of trace distance give
F a c t u a l ≥ F n − n ε − ε i n i t . (111) F_{\mathrm{actual}} \ge F_n-n\varepsilon-\varepsilon_{\mathrm{init}}. \tag*{(111)} F actual ≥ F n − n ε − ε init . (111)
Leakage and flagged failures are included in the actual channel; no outcome is discarded. If the error budgets are specified as the full diamond norm and the full trace norm, respectively, their contribution to Eq. (111) is half those budgets.
We can also bound F n F_n F n without evaluating powers of the entire cycle matrix. The first-order recovered evolution has residual dephasing rates λ A , λ B \lambda_A,\lambda_B λ A , λ B ; the second-order discrepancy accumulates in proportion to T ∗ τ T_{*}\tau T ∗ τ . For each summand of Eq. (100) , define its signed weight c c c , total damping Γ j j ′ k k ′ \Gamma_{jj'kk'} Γ j j ′ k k ′ , and frequency difference δ ω \delta\omega δ ω after removing the mean logical phase. We collect their second moments in the nonnegative constant B B B :
c = W j j ′ W k k ′ / 81 , Γ j j ′ k k ′ = Γ A ( ∣ a j − a j ′ ∣ ) + Γ B ( ∣ b k − b k ′ ∣ ) , δ ω = ν j k − ν j ′ k ′ − ( ϵ u − ϵ v ) , λ u v = λ A 1 u A ≠ v A + λ B 1 u B ≠ v B , B = 1 32 ∑ u ≠ v [ ∑ t e r m s ∣ c ∣ ( Γ j j ′ k k ′ 2 + δ ω 2 ) + λ u v 2 ] . (112) \begin{aligned}
c &= W_{jj'}W_{kk'}/81,\\
\Gamma_{jj'kk'} &= \Gamma_A(\lvert a_j-a_{j'}\rvert)+\Gamma_B(\lvert b_k-b_{k'}\rvert),\\
\delta\omega&= \nu_{jk}-\nu_{j'k'}-(\epsilon_u-\epsilon_v),\\
\lambda_{uv} &= \lambda_A\mathbf{1}_{u_A\ne v_A}+\lambda_B\mathbf{1}_{u_B\ne v_B},\\
B &= \frac{1}{32}\sum_{u\ne v}\left[\sum_{\mathrm{terms}}\lvert c\rvert\left(\Gamma_{jj'kk'}^2+\delta\omega^2\right)+\lambda_{uv}^2\right]. \tag*{(112)}
\end{aligned} c Γ j j ′ k k ′ δ ω λ uv B = W j j ′ W k k ′ /81 , = Γ A (∣ a j − a j ′ ∣) + Γ B (∣ b k − b k ′ ∣) , = ν j k − ν j ′ k ′ − ( ϵ u − ϵ v ) , = λ A 1 u A = v A + λ B 1 u B = v B , = 32 1 u = v ∑ [ terms ∑ ∣ c ∣ ( Γ j j ′ k k ′ 2 + δ ω 2 ) + λ uv 2 ] . (112)
The sums over terms use exactly the indices of Eq. (100) ; λ u v \lambda_{uv} λ uv is the residual damping of logical coherence u v uv uv . This B B B is a cycle-error coefficient with units of inverse time squared. The fidelity is bounded by the continuously recovered value minus finite-period, control and preparation losses:
F a c t u a l ≥ ( 1 + e − λ A T ∗ ) ( 1 + e − λ B T ∗ ) 4 − T ∗ τ B − T ∗ τ ε − ε i n i t . (113) F_{\mathrm{actual}} \ge\frac{(1+e^{-\lambda_A T_*})(1+e^{-\lambda_B T_*})}{4}-T_*\tau B-\frac{T_*}{\tau}\varepsilon-\varepsilon_{\mathrm{init}}. \tag*{(113)} F actual ≥ 4 ( 1 + e − λ A T ∗ ) ( 1 + e − λ B T ∗ ) − T ∗ τ B − τ T ∗ ε − ε init . (113)
To prove it, remove the mean logical phase from M u v M_{uv} M uv and compare its first-order expansion with e − λ u v τ e^{-\lambda_{uv}\tau} e − λ uv τ . The scalar inequality
∣ e − z τ − 1 + z τ ∣ ≤ 1 2 ∣ z ∣ 2 τ 2 , ℜ z ≥ 0 , \left|e^{-z\tau}-1+z\tau\right|\le\frac{1}{2}|z|^2\tau^2,\qquad\Re z\ge0, e − z τ − 1 + z τ ≤ 2 1 ∣ z ∣ 2 τ 2 , ℜ z ≥ 0 ,
follows by the integral remainder. It bounds the one-cycle difference by τ 2 / 2 \tau^2/2 τ 2 /2 times the bracket in Eq. (112) . Both compared multipliers have magnitude at most one, so the difference of their n n n th powers is at most n n n times this bound. Summing the off-diagonal terms in Eq. (102) and using Eq. (111) proves the result.
For equal quadratic noise, write γ = Γ ( r ) \gamma=\Gamma(r) γ = Γ ( r ) and D = d / r D=d/r D = d / r . At D = 3.6 D=3.6 D = 3.6 , evaluating the finite sum separates a term quadratic in the noise rate from a term quadratic in the gravitational frequency:
B = 56 9 γ 2 + 0.00849138127713216 ( G ℏ ) 2 . (114) B=\frac{56}{9}\gamma^2+0.00849138127713216\left(\frac{\mathcal{G}}{\hbar}\right)^2. \tag*{(114)} B = 9 56 γ 2 + 0.00849138127713216 ( ℏ G ) 2 . (114)
The first term is recovery loss from random forces. The second charges gravitational excursions into the syndrome spaces. For a fixed per-cycle error budget, the loss T ∗ ( τ B + ε / τ ) T_*(\tau B+\varepsilon/\tau) T ∗ ( τ B + ε / τ ) is minimized at $\tau=\sqrt{\varepsilon/B} before the integer constraint n = T ∗ / τ n = T_{*}/\tau n = T ∗ / τ is imposed. Thus increasing the recovery frequency indefinitely is counterproductive when each operation has a nonzero error. For a chosen finite n n n , Eq. (113) is the applicable certificate. For equal residual rates, let Δ = F Z e n o − 1 / 2 − ε i n i t > 0 \Delta= F_{\mathrm{Zeno}} - 1/2 - \varepsilon_{\mathrm{init}} > 0 Δ = F Zeno − 1/2 − ε init > 0 be the fidelity margin available for finite-period and control errors. Minimizing their sum before imposing the integer-cycle constraint gives the sufficient requirement
ε < Δ 2 4 B T ∗ 2 . (115) \varepsilon< \frac{\Delta^{2}}{4BT_{*}^{2}}. \tag*{(115)} ε < 4 B T ∗ 2 Δ 2 . (115)
One then evaluates the two nearest positive integers to T ∗ B / ε T_{*}\sqrt{B/\varepsilon} T ∗ B / ε in Eq. (113) . Failure of this sufficient bound alone gives no impossibility result.
Pulse duration can be charged separately when the masses remain within their balls throughout the pulse. Suppose the ideal local decoder and reset take elapsed time δ \delta δ , and their calibrated half-diamond error without the omitted drift is ε c t l \varepsilon_{\mathrm{ctl}} ε ctl . For the quadratic generator in Eq. (32) , let γ = Λ r 2 \gamma= \Lambda r^{2} γ = Λ r 2 and ω = G / ( ℏ r ) \omega= G/(\hbar r) ω = G / ( ℏ r ) . A sufficient complete-pulse allowance is
ε ≤ ε c t l + δ [ ω 2 ( 1 D − 2 − 1 D + 2 ) + 4 γ ] . (116) \varepsilon\le\varepsilon_{\mathrm{ctl}} + \delta\left[\frac{\omega}{2}\left(\frac{1}{D-2}-\frac{1}{D+2}\right)+4\gamma\right]. \tag*{(116)} ε ≤ ε ctl + δ [ 2 ω ( D − 2 1 − D + 2 1 ) + 4 γ ] . (116)
The Hamiltonian commutator has diamond norm at most the spectral diameter of V / ℏ V/\hbar V /ℏ , yielding the first term after division by two. The constraint ∑ i q Q , i 2 ≤ r 2 I \sum_i q_{Q,i}^{2}\le r^{2}I ∑ i q Q , i 2 ≤ r 2 I bounds one laboratory’s diffusion generator in diamond norm by 4 Λ r 2 4\Lambda r^{2} 4Λ r 2 , using its completely positive and anticommutator parts. The two laboratories therefore contribute at most 4 γ δ 4\gamma\delta 4 γ δ in half-diamond norm. Duhamel’s formula in the control interaction picture proves Eq. (116) . Any other omitted dynamics need their own allowance. With preparation duration T p r e p T_{\mathrm{prep}} T prep and readout duration T r e a d T_{\mathrm{read}} T read , the total elapsed time, including the n n n recovery pulses, is
T w a l l = T p r e p + n ( τ + δ ) + T r e a d . (117) T_{\mathrm{wall}} = T_{\mathrm{prep}} + n(\tau+\delta) + T_{\mathrm{read}}. \tag*{(117)} T wall = T prep + n ( τ + δ ) + T read . (117)
These formulas specify what a decoder must achieve; a bounded finite-dimensional recovery dilation alone does not establish the corresponding motional operation on a massive object.
A finite-cycle Bell-pair rate advantage under white-force noise
We now compare Bell pairs produced per unit time when recovery has a finite period and a nonzero error. The planar code gives a strictly larger rate than every axial code in the following common class of reset protocols. During each nominal dwell, Alice and Bob use fixed local encodings that obey Eq. (33) . A local recovery returns each laboratory to its code and discards its quantum syndrome. All retained logical systems, memories and classical records are included in the channel. Boundary LOCC may depend on the records and may change the protected codes. Initial entanglement is absent, and every cycle used to generate an entangled seed is counted. Local memory processing and distillation have the same ideal time convention on both sides of the comparison.
Write the nominal channel for a dwell of duration τ > 0 \tau> 0 τ > 0 as
Φ τ = R e τ L E , R E = id , (118) \Phi_{\tau} = \mathcal{R}e^{\tau\mathcal{L}}\mathcal{E}, \qquad\mathcal{R}\mathcal{E} = \operatorname{id}, \tag*{(118)} Φ τ = R e τ L E , R E = id , (118)
where E \mathcal{E} E is a product of local isometric encodings and R \mathcal{R} R is a product of local recovery channels. The identity acts on the complete retained system. Registers may be embedded in a fixed ambient space so that a cycle and its first-order generator have the same domain and codomain. The generator L \mathcal{L} L consists of the Newtonian Hamiltonian and local terms. The axial converse will use the trace norm after partial transpose, which bounds overlap with a maximally entangled target. We therefore control a cycle in both the ordinary norm and the norm after transposing Bob’s input and output. For a map M \mathcal{M} M , let M Θ = Θ B M Θ B \mathcal{M}^{\Theta} = \Theta_{B}\mathcal{M}\Theta_{B} M Θ = Θ B M Θ B , where Θ B \Theta_B Θ B transposes all Bob’s registers in fixed bases. We assume uniformly over the allowed codes, memories and conditional branches that
∥ L ∥ ⋄ , ∥ L θ ∥ ⋄ ≤ M < ∞ . (119) \lVert\mathcal{L}\rVert_{\diamond},\ \lVert\mathcal{L}^{\theta}\rVert_{\diamond} \le M < \infty. \tag*{(119)} ∥ L ∥ ⋄ , ∥ L θ ∥ ⋄ ≤ M < ∞. (119)
The common finite constant M M M bounds both generator norms independently of the code and retained memory. The implemented complete cycle Φ ~ τ \widetilde{\Phi}_{\tau} Φ τ obeys both error bounds
1 2 ∥ Φ ~ τ − Φ τ ∥ ⋄ ≤ ϵ , 1 2 ∥ ( Φ ~ τ − Φ τ ) θ ∥ ⋄ ≤ ϵ e M τ . (120) \frac{1}{2}\lVert\widetilde{\Phi}_{\tau}-\Phi_{\tau}\rVert_{\diamond} \le\epsilon,\qquad
\frac{1}{2}\lVert\left(\widetilde{\Phi}_{\tau}-\Phi_{\tau}\right)^{\theta}\rVert_{\diamond} \le\epsilon e^{M\tau}. \tag*{(120)} 2 1 ∥ Φ τ − Φ τ ∥ ⋄ ≤ ϵ , 2 1 ∥ ( Φ τ − Φ τ ) θ ∥ ⋄ ≤ ϵ e M τ . (120)
For example, product local recovery faults whose local half-diamond errors sum to at most ϵ \epsilon ϵ satisfy these bounds. Finite recovery pulses, gravity during the pulses and any departure from the nominal confinement must be included in this complete-cycle comparison.
The axial estimate needed below is the product-interaction bound already proved in Theorem S9, with the entropy-rate constant β \beta β removed. Define the frequency
J a x = G ℏ d F ( r / d ) = G ℏ r ∫ 0 ∞ e − ( d / r ) v [ 2 ∑ k ≥ 3 I k ( v ) ] 2 d v , (121) J_{\mathrm{ax}}=\frac{\mathcal{G}}{\hbar d}F(r/d)=\frac{\mathcal{G}}{\hbar r}\int_{0}^{\infty}e^{-(d/r)v}\left[2\sum_{k\geq3}I_k(v)\right]^2\,\mathrm{d}v, \tag*{(121)} J ax = ℏ d G F ( r / d ) = ℏ r G ∫ 0 ∞ e − ( d / r ) v [ 2 k ≥ 3 ∑ I k ( v ) ] 2 d v , (121)
where I k I_k I k are modified Bessel functions. In particular, the ratio g / J a x > 2.5104 g/J_{\mathrm{ax}}>2.5104 g / J ax > 2.5104 at d / r = 3.6 d/r=3.6 d / r = 3.6 follows from Eq. (78) , with g = g h e x g=g_{\mathrm{hex}} g = g hex .
The theorem compares a converse for every axial protocol in this class with a distillable rate from independent planar blocks. In the axial bound, q q q is an upper bound on the one-cycle amplification of partial-transpose norm. For the planar construction, p p p bounds Bell infidelity and Y ( p ) Y(p) Y ( p ) is the corresponding hashing yield in Bell pairs per block. We write h 2 ( p ) = − p log 2 p − ( 1 − p ) log 2 ( 1 − p ) h_2(p)=-p\log_2p-(1-p)\log_2(1-p) h 2 ( p ) = − p log 2 p − ( 1 − p ) log 2 ( 1 − p ) .
Theorem S15 (Finite-cycle rate separation). Consider reset protocols satisfying Eqs. (118) –(120) , with a fixed dwell τ \tau τ and a hard budget of N N N cycles. Every adaptive axial protocol that aims to produce m m m Bell pairs has target fidelity
F 2 m ≤ 2 − m q N , q = e 2 J a x τ + ( M 2 τ 2 + 2 ϵ ) e M τ . (122) F_{2^m}\leq2^{-m}q^N,\qquad q=e^{2J_{\mathrm{ax}}\tau}+\left(M^2\tau^2+2\epsilon\right)e^{M\tau}. \tag*{(122)} F 2 m ≤ 2 − m q N , q = e 2 J ax τ + ( M 2 τ 2 + 2 ϵ ) e M τ . (122) Its asymptotic rate per unit dwell time therefore satisfies R a x ≤ log 2 q / τ R_{\mathrm{ax}}\leq\log_2q/\tau R ax ≤ log 2 q / τ , with exponentially vanishing fidelity above this rate.
Suppose the planar code is subject to white-force diffusion Γ ( L ) = a L 2 \Gamma(L)=aL^2 Γ ( L ) = a L 2 , with 0 < a < ∞ 0<a<\infty 0 < a < ∞ , and its nominal local recovery exactly corrects { I , x , y , z } \{I,x,y,z\} { I , x , y , z } . Let independent, identically prepared blocks use T = π / ( 4 g ) = n τ T=\pi/(4g)=n\tau T = π / ( 4 g ) = n τ of dwell time. If initialization has half-trace error at most ϵ i n i t \epsilon_{\mathrm{init}} ϵ init , define
η = T ( M 2 τ 2 + ϵ τ ) , p = ϵ i n i t + η ≤ 3 4 , Y ( p ) = 1 − h 2 ( p ) − p log 2 3. (123) \eta=T\left(\frac{M^2\tau}{2}+\frac{\epsilon}{\tau}\right),\qquad p=\epsilon_{\mathrm{init}}+\eta\leq\frac{3}{4},\qquad Y(p)=1-h_2(p)-p\log_2 3. \tag*{(123)} η = T ( 2 M 2 τ + τ ϵ ) , p = ϵ init + η ≤ 4 3 , Y ( p ) = 1 − h 2 ( p ) − p log 2 3. (123) With Y ( p ) > 0 Y(p)>0 Y ( p ) > 0 , twirling and one-way hashing achieve R p l ≥ Y ( p ) / T R_{\mathrm{pl}}\geq Y(p)/T R pl ≥ Y ( p ) / T . If each planar cycle has additional charged time at most χ τ \chi\tau χ τ , the charged-time rate instead satisfies R p l ≥ Y ( p ) / [ T ( 1 + χ ) ] R_{\mathrm{pl}}\geq Y(p)/[T(1+\chi)] R pl ≥ Y ( p ) / [ T ( 1 + χ )] ; the upper bound R a x ≤ log 2 q / τ R_{\mathrm{ax}}\leq\log_2q/\tau R ax ≤ log 2 q / τ remains valid for axial charged time.
For g / J a x > 2.5104 g/J_{\mathrm{ax}}>2.5104 g / J ax > 2.5104 , M τ ≤ 0.01 M\tau\leq0.01 M τ ≤ 0.01 , η ≤ 0.004 \eta\leq0.004 η ≤ 0.004 and ϵ i n i t ≤ 0.001 \epsilon_{\mathrm{init}}\leq0.001 ϵ init ≤ 0.001 , these bounds give
T R p l ≥ 0.946660 1 + χ , T R a x < 0.914375. (124) TR_{\mathrm{pl}}\geq\frac{0.946660}{1+\chi},\qquad TR_{\mathrm{ax}}<0.914375. \tag*{(124)} T R pl ≥ 1 + χ 0.946660 , T R ax < 0.914375. (124) Thus the planar rate is strictly larger, including for a positive recovery-time overhead χ ≤ 0.01 \chi\leq0.01 χ ≤ 0.01 .
Proof. We first identify the part of the axial first-order generator that can increase entanglement. The Chebyshev expansion e v t = I 0 ( v ) + 2 ∑ k ≥ 1 I k ( v ) T k ( t ) e^{vt}=I_0(v)+2\sum_{k\geq1}I_k(v)T_k(t) e v t = I 0 ( v ) + 2 ∑ k ≥ 1 I k ( v ) T k ( t ) has nonnegative coefficients for v ≥ 0 v\geq0 v ≥ 0 . Removing T 0 , T 1 , T 2 T_0,T_1,T_2 T 0 , T 1 , T 2 leaves a tail of operator norm at most E 3 ( v ) = 2 ∑ k ≥ 3 I k ( v ) E_3(v)=2\sum_{k\geq3}I_k(v) E 3 ( v ) = 2 ∑ k ≥ 3 I k ( v ) . The removed terms compress to scalars on every protected code. Substitution into the axial Laplace representation of 1 / ( d + x B − x A ) 1/(d+x_B-x_A) 1/ ( d + x B − x A ) therefore writes the nonlocal compressed Hamiltonian as H n l / ℏ = ∑ α A α ⊗ B α H_{\mathrm{nl}}/\hbar=\sum_\alpha A_\alpha\otimes B_\alpha H nl /ℏ = ∑ α A α ⊗ B α , with Hermitian factors and ∑ α ∥ A α ∥ ∥ B α ∥ ≤ J a x \sum_\alpha\|A_\alpha\|\|B_\alpha\|\leq J_{\mathrm{ax}} ∑ α ∥ A α ∥∥ B α ∥ ≤ J ax . The sum can equivalently be a norm-convergent integral. Expanding the Bessel functions gives E 3 ( v ) = ∑ n ≥ 3 e n v n / n ! E_3(v)=\sum_{n\geq3}e_n v^n/n! E 3 ( v ) = ∑ n ≥ 3 e n v n / n ! with exactly the coefficients in Eq. (65) . Termwise integration proves both expressions for J a x J_{\mathrm{ax}} J ax in Eq. (121) .
We next connect this compressed interaction bound to a finite cycle. The first derivative of the recovered cycle at zero dwell is G 0 = R L E G_0=\mathcal{R}\mathcal{L}\mathcal{E} G 0 = R L E . It is a bounded GKSL generator: the CPTP curve Φ τ \Phi_\tau Φ τ starts at the identity, so its derivative is conditionally completely positive and trace preserving. A channel that inverts an isometric encoding erases coherences between that code and its orthogonal complement. To verify this, write R k W = c k I R_kW=c_kI R k W = c k I for its Kraus operators; trace preservation gives ∑ k c k ∗ R k v = 0 \sum_k c_k^*R_kv=0 ∑ k c k ∗ R k v = 0 for v ⊥ ran W v\perp\operatorname{ran}W v ⊥ ran W . Consequently the Hamiltonian part of G 0 G_0 G 0 is the commutator with W † H W W^\dagger HW W † H W ; the recovered local generators remain local.
Conjugating a local channel by full transpose gives another channel. Thus the local part of G 0 θ G_0^\theta G 0 θ generates a contractive semigroup. For a product Hamiltonian, the transposed commutator is the difference of two left-right multiplication maps, each with diamond norm at most ∥ A α ∥ ∥ B α ∥ \|A_\alpha\|\|B_\alpha\| ∥ A α ∥∥ B α ∥ . The bounded perturbation expansion then yields
∥ e τ G 0 θ ∥ ⋄ ≤ e 2 J a x τ . \left\|e^{\tau G_0^\theta}\right\|_\diamond\leq e^{2J_{\mathrm{ax}}\tau}. e τ G 0 θ ⋄ ≤ e 2 J ax τ .
Because the local maps R θ \mathcal{R}^\theta R θ and E θ \mathcal{E}^\theta E θ have diamond norm one, ∥ G 0 θ ∥ ⋄ ≤ M \|G_0^\theta\|_\diamond\leq M ∥ G 0 θ ∥ ⋄ ≤ M . The constant and linear terms of Φ τ θ \Phi_\tau^\theta Φ τ θ and e τ G 0 θ e^{\tau G_0^\theta} e τ G 0 θ agree. Each Taylor remainder is at most M 2 τ 2 e M τ / 2 M^2\tau^2e^{M\tau}/2 M 2 τ 2 e M τ /2 , so
∥ Φ τ θ − e τ G 0 θ ∥ ⋄ ≤ M 2 τ 2 e M τ . \left\|\Phi_\tau^\theta-e^{\tau G_0^\theta}\right\|_\diamond\leq M^2\tau^2e^{M\tau}. Φ τ θ − e τ G 0 θ ⋄ ≤ M 2 τ 2 e M τ .
Adding Eq. (120) proves ∥ Φ ~ τ θ ∥ ⋄ ≤ q \|\widetilde{\Phi}_\tau^\theta\|_\diamond\leq q ∥ Φ τ θ ∥ ⋄ ≤ q .
The one-cycle estimate composes across an adaptive experiment because intermediate LOCC, including its classical records, is contractive after partial transpose. Starting with separable laboratories therefore gives ∥ ρ β N ∥ 1 ≤ q N \|\rho_\beta^N\|_1\leq q^N ∥ ρ β N ∥ 1 ≤ q N even with adaptive choices of codes and arbitrary retained memories. The partial transpose of a maximally entangled state of dimension D D D is 1 / D 1/D 1/ D times the swap, so F D ≤ ∥ ρ β N ∥ 1 / D F_D\leq\|\rho_\beta^N\|_1/D F D ≤ ∥ ρ β N ∥ 1 / D . Taking D = 2 m D=2^m D = 2 m proves Eq. (122) . The cycle count bounds every branch; an expected stopping-time constraint alone is a different assumption.
For the planar code, exact correction makes the first-order recovered white-force generator vanish on the logical quantum systems. The logical Hamiltonian is ℏ g Z A Z B \hbar gZ_AZ_B ℏ g Z A Z B , up to local terms, so evolution from a product of logical ∣ + ⟩ |+\rangle ∣ + ⟩ states for T = π / ( 4 g ) T=\pi/(4g) T = π / ( 4 g ) gives a Bell pair up to local unitaries. In ordinary diamond norm both e S L e^{\mathcal{S}\mathcal{L}} e SL and e S G 0 e^{\mathcal{S}G_0} e S G 0 are contractions. Their integral Taylor remainders give
1 2 ∥ Φ τ − e τ G 0 ∥ ⋄ ≤ M 2 τ 2 2 . \frac{1}{2}\left\|\Phi_\tau-e^{\tau G_0}\right\|_\diamond\leq\frac{M^2\tau^2}{2}. 2 1 Φ τ − e τ G 0 ⋄ ≤ 2 M 2 τ 2 .
Telescoping n n n cycles and adding the initialization error show that the Bell overlap is at least 1 − p 1-p 1 − p . Local twirling gives a Bell-diagonal state of entropy at most h 2 ( p ) + p log 2 3 h_2(p)+p\log_2 3 h 2 ( p ) + p log 2 3 . Independent repetition, including reset of the fault process and environment, permits the one-way hashing rate Y ( p ) Y(p) Y ( p ) per block[36 ] . Dividing by the block duration proves the lower rate bounds.
Finally, log ( 1 + x ) ≤ x \log(1+x)\leq x log ( 1 + x ) ≤ x and J a x ≥ 0 J_{\mathrm{ax}}\geq0 J ax ≥ 0 imply
T R a x ≤ π 2 ( g / J a x ) ln 2 + 2 η e M τ ln 2 . TR_{\mathrm{ax}}\leq\frac{\pi}{2(g/J_{\mathrm{ax}})\ln2}+\frac{2\eta e^{M\tau}}{\ln2}. T R ax ≤ 2 ( g / J ax ) ln 2 π + ln 2 2 η e M τ .
At the stated parameter bounds, Y ( 0.005 ) = 0.946660495162600 … Y(0.005)=0.946660495162600\ldots Y ( 0.005 ) = 0.946660495162600 … and the last expression is smaller than 0.914374281718837 … 0.914374281718837\ldots 0.914374281718837 … . The difference exceeds 0.03228 0.03228 0.03228 for χ = 0 \chi=0 χ = 0 and 0.02291 0.02291 0.02291 for χ = 0.01 \chi=0.01 χ = 0.01 .
Every finite M M M permits strictly positive control tolerances. Choose τ = T / n \tau= T/n τ = T / n with
0 < τ ≤ min { 0.004 T M 2 , 0.01 M } , 0 < ϵ ≤ 0.002 τ T . 0 < \tau\le\min\left\{\frac{0.004}{TM^2},\frac{0.01}{M}\right\}, \qquad0 < \epsilon\le\frac{0.002\tau}{T}. 0 < τ ≤ min { T M 2 0.004 , M 0.01 } , 0 < ϵ ≤ T 0.002 τ .
Then η ≤ 0.004 \eta\le0.004 η ≤ 0.004 . These are sufficient specifications for the matched reset architecture. In a fixed-position mode model with no unbounded kinetic term, one may take M = 2 G / [ ℏ ( d − 2 r ) ] + 8 a r 2 M = 2G/[\hbar(d-2r)] + 8ar^2 M = 2 G / [ ℏ ( d − 2 r )] + 8 a r 2 for both geometries: the Laplace-angular product representation bounds the Hamiltonian commutator in ordinary and transposed diamond norm, and ∑ i x i 2 ≤ r 2 I \sum_i x_i^2 \le r^2 I ∑ i x i 2 ≤ r 2 I bounds the local white-force generators. Finite-energy packets require their own dynamical and recovery justification. Likewise, the Gaussian-localization example with F ≥ 0.8170 F \ge0.8170 F ≥ 0.8170 does not supply the hypotheses or fidelity required by this rate theorem.
Both norms in Eq. (120) matter when memory dimension is unrestricted. A global fault that outputs a flagged D D D -dimensional maximally entangled state with probability ϵ \epsilon ϵ can have ordinary half-diamond error ϵ \epsilon ϵ while its output partial transpose norm is 1 − ϵ + ϵ D 1-\epsilon+\epsilon D 1 − ϵ + ϵD . Local recovery faults avoid this dimension dependence because full transpose preserves the diamond norm of a local map. This example explains the two error specifications; it does not provide an uncounted source of physical entanglement.
A fixed-energy encoded construction under ideal continuous recovery
The residual Gaussian localization of the hexagon raises a different question: can another code approach a perfect Bell pair at the same geometry and finite noise strength? We construct such a family for the full Newtonian interaction on two disjoint balls of radius r r r , with centre separation d > 2 r d > 2r d > 2 r . Higher angular order suppresses uncorrectable noise, while a decreasing occupation of that angular component keeps the mean kinetic energy of every encoded state fixed. Recovery is ideal and local, with unrestricted noiseless auxiliary systems and syndrome reset. This is an encoded-energy statement; it does not bound momentum bandwidth, recovery work or the energy of every noisy trajectory.
Let the local kinetic operators be the Dirichlet Laplacians K α = − ℏ 2 Δ / ( 2 m α ) K_\alpha= -\hbar^2\Delta/(2m_\alpha) K α = − ℏ 2 Δ/ ( 2 m α ) on the balls. This explicit confinement keeps every finite dwell inside the supported domain. Each local auxiliary qutrit is noiseless. For laboratory α = A , B \alpha= A, B α = A , B , Gaussian localization is a Poisson process of rate Λ α \Lambda_\alpha Λ α : one event applies the channel J α \mathcal{J}_\alpha J α with localization length ℓ α \ell_\alpha ℓ α . On the motional coordinates, let
L α = Λ α ( J α − i d ) , ( J α ρ ) ( x , x ′ ) = e − ∣ x − x ′ ∣ 2 / ( 4 ℓ α 2 ) ρ ( x , x ′ ) , (125) \mathcal{L}_\alpha= \Lambda_\alpha(\mathcal{J}_\alpha-\mathrm{id}), \qquad(\mathcal{J}_\alpha\rho)(x,x') = e^{-|x-x'|^2/(4\ell_\alpha^2)}\rho(x,x'), \tag*{(125)} L α = Λ α ( J α − id ) , ( J α ρ ) ( x , x ′ ) = e − ∣ x − x ′ ∣ 2 / ( 4 ℓ α 2 ) ρ ( x , x ′ ) , (125)
where 0 ≤ Λ α < ∞ 0 \le\Lambda_\alpha< \infty 0 ≤ Λ α < ∞ , 0 < ℓ α < ∞ 0 < \ell_\alpha< \infty 0 < ℓ α < ∞ , and the two noise processes are independent. Gravity is their only nonlocal coupling.
Choose cylindrical coordinates ( s , z , θ ) (s,z,\theta) ( s , z , θ ) with both axes parallel to the line joining the centres and with the same angular orientation. Here s s s is the transverse radius, z z z the axial coordinate and θ \theta θ the azimuth. We keep the radial and axial profile fixed as the angular order increases. Choose a smooth χ ( s , z ) \chi(s,z) χ ( s , z ) , normalized in s d s d z s\,ds\,dz s d s d z , with support strictly inside
0 < s − ≤ s ≤ s + , ∣ z ∣ ≤ h , s + 2 + h 2 < r 2 . (126) 0 < s_- \le s \le s_+, \qquad|z| \le h, \qquad s_+^2+h^2 < r^2. \tag*{(126)} 0 < s − ≤ s ≤ s + , ∣ z ∣ ≤ h , s + 2 + h 2 < r 2 . (126)
The positive inner radius s − s_- s − keeps the angular kinetic-energy integral finite. We use the same profile in both laboratories and separate its radial–axial energy E χ , α E_{\chi,\alpha} E χ , α from the inverse-square radial moment M − 2 M_{-2} M − 2 that multiplies the angular energy:
E χ , α = ℏ 2 2 m α ∫ ( ∣ ∂ s χ ∣ 2 + ∣ ∂ z χ ∣ 2 ) s d s d z , M − 2 = ∫ s − 2 ∣ χ ∣ 2 s d s d z . (127) E_{\chi,\alpha} = \frac{\hbar^2}{2m_\alpha}\int\left(|\partial_s\chi|^2+|\partial_z\chi|^2\right)s\,ds\,dz, \qquad M_{-2} = \int s^{-2}|\chi|^2s\,ds\,dz. \tag*{(127)} E χ , α = 2 m α ℏ 2 ∫ ( ∣ ∂ s χ ∣ 2 + ∣ ∂ z χ ∣ 2 ) s d s d z , M − 2 = ∫ s − 2 ∣ χ ∣ 2 s d s d z . (127)
Proposition S16 (Fixed encoded mean energy and arbitrarily accurate Bell generation). Fix 0 < η A , η B ≤ 1 0 < \eta_A, \eta_B \le1 0 < η A , η B ≤ 1 . Under the model above, local ideal continuous recovery permits Bell-state fidelity arbitrarily close to one at the fixed geometry ( r , d ) (r,d) ( r , d ) , while every encoded state of mass α \alpha α has mean kinetic energy
E χ , α + η α ℏ 2 2 m α M − 2 . (128) E_{\chi,\alpha}+\frac{\eta_\alpha\hbar^2}{2m_\alpha}M_{-2}. \tag*{(128)} E χ , α + 2 m α η α ℏ 2 M − 2 . (128) For every finite requested accuracy, a finite code order and a finite interaction time suffice. At each such order and time, a finite number of ideal recovery operations approximates the continuous-recovery output to arbitrary additional accuracy. There is no uniform bound on that number or on the resources required to implement the recovery.
Proof. For angular order n ≥ 2 n \ge2 n ≥ 2 , an occupied harmonic costs energy proportional to n 2 n^2 n 2 . We therefore choose its probability to be w α = η α / n 2 w_\alpha=\eta_\alpha/n^2 w α = η α / n 2 , where 0 < η α ≤ 1 0 < \eta_\alpha\le1 0 < η α ≤ 1 fixes the angular energy allowance. The auxiliary levels ∣ 0 ⟩ a , ∣ 1 ⟩ a \lvert0\rangle_a,\lvert1\rangle_a ∣ 0 ⟩ a , ∣ 1 ⟩ a retain the logical label in the zero-angular-order part, while the shared level ∣ 2 ⟩ a \lvert2\rangle_a ∣ 2 ⟩ a permits a gravitational transition between the logical states. Encode the logical basis as
Ψ j , α ( s , z , θ ) = χ ( s , z ) 2 π [ 1 − w α ∣ j ⟩ a + w α e i ( 2 j − 1 ) n θ ∣ 2 ⟩ a ] , j = 0 , 1. (129) \Psi_{j,\alpha}(s,z,\theta)=\frac{\chi(s,z)}{\sqrt{2\pi}}\left[\sqrt{1-w_\alpha}\lvert j\rangle_a+\sqrt{w_\alpha}e^{i(2j-1)n\theta}\lvert2\rangle_a\right],\qquad j=0,1. \tag*{(129)} Ψ j , α ( s , z , θ ) = 2 π χ ( s , z ) [ 1 − w α ∣ j ⟩ a + w α e i ( 2 j − 1 ) n θ ∣ 2 ⟩ a ] , j = 0 , 1. (129)
Let P α P_\alpha P α project onto their span and put P = P A ⊗ P B P=P_A\otimes P_B P = P A ⊗ P B . The auxiliary labels make these states orthogonal. Direct integration of the Dirichlet kinetic quadratic form gives
P α K α P α = ( E χ , α + w α n 2 ℏ 2 2 m α M − 2 ) P α . (130) P_\alpha K_\alpha P_\alpha=\left(E_{\chi,\alpha}+\frac{w_\alpha n^2\hbar^2}{2m_\alpha}M_{-2}\right)P_\alpha. \tag*{(130)} P α K α P α = ( E χ , α + 2 m α w α n 2 ℏ 2 M − 2 ) P α . (130)
The off-diagonal matrix element vanishes by angular orthogonality, so this energy is the same for every logical state, including a logical subsystem entangled with other systems. Substituting w α n 2 = η α w_\alpha n^2=\eta_\alpha w α n 2 = η α proves (128) .
a. An explicit recovery. To recover a low angular-order kick, we must separate its angular transfer from the logical label. Suppress the laboratory index and write ∣ ℓ , j ⟩ \lvert\ell,j\rangle ∣ ℓ , j ⟩ for angular harmonic e i ℓ θ / 2 π e^{i\ell\theta}/\sqrt{2\pi} e i ℓ θ / 2 π with auxiliary level j j j . A multiplication error f ℓ ( s , z ) e i ℓ θ f_\ell(s,z)e^{i\ell\theta} f ℓ ( s , z ) e i ℓ θ gives the radial function f ℓ χ f_\ell\chi f ℓ χ and the angular–auxiliary vector
v j , ℓ = 1 − w ∣ ℓ , j ⟩ + w ∣ ℓ + ( 2 j − 1 ) n , 2 ⟩ . (131) v_{j,\ell}=\sqrt{1-w}\lvert\ell,j\rangle+\sqrt{w}\lvert\ell+(2j-1)n,2\rangle. \tag*{(131)} v j , ℓ = 1 − w ∣ ℓ , j ⟩ + w ∣ ℓ + ( 2 j − 1 ) n , 2 ⟩ . (131)
For ∣ ℓ ∣ , ∣ ℓ ′ ∣ ≤ n − 1 \lvert\ell\rvert,\lvert\ell'\rvert\le n-1 ∣ ℓ ∣ , ∣ ℓ ′ ∣ ≤ n − 1 ,
⟨ v j , ℓ ∣ v k , ℓ ′ ⟩ = δ j k δ ℓ ℓ ′ . (132) \langle v_{j,\ell}\mid v_{k,\ell'}\rangle=\delta_{jk}\delta_{\ell\ell'}. \tag*{(132)} ⟨ v j , ℓ ∣ v k , ℓ ′ ⟩ = δ j k δ ℓ ℓ ′ . (132)
Indeed, a cross-logical overlap of the common auxiliary level would require ℓ − ℓ ′ = ± 2 n \ell-\ell'=\pm2n ℓ − ℓ ′ = ± 2 n . Thus an isometry on this correctable subspace maps
∣ f ⟩ r a d i a l ∣ v j , ℓ ⟩ ⟼ ∣ j ⟩ L ∣ f , ℓ ⟩ s y n d r o m e . (133) \lvert f\rangle_{\mathrm{radial}}\lvert v_{j,\ell}\rangle\longmapsto\lvert j\rangle_L\lvert f,\ell\rangle_{\mathrm{syndrome}}. \tag*{(133)} ∣ f ⟩ radial ∣ v j , ℓ ⟩ ⟼ ∣ j ⟩ L ∣ f , ℓ ⟩ syndrome . (133)
Trace out the syndrome, prepare the fixed profile and re-encode. On the orthogonal complement, a trace-and-prepare channel completes this to a normal deterministic recovery. This explicitly resets the radial continuum as well as the angular syndrome. It uses unrestricted local operations; it is not a finite-control implementation. In particular it corrects I , x , y , z I,x,y,z I , x , y , z , since these have angular orders zero and one.
b. The entire residual noise channel. The recovery corrects every transfer of order below n n n . We now bound the total probability of all remaining transfers, which controls errors on every logical input. With the laboratory index suppressed, ℓ \ell ℓ denotes its localization length. The Gaussian jump channel in (125) is the mixture of e i q ⋅ x e^{i\mathbf{q}\cdot\mathbf{x}} e i q ⋅ x with density ℓ 3 π − 3 / 2 e − ℓ 2 ∣ q ∣ 2 \ell^3\pi^{-3/2}e^{-\ell^2\lvert\mathbf{q}\rvert^2} ℓ 3 π − 3/2 e − ℓ 2 ∣ q ∣ 2 . Expanding a transverse kick into angular harmonics and averaging its azimuth eliminates cross terms between distinct angular transfers. The transfer-ℓ ′ \ell' ℓ ′ Kraus operators are radial multipliers times e i ℓ ′ θ e^{i\ell'\theta} e i ℓ ′ θ . At radius s s s , their total probability is
p ℓ ′ ( s ) = e − a ( s ) I ∣ ℓ ′ ∣ ( a ( s ) ) , a ( s ) = s 2 / ( 2 ℓ 2 ) , (134) p_{\ell'}(s)=e^{-a(s)}I_{\lvert\ell'\rvert}(a(s)),\qquad a(s)=s^2/(2\ell^2), \tag*{(134)} p ℓ ′ ( s ) = e − a ( s ) I ∣ ℓ ′ ∣ ( a ( s )) , a ( s ) = s 2 / ( 2 ℓ 2 ) , (134)
where I j I_j I j is the modified Bessel function. Equivalently, ℓ ′ \ell' ℓ ′ has the distribution of the difference of two independent Poisson variables of mean a ( s ) / 2 a(s)/2 a ( s ) /2 . Let q α , n q_{\alpha,n} q α , n denote the actual probability of ∣ ℓ ′ ∣ ≥ n \lvert\ell'\rvert\ge n ∣ ℓ ′ ∣ ≥ n , averaged over ∣ χ ( s , z ) ∣ 2 s d s d z \lvert\chi(s,z)\rvert^2s\,ds\,dz ∣ χ ( s , z ) ∣ 2 s d s d z . Since the absolute difference is at most the sum of those Poisson variables,
q α , n ≤ a α n n ! , a α = s + 2 2 ℓ α 2 . (135) q_{\alpha,n}\le\frac{a_\alpha^n}{n!},\qquad a_\alpha=\frac{s_+^2}{2\ell_\alpha^2}. \tag*{(135)} q α , n ≤ n ! a α n , a α = 2 ℓ α 2 s + 2 . (135)
Here the last bound is the Poisson factorial-moment inequality.
The probability of each angular-transfer sector is independent of the logical input and of w α w_\alpha w α : its Kraus norm depends only on ( s , z ) (s,z) ( s , z ) , and the compressed radial multiplication operator is scalar. All low transfers are corrected exactly. Consequently, on logical inputs, the recovered jump channel is exactly
( 1 − q α , n ) id + q α , n Φ α , n (136) (1-q_{\alpha,n})\operatorname{id}+q_{\alpha,n}\Phi_{\alpha,n} \tag*{(136)} ( 1 − q α , n ) id + q α , n Φ α , n (136)
for a channel Φ α , n \Phi_{\alpha,n} Φ α , n . This controls the full residual channel, including logical flips and leakage handled by the recovery, rather than one selected coherence.
c. The retained Newtonian coupling. Write G = G m A m B \mathcal{G}=Gm_Am_B G = G m A m B . The two basis states have the same position density; their transition density is w α ∣ χ ∣ 2 e 2 i n θ / ( 2 π ) w_\alpha\lvert\chi\rvert^2e^{2in\theta}/(2\pi) w α ∣ χ ∣ 2 e 2 in θ / ( 2 π ) . With the aligned cylindrical axes, the potential depends on the angles only through ϕ = θ A − θ B \phi=\theta_A-\theta_B ϕ = θ A − θ B . Simultaneous rotational invariance therefore eliminates single logical flips and the ∣ 00 ⟩ ⟨ 11 ∣ \lvert00\rangle\langle11\rvert ∣ 00 ⟩ ⟨ 11 ∣ term. It gives exactly, with V 0 V_0 V 0 the common diagonal potential energy,
P V P = V 0 I − ℏ w A w B g 2 n ( ∣ 01 ⟩ ⟨ 10 ∣ + ∣ 10 ⟩ ⟨ 01 ∣ ) . (137) PVP=V_0I-\hbar w_Aw_Bg_{2n}(\lvert01\rangle\langle10\rvert+\lvert10\rangle\langle01\rvert). \tag*{(137)} P V P = V 0 I − ℏ w A w B g 2 n (∣ 01 ⟩ ⟨ 10 ∣ + ∣ 10 ⟩ ⟨ 01 ∣) . (137)
For clarity, writing χ α = χ ( s α , z α ) \chi_\alpha=\chi(s_\alpha,z_\alpha) χ α = χ ( s α , z α ) , g m g_m g m uses the complex Fourier coefficient convention:
g m = G ℏ ∫ ∣ χ A ∣ 2 ∣ χ B ∣ 2 [ 1 2 π ∫ 0 2 π e i m ϕ d ϕ A − 2 s A s B cos ϕ ] s A d s A d z A s B d s B d z B , g_m=\frac{\mathcal{G}}{\hbar}\int\lvert\chi_A\rvert^2\lvert\chi_B\rvert^2\left[\frac{1}{2\pi}\int_0^{2\pi}\frac{e^{im\phi}\,d\phi}{\sqrt{A-2s_As_B\cos\phi}}\right]s_A\,ds_A\,dz_A\,s_B\,ds_B\,dz_B, g m = ℏ G ∫ ∣ χ A ∣ 2 ∣ χ B ∣ 2 [ 2 π 1 ∫ 0 2 π A − 2 s A s B cos ϕ e im ϕ d ϕ ] s A d s A d z A s B d s B d z B ,
A = ( d + z B − z A ) 2 + s A 2 + s B 2 . (138) A=(d+z_B-z_A)^2+s_A^2+s_B^2. \tag*{(138)} A = ( d + z B − z A ) 2 + s A 2 + s B 2 . (138)
The bracket is real and positive for m ≥ 1 m\ge1 m ≥ 1 . To compare the surviving signal with the factorial noise tail, we need a positive lower bound on this Fourier coefficient that is uniform over the fixed profiles. Bound the denominator scale by Q Q Q , the radial product ratio from below by b b b , and denote the reciprocal-square-root series coefficients by c k c_k c k :
Q = ( d + 2 h ) 2 + 2 s + 2 , b = s − 2 / Q , c k = ( 2 k k ) / 4 k . (139) Q=(d+2h)^2+2s_+^2,\qquad b=s_-^2/Q,\qquad c_k=\binom{2k}{k}/4^k. \tag*{(139)} Q = ( d + 2 h ) 2 + 2 s + 2 , b = s − 2 / Q , c k = ( k 2 k ) / 4 k . (139)
The binomial expansion of the reciprocal square root has nonnegative contributions to Fourier order m m m . Its order-m m m term contributes c m A − 1 / 2 ( s A s B / A ) m c_mA^{-1/2}(s_As_B/A)^m c m A − 1/2 ( s A s B / A ) m : the 2 m 2^m 2 m from the potential expansion cancels the 2 − m 2^{-m} 2 − m coefficient of e i m ϕ e^{im\phi} e im ϕ in cos m ϕ \cos^m\phi cos m ϕ . Since A ≤ Q A\le Q A ≤ Q and s A s B ≥ s − 2 s_As_B\ge s_-^2 s A s B ≥ s − 2 , normalization of the profiles gives
g 2 n ≥ G ℏ Q c 2 n b 2 n ≥ G ℏ Q ( 4 n + 1 ) b 2 n > 0. (140) g_{2n}\ge\frac{\mathcal{G}}{\hbar\sqrt{Q}}c_{2n}b^{2n}\ge\frac{\mathcal{G}}{\hbar\sqrt{Q}(4n+1)}b^{2n}>0. \tag*{(140)} g 2 n ≥ ℏ Q G c 2 n b 2 n ≥ ℏ Q ( 4 n + 1 ) G b 2 n > 0. (140)
The last inequality follows because the central binomial coefficient is the largest of the 4 n + 1 4n+1 4 n + 1 coefficients whose sum is 2 4 n 2^{4n} 2 4 n .
d. Continuous recovery with the full kinetic Hamiltonian. Let E n \mathcal{E}_n E n be the two-laboratory code isometry channel and let D n \mathcal{D}_n D n be the product of the two decoding/reset channels above, with D n E n = i d \mathcal{D}_n\mathcal{E}_n=\mathrm{id} D n E n = id on the logical qubits. Let L \mathcal{L} L generate the physical evolution with H = K A + K B + V H=K_A+K_B+V H = K A + K B + V and the two noise generators in Eq. (125) . The potential is bounded on the disjoint balls, and the Poisson noise generators are bounded on trace class. Hence this is a strongly continuous physical semigroup with the Dirichlet kinetic Hamiltonian retained.
We must also show that repeated physical recovery approaches the claimed logical evolution while retaining kinetic dynamics. For each fixed n n n , the smooth compactly supported code vectors lie in the Hamiltonian domain. Their matrix units therefore lie in the trace-class generator domain. On the finite-dimensional logical input,
M τ , n : = D n e τ L E n = i d + τ G n + o ( τ ) (141) M_{\tau,n}:=\mathcal{D}_n e^{\tau\mathcal{L}}\mathcal{E}_n=\mathrm{id}+\tau\mathcal{G}_n+o(\tau) \tag*{(141)} M τ , n := D n e τ L E n = id + τ G n + o ( τ ) (141)
in diamond norm. To identify the Hamiltonian part, note that a decoder which acts identically on the code kills cross operators between the code and its orthogonal complement. A Stinespring isometry sends a code vector to its logical vector tensored with one fixed syndrome state; orthogonality forces every complementary vector to have zero component in this same syndrome sector. Thus the Hamiltonian derivative after decoding is the commutator with the compressed Hamiltonian. The local kinetic compressions are scalar by Eq. (128) . Combining Eqs. (136) and (137) gives
G n ( ρ ) = − i ℏ [ P V P , ρ ] + ∑ α = A , B Λ α q α , n ( Φ α , n ⊗ i d α ˉ − i d ) ( ρ ) , (142) \mathcal{G}_n(\rho)=-\frac{i}{\hbar}[PVP,\rho]+\sum_{\alpha=A,B}\Lambda_\alpha q_{\alpha,n}\left(\Phi_{\alpha,n}\otimes\mathrm{id}_{\bar{\alpha}}-\mathrm{id}\right)(\rho), \tag*{(142)} G n ( ρ ) = − ℏ i [ P V P , ρ ] + α = A , B ∑ Λ α q α , n ( Φ α , n ⊗ id α ˉ − id ) ( ρ ) , (142)
where P V P PVP P V P denotes its logical matrix. The finite-dimensional product formula now implies M T / N , n ∘ N → e T G n M_{T/N,n}^{\circ N}\to e^{T\mathcal{G}_n} M T / N , n ∘ N → e T G n in diamond norm for every fixed n n n and finite T T T . This proves the finite-cycle approximation assertion without replacing the kinetic Hamiltonian by a static phase model.
e. Bell fidelity. We can now compare the time needed to generate entanglement with the probability of a residual jump during that time. From the separable logical state ∣ 01 ⟩ \lvert01\rangle ∣ 01 ⟩ , the noiseless exchange in Eq. (137) reaches a Bell state at the following T n T_n T n . The constant T ∗ T_\ast T ∗ in this subsection is the geometry-dependent prefactor of its upper bound:
T n = π 4 w A w B g 2 n ≤ T ∗ n 4 ( 4 n + 1 ) b − 2 n , T ∗ = π ℏ Q 4 G η A η B . (143) T_n=\frac{\pi}{4w_Aw_Bg_{2n}}\leq T_\ast n^4(4n+1)b^{-2n},\qquad T_\ast=\frac{\pi\hbar\sqrt{Q}}{4G\eta_A\eta_B}. \tag*{(143)} T n = 4 w A w B g 2 n π ≤ T ∗ n 4 ( 4 n + 1 ) b − 2 n , T ∗ = 4 G η A η B π ℏ Q . (143)
The residual terms in Eq. (142) have state-independent Poisson rates. The no-residual-jump trajectory has the ideal Bell output, so its probability bounds the fidelity from below. Let F n F_n F n be the overlap with that Bell target in the continuous-recovery model. With Λ = Λ A + Λ B \Lambda=\Lambda_A+\Lambda_B Λ = Λ A + Λ B and a = max ( a A , a B ) a=\max(a_A,a_B) a = max ( a A , a B ) ,
1 − F n ≤ ∑ α Λ α q α , n T n ≤ Λ T ∗ n 4 ( 4 n + 1 ) ( a / b 2 ) n n ! ⟶ 0. (144) 1-F_n\leq\sum_\alpha\Lambda_\alpha q_{\alpha,n}T_n\leq\Lambda T_\ast n^4(4n+1)\frac{(a/b^2)^n}{n!}\longrightarrow0. \tag*{(144)} 1 − F n ≤ α ∑ Λ α q α , n T n ≤ Λ T ∗ n 4 ( 4 n + 1 ) n ! ( a / b 2 ) n ⟶ 0. (144)
For any requested error, first choose a finite n n n making this bound small, and then choose a finite number of cycles making the approximation in Eq. (141) as accurate as required. All interaction time is included in T n T_n T n , and no entangled seed is used.
The encoded-state energy is fixed immediately after each recovery. During a finite dwell, localization kicks can heat the masses and gravity can exchange kinetic and potential energy. Bounding these two changes extends the energy statement to every time within a dwell, after averaging over the unobserved noise.
Proposition S17 (A uniform mean kinetic-energy bound during finite dwells). Let every dwell have length at most a fixed τ max < ∞ \tau_{\max}<\infty τ m a x < ∞ , and let each ideal recovery re-encode into Eq. (129) . Write E c o d e = ∑ α [ E χ , α + E_{\mathrm{code}}=\sum_\alpha[E_{\chi,\alpha}+ E code = ∑ α [ E χ , α +
η α ℏ 2 M − 2 / ( 2 m α ) ] \eta_\alpha\hbar^2 M_{-2}/(2m_\alpha)] η α ℏ 2 M − 2 / ( 2 m α )] . The mean localization heating rate h h e a t h_{\mathrm{heat}} h heat and the range osc ( V ) \operatorname{osc}(V) osc ( V ) of the pair potential are
h h e a t = ∑ α = A , B 3 Λ α ℏ 2 4 m α ℓ α 2 , osc ( V ) = G ( 1 d − 2 r − 1 d + 2 r ) . (145) h_{\mathrm{heat}}=\sum_{\alpha=A,B}\frac{3\Lambda_\alpha\hbar^2}{4m_\alpha\ell_\alpha^2},\qquad\operatorname{osc}(V)=\mathcal{G}\left(\frac{1}{d-2r}-\frac{1}{d+2r}\right). \tag*{(145)} h heat = α = A , B ∑ 4 m α ℓ α 2 3 Λ α ℏ 2 , osc ( V ) = G ( d − 2 r 1 − d + 2 r 1 ) . (145)
During every active dwell, the total kinetic energy, averaged over the unobserved localization noise and all previous outcomes, obeys
E ⟨ K A + K B ⟩ ≤ E c o d e + osc ( V ) + h h e a t τ max . (146) \mathbb{E}\langle K_A+K_B\rangle\le E_{\mathrm{code}}+\operatorname{osc}(V)+h_{\mathrm{heat}}\tau_{\max}. \tag*{(146)} E ⟨ K A + K B ⟩ ≤ E code + osc ( V ) + h heat τ m a x . (146)
The bound is independent of the code order and number of cycles. Thus the finite-cycle approximations in Proposition S16 can also be chosen with a uniform unconditional active-dwell mean-energy bound. No bound on recovery work or individual noise-conditioned trajectories is asserted.
Proof. The multiplication unitary e i q ⋅ x α e^{i\mathbf{q}\cdot\mathbf{x}_\alpha} e i q ⋅ x α preserves the Dirichlet quadratic-form domain and commutes with V V V . Its change of the kinetic quadratic form is
ℏ m α q ⋅ ⟨ p α ⟩ + ℏ 2 ∣ q ∣ 2 2 m α . (147) \frac{\hbar}{m_\alpha}\mathbf{q}\cdot\langle\mathbf{p}_\alpha\rangle+\frac{\hbar^2|\mathbf{q}|^2}{2m_\alpha}. \tag*{(147)} m α ℏ q ⋅ ⟨ p α ⟩ + 2 m α ℏ 2 ∣ q ∣ 2 . (147)
The first term averages to zero, and the Gaussian kick distribution has E ∣ q ∣ 2 = 3 / ( 2 ℓ α 2 ) \mathbb{E}|\mathbf{q}|^2=3/(2\ell_\alpha^2) E ∣ q ∣ 2 = 3/ ( 2 ℓ α 2 ) . Between jumps the mean of H = K A + K B + V H=K_A+K_B+V H = K A + K B + V is conserved. The Poisson unraveling therefore gives E ⟨ H ( t ) ⟩ = E ⟨ H ( 0 ) ⟩ + h h e a t t \mathbb{E}\langle H(t)\rangle=\mathbb{E}\langle H(0)\rangle+h_{\mathrm{heat}}t E ⟨ H ( t )⟩ = E ⟨ H ( 0 )⟩ + h heat t . This argument also establishes finite mean energy by summing the finite mean number of jumps and their finite second moments. Each dwell starts with kinetic energy E c o d e E_{\mathrm{code}} E code , while the change in mean potential energy is bounded by osc ( V ) \operatorname{osc}(V) osc ( V ) . This proves (146) . For any finite target interaction time, the continuous-recovery approximation may use arbitrarily many cycles, so imposing τ ≤ τ max \tau\le\tau_{\max} τ ≤ τ m a x does not restrict that limit.
f. Scope of the resources. The code energy in (128) holds after each ideal re-encoding and throughout the ideal Zeno evolution. It is not the same as a common kinetic-energy bound at every time on every noise-conditioned history. (146) adds a uniform unconditional mean bound during finite dwells; its allowance includes the potential variation and noise heating, and need not equal the smaller encoded-state allowance. The recovery explicitly disposes of a radial syndrome with an infinite-dimensional state space; approximating that operation at finite precision requires its own resources. Smooth compact profiles and high angular orders also do not impose a momentum cutoff. The occupied angular harmonic is n n n , its probability is proportional to n − 2 n^{-2} n − 2 , and the kinetic-energy second moment grows as n 2 n^2 n 2 . There is therefore no uniform nonrelativistic bandwidth guarantee as n → ∞ n\to\infty n → ∞ . The result does not provide a fixed pulse-error allowance, bounded recovery work or a finite-rate comparison with other protected codes.
For the ideal resource convention, a finite choice with Bell infidelity δ < 0.1 \delta<0.1 δ < 0.1 also gives a positive achievable Bell-pair rate. Independent repetition, bilateral twirling and one-way hashing give[36 ]
C i d e a l ≥ 1 − h 2 ( δ ) − δ log 2 3 T n > 0 , (148) C_{\mathrm{ideal}}\ge\frac{1-h_2(\delta)-\delta\log_2 3}{T_n}>0, \tag*{(148)} C ideal ≥ T n 1 − h 2 ( δ ) − δ log 2 3 > 0 , (148)
where h 2 h_2 h 2 is the binary entropy, and local processing and noiseless storage are free. This is an achievable rate under the stated ideal recovery assumptions, not the optimal protected capacity or a practical-rate estimate.
An operational tolerance for imperfect position-error correction
Exact correction removes the low position moments from the logical interaction. To quantify an imperfect cancellation, we use a specified calibration channel. Its strength is fixed; its recovery infidelity is neither the physical force-noise strength nor the error of a complete experimental recovery cycle.
Write X j = x j / r X_j=x_j/r X j = x j / r on a mass supported in its radius-r r r ball, with local ancillary identities understood. We construct a calibration channel whose exact Knill–Laflamme conditions are precisely the required first- and second-moment conditions. The identity and position errors share an output flag ∣ s ⟩ \lvert s\rangle ∣ s ⟩ ; a second, orthogonal flag ∣ f ⟩ \lvert f\rangle ∣ f ⟩ supplies the remaining probability needed for trace preservation. Its Kraus operators are
K 0 = ∣ s ⟩ ⊗ I / 2 , K j = ∣ s ⟩ ⊗ X j / 2 ( j = x , y , z ) , K f = ∣ f ⟩ ⊗ ( I − ∑ j X j 2 ) / 2 , ⟨ s ∣ f ⟩ = 0. (149) K_0=\lvert s\rangle\otimes I/\sqrt{2},\qquad K_j=\lvert s\rangle\otimes X_j/\sqrt{2}\quad(j=x,y,z),\qquad K_f=\lvert f\rangle\otimes\sqrt{\left(I-\sum_jX_j^2\right)/2},\qquad\langle s\vert f\rangle=0. \tag*{(149)} K 0 = ∣ s ⟩ ⊗ I / 2 , K j = ∣ s ⟩ ⊗ X j / 2 ( j = x , y , z ) , K f = ∣ f ⟩ ⊗ ( I − j ∑ X j 2 ) /2 , ⟨ s ∣ f ⟩ = 0. (149)
The support constraint makes the square root positive, and the Kraus operators are complete. The flag makes K f † K j = 0 K_f^\dagger K_j=0 K f † K j = 0 for j = 0 , x , y , z j=0,x,y,z j = 0 , x , y , z . Exact correctability is therefore equivalent to the Knill–Laflamme conditions for { I , x , y , z } \{I,x,y,z\} { I , x , y , z } : the remaining failure product is a linear combination of the successful quadratic products.
Let N \mathcal{N} N denote this calibration channel and, for encoding isometry W W W , let W ( ρ ) = W ρ W † \mathcal{W}(\rho)=W\rho W^\dagger W ( ρ ) = W ρ W † and N P = N ∘ W \mathcal{N}_P=\mathcal{N}\circ\mathcal{W} N P = N ∘ W . Its complementary channel N ^ P \widehat{\mathcal{N}}_P N P outputs the environment register indexed by the five Kraus operators. Exact recovery is possible when this environment learns nothing about the logical input. We quantify approximate recovery by its distance from a constant environmental output:
δ P = 1 2 inf σ ∥ N ^ P − [ ρ ↦ σ Tr ρ ] ∥ ⋄ , (150) \delta_P=\frac{1}{2}\inf_\sigma\left\|\widehat{\mathcal{N}}_P-[\rho\mapsto\sigma\operatorname{Tr}\rho]\right\|_\diamond, \tag*{(150)} δ P = 2 1 σ inf N P − [ ρ ↦ σ Tr ρ ] ⋄ , (150)
where σ \sigma σ is a normalized environmental state. References are included in this norm. For finite code spaces the infimum is attained; the bounds below are uniform in their dimensions and pass to the stated operational limits.
Use δ A , δ B \delta_A,\delta_B δ A , δ B for the defects of Alice’s and Bob’s codes. Their residual first moments can restore a dipole interaction; residual second moments also couple to higher moments. The following bound keeps these contributions separate. In this subsection D = d − 2 r D=d-2r D = d − 2 r is the minimum physical clearance between the support balls.
Proposition S18 (Capacity under approximate position-error correction). Let G = G m A m B \mathcal{G}=Gm_Am_B G = G m A m B , D = d − 2 r > 0 D=d-2r>0 D = d − 2 r > 0 , and let H L H_L H L be the Newtonian Hamiltonian compressed to two fixed codes. Its ideal coherent capacity satisfies
C E ( H L ) ≤ β G ℏ [ 16 δ A δ B r 2 D 3 + 8 2 ( δ A + δ B ) r 4 D 5 + 20 r 6 D 7 ] . (151) C_E(H_L)\leq\frac{\beta\mathcal{G}}{\hbar}\left[\frac{16\delta_A\delta_Br^2}{D^3}+\frac{8\sqrt{2}(\delta_A+\delta_B)r^4}{D^5}+\frac{20r^6}{D^7}\right]. \tag*{(151)} C E ( H L ) ≤ ℏ β G [ D 3 16 δ A δ B r 2 + D 5 8 2 ( δ A + δ B ) r 4 + D 7 20 r 6 ] . (151) If a calibration recovery R \mathcal{R} R has worst-case entanglement infidelity
ε F = 1 − inf Ψ ⟨ Ψ ∣ [ ( R N P ) ⊗ id ] ( Ψ ) ∣ Ψ ⟩ , (152) \varepsilon_F=1-\inf_{\Psi}\langle\Psi|[(\mathcal{R}\mathcal{N}_P)\otimes\operatorname{id}](\Psi)|\Psi\rangle, \tag*{(152)} ε F = 1 − Ψ inf ⟨ Ψ∣ [( R N P ) ⊗ id ] ( Ψ ) ∣Ψ ⟩ , (152) then δ P ≤ ε F \delta_P\leq\sqrt{\varepsilon_F} δ P ≤ ε F . The infimum is over pure states of the logical input and a reference. The capacity in Eq. (151) concerns the coherent compressed Hamiltonian, not its capacity in the presence of residual logical noise.
Proof. Choose a minimizing σ \sigma σ in Eq. (150) and write D = N ^ P − σ Tr \mathcal{D}=\widehat{\mathcal{N}}_P-\sigma\operatorname{Tr} D = N P − σ Tr . Complete norm duality gives ∥ D ∗ ∥ c b = ∥ D ∥ ⋄ = 2 δ P \|\mathcal{D}^*\|_{\mathrm{cb}}=\|\mathcal{D}\|_\diamond=2\delta_P ∥ D ∗ ∥ cb = ∥ D ∥ ⋄ = 2 δ P , where ∥ ⋅ ∥ c b \|\cdot\|_{\mathrm{cb}} ∥ ⋅ ∥ cb is the completely bounded operator norm. We use this identity to bound compressed position moments by environmental observables. The off-diagonal Kraus blocks contain first moments and the position–position blocks contain second moments. In the environment let ∣ t θ ⟩ = cos θ ∣ x ⟩ + sin θ ∣ y ⟩ \lvert t_\theta\rangle=\cos\theta\lvert x\rangle+\sin\theta\lvert y\rangle ∣ t θ ⟩ = cos θ ∣ x ⟩ + sin θ ∣ y ⟩ , which is orthogonal to the Kraus labels ∣ 0 ⟩ \lvert0\rangle ∣ 0 ⟩ and ∣ z ⟩ \lvert z\rangle ∣ z ⟩ . The following four self-adjoint observables select the real and imaginary parts of the first and second harmonic moments in direction θ \theta θ :
H 1 , R = ∣ 0 ⟩ ⟨ z ∣ + ∣ z ⟩ ⟨ 0 ∣ , H 1 , I = ∣ 0 ⟩ ⟨ t θ ∣ + ∣ t θ ⟩ ⟨ 0 ∣ , H_{1,R}=\lvert0\rangle\langle z\rvert+\lvert z\rangle\langle0\rvert,\qquad H_{1,I}=\lvert0\rangle\langle t_\theta\rvert+\lvert t_\theta\rangle\langle0\rvert, H 1 , R = ∣ 0 ⟩ ⟨ z ∣ + ∣ z ⟩ ⟨ 0 ∣ , H 1 , I = ∣ 0 ⟩ ⟨ t θ ∣ + ∣ t θ ⟩ ⟨ 0 ∣ ,
H 2 , R = 2 ( ∣ z ⟩ ⟨ z ∣ − ∣ t θ ⟩ ⟨ t θ ∣ ) , H 2 , I = 2 ( ∣ z ⟩ ⟨ t θ ∣ + ∣ t θ ⟩ ⟨ z ∣ ) . H_{2,R}=2(\lvert z\rangle\langle z\rvert-\lvert t_\theta\rangle\langle t_\theta\rvert),\qquad H_{2,I}=2(\lvert z\rangle\langle t_\theta\rvert+\lvert t_\theta\rangle\langle z\rvert). H 2 , R = 2 (∣ z ⟩ ⟨ z ∣ − ∣ t θ ⟩ ⟨ t θ ∣) , H 2 , I = 2 (∣ z ⟩ ⟨ t θ ∣ + ∣ t θ ⟩ ⟨ z ∣) .
To retain a dimension-independent bound, we bound each real–imaginary pair as one operator column. Its norm is the square root of the norm of the sum of the two component squares, giving
∥ ( H 1 , R H 1 , I ) ∥ = 2 , ∥ ( H 2 , R H 2 , I ) ∥ = 2 2 . \left\|\begin{pmatrix}H_{1,R}\\H_{1,I}\end{pmatrix}\right\|=\sqrt{2},\qquad\left\|\begin{pmatrix}H_{2,R}\\H_{2,I}\end{pmatrix}\right\|=2\sqrt{2}. ( H 1 , R H 1 , I ) = 2 , ( H 2 , R H 2 , I ) = 2 2 .
Indeed, their sums of squares are respectively 2 ∣ 0 ⟩ ⟨ 0 ∣ + ∣ z ⟩ ⟨ z ∣ + ∣ t θ ⟩ ⟨ t θ ∣ 2|0\rangle\langle0|+|z\rangle\langle z|+|t_\theta\rangle\langle t_\theta| 2∣0 ⟩ ⟨ 0∣ + ∣ z ⟩ ⟨ z ∣ + ∣ t θ ⟩ ⟨ t θ ∣ and 8 ( ∣ z ⟩ ⟨ z ∣ + ∣ t θ ⟩ ⟨ t θ ∣ ) 8(|z\rangle\langle z|+|t_\theta\rangle\langle t_\theta|) 8 ( ∣ z ⟩ ⟨ z ∣ + ∣ t θ ⟩ ⟨ t θ ∣ ) . Put q θ = x z + i ( x x cos θ + x y sin θ ) q_\theta=x_z+i(x_x\cos\theta+x_y\sin\theta) q θ = x z + i ( x x cos θ + x y sin θ ) . The complementary 0 j 0j 0 j and i j ij ij blocks contain W † X j W / 2 W^\dagger X_jW/2 W † X j W /2 and W † X i X j W / 2 W^\dagger X_iX_jW/2 W † X i X j W /2 . Thus applying D ∗ \mathcal{D}^* D ∗ to the displayed columns gives the real and imaginary parts of W † ( q θ / r ) n W W^\dagger(q_\theta/r)^nW W † ( q θ / r ) n W , for n = 1 , 2 n=1,2 n = 1 , 2 , after subtracting their appropriate scalar values. Complete norm duality, including its rectangular-column amplification, consequently gives
a 1 ≤ 2 2 δ P r , a 2 ≤ 4 2 δ P r 2 , (153) a_1\leq2\sqrt{2}\,\delta_P r,\qquad a_2\leq4\sqrt{2}\,\delta_P r^2, \tag*{(153)} a 1 ≤ 2 2 δ P r , a 2 ≤ 4 2 δ P r 2 , (153)
where a n a_n a n is the norm of the column of centered real and imaginary parts. These are complete-norm estimates, not entrywise moment estimates. For n ≥ 3 n\geq3 n ≥ 3 no subtraction is needed: compression of ∣ q θ ∣ ≤ r |q_\theta|\leq r ∣ q θ ∣ ≤ r gives a n ≤ r n a_n\leq r^n a n ≤ r n .
The Newtonian Laplace representation contains compressed exponentials of q θ q_\theta q θ . Subtract their scalar terms through order two, which affect only local Hamiltonians in the separated product. With s ≥ 0 s\geq0 s ≥ 0 the Laplace variable and x = s r x=sr x = sr , the moment bounds give the real–imaginary column norm at most
2 2 δ P ( x + x 2 ) + ∑ n ≥ 3 x n n ! ≤ e x ( 2 2 δ P x + x 3 6 ) . 2\sqrt{2}\,\delta_P(x+x^2)+\sum_{n\geq3}\frac{x^n}{n!}\leq e^x\left(2\sqrt{2}\,\delta_Px+\frac{x^3}{6}\right). 2 2 δ P ( x + x 2 ) + n ≥ 3 ∑ n ! x n ≤ e x ( 2 2 δ P x + 6 x 3 ) .
Subtracting a scalar factor on either side changes the separated Newtonian interaction only by local terms. Apply the real sum-of-squares entropy-rate bound to both angular components together, then integrate the two column bounds against e − D s e^{-Ds} e − D s . The three terms use ∫ 0 ∞ s n e − D s d s = n ! / D n + 1 \int_0^\infty s^n e^{-Ds}\,ds=n!/D^{n+1} ∫ 0 ∞ s n e − D s d s = n ! / D n + 1 for n = 2 , 4 , 6 n=2,4,6 n = 2 , 4 , 6 . Their coefficients are 16, 8 2 8\sqrt{2} 8 2 and 20, proving Eq. (151) without a dimension factor.
For the last assertion, use the root-fidelity convention in the complementary-channel recovery theorem of Bény and Oreshkov [37 ] . A recovery with the displayed squared entanglement infidelity gives worst-case root fidelity at least 1 − ϵ F \sqrt{1-\epsilon_F} 1 − ϵ F . Their theorem gives one constant environmental channel with at least the same worst-case fidelity. The state fidelity–trace-distance inequality, uniformly including references, then gives δ P ≤ ϵ F \delta_P\leq\sqrt{\epsilon_F} δ P ≤ ϵ F . For each finite code, N P \mathcal{N}_P N P has output support of dimension at most five times the code dimension, so the finite-dimensional theorem applies even when the physical wavefunctions have continuous support.
Finite-energy codes attaining the correction-precision scaling
We now construct codes whose retained coherent interaction has both the d − 7 d^{-7} d − 7 exact-correction term and a dipole term proportional to the allowed calibration infidelity. A small imbalance in reflected packet weights changes the first moment while preserving scalar second moments. Let ℓ = r / 2 \ell=r/2 ℓ = r /2 , and choose one normalized radial smooth packet with support radius w < r / 8 w<r/8 w < r /8 . Translate it to the four disjoint centers ℓ , − ℓ , ℓ / 2 , − ℓ / 2 \ell,-\ell,\ell/2,-\ell/2 ℓ , − ℓ , ℓ /2 , − ℓ /2 on the axis. Write ∣ z ⟩ |z\rangle ∣ z ⟩ for the packet centered at z ^ z \hat{z}z z ^ z , and let v v v be its variance in each coordinate. Define
∣ 0 t ⟩ = 1 + 2 t 3 ∣ ℓ ⟩ + 2 − 2 t 3 ∣ − ℓ / 2 ⟩ , ∣ 1 t ⟩ = Reflection ∣ 0 t ⟩ , 0 ≤ t ≤ 1 2 . (154) |0_t\rangle=\sqrt{\frac{1+2t}{3}}|\ell\rangle+\sqrt{\frac{2-2t}{3}}|-\ell/2\rangle,\qquad|1_t\rangle=\operatorname{Reflection}|0_t\rangle,\qquad0\leq t\leq\frac{1}{2}. \tag*{(154)} ∣ 0 t ⟩ = 3 1 + 2 t ∣ ℓ ⟩ + 3 2 − 2 t ∣ − ℓ /2 ⟩ , ∣ 1 t ⟩ = Reflection ∣ 0 t ⟩ , 0 ≤ t ≤ 2 1 . (154)
Their supports lie inside the balls. Packet width and kinetic energy can remain fixed as t t t and d d d vary. On the encoded qubit,
W † X z W = μ Z , W † X z 2 W = b I , μ = t ℓ / r , b = ( 1 + t ) ℓ 2 / 2 + v r 2 . W^\dagger X_zW=\mu Z,\qquad W^\dagger X_z^2W=bI,\qquad\mu=t\ell/r,\qquad b=\frac{(1+t)\ell^2/2+v}{r^2}. W † X z W = μ Z , W † X z 2 W = b I , μ = t ℓ / r , b = r 2 ( 1 + t ) ℓ 2 /2 + v .
The transverse first moments and mixed second moments vanish, while W † X x 2 W = W † X y 2 W = ( v / r 2 ) I W^\dagger X_x^2W=W^\dagger X_y^2W=(v/r^2)I W † X x 2 W = W † X y 2 W = ( v / r 2 ) I . All off-diagonal logical matrix elements vanish by disjoint support.
Only the complementary 0 z 0z 0 z and z 0 z0 z 0 blocks depend on the logical input. With H 0 z = ∣ 0 ⟩ ⟨ z ∣ + ∣ z ⟩ ⟨ 0 ∣ H_{0z}=|0\rangle\langle z|+|z\rangle\langle0| H 0 z = ∣0 ⟩ ⟨ z ∣ + ∣ z ⟩ ⟨ 0∣ , the difference from the midpoint constant channel is
D ( ρ ) = μ 2 Tr ( Z ρ ) H 0 z . \mathcal{D}(\rho)=\frac{\mu}{2}\operatorname{Tr}(Z\rho)H_{0z}. D ( ρ ) = 2 μ Tr ( Z ρ ) H 0 z .
Its diamond norm is μ \mu μ : the functional has complete norm one and ∥ H 0 z ∥ 1 = 2 \lVert H_0 z\rVert_1 = 2 ∥ H 0 z ∥ 1 = 2 . Conversely, the two logical basis states give environment outputs separated by trace norm 2 μ 2\mu 2 μ , so no constant channel has diamond distance smaller than μ \mu μ from both. Hence
δ P = μ / 2. (155) \delta_P = \mu/2. \tag*{(155)} δ P = μ /2. (155)
The environmental defect measures distinguishability, but we also need a recovery whose infidelity has the claimed order. Split the z z z error into its component inside the code and an orthogonal error isometry E z E_z E z :
X z W = μ W Z + b − μ 2 E z , W † E z = 0 , E z † E z = I . X_z W = \mu W Z + \sqrt{b-\mu^2}E_z,\qquad W^\dagger E_z = 0,\qquad E_z^\dagger E_z = I. X z W = μ W Z + b − μ 2 E z , W † E z = 0 , E z † E z = I .
The normalized X x W X_xW X x W , X y W X_yW X y W and E z E_z E z are mutually orthogonal error isometries, all orthogonal to W W W . The flagged failure map has scalar squared norm and an orthogonal output flag, so it is another correctable isometry. Project onto these syndrome ranges and map each isometry back to the code; complete the map arbitrarily on their orthogonal complement. This is a trace-preserving recovery that fixes the code. It gives exactly
R N P = ( 1 − μ 2 / 2 ) i d + ( μ 2 / 2 ) Z ( ⋅ ) Z , ϵ F = μ 2 / 2 = 2 δ P 2 . (156) \mathcal{R} \mathcal{N}_P = (1-\mu^2/2)\mathrm{id}+(\mu^2/2)Z(\cdot)Z,\qquad\epsilon_F=\mu^2/2=2\delta_P^2. \tag*{(156)} R N P = ( 1 − μ 2 /2 ) id + ( μ 2 /2 ) Z ( ⋅ ) Z , ϵ F = μ 2 /2 = 2 δ P 2 . (156)
The minimum fidelity is reached by a logical state with zero Z Z Z expectation, including a maximally entangled input. This recovery is certified explicitly; its global optimality is not needed or asserted.
The compressed Newtonian Hamiltonian is diagonal. Radial averaging of the nonsingular Newtonian kernel, first over one packet and then the other, gives exactly the potential between their centers. Let m j m_j m j be the half-difference of the two logical distributions’ centre moments. These moment coefficients, indexed by degree j j j , are distinct from the physical masses m A , m B m_A,m_B m A , m B . Even m j m_j m j vanish, and for odd j j j ,
m j = ℓ j 3 [ ( 1 + 2 t ) − 2 − 2 t 2 j ] ≥ 0 , m 1 = t ℓ , m 3 = ( 1 + 3 t ) ℓ 3 / 4. m_j=\frac{\ell^j}{3}\left[(1+2t)-\frac{2-2t}{2^j}\right]\ge0,\qquad m_1=t\ell,\qquad m_3=(1+3t)\ell^3/4. m j = 3 ℓ j [ ( 1 + 2 t ) − 2 j 2 − 2 t ] ≥ 0 , m 1 = t ℓ , m 3 = ( 1 + 3 t ) ℓ 3 /4.
All surviving odd moment coefficients are nonnegative, so the terms of the convergent centre expansion add with the same sign. Keeping just the dipole–dipole and cubic–cubic terms gives the positive Ising energy
J t = G ∑ j , k ≥ 1 j , k o d d ( j + k j ) m j m k d j + k + 1 ≥ 2 G m 1 2 d 3 + 20 G m 3 2 d 7 . J_t=\mathcal{G}\sum_{\substack{j,k\ge1\\ j,k\ \mathrm{odd}}}\binom{j+k}{j}\frac{m_jm_k}{d^{j+k+1}}\ge\frac{2\mathcal{G}m_1^2}{d^3}+\frac{20\mathcal{G}m_3^2}{d^7}. J t = G j , k ≥ 1 j , k odd ∑ ( j j + k ) d j + k + 1 m j m k ≥ d 3 2 G m 1 2 + d 7 20 G m 3 2 .
Choose t = 2 2 ϵ t=2\sqrt{2}\epsilon t = 2 2 ϵ for 0 ≤ ϵ ≤ 1 / 32 0\le\epsilon\le1/32 0 ≤ ϵ ≤ 1/32 . Equation (S146) has infidelity exactly ϵ \epsilon ϵ , while
J t ≥ 4 G ϵ r 2 d 3 + 5 G 256 ϵ r 6 d 7 . (157) J_t\ge4\mathcal{G}\epsilon\frac{r^2}{d^3}+\frac{5\mathcal{G}}{256}\epsilon\frac{r^6}{d^7}. \tag*{(157)} J t ≥ 4 G ϵ d 3 r 2 + 256 5 G ϵ d 7 r 6 . (157)
Let C c o m p , o p t ( ϵ ; r , d ) C_{\mathrm{comp,opt}}(\epsilon;r,d) C comp , opt ( ϵ ; r , d ) denote the supremum of coherent compressed-Hamiltonian capacity over codes for which each local calibration admits recovery infidelity at most ϵ \epsilon ϵ . For d ≥ 4 r d\ge4r d ≥ 4 r and 0 ≤ ϵ ≤ 1 / 32 0\le\epsilon\le1/32 0 ≤ ϵ ≤ 1/32 , the upper bound and the four-packet construction yield
C c o m p , o p t ( ϵ ; r , d ) ≍ G ℏ ( r 6 d 7 + ϵ r 2 d 3 ) . (158) C_{\mathrm{comp,opt}}(\epsilon;r,d)\asymp\frac{\mathcal{G}}{\hbar}\left(\frac{r^6}{d^7}+\epsilon\frac{r^2}{d^3}\right). \tag*{(158)} C comp , opt ( ϵ ; r , d ) ≍ ℏ G ( d 7 r 6 + ϵ d 3 r 2 ) . (158)
For example, a common lower constant is 5 β / 256 5\beta/256 5 β /256 and a common upper constant is β ( 2560 + 256 2 ) \beta(2560+256\sqrt{2}) β ( 2560 + 256 2 ) , independent of dimensions, separation and tolerance. For the upper bound, use D ≥ d / 2 D\ge d/2 D ≥ d /2 , δ A , δ B ≤ ϵ \delta_A,\delta_B\le\sqrt{\epsilon} δ A , δ B ≤ ϵ and the arithmetic–geometric mean inequality on the mixed term. The lower bound uses the established Ising capacity β J t / ℏ \beta J_t/\hbar β J t /ℏ , with seed preparation charged.
Thus a uniform guarantee of the exact-correction d 7 d^7 d 7 order requires calibration tolerance ϵ = O ( ( r / d ) 4 ) \epsilon=O((r/d)^4) ϵ = O (( r / d ) 4 ) ; in the complementary norm its corresponding worst-case order is δ = O ( ( r / d ) 2 ) \delta=O((r/d)^2) δ = O (( r / d ) 2 ) . Necessity here concerns the class of all admitted codes, not every individual code or every chosen recovery. For the physical generator γ ∑ j D [ X j ] \gamma\sum_j \mathcal{D}[X_j] γ ∑ j D [ X j ] , the same syndrome recovery leaves the logical generator γ μ 2 D [ Z ] \gamma\mu^2\mathcal{D}[Z] γ μ 2 D [ Z ] in the infinitely frequent recovery limit. The restored dipole therefore brings residual noise as well as coherent signal. Equation (S148) is not an achievable noisy-throughput statement or a complete-cycle control-error budget.
Information lost through an exposed radiative reset
A recovery must remove its syndrome without revealing the logical state. We can quantify the lost information by asking how much logical coherence any deterministic recovery can restore after a photon escapes. The following calculation answers this question for one reset model. During an unobserved isotropic emission of one photon of wave number k k k , suppose the logical information remains in the alternating three-vertex states of a radius-ρ \rho ρ hexagon. The point-mode photon channel multiplies a spatial coherence between vertices q i \mathbf{q}_i q i and q j \mathbf{q}_j q j by sinc ( k ∣ q i − q j ∣ ) \operatorname{sinc}(k\lvert\mathbf{q}_i-\mathbf{q}_j\rvert) sinc ( k ∣ q i − q j ∣) , where sinc z = sin z / z \operatorname{sinc} z = \sin z/z sinc z = sin z / z and its value at zero is one. This is a specified emission channel, not a model of every possible syndrome reset.
The photon preserves the populations on the two disjoint vertex sets but suppresses their cross coherence. The trace norm of the resulting cross-coherence matrix will determine the best recovery. We use entanglement fidelity with a maximally entangled logical reference, so perfect recovery has fidelity one.
Proposition S19 (Optimal recovery after an exposed photon). Let C C C be the 3 × 3 3 \times3 3 × 3 matrix of photon coherence factors between the even and odd vertices. Optimizing over all deterministic local recovery channels, the entanglement fidelity of the recovered logical qubit is
F e , o p t = 1 2 + ∥ C ∥ 1 6 = 1 + η p h 2 , η p h = ∣ 4 sinc z − sinc ( 2 z ) ∣ 3 , z = k ρ . (159) F_{\mathrm{e,opt}} = \frac{1}{2} + \frac{\lVert C\rVert_1}{6} = \frac{1+\eta_{\mathrm{ph}}}{2}, \qquad\eta_{\mathrm{ph}} = \frac{\lvert4\operatorname{sinc} z-\operatorname{sinc}(2z)\rvert}{3}, \qquad z=k\rho. \tag*{(159)} F e , opt = 2 1 + 6 ∥ C ∥ 1 = 2 1 + η ph , η ph = 3 ∣ 4 sinc z − sinc ( 2 z )∣ , z = k ρ . (159) The smallest half-diamond distance from the ideal logical identity is ( 1 − η p h ) / 2 (1-\eta_{\mathrm{ph}})/2 ( 1 − η ph ) /2 . For z > 0 z>0 z > 0 , η p h ≤ min { 1 , 3 / ( 2 z ) } \eta_{\mathrm{ph}} \le\min\{1,3/(2z)\} η ph ≤ min { 1 , 3/ ( 2 z )} .
Proof. Let H 0 , H 1 \mathcal{H}_0,\mathcal{H}_1 H 0 , H 1 be the orthogonal even- and odd-vertex spaces. The channel sends the logical off-diagonal operator to C / 3 C/3 C /3 from H 1 \mathcal{H}_1 H 1 to H 0 \mathcal{H}_0 H 0 , and the two logical populations to normalized states on their respective spaces. For any recovery, each population contribution to entanglement fidelity is at most one. The adjoint recovery is unital and completely positive, so the relevant block of its image of ∣ 1 ⟩ ⟨ 0 ∣ \lvert1\rangle\langle0\rvert ∣ 1 ⟩ ⟨ 0 ∣ has operator norm at most one. The coherence contribution is therefore at most ∥ C ∥ 1 / 3 \lVert C\rVert_1/3 ∥ C ∥ 1 /3 . These two bounds give F e ≤ 1 / 2 + ∥ C ∥ 1 / 6 F_{\mathrm{e}} \le1/2+\lVert C\rVert_1/6 F e ≤ 1/2 + ∥ C ∥ 1 /6 .
To attain the coherence bound, align each left and right singular vector of C C C with the corresponding logical basis vector. For a singular-value decomposition C = ∑ j s j ∣ u j ⟩ ⟨ v j ∣ C=\sum_j s_j\lvert u_j\rangle\langle v_j\rvert C = ∑ j s j ∣ u j ⟩ ⟨ v j ∣ , take recovery Kraus operators R j = ∣ 0 ⟩ ⟨ u j ∣ + ∣ 1 ⟩ ⟨ v j ∣ R_j=\lvert0\rangle\langle u_j\rvert+\lvert1\rangle\langle v_j\rvert R j = ∣ 0 ⟩ ⟨ u j ∣ + ∣ 1 ⟩ ⟨ v j ∣ . They are complete on the six modes, preserve both populations, and retain coherence ∑ j s j / 3 \sum_j s_j/3 ∑ j s j /3 . Thus the bound is attained by a logical dephasing channel. Testing its Choi state against the ideal Bell projector proves the corresponding lower bound on half-diamond distance; the attaining dephasing channel has exactly that distance.
Order the odd vertices opposite the even vertices. With a = sinc z a=\operatorname{sinc}z a = sinc z and b = sinc ( 2 z ) = a cos z b=\operatorname{sinc}(2z)=a\cos z b = sinc ( 2 z ) = a cos z , we have C = a J + ( b − a ) I C=aJ+(b-a)I C = a J + ( b − a ) I , where J J J is the all-ones matrix. Its eigenvalues are b + 2 a , b − a , b − a b+2a,b-a,b-a b + 2 a , b − a , b − a , giving ∥ C ∥ 1 = ∣ a ∣ ( 4 − cos z ) = ∣ 4 sinc z − sinc ( 2 z ) ∣ \lVert C\rVert_1=\lvert a\rvert(4-\cos z)=\lvert4\operatorname{sinc}z-\operatorname{sinc}(2z)\rvert ∥ C ∥ 1 = ∣ a ∣ ( 4 − cos z ) = ∣ 4 sinc z − sinc ( 2 z )∣ . Finally ∣ 4 sin z − 1 2 sin 2 z ∣ ≤ 9 / 2 \lvert4\sin z-\frac{1}{2}\sin2z\rvert\le9/2 ∣ 4 sin z − 2 1 sin 2 z ∣ ≤ 9/2 proves the stated bound. □ \square □
A reset may emit only occasionally, without revealing which cycles emitted. If the photon occurs with input-independent probability p p h p_{\mathrm{ph}} p ph and otherwise the channel is the identity, the same recovery must act on both possibilities. Linearity of entanglement fidelity and the bound for one emitted photon give, for every such recovery,
1 2 ∥ R [ ( 1 − p p h ) id + p p h D p h ] E − id L ∥ ⋄ ≥ p p h ( 1 − η p h ) 2 . (160) \frac{1}{2}\left\lVert\mathcal{R}\left[(1-p_{\mathrm{ph}})\operatorname{id}+p_{\mathrm{ph}}\mathcal{D}_{\mathrm{ph}}\right]\mathcal{E}-\operatorname{id}_{L}\right\rVert_{\diamond}\ge\frac{p_{\mathrm{ph}}(1-\eta_{\mathrm{ph}})}{2}. \tag*{(160)} 2 1 ∥ R [ ( 1 − p ph ) id + p ph D ph ] E − id L ∥ ⋄ ≥ 2 p ph ( 1 − η ph ) . (160)
Here E \mathcal{E} E encodes the logical qubit. An exact common-recovery formula follows by replacing C \mathcal{C} C with C p = ( 1 − p p h ) J + p p h C \mathcal{C}_p=(1-p_{\mathrm{ph}})\mathcal{J}+p_{\mathrm{ph}}\mathcal{C} C p = ( 1 − p ph ) J + p ph C in Eq. (159) . Thus the bound does not assume that the recovery knows whether a photon was emitted. For ρ = 125 μ m \rho=125\,\mu\mathrm{m} ρ = 125 μ m and wavelength 800 n m 800\,\mathrm{nm} 800 nm , η p h = 0.00135812218 … \eta_{\mathrm{ph}}=0.00135812218\ldots η ph = 0.00135812218 … and F e , o p t = 0.50067906109 … F_{\mathrm{e,opt}}=0.50067906109\ldots F e , opt = 0.50067906109 … . An isolated reset error at most 10 − 6 10^{-6} 1 0 − 6 relative to logical identity therefore requires p p h ≤ 2.00272 × 10 − 6 p_{\mathrm{ph}}\leq2.00272\times10^{-6} p ph ≤ 2.00272 × 1 0 − 6 .
This last comparison is to an ideal reset. It must not be equated without further calculation to the complete-cycle error ϵ \epsilon ϵ relative to a noisy reference cycle. For example, a preceding reference dephasing with coherence factor s s s multiplies the additional channel distance by s s s . Nor does a single-cycle lower bound alone imply an accumulated decay rate. An exponential decay requires a specified independent, input-independent event process and repeated re-encoding into the same exposed logical basis.
There is a controlled finite-width extension. Suppose the six normalized packets have disjoint supports and mean-square displacements from their centres at most σ 2 \sigma^2 σ 2 . Compare the true recoil unitary e i k n ⋅ X e^{i\mathbf{k}\mathbf{n}\cdot\mathbf{X}} e i kn ⋅ X with its branch-centre value. Averaging ∣ e i u − 1 ∣ 2 ≤ u 2 \lvert e^{iu}-1\rvert^2\leq u^2 ∣ e i u − 1 ∣ 2 ≤ u 2 over isotropic directions gives a Stinespring-isometry distance at most k σ / 3 k\sigma/\sqrt{3} k σ / 3 , uniformly over logical inputs and references. The channel half-diamond distance, and hence the change in optimized entanglement fidelity, is at most this quantity. The point-mode bound remains informative when this allowance is small. Transferring the logical information to an unaffected local system before emission changes the encoding and avoids the premise of this obstruction; realizing that transfer and reset remains a control problem.
Further geometry, energy and confinement results
The main capacity and mean-time results leave several distinct resource questions. A bound on every history’s duration permits a different statistical converse; a common kinetic-energy budget prevents arbitrarily sharp endpoint localization; finite barriers require control of leakage; and near-contact geometry can favour more than two spatial levels. We establish these extensions with their respective assumptions. The collinear decomposition comes first because it supplies the exact interaction strength used by both time and energy bounds.
Confined Newtonian interaction and confidence at bounded time
We first impose a hard bound on the interaction duration of every history, including histories selected by feedback. For collinear supports, the full Newtonian potential gives an exponential bound on the power of a test with prescribed size. The position domain is a finite nonlocal interaction strength after local gravitational phases have been removed. We evaluate that strength exactly and use it to bound the final state’s departure from the separable set. The statistical conversion is an instance of the established max-relative-entanglement method for bipartite interactions[38 ] ; product-decomposition growth estimates also underlie Hamiltonian circuit-cutting bounds[39 ] .
Let G = G m A m B \mathcal{G}=Gm_A m_B G = G m A m B , ∣ x A ∣ ≤ ℓ A \lvert x_A\rvert\leq\ell_A ∣ x A ∣ ≤ ℓ A , ∣ x B ∣ ≤ ℓ B \lvert x_B\rvert\leq\ell_B ∣ x B ∣ ≤ ℓ B , and d min = d − ℓ A − ℓ B > 0 d_{\min}=d-\ell_A-\ell_B>0 d m i n = d − ℓ A − ℓ B > 0 , throughout all interaction and local-control steps. The only quantum interaction between the laboratories is V = − G / ( d + x B − x A ) V=-\mathcal{G}/(d+x_B-x_A) V = − G / ( d + x B − x A ) . We allow initially separable local memories, local instruments and classical feedback, with all flags retained. A final effect 0 ≤ M ≤ I 0\leq M\leq I 0 ≤ M ≤ I has size at most α \alpha α on every separable state of the complete laboratories and power p > α p>\alpha p > α on the actual output. The effect M M M includes the trusted verification measurement, evaluated on the laboratories before readout. Reading only an already produced acceptance flag would have all-separable size one. All logarithms below are natural unless a base is displayed.
The nonlocal strength of the full potential
A local phase cannot entangle the laboratories, so we remove it before bounding the interaction. In the Laplace representation of the reciprocal separation, the two position factors are e s x A e^{s x_A} e s x A and e − s x B e^{-s x_B} e − s x B , with s ≥ 0 s \ge0 s ≥ 0 of units inverse length. Subtracting each factor’s spectral midpoint minimizes its operator norm. Define
A s = e s x A − cosh ( s ℓ A ) I , B s = e − s x B − cosh ( s ℓ B ) I . A_s = e^{s x_A} - \cosh(s\ell_A)I,\qquad B_s = e^{-s x_B} - \cosh(s\ell_B)I. A s = e s x A − cosh ( s ℓ A ) I , B s = e − s x B − cosh ( s ℓ B ) I .
Their norms are sinh ( s ℓ A ) \sinh(s\ell_A) sinh ( s ℓ A ) and sinh ( s ℓ B ) \sinh(s\ell_B) sinh ( s ℓ B ) . Expanding the product gives V = V A ⊗ I + I ⊗ V B + V i n t V = V_A \otimes I + I \otimes V_B + V_{\mathrm{int}} V = V A ⊗ I + I ⊗ V B + V int , up to a scalar, with
V i n t = − G ∫ 0 ∞ e − s d A s ⊗ B s d s . (161) V_{\mathrm{int}} = -\mathcal{G} \int_0^\infty e^{-sd} A_s \otimes B_s\,\mathrm{d}s. \tag*{(161)} V int = − G ∫ 0 ∞ e − s d A s ⊗ B s d s . (161)
Every integral is bounded because d min > 0 d_{\min} > 0 d m i n > 0 . After centering, the integral of the product norms bounds the strength that can generate entanglement. Dividing by ℏ \hbar ℏ defines its frequency κ \kappa κ :
κ = G ℏ ∫ 0 ∞ e − s d sinh ( s ℓ A ) sinh ( s ℓ B ) d s = G 4 ℏ [ 1 d − ℓ A − ℓ B + 1 d + ℓ A + ℓ B − 1 d − ℓ A + ℓ B − 1 d + ℓ A − ℓ B ] . (162) \begin{aligned}
\kappa= \frac{\mathcal{G}}{\hbar}\int_0^\infty e^{-sd}\sinh(s\ell_A)\sinh(s\ell_B)\,\mathrm{d}s \\
&= \frac{\mathcal{G}}{4\hbar}\left[\frac{1}{d-\ell_A-\ell_B}+\frac{1}{d+\ell_A+\ell_B}-\frac{1}{d-\ell_A+\ell_B}-\frac{1}{d+\ell_A-\ell_B}\right]. \tag*{(162)}
\end{aligned} κ = ℏ G ∫ 0 ∞ e − s d sinh ( s ℓ A ) sinh ( s ℓ B ) d s = 4ℏ G [ d − ℓ A − ℓ B 1 + d + ℓ A + ℓ B 1 − d − ℓ A + ℓ B 1 − d + ℓ A − ℓ B 1 ] . (162)
For small allowed displacements, κ = 2 G ℓ A ℓ B / ( ℏ d 3 ) + O [ G ℓ A ℓ B ( ℓ A 2 + ℓ B 2 ) / ( ℏ d 5 ) ] \kappa= 2\mathcal{G}\ell_A\ell_B/(\hbar d^3) + O[\mathcal{G}\ell_A\ell_B(\ell_A^2+\ell_B^2)/(\hbar d^5)] κ = 2 G ℓ A ℓ B / ( ℏ d 3 ) + O [ G ℓ A ℓ B ( ℓ A 2 + ℓ B 2 ) / ( ℏ d 5 )] . We use the full expression in all bounds below.
We can certify that no alternative subtraction of local terms lowers this product-norm sum. Evaluate the potential at the four support corners with alternating signs: every local function cancels, leaving a lower bound on any sum of product norms. Thus Eq. (162) is also the minimum product-norm sum of V / ℏ V/\hbar V /ℏ modulo local operators. Indeed, consider any representation by local summands and product terms ∑ j c j X j ⊗ Y j \sum_j c_j X_j \otimes Y_j ∑ j c j X j ⊗ Y j , including limits in the projective operator norm. The alternating expectation at the four support corners cancels the local summands and has magnitude at most 4 ∑ j ∣ c j ∣ ∥ X j ∥ ∥ Y j ∥ 4\sum_j |c_j|\|X_j\|\|Y_j\| 4 ∑ j ∣ c j ∣∥ X j ∥∥ Y j ∥ . For V / ℏ V/\hbar V /ℏ its value is 4 κ 4\kappa 4 κ . Smooth normalized packets approaching the corners justify these expectations without position eigenstates. Equation (161) attains the matching product-norm sum. If either ℓ A \ell_A ℓ A or ℓ B \ell_B ℓ B is zero, κ = 0 \kappa= 0 κ = 0 and the potential is local; the divisions by κ \kappa κ below concern positive widths.
A hard time budget, including adaptive histories
We follow subnormalized pure branches so that local filtering cannot hide its failure probability. For a bipartite vector with coefficient operator C C C , the nuclear norm ∥ C ∥ 1 \|C\|_1 ∥ C ∥ 1 is its sum of Schmidt amplitudes. This norm has a dimension-independent interaction bound and a useful averaged monotonicity under local instruments. Its square also equals the trace of an explicit separable positive operator that dominates the branch state. This converts its growth bound into a bound on any final test, without assuming that the output is close to a Bell state.
Theorem S20 (Confined Newtonian bound at a hard time budget). Under the supported interaction and separable-input assumptions above, suppose every history has total interaction duration at most T max T_{\max} T m a x . For any final test of size 0 < α < p ≤ 1 0 < \alpha< p \le1 0 < α < p ≤ 1 ,
p ≤ α e 2 κ T max , T max ≥ ln ( p / α ) 2 κ . (163) p \le\alpha e^{2\kappa T_{\max}},\qquad T_{\max} \ge\frac{\ln(p/\alpha)}{2\kappa}. \tag*{(163)} p ≤ α e 2 κ T m a x , T m a x ≥ 2 κ ln ( p / α ) . (163) The statement holds for finite protocols and their normal trace-norm limits with the same pathwise time bound and support constraint.
Proof. Remove local Hamiltonians in a local interaction picture. Their unitaries preserve the norms of the factors in Eq. (161) . The nuclear-norm ideal property, ∥ A C B T ∥ 1 ≤ ∥ A ∥ ∥ B ∥ ∥ C ∥ 1 \lVert ACB^{\mathsf{T}}\rVert_1 \le\lVert A\rVert\lVert B\rVert\lVert C\rVert_1 ∥ A C B T ∥ 1 ≤ ∥ A ∥ ∥ B ∥ ∥ C ∥ 1 , applied to the integral evolution equation gives
∥ C ( t + δ ) ∥ 1 ≤ e κ δ ∥ C ( t ) ∥ 1 . \lVert C(t+\delta)\rVert_1 \le e^{\kappa\delta}\lVert C(t)\rVert_1. ∥ C ( t + δ ) ∥ 1 ≤ e κ δ ∥ C ( t ) ∥ 1 .
This argument applies on the nuclear class and does not require differentiable Schmidt coefficients. We must also control the branches created by intermediate measurements. For a local Kraus family { K i } \{K_i\} { K i } , write C = ∑ j s j ∣ u j ⟩ ⟨ v ˉ j ∣ C=\sum_j s_j|u_j\rangle\langle\bar{v}_j| C = ∑ j s j ∣ u j ⟩ ⟨ v ˉ j ∣ , where s j ≥ 0 s_j\ge0 s j ≥ 0 . The triangle inequality and Kraus completeness give
∑ i ∥ K i C ∥ 1 2 ≤ ∑ j , k s j s k ∑ i ∥ K i u j ∥ ∥ K i u k ∥ ≤ ∑ j , k s j s k = ∥ C ∥ 1 2 . \begin{aligned}
\sum_i\lVert K_iC\rVert_1^2 \le\sum_{j,k}s_js_k\sum_i\lVert K_iu_j\rVert\lVert K_iu_k\rVert\\
&\le\sum_{j,k}s_js_k=\lVert C\rVert_1^2.
\end{aligned} i ∑ ∥ K i C ∥ 1 2 ≤ j , k ∑ s j s k i ∑ ∥ K i u j ∥ ∥ K i u k ∥ ≤ j , k ∑ s j s k = ∥ C ∥ 1 2 .
The second inequality is Cauchy–Schwarz over i i i . The same proof applies to operations in Bob’s laboratory. Thus local instruments cannot increase the sum over outcomes, even though a normalized selected outcome can have more entanglement.
Let C h C_h C h describe a subnormalized branch and t h t_h t h its accumulated interaction duration. The discounted sum ∑ h e − 2 κ t h ∥ C h ∥ 1 2 \sum_h e^{-2\kappa t_h}\lVert C_h\rVert_1^2 ∑ h e − 2 κ t h ∥ C h ∥ 1 2 does not increase under either interaction or a local instrument. It starts at one for a pure-product decomposition of a separable input. The pathwise bound therefore implies ∑ h ∥ C h ∥ 1 2 ≤ e 2 κ T max \sum_h\lVert C_h\rVert_1^2\le e^{2\kappa T_{\max}} ∑ h ∥ C h ∥ 1 2 ≤ e 2 κ T m a x .
To turn the branch-norm estimate into a testing bound, we construct the separable dominator explicitly. For ∣ ψ h ⟩ = ∑ j s h j ∣ u h j v h j ⟩ |\psi_h\rangle=\sum_j s_{hj}|u_{hj}v_{hj}\rangle ∣ ψ h ⟩ = ∑ j s hj ∣ u hj v hj ⟩ , put S h = ∑ j s h j S_h=\sum_j s_{hj} S h = ∑ j s hj . Weighted Cauchy–Schwarz shows that the separable positive operator
T h = S h ∑ j s h j ∣ u h j v h j ⟩ ⟨ u h j v h j ∣ ≥ ∣ ψ h ⟩ ⟨ ψ h ∣ T_h=S_h\sum_j s_{hj}|u_{hj}v_{hj}\rangle\langle u_{hj}v_{hj}|\ge|\psi_h\rangle\langle\psi_h| T h = S h j ∑ s hj ∣ u hj v hj ⟩ ⟨ u hj v hj ∣ ≥ ∣ ψ h ⟩ ⟨ ψ h ∣
has trace S h 2 S_h^2 S h 2 . Summing over all histories, including their flags, gives a separable positive dominator of the output with trace at most e 2 κ T max e^{2\kappa T_{\max}} e 2 κ T m a x . The size bound on M M M gives Eq. (163) . General separable inputs follow by finite separable-mixture approximation. The final probability passes to trace-norm protocol limits because M M M is bounded.
The dominator also gives 1 + R g ( ρ ) ≤ e 2 κ T max 1+R_g(\rho)\le e^{2\kappa T_{\max}} 1 + R g ( ρ ) ≤ e 2 κ T m a x whenever the displayed branch construction is used, where R g R_g R g is generalized entanglement robustness. Equation (S153) requires a bound on every history. An expectation cannot replace T max T_{\max} T m a x in its exponential: a protocol may rarely run a long entangling sequence and otherwise stop immediately. The entropy argument in § 1.24 gives the bound whose cost is linear in expected time. For parallel interactions, the resource in this proof is the history-dependent sum ∫ ∑ j κ j ( t ) d t \int\sum_j\kappa_j(t)\,\mathrm{d}t ∫ ∑ j κ j ( t ) d t ; unlimited parallel pairs do not obey the same wall-clock bound as one pair.
When the endpoint construction applies to other potentials
The endpoint construction works because all the product interactions favour the same two local positions. We can identify this property directly from the potential. Let W ( x , y ) W(x,y) W ( x , y ) be a real C 2 C^2 C 2 interaction energy on [ x 0 , x 1 ] × [ y 0 , y 1 ] [x_0,x_1]\times[y_0,y_1] [ x 0 , x 1 ] × [ y 0 , y 1 ] , with both intervals of positive length. We keep the ideal local-control and supported-protocol convention of Proposition S2. In particular, local memories are free and packet energies may grow along an approximating sequence. The mixed derivative W x y W_{xy} W x y removes all terms that depend on only one position. We integrate its absolute value to bound the total strength of the remaining product interactions:
κ W a b s = 1 4 ℏ ∫ x 0 x 1 d u ∫ y 0 y 1 d v ∣ ∂ x ∂ y W ( u , v ) ∣ . (164) \kappa_W^{\mathrm{abs}}=\frac{1}{4\hbar}\int_{x_0}^{x_1}\mathrm{d}u\int_{y_0}^{y_1}\mathrm{d}v\,\lvert\partial_x\partial_yW(u,v)\rvert. \tag*{(164)} κ W abs = 4ℏ 1 ∫ x 0 x 1 d u ∫ y 0 y 1 d v ∣ ∂ x ∂ y W ( u , v )∣ . (164)
Proposition S21 (Capacity for a mixed derivative of fixed sign). The ideal entanglement capacity of W W W is at most β κ W a b s \beta\kappa_W^{\mathrm{abs}} β κ W abs . If ∂ x ∂ y W \partial_x\partial_y W ∂ x ∂ y W is everywhere nonnegative or everywhere nonpositive, then
C W = β κ W , κ W = ∣ W ( x 1 , y 1 ) + W ( x 0 , y 0 ) − W ( x 1 , y 0 ) − W ( x 0 , y 1 ) ∣ 4 ℏ = κ W a b s . (165) C_W=\beta\kappa_W,\qquad\kappa_W=\frac{\left|W(x_1,y_1)+W(x_0,y_0)-W(x_1,y_0)-W(x_0,y_1)\right|}{4\hbar}=\kappa_W^{\mathrm{abs}}. \tag*{(165)} C W = β κ W , κ W = 4ℏ ∣ W ( x 1 , y 1 ) + W ( x 0 , y 0 ) − W ( x 1 , y 0 ) − W ( x 0 , y 1 ) ∣ = κ W abs . (165) For κ W > 0 \kappa_W>0 κ W > 0 , the interaction is reversibly equivalent to ℏ κ W Z ⊗ Z \hbar\kappa_W Z\otimes Z ℏ κ W Z ⊗ Z in the closure of finite ideal-control protocols. If κ W = 0 \kappa_W=0 κ W = 0 under the sign condition, W W W is local.
Proof. We first separate the local terms by integrating the mixed derivative. For the position operators X , Y X,Y X , Y , let P u = 1 X ≥ u P_u=\mathbf{1}_{X\geq u} P u = 1 X ≥ u and Q v = 1 Y ≥ v Q_v=\mathbf{1}_{Y\geq v} Q v = 1 Y ≥ v be their spectral step projections. Integrating these steps reconstructs the potential from its mixed derivative; centering each projection removes only local terms. The fundamental theorem of calculus gives, modulo local operators,
W ( X , Y ) = ∫ x 0 x 1 d u ∫ y 0 y 1 d v W x y ( u , v ) ( P u − I / 2 ) ⊗ ( Q v − I / 2 ) . W(X,Y)=\int_{x_0}^{x_1}du\int_{y_0}^{y_1}dv\,W_{xy}(u,v)(P_u-I/2)\otimes(Q_v-I/2). W ( X , Y ) = ∫ x 0 x 1 d u ∫ y 0 y 1 d v W x y ( u , v ) ( P u − I /2 ) ⊗ ( Q v − I /2 ) .
Each centred projection has spectral diameter at most one and norm at most 1 / 2 1/2 1/2 . Thus the established product-Hamiltonian simulation and entropy-rate bounds[19 ] give the total Ising strength κ W a b s \kappa_W^{\mathrm{abs}} κ W abs and rate β κ W a b s \beta\kappa_W^{\mathrm{abs}} β κ W abs . For continuous positions, approximate X , Y X,Y X , Y by finite position grids. The error is bounded by
∥ W ( X , Y ) − W ( X δ , Y δ ) ∥ ≤ ∥ W x ∥ ∞ ∥ X − X δ ∥ + ∥ W y ∥ ∞ ∥ Y − Y δ ∥ . \left\|W(X,Y)-W(X_\delta,Y_\delta)\right\|\leq\left\|W_x\right\|_\infty\left\|X-X_\delta\right\|+\left\|W_y\right\|_\infty\left\|Y-Y_\delta\right\|. ∥ W ( X , Y ) − W ( X δ , Y δ ) ∥ ≤ ∥ W x ∥ ∞ ∥ X − X δ ∥ + ∥ W y ∥ ∞ ∥ Y − Y δ ∥ .
The finite-grid simulation therefore converges on each finite protocol, by the same channel-error argument as above.
When W x y W_{xy} W x y has one sign, its integral is the corner difference in Eq. (165) . On the two endpoint states, every centred projection restricts to the same Z / 2 Z/2 Z /2 , up to the common choice of basis order. Hence all terms add with the same sign and realize an Ising interaction of strength κ W \kappa_W κ W . Smooth stationary packets approaching these endpoints give the reverse simulation: the displayed derivative bound controls the potential variation over each branch rectangle, and Duhamel’s inequality controls the full evolution with the local kinetic terms retained. Each packet has finite energy. Choosing its width separately for each finite block proves equality and reversible simulation. If the corner difference vanishes under the sign condition, continuity implies W x y = 0 W_{xy}=0 W x y = 0 throughout, so W ( x , y ) = W ( x , y 0 ) + W ( x 0 , y ) − W ( x 0 , y 0 ) W(x,y)=W(x,y_0)+W(x_0,y)-W(x_0,y_0) W ( x , y ) = W ( x , y 0 ) + W ( x 0 , y ) − W ( x 0 , y 0 ) is local.
We can now see why an axial result need not extend to two displaced parallel lines. For transverse separation b ≥ 0 b\geq0 b ≥ 0 , their interaction is
W b ( x , y ) = − G ( d + y − x ) 2 + b 2 , ( W b ) x y = G [ 2 ( d + y − x ) 2 − b 2 ] [ ( d + y − x ) 2 + b 2 ] 5 / 2 . W_b(x,y)=-\frac{\mathcal{G}}{\sqrt{(d+y-x)^2+b^2}},\qquad(W_b)_{xy}=\frac{\mathcal{G}\left[2(d+y-x)^2-b^2\right]}{\left[(d+y-x)^2+b^2\right]^{5/2}}. W b ( x , y ) = − ( d + y − x ) 2 + b 2 G , ( W b ) x y = [ ( d + y − x ) 2 + b 2 ] 5/2 G [ 2 ( d + y − x ) 2 − b 2 ] .
Take ∣ x ∣ ≤ ℓ A |x|\leq\ell_A ∣ x ∣ ≤ ℓ A , ∣ y ∣ ≤ ℓ B |y|\leq\ell_B ∣ y ∣ ≤ ℓ B and z min = d − ℓ A − ℓ B > 0 z_{\min}=d-\ell_A-\ell_B>0 z m i n = d − ℓ A − ℓ B > 0 , z max = d + ℓ A + ℓ B z_{\max}=d+\ell_A+\ell_B z m a x = d + ℓ A + ℓ B . The sign of the mixed derivative is fixed whenever its numerator keeps one sign over the entire allowed range. The corner formula is therefore exact in either regime
b 2 ≤ 2 z min 2 or b 2 ≥ 2 z max 2 . (166) b^2\leq2z_{\min}^2\qquad\text{or}\qquad b^2\geq2z_{\max}^2. \tag*{(166)} b 2 ≤ 2 z m i n 2 or b 2 ≥ 2 z m a x 2 . (166)
Between these regimes, opposite signs can cancel in the outer corner difference while smaller spatial codes still interact. In units with G = d = 1 \mathcal{G}=d=1 G = d = 1 , take ℓ A = ℓ B = 0.1 \ell_A=\ell_B=0.1 ℓ A = ℓ B = 0.1 . The outer difference is positive at b = 0 b=0 b = 0 and behaves as − 0.04 / b 3 + O ( b − 5 ) -0.04/b^3+O(b^{-5}) − 0.04/ b 3 + O ( b − 5 ) for large b b b , so it has a zero. One zero is b ∗ = 1.403173365214517 … b_* = 1.403173365214517\ldots b ∗ = 1.403173365214517 … . At this value, the rectangle x ∈ [ 0.08 , 0.1 ] x\in[0.08,0.1] x ∈ [ 0.08 , 0.1 ] , y ∈ [ − 0.1 , − 0.08 ] y\in[-0.1,-0.08] y ∈ [ − 0.1 , − 0.08 ] has corner difference
W b ∗ ( 0.1 , − 0.08 ) + W b ∗ ( 0.08 , − 0.1 ) − W b ∗ ( 0.1 , − 0.1 ) − W b ∗ ( 0.08 , − 0.08 ) = − 2.2025884191 … × 10 − 5 . (167) W_{b_*}(0.1,-0.08)+W_{b_*}(0.08,-0.1)-W_{b_*}(0.1,-0.1)-W_{b_*}(0.08,-0.08)=-2.2025884191\ldots\times10^{-5}. \tag*{(167)} W b ∗ ( 0.1 , − 0.08 ) + W b ∗ ( 0.08 , − 0.1 ) − W b ∗ ( 0.1 , − 0.1 ) − W b ∗ ( 0.08 , − 0.08 ) = − 2.2025884191 … × 1 0 − 5 . (167)
Thus this smaller code has positive capacity even though the outer corner expression is zero. The conclusion also follows without the numerical root: ( W b ) x y (W_b)_{xy} ( W b ) x y cannot vanish throughout a rectangle of positive area, so some smaller corner difference is nonzero at any such cancellation. The fixed-sign condition is sufficient for the endpoint formula; it cannot simply be omitted.
A strict capacity gap at fixed kinetic energy
Approaching the endpoint capacity requires increasingly narrow position states. We now show that a fixed kinetic-energy budget prevents any protocol from reaching that capacity. The reason is simple: a wavefunction that vanishes at the confinement boundary must spend kinetic energy to place its probability near that boundary. A finite budget therefore leaves a definite fraction of the mass’s position distribution in the interior, where the product factors in the Newtonian potential are smaller.
In this subsection the masses are equal, m A = m B = m m_A=m_B=m m A = m B = m , their collinear supports are [ − ℓ , ℓ ] [-\ell,\ell] [ − ℓ , ℓ ] , and d > 2 ℓ d>2\ell d > 2 ℓ . Thus G = G m 2 G=Gm^2 G = G m 2 and κ = κ ( ℓ , ℓ ) \kappa=\kappa(\ell,\ell) κ = κ ( ℓ , ℓ ) in Eq. (162) . Let K j K_j K j be the Dirichlet kinetic-energy quadratic form − ℏ 2 ∂ x j 2 / ( 2 m ) -\hbar^2\partial_{x_j}^2/(2m) − ℏ 2 ∂ x j 2 / ( 2 m ) . Vector-valued wavefunctions belong to H 0 1 ( [ − ℓ , ℓ ] ) H_0^1([-\ell,\ell]) H 0 1 ([ − ℓ , ℓ ]) , with arbitrary local memories included in their coefficient space. Let ρ j , h ( t ) \rho_{j,h}(t) ρ j , h ( t ) be the conditional state of mass j j j in recorded history h h h . We impose the bound
Tr ( ρ j , h ( t ) K j ) ≤ E , j = A , B , (168) \operatorname{Tr}(\rho_{j,h}(t)K_j)\leq\mathcal{E},\qquad j=A,B, \tag*{(168)} Tr ( ρ j , h ( t ) K j ) ≤ E , j = A , B , (168)
in every normalized recorded history h h h throughout each interaction. Here E \mathcal{E} E is one fixed budget for the entire protocol, including its gravitational seed preparation. Local operations between interactions remain free, and must return an admissible state before interaction resumes. The Dirichlet ground-state bound requires E ≥ π 2 ℏ 2 / ( 8 m ℓ 2 ) \mathcal{E}\geq\pi^2\hbar^2/(8m\ell^2) E ≥ π 2 ℏ 2 / ( 8 m ℓ 2 ) . Define δ E = ℏ / 2 m E \delta_{\mathcal{E}}=\hbar/\sqrt{2m\mathcal{E}} δ E = ℏ/ 2 m E , so 0 < δ E ≤ 2 ℓ / π < ℓ 0<\delta_{\mathcal{E}}\leq2\ell/\pi<\ell 0 < δ E ≤ 2 ℓ / π < ℓ . We will show that at least half the position probability lies outside boundary strips of this width. That forced interior probability reduces the second moments of the centered interaction factors and gives the positive frequency gap below.
Proposition S22 (Finite-energy capacity and confidence bounds). For finite initially separable protocols obeying Eq. (168) , put
Δ κ E = G 2 ℏ [ 1 d − δ E − 1 d + 1 d + 2 ℓ − δ E − 1 d + 2 ℓ − 2 δ E ] , (169) \Delta\kappa_{\mathcal{E}}=\frac{G}{2\hbar}\left[\frac{1}{d-\delta_{\mathcal{E}}}-\frac{1}{d}+\frac{1}{d+2\ell-\delta_{\mathcal{E}}}-\frac{1}{d+2\ell-2\delta_{\mathcal{E}}}\right], \tag*{(169)} Δ κ E = 2ℏ G [ d − δ E 1 − d 1 + d + 2 ℓ − δ E 1 − d + 2 ℓ − 2 δ E 1 ] , (169) Γ E = β ( κ − Δ κ E ) . \Gamma_{\mathcal{E}}=\beta(\kappa-\Delta\kappa_{\mathcal{E}}). Γ E = β ( κ − Δ κ E ) . Then 0 < Δ κ E < κ 0<\Delta\kappa_{\mathcal{E}}<\kappa 0 < Δ κ E < κ , and the asymptotic entanglement capacity under this energy constraint satisfies
C k i n ( E ) ≤ Γ E < β κ . (170) C_{\mathrm{kin}}(\mathcal{E})\leq\Gamma_{\mathcal{E}}<\beta\kappa. \tag*{(170)} C kin ( E ) ≤ Γ E < β κ . (170) Any final test of all-separable size 0 < α < p ≤ 1 0<\alpha<p\leq1 0 < α < p ≤ 1 obeys
d b i n ( p ∥ α ) ≤ Γ E ln 2 E T i n t . (171) d_{\mathrm{bin}}(p\mathbin{\|}\alpha)\leq\Gamma_{\mathcal{E}}\ln2\,\mathbb{E}T_{\mathrm{int}}. \tag*{(171)} d bin ( p ∥ α ) ≤ Γ E ln 2 E T int . (171) The bounds extend to normal protocol limits admitting energy-respecting, bounded-duration approximants with convergent output probabilities and expected interaction time.
Proof. We first bound the probability near the two support endpoints. For a normalized vector-valued wavefunction, the zero boundary trace and Cauchy–Schwarz give
∥ ψ ( x ) ∥ 2 ≤ ( ℓ − x ) ∫ x ℓ ∥ ψ ′ ( u ) ∥ 2 d u , ℓ − δ E ≤ x ≤ ℓ . \lVert\psi(x)\rVert^2\leq(\ell-x)\int_x^\ell\lVert\psi'(u)\rVert^2\,du,\qquad\ell-\delta_{\mathcal{E}}\leq x\leq\ell. ∥ ψ ( x ) ∥ 2 ≤ ( ℓ − x ) ∫ x ℓ ∥ ψ ′ ( u ) ∥ 2 d u , ℓ − δ E ≤ x ≤ ℓ .
The vanishing boundary value expresses the wavefunction inside the strip as an integral of its derivative. Integrating the resulting probability bound and adding the disjoint left endpoint strip gives
Pr { ∣ x ∣ > ℓ − δ E } ≤ δ E 2 2 ∫ − ℓ ℓ ∥ ψ ′ ( x ) ∥ 2 d x ≤ m E δ E 2 ℏ 2 = 1 2 . (172) \Pr\{|x|>\ell-\delta_{\mathcal{E}}\}\leq\frac{\delta_{\mathcal{E}}^2}{2}\int_{-\ell}^{\ell}\lVert\psi'(x)\rVert^2\,dx\leq\frac{m\mathcal{E}\delta_{\mathcal{E}}^2}{\hbar^2}=\frac{1}{2}. \tag*{(172)} Pr { ∣ x ∣ > ℓ − δ E } ≤ 2 δ E 2 ∫ − ℓ ℓ ∥ ψ ′ ( x ) ∥ 2 d x ≤ ℏ 2 m E δ E 2 = 2 1 . (172)
Averaging this quadratic-form inequality proves it for mixed conditional states, including states entangled with ancillary systems. Hence at least half the probability lies in [ − ℓ + δ E , ℓ − δ E ] [-\ell+\delta_{\mathcal{E}},\ell-\delta_{\mathcal{E}}] [ − ℓ + δ E , ℓ − δ E ] on every recorded history. For s > 0 s > 0 s > 0 , the factors A s A_s A s , B s B_s B s in Eq. (161) have absolute value at most S s = sinh ( s ℓ ) S_s = \sinh(s\ell) S s = sinh ( s ℓ ) . On the interior interval their absolute value is at most L s = cosh ( s ℓ ) − e − s ( ℓ − δ E ) L_s = \cosh(s\ell) - e^{-s(\ell-\delta_E)} L s = cosh ( s ℓ ) − e − s ( ℓ − δ E ) . Indeed, comparison of the two endpoint values leaves the nonnegative difference 2 [ cosh ( s ℓ ) − cosh ( s ( ℓ − δ E ) ) ] 2[\cosh(s\ell) - \cosh(s(\ell-\delta_E))] 2 [ cosh ( s ℓ ) − cosh ( s ( ℓ − δ E ))] . Since 0 < L s < S s 0 < L_s < S_s 0 < L s < S s , the probability bound implies
Tr ( ρ A , h A s 2 ) , Tr ( ρ B , h B s 2 ) ≤ Q s : = S s 2 + L s 2 2 < S s 2 . (173) \operatorname{Tr}(\rho_{A,h}A_s^2),\quad\operatorname{Tr}(\rho_{B,h}B_s^2) \le Q_s := \frac{S_s^2 + L_s^2}{2} < S_s^2. \tag*{(173)} Tr ( ρ A , h A s 2 ) , Tr ( ρ B , h B s 2 ) ≤ Q s := 2 S s 2 + L s 2 < S s 2 . (173)
An operator-norm bound alone would miss this restriction on the occupied state. We instead bound the entropy derivative by the actual second moments and denote the Schmidt entropy in bits by S 2 S_2 S 2 . For a pure state with Schmidt probabilities λ i \lambda_i λ i and a product Hamiltonian A ⊗ B A \otimes B A ⊗ B , the entropy derivative in bits is a sum over i < j i < j i < j with coefficients 2 λ i λ j log 2 ( λ i / λ j ) / ℏ 2\sqrt{\lambda_i\lambda_j}\log_2(\lambda_i/\lambda_j)/\hbar 2 λ i λ j log 2 ( λ i / λ j ) /ℏ . The definition of β \beta β gives
2 λ i λ j ∣ log 2 ( λ i / λ j ) ∣ ≤ β ( λ i + λ j ) . 2\sqrt{\lambda_i\lambda_j}\left|\log_2(\lambda_i/\lambda_j)\right| \le\beta(\lambda_i+\lambda_j). 2 λ i λ j ∣ log 2 ( λ i / λ j ) ∣ ≤ β ( λ i + λ j ) .
Weighted Cauchy–Schwarz and Hermiticity therefore yield
∣ S ˙ 2 ∣ ≤ β ℏ ⟨ A 2 ⟩ ⟨ B 2 ⟩ . (174) |\dot{S}_2| \le\frac{\beta}{\hbar}\sqrt{\langle A^2\rangle\langle B^2\rangle}. \tag*{(174)} ∣ S ˙ 2 ∣ ≤ ℏ β ⟨ A 2 ⟩ ⟨ B 2 ⟩ . (174)
Here the matrix elements are in the Schmidt bases of the complete laboratories. In particular, ∑ i < j ( λ i + λ j ) ∣ A i j ∣ 2 ≤ Tr ( ρ A A 2 ) \sum_{i<j}(\lambda_i+\lambda_j)|A_{ij}|^2 \le\operatorname{Tr}(\rho_A A^2) ∑ i < j ( λ i + λ j ) ∣ A ij ∣ 2 ≤ Tr ( ρ A A 2 ) , so local memories introduce no dimension factor. Applying Cauchy–Schwarz once more to a pure-state ensemble within a recorded history replaces the two expectations by their values in that history’s mixed state. Individual unrecorded pure components need not obey the energy bound.
Integrating Eq. (174) over the Laplace representation now bounds the average entropy increase per interaction time by
β G ℏ ∫ 0 ∞ e − s d Q s d s = β ( κ − Δ κ E ) . \frac{\beta G}{\hbar}\int_0^\infty e^{-sd}Q_s\,ds = \beta(\kappa-\Delta\kappa_{\mathcal E}). ℏ β G ∫ 0 ∞ e − s d Q s d s = β ( κ − Δ κ E ) .
To evaluate the difference, we use
S s 2 − L s 2 = − 1 + e s δ E + e − s ( 2 ℓ − δ E ) − e − s ( 2 ℓ − 2 δ E ) . S_s^2-L_s^2=-1+e^{s\delta_E}+e^{-s(2\ell-\delta_E)}-e^{-s(2\ell-2\delta_E)}. S s 2 − L s 2 = − 1 + e s δ E + e − s ( 2 ℓ − δ E ) − e − s ( 2 ℓ − 2 δ E ) .
Its Laplace integral gives Eq. (169) . The inequalities 0 < Q s < S s 2 0<Q_s<S_s^2 0 < Q s < S s 2 prove the strict bounds on Δ κ E \Delta\kappa_{\mathcal E} Δ κ E .
The kinetic-energy constraint must remain valid when passing to continuous positions. A position grid would change that constraint, so we regularize the entropy while leaving the physical state unchanged. For ε > 0 \varepsilon>0 ε > 0 , define the scalar function g ε g_\varepsilon g ε and its associated spectral entropy by
g ε ( x ) = − ( x + ε ) log 2 ( x + ε ) + ε log 2 ε , S ε ( ρ ) = Tr g ε ( ρ ) − g ε ( 1 ) . g_\varepsilon(x)=-(x+\varepsilon)\log_2(x+\varepsilon)+\varepsilon\log_2\varepsilon,\qquad S_\varepsilon(\rho)=\operatorname{Tr}g_\varepsilon(\rho)-g_\varepsilon(1). g ε ( x ) = − ( x + ε ) log 2 ( x + ε ) + ε log 2 ε , S ε ( ρ ) = Tr g ε ( ρ ) − g ε ( 1 ) .
This finite, concave spectral function vanishes on pure states. Its Schmidt-pair derivative contains log 2 [ ( λ i + ε ) / ( λ j + ε ) ] \log_2[(\lambda_i+\varepsilon)/(\lambda_j+\varepsilon)] log 2 [( λ i + ε ) / ( λ j + ε )] , whose magnitude is no larger than the logarithm used above. Thus the same rate bound holds uniformly in ε \varepsilon ε . Local instruments cannot increase its pure-state ensemble average, by concavity. Moreover, g ε ( x ) − x g ε ( 1 ) ≥ 0 g_\varepsilon(x)-xg_\varepsilon(1)\ge0 g ε ( x ) − x g ε ( 1 ) ≥ 0 for 0 ≤ x ≤ 1 0\le x\le1 0 ≤ x ≤ 1 and converges to − x log 2 x -x\log_2x − x log 2 x . Fatou’s lemma therefore passes the integrated bound to the true final Schmidt entropies. Averaging over the recorded histories gives ∑ h w h S 2 ( ψ h ) ≤ Γ E T i n t \sum_h w_hS_2(\psi_h)\le\Gamma\mathcal{E}T_{\mathrm{int}} ∑ h w h S 2 ( ψ h ) ≤ Γ E T int . The separable-comparator and binary-data-processing argument of Corollary S12 proves Eq. (171) . Producing L L L Bell pairs with error tending to zero requires average entropy at least L − o ( L ) L-o(L) L − o ( L ) on their finite output registers, proving the capacity bound. The stated protocol limits preserve the scalar probability and time inequalities.
For large E \mathcal{E} E , the certified gap has the expansion
Δ κ E = G δ E 2 ℏ [ 1 d 2 − 1 ( d + 2 ℓ ) 2 ] + O ( δ E 2 ) . \Delta\kappa_{\mathcal E}=\frac{G\delta_{\mathcal E}}{2\hbar}\left[\frac{1}{d^2}-\frac{1}{(d+2\ell)^2}\right]+O(\delta_{\mathcal E}^2). Δ κ E = 2ℏ G δ E [ d 2 1 − ( d + 2 ℓ ) 2 1 ] + O ( δ E 2 ) .
Thus every finite admissible budget gives a strict reduction, with this bound approaching the ideal capacity as E − 1 / 2 E^{-1/2} E − 1/2 . The exact capacity at fixed energy and a matching confidence construction remain open. For fixed power 0 < p < 1 0 < p < 1 0 < p < 1 , Eq. (171) also gives the leading mean-time lower bound [ p / Γ E + o ( 1 ) ] log 2 ( 1 / α ) [p/\Gamma_E+o(1)]\log_2(1/\alpha) [ p / Γ E + o ( 1 )] log 2 ( 1/ α ) as α → 0 \alpha\to0 α → 0 . A preparation-energy bound alone does not imply Eq. (168) , because later controls and the interaction can change the kinetic energy. The finite-packet construction in § 1.24 S6.3 instead has the explicit uniform dwell-energy bound of Eq. (89) .
A finite-barrier realization of the finite-count construction
We can replace the divergent walls of the smooth-packet construction in § 1.24 S6.3 by bounded local potentials and control the resulting leakage for a fixed interaction time. The comparison uses the residual of the compact reference packets, so it does not require a bound on the Newtonian potential over the entire unconfined configuration space.
Take equal masses m m m and packet support radii w w w , with axial branch centres ± a \pm a ± a . Recall the compact profile f f f used in the three-dimensional product packets. Put σ = w / 3 \sigma= w/\sqrt{3} σ = w / 3 and A = ℏ 2 / ( 2 m σ 2 ) A = \hbar^2/(2m\sigma^2) A = ℏ 2 / ( 2 m σ 2 ) , the energy scale of one coordinate well. Capping its dimensionless potential u u u at height M M M removes a part whose norm on the reference packet is measured by R M R_M R M :
u ( z ) = f ′ ′ ( z ) f ( z ) = 6 z 4 − 2 ( 1 − z 2 ) 4 , R M = [ ∫ − 1 1 ( u ( z ) − M ) + 2 ∣ f ( z ) ∣ 2 d z ] 1 / 2 . u(z)=\frac{f''(z)}{f(z)}=\frac{6z^4-2}{(1-z^2)^4},\qquad R_M=\left[\int_{-1}^{1}(u(z)-M)_+^2|f(z)|^2\,\mathrm{d}z\right]^{1/2}. u ( z ) = f ( z ) f ′′ ( z ) = ( 1 − z 2 ) 4 6 z 4 − 2 , R M = [ ∫ − 1 1 ( u ( z ) − M ) + 2 ∣ f ( z ) ∣ 2 d z ] 1/2 .
Here M > 0 M > 0 M > 0 is a dimensionless barrier height and ( x ) + = max ( x , 0 ) (x)_+ = \max(x,0) ( x ) + = max ( x , 0 ) . On each occupied coordinate interval replace A u Au A u by A min { u , M } A\min\{u,M\} A min { u , M } , and set the potential to A M AM A M outside those intervals. The longitudinal coordinate has two disjoint intervals, centred at ± a \pm a ± a ; each transverse coordinate has one. The sum of these three coordinate potentials defines the local potential on all of R 3 \mathbb{R}^3 R 3 . It is bounded above and below. On a reference packet the local Schrödinger residual is the sum of the three functions − A ( u − M ) + f -A(u-M)_+f − A ( u − M ) + f , whose norms are at most A R M AR_M A R M each.
Let H M H_M H M be the full kinetic-plus-potential Hamiltonian with these local potentials and the three-dimensional Newtonian pair potential. Its usual semibounded self-adjoint realization is well defined. More generally, the argument applies to any self-adjoint pair Hamiltonian agreeing with the Newtonian potential on the support of the reference packets, including a finite-body continuation at overlapping configurations. Let ψ r e f ( t ) \psi_{\mathrm{ref}}(t) ψ ref ( t ) be the original superposition of the four stationary packet products, with their branch-centre phases. All these packets are smooth and supported away from the pair singularity, so they belong to the domain of H M H_M H M . Their residual obeys
∥ ( H M − i ℏ d d t ) ψ r e f ( t ) ∥ ≤ ϵ V + 6 A R M , ϵ V = G ( 2 w ) ( d − 2 a ) ( d − 2 a − 2 w ) . \left\|\left(H_M-i\hbar\frac{d}{dt}\right)\psi_{\mathrm{ref}}(t)\right\|\leq\epsilon_V+6AR_M,\qquad\epsilon_V=\frac{\mathcal{G}(2w)}{(d-2a)(d-2a-2w)}. ( H M − i ℏ d t d ) ψ ref ( t ) ≤ ϵ V + 6 A R M , ϵ V = ( d − 2 a ) ( d − 2 a − 2 w ) G ( 2 w ) .
The gravity term follows from the reciprocal-distance bound on the reference support. The well term follows by the triangle inequality; disjoint packet supports make this bound uniform in the four branch phases. Applying variation of constants to this differentiable reference state gives
∥ e − i H M t / ℏ ψ r e f ( 0 ) − ψ r e f ( t ) ∥ ≤ η M ( t ) : = t ℏ ( ϵ V + 6 A R M ) . (175) \left\|e^{-iH_Mt/\hbar}\psi_{\mathrm{ref}}(0)-\psi_{\mathrm{ref}}(t)\right\|\leq\eta_M(t):=\frac{t}{\hbar}(\epsilon_V+6AR_M). \tag*{(175)} e − i H M t /ℏ ψ ref ( 0 ) − ψ ref ( t ) ≤ η M ( t ) := ℏ t ( ϵ V + 6 A R M ) . (175)
This estimate uses a residual on the reference state, rather than an operator-norm difference between the two Hamiltonians.
At T B = π / ( 4 κ a ) T_B=\pi/(4\kappa a) T B = π / ( 4 κa ) , use a deterministic local channel that maps the two reference packets to the two logical basis states and extends to a trace-preserving channel on their orthogonal complement. In particular, amplitudes outside the reference subspace are assigned a qubit output and are retained. The reference output is a Bell pair. Contractivity of fidelity under this decoder and Eq. (175) give F B e l l ≥ 1 − η M ( T B ) 2 F_{\mathrm{Bell}} \ge1-\eta_M(T_B)^2 F Bell ≥ 1 − η M ( T B ) 2 for η M ( T B ) ≤ 1 \eta_M(T_B) \le1 η M ( T B ) ≤ 1 . Consequently the same local Pauli verifier has
q ≥ 1 − 2 3 η M ( T B ) 2 , b = 2 3 . q \ge1-\frac{2}{3}\eta_M(T_B)^2,\qquad b=\frac{2}{3}. q ≥ 1 − 3 2 η M ( T B ) 2 , b = 3 2 .
The finite-count guarantees above therefore apply with η \eta η replaced by η M ( T B ) \eta_M(T_B) η M ( T B ) . If an alternative implementation assigns every escape event a nonpassing outcome, the conservative guarantee is instead q ≥ 1 − η M ( T B ) 2 q \ge1-\eta_M(T_B)^2 q ≥ 1 − η M ( T B ) 2 .
At the calibration in § 1.24 § 1.26 (m = 10 − 14 k g m=10^{-14}\,\mathrm{kg} m = 1 0 − 14 kg , a = 125 μ m a=125\,\mu\mathrm{m} a = 125 μ m , w = 1 n m w=1\,\mathrm{nm} w = 1 nm and d = 450 μ m d=450\,\mu\mathrm{m} d = 450 μ m ), the finite height M = 10 6 M=10^6 M = 1 0 6 gives
A M = 1.668182576 × 10 − 30 J , R M = 1.001269215 × 10 − 6 , η M ( T B ) = 8.154642576 × 10 − 5 . A_M=1.668182576\times10^{-30}\,\mathrm{J},\quad R_M=1.001269215\times10^{-6},\quad\eta_M(T_B)=8.154642576\times10^{-5}. A M = 1.668182576 × 1 0 − 30 J , R M = 1.001269215 × 1 0 − 6 , η M ( T B ) = 8.154642576 × 1 0 − 5 .
Twelve independent trials then have size at most 0.007707346629 and power at least 0.999999946801, at aggregate dwell time 300.2147959 s. The barrier modification starts 12.6172 pm inside each coordinate edge. These numbers specify a bounded-potential construction; implementing its spatial profile, preparation and complete local decoder is an additional control task.
For a bounded finite-body interaction V ≥ − V ∗ V\ge-V_\ast V ≥ − V ∗ that is nonpositive on the initial support, the total kinetic energy also has a uniform bound. The capped local potentials have lower bound − 6 A u ∗ -6Au_\ast − 6 A u ∗ , where u ∗ = 8.5914976719 … u_\ast=8.5914976719\ldots u ∗ = 8.5914976719 … , and their initial expectation is no larger than for the uncapped zero-energy reference state. Conservation of energy thus gives
⟨ K A + K B ⟩ t ≤ V ∗ + 6 A u ∗ . \langle K_A+K_B\rangle_t\le V_\ast+6Au_\ast. ⟨ K A + K B ⟩ t ≤ V ∗ + 6 A u ∗ .
For equal homogeneous spheres of radius R R R , their Newtonian mutual energy has V ∗ = 6 G / ( 5 R ) V_\ast=6\mathcal{G}/(5R) V ∗ = 6 G / ( 5 R ) , and agrees with − G / L -\mathcal{G}/L − G / L when their centre separation L L L exceeds 2 R 2R 2 R . At density 3500 kg m− 3 ^{-3} − 3 and the calibration mass, R = 0.8802671 μ m R=0.8802671\,\mu\mathrm{m} R = 0.8802671 μ m and the total kinetic bound is 9.184550136 × 10 − 33 J 9.184550136\times10^{-33}\,\mathrm{J} 9.184550136 × 1 0 − 33 J . Finite barriers permit leakage, so this extension supplies a finite-time preparation and testing construction; the hard-support capacity statements keep their original confinement hypothesis.
Near contact, three spatial levels outperform two
The two-position optimum in Theorem S1 holds for sufficiently separated balls. Near contact, several matched branch pairs can each have a short separation. We show that three spatial levels can then beat every maintained two-dimensional spatial encoding, including encodings whose basis states are delocalized. The supports are again the two radius-r r r balls with centre separation d > 2 r d>2r d > 2 r . Let one mass be confined throughout each interaction to a maintained spatial subspace with isometry W : C 2 → H A W:\mathbb{C}^2\to\mathcal{H}_A W : C 2 → H A . The other mass may use its full spatial Hilbert space, and both laboratories may have arbitrary local ancillary memories. Put δ = d − 2 r > 0 \delta=d-2r>0 δ = d − 2 r > 0 and let
w V = G d − 2 r − G d + 2 r w_V=\frac{\mathcal{G}}{d-2r}-\frac{\mathcal{G}}{d+2r} w V = d − 2 r G − d + 2 r G
be the global potential range. The compressed position POVM has the form W † Π A ( d a ) W = d ν ( a ) [ I + n ( a ) ⋅ σ ] W^\dagger\Pi_A(d a)W=d\nu(\mathbf{a})[I+\mathbf{n}(\mathbf{a})\cdot\boldsymbol{\sigma}] W † Π A ( d a ) W = d ν ( a ) [ I + n ( a ) ⋅ σ ] , where σ \boldsymbol{\sigma} σ is the Pauli vector on the spatial qubit, ν \nu ν is a probability measure, ∫ n d ν = 0 \int\mathbf{n}\,d\nu=0 ∫ n d ν = 0 and ∣ n ∣ ≤ 1 |\mathbf{n}|\le1 ∣ n ∣ ≤ 1 . This Bloch-vector decomposition expresses every compressed position measurement as a scalar part and a qubit part. Writing V a = V ( a , X B ) V_a=V(\mathbf{a},X_B) V a = V ( a , X B ) , subtract the local term I ⊗ ∫ V a d ν I\otimes\int V_a d\nu I ⊗ ∫ V a d ν and the global range midpoint v 0 v_0 v 0 . The remaining interaction is
∫ d ν ( a ) [ n ( a ) ⋅ σ ] ⊗ [ V a − v 0 I ] . \int d\nu(\mathbf{a})[\mathbf{n}(\mathbf{a})\cdot\boldsymbol{\sigma}]\otimes[V_a-v_0I]. ∫ d ν ( a ) [ n ( a ) ⋅ σ ] ⊗ [ V a − v 0 I ] .
The two product norms are at most 1 and w V / 2 w_V/2 w V /2 ; their spectral diameters are at most 2 and w V w_V w V . The established ancilla-assisted product entropy bound, integrated over ν \nu ν , therefore gives
C E , 2 D p o r t ≤ β w V 2 ℏ . (176) C_{E,2\mathrm{D\ port}} \le\frac{\beta w_V}{2\hbar}. \tag*{(176)} C E , 2 D port ≤ 2ℏ β w V . (176)
The same proof covers a time- or classical-history-dependent maintained subspace and ideal time sharing. The isometry acts on the spatial code; memories are ancillary identities. It excludes leakage during interaction and coherent memory-controlled code choices whose combined spatial range has dimension greater than two. Such larger ranges are not a single maintained two-dimensional spatial port. The bound is not restricted to localized point encodings and does not require both masses to be qubits.
For the lower construction, use matching equilateral rings facing one another. This makes the three matched-label distances equal and shorter than all six unmatched distances. Label the vertices by x = 0 , 1 , 2 x=0,1,2 x = 0 , 1 , 2 and choose
a x = ( ρ cos θ x , ρ sin θ x , z ) , b x = ( ρ cos θ x , ρ sin θ x , − z ) , θ x = 2 π x / 3 , ρ 2 + z 2 = r 2 . \mathbf{a}_x=(\rho\cos\theta_x,\rho\sin\theta_x,z),\qquad\mathbf{b}_x=(\rho\cos\theta_x,\rho\sin\theta_x,-z),\qquad\theta_x=2\pi x/3,\qquad\rho^2+z^2=r^2. a x = ( ρ cos θ x , ρ sin θ x , z ) , b x = ( ρ cos θ x , ρ sin θ x , − z ) , θ x = 2 π x /3 , ρ 2 + z 2 = r 2 .
Matched labels have distance s = d − 2 z s=d-2z s = d − 2 z and unequal labels have distance L = s 2 + 3 ρ 2 L=\sqrt{s^2+3\rho^2} L = s 2 + 3 ρ 2 . On these three-dimensional spatial codes,
H = − G L I − Δ △ P e q , Δ △ = G ( 1 / s − 1 / L ) , P e q = ∑ x = 0 2 ∣ x x ⟩ ⟨ x x ∣ . H=-\frac{\mathcal{G}}{L}I-\Delta_\triangle P_{\mathrm{eq}},\qquad\Delta_\triangle=\mathcal{G}(1/s-1/L),\qquad P_{\mathrm{eq}}=\sum_{x=0}^{2}|xx\rangle\langle xx|. H = − L G I − Δ △ P eq , Δ △ = G ( 1/ s − 1/ L ) , P eq = x = 0 ∑ 2 ∣ xx ⟩ ⟨ xx ∣.
We choose Schmidt bases in which this equal-label projector couples one heavily occupied Schmidt component to two weakly occupied ones. The relative phases make both contributions to the entropy derivative positive. Let u j = 3 − 1 / 2 ∑ x e 2 π i j x / 3 ∣ x ⟩ u_j=3^{-1/2}\sum_x e^{2\pi ijx/3}|x\rangle u j = 3 − 1/2 ∑ x e 2 π ij x /3 ∣ x ⟩ , v j = e i ϕ j u j ∗ v_j=e^{i\phi_j}u_j^* v j = e i ϕ j u j ∗ , ϕ = ( 0 , π / 2 , π / 2 ) \phi=(0,\pi/2,\pi/2) ϕ = ( 0 , π /2 , π /2 ) , and prepare the Schmidt state ∑ j p j ∣ u j v j ⟩ \sum_j\sqrt{p_j}|u_jv_j\rangle ∑ j p j ∣ u j v j ⟩ with p = ( .9 , .05 , .05 ) p=(.9,.05,.05) p = ( .9 , .05 , .05 ) . Directly, ⟨ u i v i ∣ P e q ∣ u j v j ⟩ = e i ( ϕ j − ϕ i ) / 3 \langle u_iv_i|P_{\mathrm{eq}}|u_jv_j\rangle=e^{i(\phi_j-\phi_i)}/3 ⟨ u i v i ∣ P eq ∣ u j v j ⟩ = e i ( ϕ j − ϕ i ) /3 . Its positive entropy production is
Γ 3 = 2 Δ △ 3 ℏ ∑ j = 1 2 p 0 p j log 2 p 0 p j = 2 5 log 2 ( 18 ) Δ △ ℏ . (177) \Gamma_3=\frac{2\Delta_\triangle}{3\hbar}\sum_{j=1}^{2}\sqrt{p_0p_j}\log_2\frac{p_0}{p_j}=\frac{\sqrt{2}}{5}\log_2(18)\frac{\Delta_\triangle}{\hbar}. \tag*{(177)} Γ 3 = 3ℏ 2 Δ △ j = 1 ∑ 2 p 0 p j log 2 p j p 0 = 5 2 log 2 ( 18 ) ℏ Δ △ . (177)
This input is already entangled. The established entanglement-processing framework converts its incremental entropy gain into an asymptotic net generation rate; the finite initial seed is produced and counted, not provided for free[16 ] .
At d = 2.001 r d=2.001r d = 2.001 r and z = .99998 r z=.99998r z = .99998 r ,
s = 13 r 12500 , L = 302701 50000 r , Γ 3 = 1026.88452638 G ℏ r , s=\frac{13r}{12500},\qquad L=\frac{\sqrt{302701}}{50000}r,\qquad\Gamma_3=1026.88452638\frac{\mathcal{G}}{\hbar r}, s = 12500 13 r , L = 50000 302701 r , Γ 3 = 1026.88452638 ℏ r G ,
whereas Eq. (176) is 955.89767006 G / ( ℏ r ) 955.89767006\mathcal{G}/(\hbar r) 955.89767006 G / ( ℏ r ) . This is stronger than the coarse localized two-position bound β G / ( 2 ℏ δ ) = 956.13664448 G / ( ℏ r ) \beta\mathcal{G}/(2\hbar\delta)=956.13664448\mathcal{G}/(\hbar r) β G / ( 2ℏ δ ) = 956.13664448 G / ( ℏ r ) . Thus the construction exceeds even the maintained-two-dimensional-port bound by more than 7.39%. Moving the ring centres slightly inward and using sufficiently narrow smooth stationary packets preserves the strict gap with finite energy in every approximation. This does not give the exact near-contact capacity or an advantage at fixed preparation energy, control bandwidth or noisy memory lifetime. For finite bodies of radii R A , R B R_A,R_B R A , R B , the support clearance must also satisfy d − 2 r > R A + R B d-2r>R_A+R_B d − 2 r > R A + R B ; the near-contact example is not a feasibility estimate.
References