Quantum circuits for toric code and X-cube fracton model

• URL: http://arxiv.org/abs/2210.01682v3
• Date: Thu, 29 Feb 2024 19:17:55 GMT
• Title: Quantum circuits for toric code and X-cube fracton model
• Authors: Penghua Chen, Bowen Yan, and Shawn X. Cui
• Abstract summary: We propose a 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+log_2(d)+fracL2d rceil$ time steps. Our algorithm reformulates the problem into a purely geometric one, facilitating its extension to attain the ground state of certain 3D topological phases.
• Score: 0.23408308015481666
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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+log_{2}(d)+\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.

Related papers

• Quantum 2D Liouville Path-Integral Is a Sum over Geometries in AdS$_3$ Einstein Gravity [5.169264860833405]
  We triangulate the path-integral of Liouville theory on any 2D surface $mathcalM$. This is essentially a tensor network that admits an interpretation of a state-sum of a 3D topological theory.
  arXiv  Detail & Related papers  (2024-03-05T18:16:49Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Quantum phase transitions in the $K$-layer Ising toric code [0.0]
  Investigation of the $K$-layer Ising toric code corresponding to $K$ layers of two-dimensional toric codes coupled by Ising interactions. For small Ising interactions the system displays $mathbbZK$ topological order originating from the toric codes in each layer. The latter is demonstrated for general $K$ by deriving an effective low-energy model in $Krm th$-order perturbation theory. Extrapolation of the elementary energy gaps gives convincing evidence that the ground-state phase diagram consists of a single quantum critical point in the
  arXiv  Detail & Related papers  (2022-01-25T15:14:23Z)
• Single-shot quantum error correction with the three-dimensional subsystem toric code [77.34726150561087]
  We introduce a new topological quantum code, the three-dimensional subsystem toric code (3D STC) The 3D STC can be realized by measuring geometrically-local parity checks of weight at most three on the cubic lattice with open boundary conditions.
  arXiv  Detail & Related papers  (2021-06-04T17:35:00Z)
• Fracton physics of spatially extended excitations. II. Polynomial ground state degeneracy of exactly solvable models [8.527114922918168]
  We decompose ground state degeneracy (GSD) in both isotropic and anisotropic lattices. We are able to systematically obtain GSD formulas which exhibit diverse kinds of dependence on system sizes.
  arXiv  Detail & Related papers  (2021-04-12T18:03:28Z)
• A New Framework for Variance-Reduced Hamiltonian Monte Carlo [88.84622104944503]
  We propose a new framework of variance-reduced Hamiltonian Monte Carlo (HMC) methods for sampling from an $L$-smooth and $m$-strongly log-concave distribution. We show that the unbiased gradient estimators, including SAGA and SVRG, based HMC methods achieve highest gradient efficiency with small batch size. Experimental results on both synthetic and real-world benchmark data show that our new framework significantly outperforms the full gradient and gradient HMC approaches.
  arXiv  Detail & Related papers  (2021-02-09T02:44:24Z)
• $\mathbb{Z}_2$ lattice gauge theories and Kitaev's toric code: A scheme for analog quantum simulation [0.0]
  Kitaev's toric code is an exactly solvable model with $mathbbZ$-topological order. Our work paves the way for realizing non-Abelian anyons in analog quantum simulators.
  arXiv  Detail & Related papers  (2020-12-09T18:59:58Z)
• Quantum anomalous Hall phase in synthetic bilayers via twistless twistronics [58.720142291102135]
  We propose quantum simulators of "twistronic-like" physics based on ultracold atoms and syntheticdimensions. We show that our system exhibits topologicalband structures under appropriate conditions.
  arXiv  Detail & Related papers  (2020-08-06T19:58:05Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• PUGeo-Net: A Geometry-centric Network for 3D Point Cloud Upsampling [103.09504572409449]
  We propose a novel deep neural network based method, called PUGeo-Net, to generate uniform dense point clouds. Thanks to its geometry-centric nature, PUGeo-Net works well for both CAD models with sharp features and scanned models with rich geometric details.
  arXiv  Detail & Related papers  (2020-02-24T14:13:29Z)

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.