skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Quantum circuits for toric code and X-cube fracton model
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 ⌈ 2 L + 2 + l o g 2 ( d ) + L 2 d βŒ‰ 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 3 L + 8 steps and the X-cube fracton model in 12 L + 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
Award ID(s):
2006667
PAR ID:
10547538
Author(s) / Creator(s):
; ;
Publisher / Repository:
Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Date Published:
Journal Name:
Quantum
Volume:
8
ISSN:
2521-327X
Page Range / eLocation ID:
1276
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. By discretizing an argument of Kislyakov, Naor and Schechtman proved that the 1-Wasserstein metric over the planar grid { 0 , 1 , …<#comment/> , n } 2 \{0,1,\dots , n\}^2 has L 1 L_1 -distortion bounded below by a constant multiple of log ⁑<#comment/> n \sqrt {\log n} . We provide a new β€œdimensionality” interpretation of Kislyakov’s argument, showing that if { G n } n = 1 ∞<#comment/> \{G_n\}_{n=1}^\infty is a sequence of graphs whose isoperimetric dimension and Lipschitz-spectral dimension equal a common number Ξ΄<#comment/> ∈<#comment/> [ 2 , ∞<#comment/> ) \delta \in [2,\infty ) , then the 1-Wasserstein metric over G n G_n has L 1 L_1 -distortion bounded below by a constant multiple of ( log ⁑<#comment/> | G n | ) 1 Ξ΄<#comment/> (\log |G_n|)^{\frac {1}{\delta }} . We proceed to compute these dimensions for ⊘<#comment/> \oslash -powers of certain graphs. In particular, we get that the sequence of diamond graphs { D n } n = 1 ∞<#comment/> \{\mathsf {D}_n\}_{n=1}^\infty has isoperimetric dimension and Lipschitz-spectral dimension equal to 2, obtaining as a corollary that the 1-Wasserstein metric over D n \mathsf {D}_n has L 1 L_1 -distortion bounded below by a constant multiple of log ⁑<#comment/> | D n | \sqrt {\log | \mathsf {D}_n|} . This answers a question of Dilworth, Kutzarova, and Ostrovskii and exhibits only the third sequence of L 1 L_1 -embeddable graphs whose sequence of 1-Wasserstein metrics is not L 1 L_1 -embeddable. 
    more » « less
  2. In this paper we derive the best constant for the following L ∞<#comment/> L^{\infty } -type Gagliardo-Nirenberg interpolation inequality β€–<#comment/> u β€–<#comment/> L ∞<#comment/> ≀<#comment/> C q , ∞<#comment/> , p β€–<#comment/> u β€–<#comment/> L q + 1 1 βˆ’<#comment/> ΞΈ<#comment/> β€–<#comment/> βˆ‡<#comment/> u β€–<#comment/> L p ΞΈ<#comment/> , ΞΈ<#comment/> = p d d p + ( p βˆ’<#comment/> d ) ( q + 1 ) , \begin{equation*} \|u\|_{L^{\infty }}\leq C_{q,\infty ,p} \|u\|^{1-\theta }_{L^{q+1}}\|\nabla u\|^{\theta }_{L^p},\quad \theta =\frac {pd}{dp+(p-d)(q+1)}, \end{equation*} where parameters q q and p p satisfy the conditions p > d β‰₯<#comment/> 1 p>d\geq 1 , q β‰₯<#comment/> 0 q\geq 0 . The best constant C q , ∞<#comment/> , p C_{q,\infty ,p} is given by C q , ∞<#comment/> , p = ΞΈ<#comment/> βˆ’<#comment/> ΞΈ<#comment/> p ( 1 βˆ’<#comment/> ΞΈ<#comment/> ) ΞΈ<#comment/> p M c βˆ’<#comment/> ΞΈ<#comment/> d , M c ≔ ∫<#comment/> R d u c , ∞<#comment/> q + 1 d x , \begin{equation*} C_{q,\infty ,p}=\theta ^{-\frac {\theta }{p}}(1-\theta )^{\frac {\theta }{p}}M_c^{-\frac {\theta }{d}},\quad M_c≔\int _{\mathbb {R}^d}u_{c,\infty }^{q+1} dx, \end{equation*} where u c , ∞<#comment/> u_{c,\infty } is the unique radial non-increasing solution to a generalized Lane-Emden equation. The case of equality holds when u = A u c , ∞<#comment/> ( Ξ»<#comment/> ( x βˆ’<#comment/> x 0 ) ) u=Au_{c,\infty }(\lambda (x-x_0)) for any real numbers A A , Ξ»<#comment/> > 0 \lambda >0 and x 0 ∈<#comment/> R d x_{0}\in \mathbb {R}^d . In fact, the generalized Lane-Emden equation in R d \mathbb {R}^d contains a delta function as a source and it is a Thomas-Fermi type equation. For q = 0 q=0 or d = 1 d=1 , u c , ∞<#comment/> u_{c,\infty } have closed form solutions expressed in terms of the incomplete Beta functions. Moreover, we show that u c , m β†’<#comment/> u c , ∞<#comment/> u_{c,m}\to u_{c,\infty } and C q , m , p β†’<#comment/> C q , ∞<#comment/> , p C_{q,m,p}\to C_{q,\infty ,p} as m β†’<#comment/> + ∞<#comment/> m\to +\infty for d = 1 d=1 , where u c , m u_{c,m} and C q , m , p C_{q,m,p} are the function achieving equality and the best constant of L m L^m -type Gagliardo-Nirenberg interpolation inequality, respectively. 
    more » « less
  3. We present an explicit quantum circuit that prepares an arbitrary U ( 1 ) -eigenstate on a quantum computer, including the exact eigenstates of the spin- 1 / 2 X X Z quantum spin chain with either open or closed boundary conditions. The algorithm is deterministic, does not require ancillary qubits, and does not require QR decompositions. The circuit prepares such an L -qubit state with M down-spins using ( L M ) βˆ’ 1 multi-controlled rotation gates and 2 M ( L βˆ’ M ) CNOT-gates. 
    more » « less
  4. 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 = ⌊ ( d βˆ’ 1 ) / 2 βŒ‹ 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
  5. We formulate a plausible conjecture for the optimal Ehrhard-type inequality for convex symmetric sets with respect to the Gaussian measure. Namely, letting J k βˆ’<#comment/> 1 ( s ) = ∫<#comment/> 0 s t k βˆ’<#comment/> 1 e βˆ’<#comment/> t 2 2 d t J_{k-1}(s)=\int ^s_0 t^{k-1} e^{-\frac {t^2}{2}}dt and c k βˆ’<#comment/> 1 = J k βˆ’<#comment/> 1 ( + ∞<#comment/> ) c_{k-1}=J_{k-1}(+\infty ) , we conjecture that the function F : [ 0 , 1 ] β†’<#comment/> R F:[0,1]\rightarrow \mathbb {R} , given by F ( a ) = βˆ‘<#comment/> k = 1 n 1 a ∈<#comment/> E k β‹…<#comment/> ( Ξ²<#comment/> k J k βˆ’<#comment/> 1 βˆ’<#comment/> 1 ( c k βˆ’<#comment/> 1 a ) + Ξ±<#comment/> k ) \begin{equation*} F(a)= \sum _{k=1}^n 1_{a\in E_k}\cdot (\beta _k J_{k-1}^{-1}(c_{k-1} a)+\alpha _k) \end{equation*} (with an appropriate choice of a decomposition [ 0 , 1 ] = βˆͺ<#comment/> i E i [0,1]=\cup _{i} E_i and coefficients Ξ±<#comment/> i , Ξ²<#comment/> i \alpha _i, \beta _i ) satisfies, for all symmetric convex sets K K and L L , and any Ξ»<#comment/> ∈<#comment/> [ 0 , 1 ] \lambda \in [0,1] , F ( Ξ³<#comment/> ( Ξ»<#comment/> K + ( 1 βˆ’<#comment/> Ξ»<#comment/> ) L ) ) β‰₯<#comment/> Ξ»<#comment/> F ( Ξ³<#comment/> ( K ) ) + ( 1 βˆ’<#comment/> Ξ»<#comment/> ) F ( Ξ³<#comment/> ( L ) ) . \begin{equation*} F\left (\gamma (\lambda K+(1-\lambda )L)\right )\geq \lambda F\left (\gamma (K)\right )+(1-\lambda ) F\left (\gamma (L)\right ). \end{equation*} We explain that this conjecture is β€œthe most optimistic possible”, and is equivalent to the fact that for any symmetric convex set K K , itsGaussian concavity power p s ( K , Ξ³<#comment/> ) p_s(K,\gamma ) is greater than or equal to p s ( R B 2 k Γ—<#comment/> R n βˆ’<#comment/> k , Ξ³<#comment/> ) p_s(RB^k_2\times \mathbb {R}^{n-k},\gamma ) , for some k ∈<#comment/> { 1 , …<#comment/> , n } k\in \{1,\dots ,n\} . We call the sets R B 2 k Γ—<#comment/> R n βˆ’<#comment/> k RB^k_2\times \mathbb {R}^{n-k} round k k -cylinders; they also appear as the conjectured Gaussian isoperimetric minimizers for symmetric sets, see Heilman [Amer. J. Math. 143 (2021), pp. 53–94]. In this manuscript, we make progress towards this question, and show that for any symmetric convex set K K in R n \mathbb {R}^n , p s ( K , Ξ³<#comment/> ) β‰₯<#comment/> sup F ∈<#comment/> L 2 ( K , Ξ³<#comment/> ) ∩<#comment/> L i p ( K ) : ∫<#comment/> F = 1 ( 2 T Ξ³<#comment/> F ( K ) βˆ’<#comment/> V a r ( F ) ) + 1 n βˆ’<#comment/> E X 2 , \begin{equation*} p_s(K,\gamma )\geq \sup _{F\in L^2(K,\gamma )\cap Lip(K):\,\int F=1} \left (2T_{\gamma }^F(K)-Var(F)\right )+\frac {1}{n-\mathbb {E}X^2}, \end{equation*} where T Ξ³<#comment/> F ( K ) T_{\gamma }^F(K) is the F βˆ’<#comment/> F- torsional rigidity of K K with respect to the Gaussian measure.Moreover, the equality holds if and only if K = R B 2 k Γ—<#comment/> R n βˆ’<#comment/> k K=RB^k_2\times \mathbb {R}^{n-k} for some R > 0 R>0 and k = 1 , …<#comment/> , n k=1,\dots ,n .As a consequence, we get p s ( K , Ξ³<#comment/> ) β‰₯<#comment/> Q ( E | X | 2 , E β€–<#comment/> X β€–<#comment/> K 4 , E β€–<#comment/> X β€–<#comment/> K 2 , r ( K ) ) , \begin{equation*} p_s(K,\gamma )\geq Q(\mathbb {E}|X|^2, \mathbb {E}\|X\|_K^4, \mathbb {E}\|X\|^2_K, r(K)), \end{equation*} where Q Q is a certain rational function of degree 2 2 , the expectation is taken with respect to the restriction of the Gaussian measure onto K K , β€–<#comment/> β‹…<#comment/> β€–<#comment/> K \|\cdot \|_K is the Minkowski functional of K K , and r ( K ) r(K) is the in-radius of K K . The result follows via a combination of some novel estimates, the L 2 L2 method (previously studied by several authors, notably Kolesnikov and Milman [J. Geom. Anal. 27 (2017), pp. 1680–1702; Amer. J. Math. 140 (2018), pp. 1147–1185;Geometric aspects of functional analysis, Springer, Cham, 2017; Mem. Amer. Math. Soc. 277 (2022), v+78 pp.], Kolesnikov and the author [Adv. Math. 384 (2021), 23 pp.], Hosle, Kolesnikov, and the author [J. Geom. Anal. 31 (2021), pp. 5799–5836], Colesanti [Commun. Contemp. Math. 10 (2008), pp. 765–772], Colesanti, the author, and Marsiglietti [J. Funct. Anal. 273 (2017), pp. 1120–1139], Eskenazis and Moschidis [J. Funct. Anal. 280 (2021), 19 pp.]), and the analysis of the Gaussian torsional rigidity. As an auxiliary result on the way to the equality case characterization, we characterize the equality cases in the β€œconvex set version” of the Brascamp-Lieb inequality, and moreover, obtain a quantitative stability version in the case of the standard Gaussian measure; this may be of independent interest. All the equality case characterizations rely on the careful analysis of the smooth case, the stability versions via trace theory, and local approximation arguments. In addition, we provide a non-sharp estimate for a function F F whose composition with Ξ³<#comment/> ( K ) \gamma (K) is concave in the Minkowski sense for all symmetric convex sets. 
    more » « less