Homology-changing percolation transitions on finite graphs
arXiv:2011.02603 · doi:10.1063/5.0036418
Abstract
We consider homological edge percolation on a sequence of finite graphs covered by an infinite (quasi)transitive graph , and weakly convergent to . Namely, we use the covering maps to classify -cycles on graphs as homologically trivial or non-trivial, and define several thresholds associated with the rank of thus defined first homology group on the open subgraphs. We identify the growth of the homological distance , the smallest size of a non-trivial cycle on , as the main factor determining the location of homology-changing thresholds. In particular, we show that the giant cycle erasure threshold (related to the conventional erasure threshold for the corresponding sequence of generalized toric codes) coincides with the edge percolation threshold if the ratio diverges, where is the number of edges of , and we give evidence that in several cases where this ratio remains bounded, which is necessarily the case if is non-amenable.
References in corpus (30)
- Fault-tolerant quantum computation by anyons
- Quantum cryptography: Public key distribution and coin tossing
- Good Quantum Error-Correcting Codes Exist
- Topological quantum memory
- Secure Quantum Key Distribution
- A Theory of Fault-Tolerant Quantum Computation
- Practical challenges in quantum key distribution
- Simple Quantum Error Correcting Codes
- A fast Monte Carlo algorithm for site or bond percolation
- Capacities of Quantum Erasure Channels
- Active stabilisation, quantum computation and quantum state synthesis
- Thresholds for topological codes in the presence of loss
- Error Threshold for Color Codes and Random 3-Body Ising Models
- Constructions and Noise Threshold of Hyperbolic Surface Codes
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- Percolation in the Hyperbolic Plane
- Uniqueness and non-uniqueness in percolation theory
- Periodic boundary conditions on the pseudosphere
- Three-dimensional color code thresholds via statistical-mechanical mapping
- Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
- Homological Percolation and the Euler Characteristic
- Tradeoffs for reliable quantum information storage in surface codes and color codes
- Error- and Loss-Tolerances of Surface Codes with General Lattice Structures
- Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- New critical exponent inequalities for percolation and the random cluster model
- Percolation Thresholds in Hyperbolic Lattices
- Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank
- Generalized surface codes and packing of logical qubits
- A homological upper bound on critical probabilities for hyperbolic percolation