Related papers: Balls and Walls: A Compact Unary Coding for Bosoni…
Bilayer quantum Hall states have been shown to be described by a BCS-paired state of composite fermions. However, finding a qualitatively accurate model state valid across all values of the bilayer separation is challenging. Here, we…
We explore the groundstates of a few dipolar bosons in optical lattices with incommensurate filling. The competition of kinetic, potential, and interaction energies leads to the emergence of a variety of crystal state orders with…
The surface code is a promising candidate for fault-tolerant quantum computation and has been implemented in many quantum hardware platforms. In this work, we propose a new non-local unitary circuit to encode a surface code state based on a…
In this work we describe a new technique for numerical exact diagonalization. The method is particularly suitable for cold bosonic atoms in optical lattices, in which multiple atoms can occupy a lattice site. We describe the use of the…
Continuous-variable cat codes are encodings into a single photonic or phononic mode that offer a promising avenue for hardware-efficient fault-tolerant quantum computation. Protecting information in a cat code requires measuring the mode's…
We present a general procedure for constructing lattices of qubits with a Hamiltonian composed of nearest-neighbour two-body interactions such that the ground state encodes a cluster state. We give specific details for lattices in one-,…
We study invertible states of 1d bosonic quantum lattice systems. We show that every invertible 1d state is in a trivial phase: after tensoring with some unentangled ancillas it can be disentangled by a fuzzy analog of a finite-depth…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that…
Bosonic codes, leveraging infinite-dimensional Hilbert spaces for redundancy, offer great potential for encoding quantum information. However, the realization of a practical continuous-variable bosonic code that can simultaneously correct…
The one-body reduced density matrix $\gamma$ plays a fundamental role in describing and predicting quantum features of bosonic systems, such as Bose-Einstein condensation. The recently proposed reduced density matrix functional theory for…
Fault tolerant quantum simulation via the phase estimation algorithm and qubitization has a T-gate count that scales proportionally to the 1-norm of the Hamiltonian, the cost of block encoding the Hamiltonian, and inversely proportionally…
Lattice states are a class of quantum states that naturally generalize the fundamental set of Bell states. We apply recent results from quantum error correction and from one-way local operations and classical communication (LOCC) theory,…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
Bosons in the form of ultra cold alkali atoms can be confined to a one dimensional (1d) domain by the use of harmonic traps. This motivates the study of the ground state occupations $\lambda_i$ of effective single particle states $\phi_i$,…
Based on a generalization of Hohenberg-Kohn's theorem, we propose a ground state theory for bosonic quantum systems. Since it involves the one-particle reduced density matrix $\gamma$ as a natural variable but still recovers quantum…
The Fibonacci topological order is the simplest platform for a universal topological quantum computer, consisting of a single type of non-Abelian anyon, $\tau$, with fusion rule $\tau\times\tau=1+\tau$. While it has been proposed that the…
Unary coding is useful but it is redundant in its standard form. Unary coding can also be seen as spatial coding where the value of the number is determined by its place in an array. Motivated by biological finding that several neurons in…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…
We develop a framework for the classification of invertible translation-invariant stabilizer codes modulo condensation and stabilization with simple codes. We introduce generalizations of the Pauli groups of local unitaries for quantum…
We present a new variational method for investigating the ground state and out of equilibrium dynamics of quantum many-body bosonic and fermionic systems. Our approach is based on constructing variational wavefunctions which extend Gaussian…