More Like this

1. Quantum circuits for toric code and X-cube fracton model

   https://doi.org/10.22331/q-2024-03-13-1276  

   Chen, Penghua; Yan, Bowen; Cui, Shawn X (March 2024, Quantum)

   We propose a systematic and efficient quantum circuit composed solely of Clifford gates for simulating the ground state of the surface code model. This approach yields the ground state of the toric code in $\lceil 2L+2+lo{g}_2\left(d\right)+\frac{L}{2d}\rceil$time steps, where $L$refers to the system size and $d$represents the maximum distance to constrain the application of the CNOT gates. Our algorithm reformulates the problem into a purely geometric one, facilitating its extension to attain the ground state of certain 3D topological phases, such as the 3D toric model in $3L+8$steps and the X-cube fracton model in $12L+11$steps. Furthermore, we introduce a gluing method involving measurements, enabling our technique to attain the ground state of the 2D toric code on an arbitrary planar lattice and paving the way to more intricate 3D topological phases. 

   more » « less
2. Classical freeness of orthosymplectic affine vertex superalgebras

   https://doi.org/10.1090/proc/16548  

   Creutzig, Thomas; Linshaw, Andrew; Song, Bailin (October 2024, Proceedings of the American Mathematical Society)

   The question of when a vertex algebra is a quantization of the arc space of its associated scheme has recently received a lot of attention in both the mathematics and physics literature. This property was first studied by Tomoyuki Arakawa and Anne Moreau (see their paper in the references), and was given the name \lq\lq classical freeness by Jethro van Ekeren and Reimundo Heluani [Comm. Math. Phys. 386 (2021), no. 1, pp. 495-550] in their work on chiral homology. Later, it was extended to vertex superalgebras by Hao Li [Eur. J. Math. 7 (2021), pp. 1689–1728]. In this note, we prove the classical freeness of the simple affine vertex superalgebra $L_n\left(\mathfrak{o}\mathfrak{s}{\mathfrak{p}}_{m|2r}\right)$for all positive integers $m,n,r$satisfying $-<\#comment/>\frac{m}{2}+r+n+1>0$. In particular, it holds for the rational vertex superalgebras $L_n\left(\mathfrak{o}\mathfrak{s}{\mathfrak{p}}_{1|2r}\right)$for all positive integers $r,n$. 

   more » « less
