Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries

• URL: http://arxiv.org/abs/2108.00018v2
• Date: Fri, 27 Aug 2021 03:49:51 GMT
• Title: Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
• Authors: Guanyu Zhu and Tomas Jochym-O'Connor and Arpit Dua
• Abstract summary: We prove a no-go theorem that $mathbbZ_N$ topological order cannot survive on any fractal embedded in 2D. We construct fault-tolerant logical gates using their connection to global and higher-form topological symmetries.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate topological order on fractal geometries embedded in $n$ dimensions. In particular, we diagnose the existence of the topological order through the lens of quantum information and geometry, i.e., via its equivalence to a quantum error-correcting code with a macroscopic code distance or the presence of macroscopic systoles in systolic geometry. We first prove a no-go theorem that $\mathbb{Z}_N$ topological order cannot survive on any fractal embedded in 2D. For fractal lattice models embedded in 3D or higher spatial dimensions, $\mathbb{Z}_N$ topological order survives if the boundaries of the interior holes condense only loop or membrane excitations. Moreover, for a class of models containing only loop or membrane excitations, and are hence self-correcting on an $n$-dimensional manifold, we prove that topological order survives on a large class of fractal geometries independent of the type of hole boundaries. We further construct fault-tolerant logical gates using their connection to global and higher-form topological symmetries. In particular, we have discovered a logical CCZ gate corresponding to a global symmetry in a class of fractal codes embedded in 3D with Hausdorff dimension asymptotically approaching $D_H=2+\epsilon$ for arbitrarily small $\epsilon$, which hence only requires a space-overhead $\Omega(d^{2+\epsilon})$ with $d$ being the code distance. This in turn leads to the surprising discovery of certain exotic gapped boundaries that only condense the combination of loop excitations and gapped domain walls. We further obtain logical $\text{C}^{p}\text{Z}$ gates with $p\le n-1$ on fractal codes embedded in $n$D. In particular, for the logical $\text{C}^{n-1}\text{Z}$ in the $n^\text{th}$ level of Clifford hierarchy, we can reduce the space overhead to $\Omega(d^{n-1+\epsilon})$. Mathematically, our findings correspond to macroscopic relative systoles in fractals.

Related papers

• Random unitaries in extremely low depth [0.8680580889074451]
  We prove that random quantum circuits on any geometry, including a 1D line, can form approximate unitary designs over $n$ qubits in $log n$ depth. In a similar manner, we construct pseudorandom unitaries (PRUs) in 1D circuits in $textpoly log n $ depth, and in all-to-all-connected circuits in $textpoly log log n $ depth.
  arXiv  Detail & Related papers  (2024-07-10T15:27:48Z)
• Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
  We show how to reduce the geometry of degenerate states to the non-abelian connection $A$. We find independent invariants associated with each triple of subspaces. Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
  arXiv  Detail & Related papers  (2024-04-04T06:39:28Z)
• Higher-group symmetry of (3+1)D fermionic $\mathbb{Z}_2$ gauge theory: logical CCZ, CS, and T gates from higher symmetry [0.0]
  We study the higher-group structure in (3+1)D $mathbbZ$ gauge theory with an emergent fermion. Our considerations also imply the possibility of a logical $T$ gate by placing the code on $mathbbRP3$ and pumping a $p+ip$ topological state.
  arXiv  Detail & Related papers  (2023-11-09T19:00:00Z)
• Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries [1.3194391758295114]
  We study fault-tolerant quantum computing for families of homological quantum low-density parity-check codes defined on 3-manifolds with constant or almost-constant encoding rate. We have developed a generic formalism to compute the triple intersection invariants for 3-manifolds.
  arXiv  Detail & Related papers  (2023-10-25T20:33:59Z)
• Detection-Recovery Gap for Planted Dense Cycles [72.4451045270967]
  We consider a model where a dense cycle with expected bandwidth $n tau$ and edge density $p$ is planted in an ErdHos-R'enyi graph $G(n,q)$. We characterize the computational thresholds for the associated detection and recovery problems for the class of low-degree algorithms.
  arXiv  Detail & Related papers  (2023-02-13T22:51:07Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• A New Look at the $C^{0}$-formulation of the Strong Cosmic Censorship Conjecture [68.8204255655161]
  We argue that for generic black hole parameters as initial conditions for Einstein equations, the metric is $C0$-extendable to a larger Lorentzian manifold. We prove it violates the "complexity=volume" conjecture for a low-temperature hyperbolic AdS$_d+1$ black hole dual to a CFT living on a ($d-1$)-dimensional hyperboloid $H_d-1$.
  arXiv  Detail & Related papers  (2022-06-17T12:14:33Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• A degeneracy bound for homogeneous topological order [0.30458514384586394]
  We introduce a notion of homogeneous topological order, which is obeyed by most, if not all, known examples of topological order. We derive a bound on the ground state degeneracy $mathcal D$ for systems with homogeneous topological order.
  arXiv  Detail & Related papers  (2020-09-28T18:03:17Z)
• A deep network construction that adapts to intrinsic dimensionality beyond the domain [79.23797234241471]
  We study the approximation of two-layer compositions $f(x) = g(phi(x))$ via deep networks with ReLU activation. We focus on two intuitive and practically relevant choices for $phi$: the projection onto a low-dimensional embedded submanifold and a distance to a collection of low-dimensional sets.
  arXiv  Detail & Related papers  (2020-08-06T09:50:29Z)
• Epsilon-nets, unitary designs and random quantum circuits [0.11719282046304676]
  Epsilon-nets and approximate unitary $t$-designs are notions of unitary operations relevant for numerous applications in quantum information and quantum computing. We prove that for a fixed $d$ of the space, unitaries constituting $delta$-approx $t$-expanders form $epsilon$-nets for $tsimeqfracd5/2epsilon$ and $delta=left(fracepsilon3/2dright)d2$. We show that approximate tdesigns can be generated
  arXiv  Detail & Related papers  (2020-07-21T15:16:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.