Searcharxiv⌕ Search

arXiv subjects

Ting-Chun Lin

Publications and source records attributed to Ting-Chun Lin.

At least 19 recordsLinked to original sources
arXiv2026

Reconstruction of the conformal algebra from a critical groundstate on the (fuzzy) sphere

Recently, we found a method to reconstruct the dilatation operator (sphere Hamiltonian) from a regulated conformal field theory groundstate. In this paper, we explore methods to construct the whole global conformal algebra, and test our construction using fuzzy sphere regularization. Starting from a groundstate of the same Hamiltonian, these methods perform better than constructions of the conformal generators based on a Hamiltonian density, are model-independent, require no additional tuning, and improve with system size. One purpose of reconstructing the conformal algebra is to identify conformal primary states, which we do with some success. We also find further evidence supporting the model of the short-distance corrections to the entanglement Hamiltonian proposed earlier and use it to make systematic improvements.

hep-th↗
arXiv2026

Simplified Quantum Weight Reduction with Optimal Bounds

Quantum weight reduction is the task of transforming a quantum code with large check weight into one with small check weight. This problem is important in practice, since low-weight measurements are necessary for reliable implementations of quantum error correction on physical hardware. It is also important theoretically, as it can be used to construct constant-locality versions of quantum locally testable codes, which may be relevant to the quantum PCP conjecture. We give a streamlined geometric procedure for quantum weight reduction based entirely on coning and treating X and Z checks symmetrically, which simplifies Hastings' previous approach. In particular, given an arbitrary $[[n,k,d]]$ quantum code with weight $w$, our method produces a code with parameters $[[O(n w^2 \log w), k, Ω(d w)]]$, check weight $5$, and qubit weight $6$; these bounds are optimal or close to optimal within the current geometric framework. Applied to random dense CSS codes, our procedure yields explicit quantum codes surpassing the square-root distance barrier, with parameters $[[n, \tilde Ω(n^{1/3}), \tilde Ω(n^{2/3})]]$. These codes also admit a three-dimensional embedding that saturates the Bravyi-Poulin-Terhal (BPT) bound, recovering the layer-code result. Our weight reduction technique also improves fault-tolerant logical-operator measurements by reducing the required number of ancilla qubits.

quant-ph↗
arXiv2026

Linear-Time Encodable and Decodable Quantum Error-Correcting Codes

Recent years have seen rapid development in the subject of quantum coding theory, with breakthroughs on many exciting classes of codes, including quantum LDPC codes, quantum locally testable codes, and quantum codes with interesting transversal gates. However, a natural class of quantum codes, which has been well-studied classically, has not yet been treated: those which can be quickly encoded and decoded. This problem concerns the channel capacity setting, where a noise channel sits between perfect encoding and unencoding/decoding operations; this is the setting that is relevant for communication between fault-tolerant quantum computers. In this work, we construct asymptotically good quantum codes that can be encoded and unencoded by quantum circuits of logarithmic depth and consisting of a linear total number of gates. The classical decoding algorithms also run in logarithmic depth and use $\mathcal{O}(n \log n)$ gates, or alternatively a linear number of gates but with higher depth. We further construct explicit and asymptotically good quantum codes whose encoding, unencoding and decoding all use a linear number of gates, and additionally whose encoding and unencoding may be run in logarithmic depth.

quant-ph↗
arXiv2026

Toward Entanglement Bootstrap for Conformal Field Theory in Any Dimension

Given a quantum critical wavefunction in any dimension, we propose a reconstructed Hamiltonian, analogous to the ones previously found for 1+1d CFT and for 2+1d bosonic liquid topologically-ordered states. We test numerically that, for known regularized approximate CFT groundstates (on the icosahedron and the fuzzy sphere), (1) they are close to the groundstate of their reconstructed Hamiltonian, and (2) the spectrum of their reconstructed Hamiltonian on the unit sphere has CFT properties (integer spacing of descendants) and matches known low-lying energies. We show that this provides an automated method to improve the finite-size effects in a fixed Hilbert space.

hep-th↗
arXiv2026

A passive self-correcting quantum memory in three dimensions

We construct a 3D Pauli stabilizer Hamiltonian whose ground state space can encode a qubit for exponential time when coupled to a bath at non-zero temperature. Our construction recursively applies a sequence of transformations to a seed Hamiltonian that increases the memory lifetime of the encoded qubit while maintaining geometric locality in $\mathbb{R}^3$.

quant-ph↗
arXiv2026

Parsimonious Quantum Low-Density Parity-Check Code Surgery

Quantum code surgery offers a flexible, low-overhead framework for executing logical measurements within quantum error-correcting codes. It encompasses several fault-tolerant logical computation schemes, including parallel surgery, universal adapters and fast surgery, and serves as the key primitive in extractor architectures. The efficiency of these schemes crucially depends on constructing low-overhead ancilla systems for measuring arbitrary logical operators in general quantum Low-Density Parity-Check (qLDPC) codes. In this work, we introduce a method to construct an ancilla system of qubit size $O(W \log W)$ to measure an arbitrary logical Pauli operator of weight $W$ in any qLDPC stabilizer code. This new construction immediately reduces the asymptotic overhead across various quantum code surgery schemes.

