Related papers: Approximate low-weight check codes and circuit low…
We develop a systematic semiclassical approximation scheme for quantum Hall skyrmions near filling factors $\nu = {1 \over 2n+1}$, which is exact in the long wavelength limit. We construct a coherent state basis for the Hilbert space of…
We consider the entanglement entropy of an arbitrary subregion in a system of $N$ non-relativistic fermions in $2+1$ dimensions in Lowest Landau Level (LLL) states. Using the connection of these states to those of an auxiliary $1+1$…
Advantages of using a low-energy effective theory to study bound state properties are briefly discussed, and a nonperturbative implementation of such an effective theory is described within the context of nonrelativistic quantum mechanics.…
Identifying the best families of quantum error correction (QEC) codes for near-term experiments is key to enabling fault-tolerant quantum computing. Ideally, such codes should have low overhead in qubit number, high physical error…
F-theory GUT models favor a relatively narrow range of soft supersymmetry breaking parameters in the MSSM Lagrangian. This leads to the specific predictions that a 10-100 MeV mass gravitino is the LSP, and the NLSP is quasi-stable, with a…
Stabilizer states are a prime resource for a number of applications in quantum information science, such as secret-sharing and measurement-based quantum computation. This motivates us to study the entanglement of noisy stabilizer states…
The local Hamiltonian problem plays the equivalent role of SAT in quantum complexity theory. Understanding the complexity of the intermediate case in which the constraints are quantum but all local terms in the Hamiltonian commute, is of…
We propose the use of certain low-density generator-matrix (LDGM) codes as syndrome measurement (SM) codes for quantum low-density parity check (QLDPC) codes. We use an efficient progressive-edge-growth-like algorithm to create LDGM SM…
High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are highly desirable for achieving fault-tolerant quantum computing. Recently, quantum error correction has experienced…
Given a local Hamiltonian, how difficult is it to determine the entanglement structure of its ground state? We show that this problem is computationally intractable even if one is only trying to decide if the ground state is volume-law vs…
In 2024, Kliuchnikov and Sch\"onnenbeck showed a connection between the Barnes Wall lattices, stabilizer states and Clifford operations. In this work, we study their results and relate them to the problem of lower bounding stabilizer ranks.…
We study the hardness of the problem of finding the distance of quantum error-correcting codes. The analogous problem for classical codes is known to be NP-hard, even in approximate form. For quantum codes, various problems related to…
Reconstructing a quantum system's Hamiltonian from limited yet experimentally observable information is interesting both as a practical task and from a fundamental standpoint. We pose and investigate the inverse problem of reconstructing a…
Over the past decade, the low-degree heuristic has been used to estimate the algorithmic thresholds for a wide range of average-case planted vs null distinguishing problems. Such results rely on the hypothesis that if the low-degree moments…
In this tutorial we address the existence and stability of periodic and quasiperiodic orbits in N degree of freedom Hamiltonian systems and their connection with discrete symmetries. Of primary importance in our study are the nonlinear…
Computing many-body ground state energies and resolving electronic structure calculations are fundamental problems for fields such as quantum chemistry or condensed matter. Several quantum computing algorithms that address these problems…
We study the complexity of finding the ground state energy density of a local Hamiltonian on a lattice in the thermodynamic limit of infinite lattice size. We formulate this rigorously as a function problem, in which we request an estimate…
The paper proposes an iterative Hidden Markov Model (HMM) for decoding a Low Density Parity Check (LDPC) code. It is demonstrated that a first-order HMM provides a natural framework for the decoder. The HMM is time-homogeneous with a fixed…
We consider a version of the nearest-codeword problem on finite fields $\mathbb{F}_q$ using the Manhattan distance, an analog of the Hamming metric for non-binary alphabets. Similarly to other lattice related problems, this problem is…
An orthogonal set of states in multipartite systems is called to be strong quantum nonlocality if it is locally irreducible under every bipartition of the subsystems…