More Like this

1. Entanglement-enhanced optomechanical sensor array with application to dark matter searches

   https://doi.org/10.1038/s42005-023-01357-z  

   Brady, Anthony J.; Chen, Xin; Xia, Yi; Manley, Jack; Dey Chowdhury, Mitul; Xiao, Kewen; Liu, Zhen; Harnik, Roni; Wilson, Dalziel J.; Zhang, Zheshen; et al (September 2023, Communications Physics)

   Abstract Squeezed light has long been used to enhance the precision of a single optomechanical sensor. An emerging set of proposals seeks to use arrays of optomechanical sensors to detect weak distributed forces, for applications ranging from gravity-based subterranean imaging to dark matter searches; however, a detailed investigation into the quantum-enhancement of this approach remains outstanding. Here, we propose an array of entanglement-enhanced optomechanical sensors to improve the broadband sensitivity of distributed force sensing. By coherently operating the optomechanical sensor array and distributing squeezing to entangle the optical fields, the array of sensors has a scaling advantage over independent sensors (i.e.,$$\sqrt{M}\to M$$ $\sqrt{M}\to M$, whereMis the number of sensors) due to coherence as well as joint noise suppression due to multi-partite entanglement. As an illustration, we consider entanglement-enhancement of an optomechanical accelerometer array to search for dark matter, and elucidate the challenge of realizing a quantum advantage in this context. 

   more » « less
2. More on codes for combinatorial composite DNA

   https://doi.org/10.1007/s10623-025-01634-8  

   Ye, Zuo; Sabary, Omer; Gabrys, Ryan; Yaakobi, Eitan; Elishco, Ohad (May 2025, Designs, Codes and Cryptography)

   Abstract In this paper, we focus on constructing unique-decodable and list-decodable codes for the recently studied (t, e)-composite-asymmetric error-correcting codes ((t, e)-CAECCs). Let$$\mathcal {X}$$ $X$be an$$m \times n$$ $m\times n$binary matrix in which each row has Hamming weightw. If at mosttrows of$$\mathcal {X}$$ $X$contain errors, and in each erroneous row, there are at mosteoccurrences of$$1 \rightarrow 0$$ $1\to 0$errors, we say that a (t, e)-composite-asymmetric error occurs in$$\mathcal {X}$$ $X$. For general values ofm, n, w, t, ande, we propose new constructions of (t, e)-CAECCs with redundancy at most$$(t-1)\log (m) + O(1)$$ $(t-1)log\left(m\right)+O\left(1\right)$, whereO(1) is independent of the code lengthm. In particular, this yields a class of (2, e)-CAECCs that are optimal in terms of redundancy. Whenmis a prime power, the redundancy can be further reduced to$$(t-1)\log (m) - O(\log (m))$$ $(t-1)log\left(m\right)-O(log(m\left)\right)$. To further increase the code size, we introduce a combinatorial object called a weak$$B_e$$ $B_e$-set. When$$e = w$$ $e=w$, we present an efficient encoding and decoding method for our codes. Finally, we explore potential improvements by relaxing the requirement of unique decoding to list-decoding. We show that when the list size ist! or an exponential function oft, there exist list-decodable (t, e)-CAECCs with constant redundancy. When the list size is two, we construct list-decodable (3, 2)-CAECCs with redundancy$$\log (m) + O(1)$$ $log\left(m\right)+O\left(1\right)$. 

   more » « less
3. The weight hierarchy of decreasing norm-trace codes

   https://doi.org/10.1007/s10623-025-01619-7  

   Camps-Moreno, Eduardo; López, Hiram H; Matthews, Gretchen L; San-José, Rodrigo (April 2025, Designs, Codes and Cryptography)

   Abstract The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II,t-resilient functions, bounding the cardinality of the output in list decoding algorithms, ramp secret sharing schemes, and quantum error correction. The generalized Hamming weights have been determined for some families of codes, including Cartesian codes and Hermitian one-point codes. In this paper, we determine the generalized Hamming weights of decreasing norm-trace codes, which are linear codes defined by evaluating sets of monomials that are closed under divisibility on the rational points of the extended norm-trace curve given by$$x^{u} = y^{q^{s - 1}} + y^{q^{s - 2}} + \cdots + y$$ $x^u=y^{q^{s-1}}+y^{q^{s-2}}+\cdots +y$over the finite field of cardinality$$q^s$$ $q^s$, whereuis a positive divisor of$$\frac{q^s - 1}{q - 1}$$ $\frac{q^s-1}{q-1}$. As a particular case, we obtain the weight hierarchy of one-point norm-trace codes and recover the result of Barbero and Munuera (2001) giving the weight hierarchy of one-point Hermitian codes. We also study the relative generalized Hamming weights for these codes and use them to construct impure quantum codes with excellent parameters. 

   more » « less