3. The best constant for 𝐿^{∞}-type Gagliardo-Nirenberg inequalities

   https://doi.org/10.1090/qam/1645  

   Liu, Jian-Guo; Wang, Jinhuan (June 2024, Quarterly of Applied Mathematics)

   In this paper we derive the best constant for the following $L^{\mathrm{\infty <\#comment/>}}$-type Gagliardo-Nirenberg interpolation inequality $\Vert <\#comment/>u{\Vert <\#comment/>}_{L^{\mathrm{\infty <\#comment/>}}}\le <\#comment/>C_{q,\mathrm{\infty <\#comment/>},p}\Vert <\#comment/>u{\Vert <\#comment/>}_{L^{q+1}}^{1-<\#comment/>\mathrm{\theta <\#comment/>}}\Vert <\#comment/>\mathrm{\nabla <\#comment/>}u{\Vert <\#comment/>}_{L^p}^{\mathrm{\theta <\#comment/>}},\mathrm{\theta <\#comment/>}=\frac{pd}{dp+(p-<\#comment/>d)(q+1)},$where parameters $q$and $p$satisfy the conditions $p>d\ge <\#comment/>1$, $q\ge <\#comment/>0$. The best constant $C_{q,\mathrm{\infty <\#comment/>},p}$is given by $C_{q,\mathrm{\infty <\#comment/>},p}={\mathrm{\theta <\#comment/>}}^{-<\#comment/>\frac{\mathrm{\theta <\#comment/>}}{p}}(1-<\#comment/>\mathrm{\theta <\#comment/>}{)}^{\frac{\mathrm{\theta <\#comment/>}}{p}}{M}_c^{-<\#comment/>\frac{\mathrm{\theta <\#comment/>}}{d}},M_c≔{\int <\#comment/>}_{{\mathbb{R}}^d}{u}_{c,\mathrm{\infty <\#comment/>}}^{q+1}dx,$where $u_{c,\mathrm{\infty <\#comment/>}}$is the unique radial non-increasing solution to a generalized Lane-Emden equation. The case of equality holds when $u=A{u}_{c,\mathrm{\infty <\#comment/>}}\left(\mathrm{\lambda <\#comment/>}\right(x-<\#comment/>x_0\left)\right)$for any real numbers $A$, $\mathrm{\lambda <\#comment/>}>0$and $x_0\in <\#comment/>{\mathbb{R}}^d$. In fact, the generalized Lane-Emden equation in ${\mathbb{R}}^d$contains a delta function as a source and it is a Thomas-Fermi type equation. For $q=0$or $d=1$, $u_{c,\mathrm{\infty <\#comment/>}}$have closed form solutions expressed in terms of the incomplete Beta functions. Moreover, we show that $u_{c,m}\to <\#comment/>u_{c,\mathrm{\infty <\#comment/>}}$and $C_{q,m,p}\to <\#comment/>C_{q,\mathrm{\infty <\#comment/>},p}$as $m\to <\#comment/>+\mathrm{\infty <\#comment/>}$for $d=1$, where $u_{c,m}$and $C_{q,m,p}$are the function achieving equality and the best constant of $L^m$-type Gagliardo-Nirenberg interpolation inequality, respectively. 

   more » « less
4. Sums of linear transformations

   https://doi.org/10.1090/tran/9433  

   Conlon, David; Lim, Jeck (July 2025, Transactions of the American Mathematical Society)

   We show that if ${\mathcal{L}}_1$and ${\mathcal{L}}_2$are linear transformations from ${\mathbb{Z}}^d$to ${\mathbb{Z}}^d$satisfying certain mild conditions, then, for any finite subset $A$of ${\mathbb{Z}}^d$, $|{\mathcal{L}}_{1}A+{\mathcal{L}}_{2}A|\ge <\#comment/>{(|det({\mathcal{L}}_1){|}^{1/d}+|det({\mathcal{L}}_2\left){|}^{1/d}\right)}^d|A|-<\#comment/>o\left(|A|\right).$This result corrects and confirms the two-summand case of a conjecture of Bukh and is best possible up to the lower-order term for certain choices of ${\mathcal{L}}_1$and ${\mathcal{L}}_2$. As an application, we prove a lower bound for $|A+\mathrm{\lambda <\#comment/>}\cdot <\#comment/>A|$when $A$is a finite set of real numbers and $\mathrm{\lambda <\#comment/>}$is an algebraic number. In particular, when $\mathrm{\lambda <\#comment/>}$is of the form $(p/q{)}^{1/d}$for some $p,q,d\in <\#comment/>\mathbb{N}$, each taken as small as possible for such a representation, we show that $|A+\mathrm{\lambda <\#comment/>}\cdot <\#comment/>A|\ge <\#comment/>(p^{1/d}+q^{1/d}{)}^d|A|-<\#comment/>o(|A|).$This is again best possible up to the lower-order term and extends a recent result of Krachun and Petrov which treated the case $\mathrm{\lambda <\#comment/>}=\sqrt{2}$. 

   more » « less
5. Adaptive syndrome measurements for Shor-style error correction

   https://doi.org/10.22331/q-2023-08-08-1075  

   Tansuwannont, Theerapat; Pato, Balint; Brown, Kenneth R. (August 2023, Quantum)

   The Shor fault-tolerant error correction (FTEC) scheme uses transversal gates and ancilla qubits prepared in the cat state in syndrome extraction circuits to prevent propagation of errors caused by gate faults. For a stabilizer code of distance $d$that can correct up to $t=\lfloor (d-1)/2\rfloor$errors, the traditional Shor scheme handles ancilla preparation and measurement faults by performing syndrome measurements until the syndromes are repeated $t+1$times in a row; in the worst-case scenario, $(t+1{)}^2$rounds of measurements are required. In this work, we improve the Shor FTEC scheme using an adaptive syndrome measurement technique. The syndrome for error correction is determined based on information from the differences of syndromes obtained from consecutive rounds. Our protocols that satisfy the strong and the weak FTEC conditions require no more than $(t+3{)}^2/4-1$rounds and $(t+3{)}^2/4-2$rounds, respectively, and are applicable to any stabilizer code. Our simulations of FTEC protocols with the adaptive schemes on hexagonal color codes of small distances verify that our protocols preserve the code distance, can increase the pseudothreshold, and can decrease the average number of rounds compared to the traditional Shor scheme. We also find that for the code of distance $d$, our FTEC protocols with the adaptive schemes require no more than $d$rounds on average. 

   more » « less