Related papers: A fermionic code related to the exceptional group …
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
We construct qubit stabilizer codes with parameters $[[81, 0, 20]]$ and $[[94, 0, 22]]$ for the first time. We use symplectic self-dual additive codes over $\mathbb{F}_4$ built by modifying the adjacency matrices of suitable metacirculant…
We study the underlying extended supersymmetric structure in a system composed of fermions scattered off an infinitely extended static domain wall in the $xz$-plane. As we shall demonstrate, the fermionic scattered states are associated to…
Local Hamiltonians of fermionic systems on a lattice can be mapped onto local qubit Hamiltonians. Maintaining the locality of the operators comes at the expense of increasing the Hilbert space with auxiliary degrees of freedom. In order to…
Surface codes describe quantum memory stored as a global property of interacting spins on a surface. The state space is fixed by a complete set of quasi-local stabilizer operators and the code dimension depends on the first homology group…
In contemporary physics, especially in condensed matter physics, fermionic topological order and its protected edge modes are one of the most important objects. In this work, we propose a systematic construction of the cylinder partition…
Compressible models extend the domain of simulable systems in quantum computers, but little is known about their precise limits of applicability. Using the theory of compressible matchgate circuits, we identify a class of quadratic…
After exploring much on two-dimensional higher-order topological superconductors (HOTSCs) hosting Majorana corner modes (MCMs) only, we propose a simple fermionic model based on a three-dimensional topological insulator proximized with…
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…
We study the ground states of lattice Hamiltonians that are invariant under permutations, in the limit where the number of lattice sites, N -> \infty. For spin systems, these are product states, a fact that follows directly from the quantum…
We study the Hermitian hull of a particular family of generalized Reed-Solomon codes. The problem of computing the dimension of the hull is translated to a counting problem in a lattice. By solving this problem, we provide explicit formulas…
We devise a number-conserving scheme for the realization of Majorana Zero Modes in an interacting fermionic ladder coupled by Aharonov-Bohm cages. The latter provide an efficient mechanism to cancel single-particle hopping by destructive…
Up to now every good quantum error-correcting code discovered has had the structure of an eigenspace of an Abelian group generated by tensor products of Pauli matrices; such codes are known as stabilizer or additive codes. In this letter we…
We propose to construct large quantum graph codes by means of superconducting circuits working at the ultrastrong coupling regime. In this physical scenario, we are able to create a cluster state between any pair of qubits within a fraction…
One promising avenue to study one-dimensional ($1$D) topological phases is to realize them in synthetic materials such as cold atomic gases. Intriguingly, it is possible to realize Majorana boundary modes in a $1$D number-conserving system…
Inspired by recent developments generalizing Jordan-Wigner dualities to higher dimensions, we develop a framework of such dualities using an algebraic formalism for translation-invariant Hamiltonians proposed by Haah. We prove that given a…
Recently we developed a local and constructive algorithm based on Lie algebraic methods for compressing Trotterized evolution under Hamiltonians that can be mapped to free fermions. The compression algorithm yields a circuit which scales…
Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gagie et al. (2015) gave a representation of this coding…
This paper proposes new propagation rules on quantum codes in the entanglement-assisted and in quantum subsystem scenarios. The rules lead to new families of such quantum codes whose parameters are demonstrably optimal. To obtain the…
We establish a unified framework for Majorana-based fault-tolerant quantum computation with Majorana surface codes and Majorana color codes. All logical Clifford gates are implemented with zero time overhead. This is done by introducing a…