Related papers: Efficient quantum Gibbs sampling of stabilizer cod…
We consider the strong coupling limit of lattice QCD with massless staggered quarks and study the resource requirements for quantum simulating the theory in its Hamiltonian formulation. The bosonic Hilbert space of the color-singlet degrees…
Dissipative quantum algorithms for state preparation in many-body systems are increasingly recognised as promising candidates for achieving large quantum advantages in application-relevant tasks. Recent advances in algorithmic,…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
Logical qubits can be protected against environmental noise by encoding them into a highly entangled state of many physical qubits and actively intervening in the dynamics with stabilizer measurements. In this work, we numerically optimize…
We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace…
The problem 2-LOCAL HAMILTONIAN has been shown to be complete for the quantum computational class QMA, see quant-ph/0406180. In this paper we show that this important problem remains QMA-complete when the interactions of the 2-local…
Surface codes are a promising method of quantum error correction and the basis of many proposed quantum computation implementations. However, their efficient decoding is still not fully explored. Recently, approaches based on machine…
Adopting the geometric description of steering assemblages and local hidden states (LHS) model, we construct the optimal LHS model for some two-qubit states under continuous projective measurements, and obtain a sufficient steering…
We study Bosonic representation of spin Ising model with the application of simulating two level systems using continuous variable quantum processors. We decompose the time evolution of spin systems into a sequence of continuous variable…
The lattice compact Abelian Higgs model is a non-perturbative regularized formulation of low-energy scalar quantum electrodynamics. In 1+1 dimensions, this model can be quantum simulated using a ladder-shaped optical lattice with…
We formally define homological quantum rotor codes which use multiple quantum rotors to encode logical information. These codes generalize homological or CSS quantum codes for qubits or qudits, as well as linear oscillator codes which…
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…
It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced disispative evolution, inspired by existing models of…
We propose a method for constructing $\texttt{PREPARE}$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry by using variational optimization of quantum circuits solely on classical computers. The…
We present a quantum algorithm to prepare the thermal Gibbs state of interacting quantum systems. This algorithm sets a universal upper bound D^alpha on the thermalization time of a quantum system, where D is the system's Hilbert space…
Encoding classical data on quantum spin Hamiltonians yields ordered spin ground states which are used to discriminate data types for binary classification. The Ising Hamiltonian is a typical spin model to encode classical data onto qubits,…
We introduce a new primitive, called welding, for combining two stabilizer codes to produce a new stabilizer code. We apply welding to construct surface codes and then use the surface codes to construct solid codes, a variant of a 3-d toric…
Quantum computation represents an emerging framework to solve lattice gauge theories (LGT) with arbitrary gauge groups, a general and long-standing problem in computational physics. While quantum computers may encode LGT using only…
We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body…
Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess their resourcefulness, sufficient conditions have remained…