Related papers: Bounds on Effective Hamiltonians for Stabilizer Co…
With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting codes designed to address a single dominant error type.…
This paper investigates the relation between linear codes and the stabilizer in ${\rm GL}_2(\mathbb{C})$ of their weight enumerators. We prove a result on the finiteness of stabilizers and give a complete classification of linear codes with…
An open question in designing superconducting quantum circuits is how best to reduce the full circuit Hamiltonian which describes their dynamics to an effective two-level qubit Hamiltonian which is appropriate for manipulation of quantum…
We study properties of stabilizer codes that permit a local description on a regular D-dimensional lattice. Specifically, we assume that the stabilizer group of a code (the gauge group for subsystem codes) can be generated by local Pauli…
In this paper, we explicitly construct (Abelian) anyonic excitations of arbitrary stabilizer Hamiltonians which are local on a 2D lattice of qubits. This leads directly to the conclusion that, in the presence of local thermal noise, such…
A Hamiltonian density bounded from below implies that the lowest-energy state is stable. We point out, contrary to common lore, that an unbounded Hamiltonian density does not necessarily imply an instability: Stability is indeed a…
This work uncovers a fundamental connection between doped stabilizer states, a concept from quantum information theory, and the structure of eigenstates in perturbed many-body quantum systems. We prove that for Hamiltonians consisting of a…
In this work, we explore a new approach to designing both algorithms and error detection codes for preparing approximate ground states of molecules. We propose a classical algorithm to find the optimal stabilizer state by using excitations…
We consider a class of Hermitian Hamiltonians with position-dependent mass $H=((m^alpha)p(m^beta)p(m^alpha))/2+\V$ with $2(alpha)+\beta=-1$. We apply these Hamiltonians to different piecewise flat potentials and masses (step, barrier, well…
We study conditions under which a given hypergraph is randomly robust Hamiltonian, which means that a random sparsification of the host graph contains a Hamilton cycle with high probability. Our main contribution provides nearly optimal…
In this paper we study the equivalence of quantum stabilizer codes via symplectic isometries of stabilizer codes. We define monomially and symplectically equivalent stabilizer codes and determine how different the two notions can be.…
Quantum entanglement is considered, by and large, to be a very delicate and non-robust phenomenon that is very hard to maintain in the presence of noise, or non-zero temperatures. In recent years however, and motivated, in part, by a quest…
We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $\mathbb{F}_4$ and $\mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with…
We consider the mapping of tight-binding electronic structure theory to a local spin Hamiltonian, based on the adiabatic approximation for spin degrees of freedom in itinerant-electron systems. Local spin Hamiltonians are introduced in…
When canonical Hamiltonians of local quantum field theories are transformed using a renormalization group procedure for effective particles, the resulting interaction terms are non-local. The range of their non-locality depends on the…
Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for GF(q)-linear subsystem codes. It follows that no subsystem code over a prime field…
When a Hamiltonian density is bounded by below, we know that the lowest-energy state must be stable. One is often tempted to reverse the theorem and therefore believe that an unbounded Hamiltonian density always implies an instability. The…
We define a numerical scheme that allows to approximate a given Hamiltonian by an effective one, by requiring several constraints determined by exact properties of generic ''short range'' Hamiltonians. In this way the standard lattice fixed…
Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge.…
We define and show how to construct nonbinary quantum stabilizer codes. Our approach is based on nonbinary error bases. It generalizes the relationship between selforthogonal codes over $GF_{4}$ and binary quantum codes to one between…