Near term quantum devices have recently garnered significant interest as promising candidates for investigating difficult-to-probe regimes in many-body physics. To this end, various qubit encoding schemes targeting second quantized Hamiltonians have been proposed and optimized. In this study, we investigate two qubit representations of the planar rotor lattice Hamiltonian. The first representation is realized by decomposing the rotor Hamiltonian projectors in binary and mapping them to spin-1/2 projectors. The second approach relies on embedding the planar rotor lattice Hilbert space in a larger space and recovering the relevant qubit encoded system as a quotient space projecting down to the physical degrees of freedom. This is typically called the unary mapping and is used for bosonic systems. We establish the veracity of the two encoding approaches using sparse diagonalization on small chains and discuss quantum phase estimation resource requirements to simulate small planar rotor lattices on near-term quantum devices. We also examine the utility of variational approaches for simulating planar rotor chains using these encodings.
Near term quantum devices have recently garnered significant interest as promising candidates for investigating difficult-to-probe regimes in many-body physics. To this end, various qubit encoding schemes targeting second quantized Hamiltonians have been proposed and optimized. In this study, we investigate two qubit representations of the planar rotor lattice Hamiltonian. The first representation is realized by decomposing the rotor Hamiltonian projectors in binary and mapping them to spin-1/2 projectors. The second approach relies on embedding the planar rotor lattice Hilbert space in a larger space and recovering the relevant qubit encoded system as a quotient space projecting down to the physical degrees of freedom. This is typically called the unary mapping and is used for bosonic systems. We establish the veracity of the two encoding approaches using sparse diagonalization on small chains and discuss quantum phase estimation resource requirements to simulate small planar rotor lattices on near-term quantum devices. We also examine the utility of variational approaches for simulating planar rotor chains using these encodings.
Qubit-based quantum simulators naturally target two-level systems, whereas many quantum many-body problems are intrinsically d level. Encodings from qudits to qubits then enlarge the Hilbert space and can introduce unphysical states that interfere with variational optimization. We formulate a variational framework for encoded d -level models that suppresses these illegitimate states with penalty terms and benchmark it for spin-1 and spin-3/2 bilinear-biquadratic Heisenberg chains. We compare binary encoding, which minimizes the qubit overhead, with symmetry encoding, which preserves the relevant spin symmetries and enables symmetry-conserving ansätze. Although binary encoding is more qubit efficient, its hardware-efficient ansatz is harder to train and less effective at exploiting conserved quantities. In contrast, symmetry encoding requires more qubits but reaches substantially higher fidelities, converges faster, and exhibits better trainability than the binary hardware-efficient ansatz. These results identify symmetry-preserving encodings as a practical route to simulating higher-spin models on existing qubit platforms.
We compare the basic resource requirements for first and second quantized bosonic mappings in a system consisting of N particles in M modes. In addition to the standard binary first quantized mapping, we investigate the unary first quantized mapping. Our comparison focuses on the k-body reduced density matrix (k-RDM) and two standard bosonic Hamiltonians. The first quantized mappings use less resources for off-diagonal terms of the k-RDM by a factor of $ \sim N^k$, compared to the second quantized mappings. The number of gates for the first quantized binary mapping increases faster with M compared to the other mappings. Nevertheless, a detailed numeric analysis reveals that the binary first quantized mapping still requires fewer gates than the binary and unary second quantized ones for realistic combinations of N and M, while requiring exponentially fewer qubits than the unary mappings. Additionally, the number of CNOT and Rz(φ) gates necessary to express a single Trotter step of the Hamiltonian in the binary first quantized mapping is comparable to the (most efficient for a single Trotter step) unary first quantized one when M=2n for both the Bose-Hubbard model and the harmonic trap with short-range interactions. Additionally the binary mapping leads to lower one-norms than the unary mapping making it the overall most efficient choice for qubitization-based quantum phase estimation.
Simulating a bosonic degree of freedom on qubit hardware requires discretizing its position space, and the qubit encoding of the resulting lattice determines the circuits that realize its real-time dynamics. We compare binary and unary encodings of a position lattice on superconducting (IBM) and trapped-ion (IonQ) processors. Binary encoding applies the kinetic term through the quantum Fourier transform; unary encoding uses one qubit per site, single-qubit rotations for the potential and excitation-conserving exchange gates for the kinetic term. For a single degree of freedom the unary dynamics is a free-fermion problem, and its product formula compresses exactly into a nearest-neighbor circuit of fixed size. With about two hundred two-qubit gates, these circuits resolve tunneling in a symmetric double well on both processors, with the right-well probability falling from 0.97 to 0.06 on IBM and from 0.96 to 0.12 on IonQ, whereas binary product-formula circuits with several thousand two-qubit gates do not reproduce the transfer. Noiseless emulation indicates that this contrast reflects the compilation as well as the encoding: without the fixed-size optimization, a unary product formula that captures the transfer also requires several thousand two-qubit gates. Post-selection on the single-excitation subspace removes leakage, and because every energy eigenstate of the symmetric grid populates both wells equally, the measured population reversal bounds the coherence between energy eigenstates from below. Coupled-oscillator benchmarks, where inter-register interactions prevent this exact compression, show that the preferred encoding depends on the grid size and the evolution time.
We develop a theory of stabilizer codes whose stabilizer groups consist of commuting qudit Paulis, oscillator displacements, and/or planar-rotor displacements. We consider codes whose stabilizer groups form generalized lattices in quantum phase space, a condition that guarantees a finite logical dimension. We construct oscillator-rotor, rotor-qudit, and oscillator-rotor-qubit codes that cannot be decomposed into separate subsystems by generalized Clifford transformations. We also introduce an oscillator-qubit code arising from a partially lifted Golay code, where Construction A is applied to half of the Golay code coordinates. We derive analytical forms of logical operators from the symplectic dual lattice, determine Clifford-Gaussian gates from lattice symmetries, show that the code dimension equals the covolume of the stabilizer lattice, and organize the syndrome subspaces into a vector bundle. Our technique builds on earlier non-commutative geometric results by Rieffel, but it can often be interpreted simply as concatenating a given stabilizer code with a Gottesman-Kitaev-Preskill (GKP) code, applying conventional lattice-theoretic results, and unconcatenating. We formulate distances, optimal decoding, and quantum weight enumerators, recovering the Pauli, qudit, and GKP versions together with known MacWilliams identities. We construct finite-energy codewords whose encoding is an isometry up to an error exponentially small in the inverse damping parameter.
We propose a scheme for encoding many qubits in a single rotor, that is, a continuous and periodic degree of freedom. A key feature of this scheme is its ability to manipulate and entangle the encoded qubits with a single operation on the system. We also show, using quantum error-correcting codes, how to protect the qubits against small errors in angular position and momentum which may affect the rotor. We then discuss the feasibility of this scheme and suggest several candidates for its implementation. The proposed scheme is immediately generalizable to qudits of any finite dimension.
We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized Hamiltonians composed of a constant number of interactions, i.e., linear combinations of ladder operator monomials of fixed form. Compact encoding leads to qubit requirements that are optimal up to logarithmic factors. We show how to use sparse Hamiltonian simulation methods for second-quantized Hamiltonians in compact encoding, give explicit implementations for the required oracles, and analyze the methods. We also describe several example applications including the free boson and fermion theories, the ${\ensuremath{\phi}}^{4}$-theory, and the massive Yukawa model, all in both equal-time and light-front quantization. Our methods provide a general-purpose tool for simulating second-quantized Hamiltonians, with optimal or near-optimal scaling with error and model parameters.