quant-ph↗
arXiv2026

Chiral gapped states are universally non-topological

We propose an operator generalization of the Li-Haldane conjecture regarding the entanglement Hamiltonian of a disk in a 2+1D chiral gapped groundstate. The logic applies to regions with sharp corners, from which we derive several universal properties regarding corner entanglement. These universal properties follow from a set of locally-checkable conditions on the wavefunction. We also define a quantity $(\mathfrak{c}_{\text{tot}})_{\text{min}}$ that reflects the robustness of corner entanglement contributions, and show that it provides an obstruction to a gapped boundary. One reward from our analysis is that we can construct a local gapped Hamiltonian within the same chiral gapped phase from a given wavefunction; we conjecture that it is closer to the low-energy renormalization group fixed point than the original parent Hamiltonian. Our analysis of corner entanglement reveals the emergence of a universal conformal geometry encoded in the entanglement structure of bulk regions of chiral gapped states that is not visible in topological field theory. Our formalism also gives an explanation of the modular commutator formula for the chiral central charge.

cond-mat.str-el↗
arXiv2025

Strict area law entanglement versus chirality

Chirality is a property of a gapped phase of matter in two spatial dimensions that can be manifested through non-zero thermal or electrical Hall conductance. In this paper, we prove two no-go theorems that forbid such chirality for a quantum state in a finite dimensional local Hilbert space with strict area law entanglement entropies. As a crucial ingredient in the proofs, we introduce a new quantum information-theoretic primitive called instantaneous modular flow, which has many other potential applications.

quant-ph↗
arXiv2025

Single-Shot Universality in Quantum LDPC Codes via Code-Switching

Code-switching is a powerful technique in quantum error correction that allows one to leverage the complementary strengths of different codes to achieve fault-tolerant universal quantum computation. However, existing code-switching protocols that encapsulate recent generalized lattice surgery approaches often either require many rounds of measurements to ensure fault-tolerance or suffer from low code rates. We present a single-shot, universal protocol that uses code-switching between high-rate quantum codes to perform fault-tolerant quantum computation. To our best knowledge, our work contains the first universal fault-tolerant quantum computation protocol that achieves what we term single-shot universality on high-rate codes that is characterized by (i) single-shot error correction, (ii) single-shot state preparation, as well as (iii) universal logical gates and logical measurements with constant depth circuits. We achieve this feat with single-shot code-switching between constant-rate 2D hypergraph product (HGP) codes and high-rate 3D HGP codes that can be viewed as a generalization of Bombin's dimensional jump for color codes and Hillmann et al.'s single-shot lattice surgery for higher-dimensional topological codes. In addition, we prove the fault-tolerance of our code-switching protocol under both the adversarial and local-stochastic noise models. We introduce a vastly simpler recipe to construct high-rate 3D HGP codes with transversal CCZ gates that grants immense flexibility in the choice of expander graphs and local codes, allowing us to expand the search space for codes with good parameters and interesting logical gates. Our work opens an alternative path towards universal fault-tolerant quantum computation with low space-time overhead by circumventing the need for magic state distillation.

quant-ph↗
arXiv2025

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes

We introduce a high-dimensional cubical complex, for any dimension t>0, and apply it to the design of quantum locally testable codes. Our complex is a natural generalization of the constructions by Panteleev and Kalachev and by Dinur et. al of a square complex (case t=2), which have been applied to the design of classical locally testable codes (LTC) and quantum low-density parity check codes (qLDPC) respectively. We turn the geometric (cubical) complex into a chain complex by relying on constant-sized local codes $h_1,\ldots,h_t$ as gadgets. A recent result of Panteleev and Kalachev on existence of tuples of codes that are product expanding enables us to prove lower bounds on the cycle and co-cycle expansion of our chain complex. For t=4 our construction gives a new family of "almost-good" quantum LTCs -- with constant relative rate, inverse-polylogarithmic relative distance and soundness, and constant-size parity checks. Both the distance of the quantum code and its local testability are proven directly from the cycle and co-cycle expansion of our chain complex.

quant-ph↗
arXiv2025

A systematic search for conformal field theories in very small spaces

Groundstates of 1+1d conformal field theories (CFTs) satisfy a local entropic condition called the vector fixed point equation. This condition is surprisingly well satisfied by groundstates of quantum critical lattice models even at small system sizes. We perform a search in the space of states of very small systems (four qubits and four qutrits) and examine the states that satisfy this condition. By reconstructing a local Hamiltonian from each state, we are able to identify many of these solutions with known CFTs; others are gapped fixed points, or involve large relevant perturbations, and others are CFTs we have not yet identified. These ideas are also useful for identifying continuous quantum phase transitions in a given family of Hamiltonians, and for identifying the nature of the critical theory in small systems.

hep-th↗
arXiv2025

Almost Linear Decoder for Optimal Geometrically Local Quantum Codes