4. Length and Velocity Scales in Protoplanetary Disk Turbulence

   https://doi.org/10.3847/1538-4357/ad2c89  

   Sengupta, Debanjan; Cuzzi, Jeffrey N; Umurhan, Orkan M; Lyra, Wladimir (April 2024, The Astrophysical Journal)

   Abstract In the theory of protoplanetary disk turbulence, a widely adopted ansatz, or assumption, is that the turnover frequency of the largest turbulent eddy, Ω_L, is the local Keplerian frequency Ω_K. In terms of the standard dimensionless Shakura–Sunyaevαparameter that quantifies turbulent viscosity or diffusivity, this assumption leads to characteristic length and velocity scales given respectively by $\sqrt{\alpha }H$and $\sqrt{\alpha }c$, in whichHandcare the local gas scale height and sound speed. However, this assumption is not applicable in cases when turbulence is forced numerically or driven by some natural processes such as vertical shear instability. Here, we explore the more general case where Ω_L≥ Ω_Kand show that, under these conditions, the characteristic length and velocity scales are respectively $\sqrt{\alpha /R\prime }H$and $\sqrt{\alpha R\prime }c$, where $R\prime \equiv {\mathrm{\Omega }}_L/{\mathrm{\Omega }}_K$is twice the Rossby number. It follows that $\alpha =\tilde{\alpha }/R\prime$, where $\sqrt{\tilde{\alpha }}c$is the root-mean-square average of the turbulent velocities. Properly allowing for this effect naturally explains the reduced particle scale heights produced in shearing box simulations of particles in forced turbulence, and it may help with interpreting recent edge-on disk observations; more general implications for observations are also presented. For $R\prime >1$, the effective particle Stokes numbers are increased, which has implications for particle collision dynamics and growth, as well as for planetesimal formation. 

   more » « less
5. On a Traveling Salesman Problem for Points in the Unit Cube

   https://doi.org/10.1007/s00453-024-01257-w  

   Balogh, József; Clemen, Felix Christian; Dumitrescu, Adrian (September 2024, Algorithmica)

   Abstract LetXbe ann-element point set in thek-dimensional unit cube$$[0,1]^k$$ ${[0,1]}^k$where$$k \ge 2$$ $k\ge 2$. According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour)$$x_1, x_2, \ldots , x_n$$ $x_1,x_2,\dots ,x_n$through thenpoints, such that$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} \le c_k$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}\le c_k$, where$$|x-y|$$ $|x-y|$is the Euclidean distance betweenxandy, and$$c_k$$ $c_k$is an absolute constant that depends only onk, where$$x_{n+1} \equiv x_1$$ $x_{n+1}\equiv x_1$. From the other direction, for every$$k \ge 2$$ $k\ge 2$and$$n \ge 2$$ $n\ge 2$, there existnpoints in$$[0,1]^k$$ ${[0,1]}^k$, such that their shortest tour satisfies$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} = 2^{1/k} \cdot \sqrt{k}$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}=2^{1/k}·\sqrt{k}$. For the plane, the best constant is$$c_2=2$$ $c_2=2$and this is the only exact value known. Bollobás and Meir showed that one can take$$c_k = 9 \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=9{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$for every$$k \ge 3$$ $k\ge 3$and conjectured that the best constant is$$c_k = 2^{1/k} \cdot \sqrt{k}$$ $c_k=2^{1/k}·\sqrt{k}$, for every$$k \ge 2$$ $k\ge 2$. Here we significantly improve the upper bound and show that one can take$$c_k = 3 \sqrt{5} \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=3\sqrt{5}{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$or$$c_k = 2.91 \sqrt{k} \ (1+o_k(1))$$ $c_k=2.91\sqrt{k}(1+o_k\left(1\right))$. Our bounds are constructive. We also show that$$c_3 \ge 2^{7/6}$$ $c_3\ge 2^{7/6}$, which disproves the conjecture for$$k=3$$ $k=3$. Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed. 

   more » « less