By discretizing an argument of Kislyakov, Naor and Schechtman proved that the 1-Wasserstein metric over the planar grid has -distortion bounded below by a constant multiple of . We provide a new βdimensionalityβ interpretation of Kislyakovβs argument, showing that if is a sequence of graphs whose isoperimetric dimension and Lipschitz-spectral dimension equal a common number , then the 1-Wasserstein metric over has -distortion bounded below by a constant multiple of . We proceed to compute these dimensions for -powers of certain graphs. In particular, we get that the sequence of diamond graphs has isoperimetric dimension and Lipschitz-spectral dimension equal to 2, obtaining as a corollary that the 1-Wasserstein metric over has -distortion bounded below by a constant multiple of . This answers a question of Dilworth, Kutzarova, and Ostrovskii and exhibits only the third sequence of -embeddable graphs whose sequence of 1-Wasserstein metrics is not -embeddable.
more »
« less
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 time steps, where refers to the system size and 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 steps and the X-cube fracton model in 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
- 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
-
-
In this paper we derive the best constant for the following -type Gagliardo-Nirenberg interpolation inequality where parameters and satisfy the conditions , . The best constant is given by where is the unique radial non-increasing solution to a generalized Lane-Emden equation. The case of equality holds when for any real numbers , and . In fact, the generalized Lane-Emden equation in contains a delta function as a source and it is a Thomas-Fermi type equation. For or , have closed form solutions expressed in terms of the incomplete Beta functions. Moreover, we show that and as for , where and are the function achieving equality and the best constant of -type Gagliardo-Nirenberg interpolation inequality, respectively.more » « less
-
We present an explicit quantum circuit that prepares an arbitrary -eigenstate on a quantum computer, including the exact eigenstates of the spin- 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 -qubit state with down-spins using multi-controlled rotation gates and CNOT-gates.more » « less
-
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 that can correct up to errors, the traditional Shor scheme handles ancilla preparation and measurement faults by performing syndrome measurements until the syndromes are repeated times in a row; in the worst-case scenario, 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 rounds and 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 , our FTEC protocols with the adaptive schemes require no more than rounds on average.more » « less
-
We formulate a plausible conjecture for the optimal Ehrhard-type inequality for convex symmetric sets with respect to the Gaussian measure. Namely, letting and , we conjecture that the function , given by (with an appropriate choice of a decomposition and coefficients ) satisfies, for all symmetric convex sets and , and any , We explain that this conjecture is βthe most optimistic possibleβ, and is equivalent to the fact that for any symmetric convex set , itsGaussian concavity power is greater than or equal to , for some . We call the sets round -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 in , where is the torsional rigidity of with respect to the Gaussian measure.Moreover, the equality holds if and only if for some and .As a consequence, we get where is a certain rational function of degree , the expectation is taken with respect to the restriction of the Gaussian measure onto , is the Minkowski functional of , and is the in-radius of . The result follows via a combination of some novel estimates, the 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 whose composition with is concave in the Minkowski sense for all symmetric convex sets.more » « less
An official website of the United States government