Geometrically local quantum codes, which are error correction codes embedded in $\mathbb{R}^D$ with checks acting only on qubits within a fixed spatial distance, have garnered significant interest. Recently, it has been demonstrated how to achieve geometrically local codes that maximize both the dimension and the distance, as well as the energy barrier of the code. In this work, we focus on the constructions involving subdivision and show that they have an almost linear time decoder, obtained by combining the decoder of the outer good qLDPC code and a generalized version of the Union-Find decoder. This provides the first decoder for an optimal geometrically local three-dimensional code. We demonstrate the existence of a finite threshold error rate under the code capacity noise model using a minimum weight perfect matching decoder. Furthermore, we argue that this threshold is also applicable to the decoder based on the generalized Union-Find algorithm.

quant-ph↗
arXiv2025

Conformal geometry from entanglement

In a physical system with conformal symmetry, observables depend on cross-ratios, measures of distance invariant under global conformal transformations (conformal geometry for short). We identify a quantum information-theoretic mechanism by which the conformal geometry emerges at the gapless edge of a 2+1D quantum many-body system with a bulk energy gap. We introduce a novel pair of information-theoretic quantities $(\mathfrak{c}_{\mathrm{tot}}, η)$ that can be defined locally on the edge from the wavefunction of the many-body system, without prior knowledge of any distance measure. We posit that, for a topological groundstate, the quantity $\mathfrak{c}_{\mathrm{tot}}$ is stationary under arbitrary variations of the quantum state, and study the logical consequences. We show that stationarity, modulo an entanglement-based assumption about the bulk, implies (i) $\mathfrak{c}_{\mathrm{tot}}$ is a non-negative constant that can be interpreted as the total central charge of the edge theory. (ii) $η$ is a cross-ratio, obeying the full set of mathematical consistency rules, which further indicates the existence of a distance measure of the edge with global conformal invariance. Thus, the conformal geometry emerges from a simple assumption on groundstate entanglement. We show that stationarity of $\mathfrak{c}_{\mathrm{tot}}$ is equivalent to a vector fixed-point equation involving $η$, making our assumption locally checkable. We also derive similar results for 1+1D systems under a suitable set of assumptions.

quant-ph↗
arXiv2025

Chiral Virasoro algebra from a single wavefunction

Chiral edges of 2+1D systems can have very robust emergent conformal symmetry. When the edge is purely chiral, the Hilbert space of low-energy edge excitations can form a representation of a single Virasoro algebra. We propose a method to systematically extract the generators of the Virasoro algebra from a single ground state wavefunction, using entanglement bootstrap and an input from the edge conformal field theory. We corroborate our construction by numerically verifying the commutation relations of the generators. We also study the unitary flows generated by these operators, whose properties (such as energy and state overlap) are shown numerically to agree with our analytical predictions.

quant-ph↗
arXiv2024

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier

We construct the first explicit two-sided vertex expanders that bypass the spectral barrier. Previously, the strongest known explicit vertex expanders were given by $d$-regular Ramanujan graphs, whose spectral properties imply that every small subset of vertices $S$ has at least $0.5d|S|$ distinct neighbors. However, it is possible to construct Ramanujan graphs containing a small set $S$ with no more than $0.5d|S|$ neighbors. In fact, no explicit construction was known to break the $0.5 d$-barrier. In this work, we give an explicit construction of an infinite family of $d$-regular graphs (for large enough $d$) where every small set expands by a factor of $\approx 0.6d$. More generally, for large enough $d_1,d_2$, we give an infinite family of $(d_1,d_2)$-biregular graphs where small sets on the left expand by a factor of $\approx 0.6d_1$, and small sets on the right expand by a factor of $\approx 0.6d_2$. In fact, our construction satisfies an even stronger property: small sets on the left and right have unique-neighbor expansion $0.6d_1$ and $0.6d_2$ respectively. Our construction follows the tripartite line product framework of Hsieh, McKenzie, Mohanty & Paredes, and instantiates it using the face-vertex incidence of the $4$-dimensional Ramanujan clique complex as its base component. As a key part of our analysis, we derive new bounds on the triangle density of small sets in the Ramanujan clique complex.

math.CO↗
arXiv2024

Proposals for 3D self-correcting quantum memory

A self-correcting quantum memory is a type of quantum error correcting code that can correct errors passively through cooling. A major open question in the field is whether self-correcting quantum memories can exist in 3D. In this work, we propose two candidate constructions for 3D self-correcting quantum memories. The first construction is an extension of Haah's code, which retains translation invariance. The second construction is based on fractals with greater flexibility in its design. Additionally, we review existing 3D quantum codes and suggest that they are not self-correcting.

quant-ph↗
arXiv2024

Transversal non-Clifford gates for quantum LDPC codes on sheaves

A major goal in quantum computing is to build a fault-tolerant quantum computer. One approach involves quantum low-density parity-check (qLDPC) codes that support transversal non-Clifford gates. In this work, we provide a large family of such codes. The key insight is to interpret the logical operators of qLDPC codes as geometric surfaces and use the intersection number of these surfaces to define the non-Clifford operation. At a more abstract level, this construction is based on defining the cup product on the chain complex induced from a sheaf.

quant-ph↗