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.
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.
Variational quantum algorithms are among the most promising approaches for simulating interacting quantum many-body systems on noisy intermediate-scale quantum (NISQ) devices. However, the practical success of variational quantum eigensolvers (VQE) critically depends on the structure of the chosen variational ansatz. In this work, we investigate the ground-state properties of the one-dimensional antiferromagnetic Heisenberg spin-1/2 chain using both generic hardware-efficient ansatz and physics-informed, symmetry-preserving variational circuits. We benchmark variational results against exact diagonalization and noiseless simulations, and subsequently validate the approach on real IQM Garnet quantum hardware. Our results demonstrate that incorporating physical symmetries into the circuit design leads to significantly improved energy estimates, enhanced robustness against hardware noise, and clearer convergence behavior when compared to hardware-efficient ansatz under identical resource constraints. These findings highlight the importance of problem specific ansatz construction for reliable quantum simulations in the NISQ era.
We investigate the utility of the locality-preserving Derby-Klassen (DK) fermion-to-qubit mapping [arXiv:2003.06939] for variational quantum simulation of two-dimensional t-V and Fermi-Hubbard models. The DK mapping preserves the locality of fermionic interactions with an enlarged Hilbert space, thereby requiring additional constraints that define the physical sector. We incorporate these constraints directly into a Hamiltonian Variational Ansätz (HVA) through Clifford-gate state preparation and use the Variational Quantum Eigensolver (VQE) to show that the low-energy properties of the resulting qubit Hamiltonian are accurately reproduced. We further exploit particle-number conservation inherent in the ansätz to resolve distinct symmetry sectors and reliably access degenerate states. Consequently, we benchmark the DK-HVA against Jordan-Wigner-based variational circuits at nonzero chemical potential, where particle-hole symmetry and the associated half-filled sign-free condition are absent. Finally, we demonstrate the advantage of locality-preserving mappings in higher-dimensional fermionic systems, where the conventional Jordan-Wigner (JW) transformation generates increasingly long Pauli strings and corresponding circuit overheads. We further extend the framework to the spinful Fermi-Hubbard model and identify a tradeoff between fermionic-mode placement and the locality of hopping and on-site interaction terms. These results establish a practical framework combining locality-preserving fermion-to-qubit mappings, constraint-preserving Clifford state preparation, and symmetry-preserving variational circuits, that trades auxiliary-qubit and stabilizer-preparation overhead for reduced operator nonlocality, providing a practical route toward resource-efficient quantum simulation of higher-dimensional interacting fermionic systems.
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of N spin-orbitals into an N-qubit system, but many of the fermionic configurations do not respect the required conditions and symmetries of the system so the qubit Hilbert space in this case may have unphysical states and thus cannot be fully utilized. We propose a generalized qubit-efficient encoding (QEE) scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. For the case of considering only the particle-conserving and singlet configurations, we reduce the qubit count to an upper bound of O(mlog2N), where m is the number of particles. This QEE scheme is demonstrated on an H2 molecule in the 6-31G basis set and a LiH molecule in the STO-3G basis set using fewer qubits than the common encoding methods. We calculate the ground-state energy surfaces using a variational quantum eigensolver algorithm with a hardware-efficient ansatz circuit. We choose to use a hardware-efficient ansatz since most of the Hilbert space in our scheme is spanned by desired configurations so a heuristic search for an eigenstate is sensible. The simulations are performed on IBM Quantum machines and the Qiskit simulator with a noise model implemented from a IBM Quantum machine. Using the methods of measurement error mitigation and error-free linear extrapolation, we demonstrate that most of the distributions of the extrapolated energies using our QEE scheme agree with the exact results obtained by Hamiltonian diagonalization in the given basis sets within chemical accuracy. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era. The number of terms in the Hamiltonian has an upper bound of $\mathcal{O}(\frac{{N}^{2m+1}}{(m\ensuremath{-}1)!\phantom{\rule{0.16em}{0ex}}m!})$ for the QEE scheme while it scales as O(N4) for the Jordan-Wigner encoding scheme. Nevertheless, we present several cases where QEE is useful.
Quantum numbers associated with symmetries classify quantum states and identify the sectors relevant to a given simulation. Generic hardware-efficient ansatzes do not necessarily preserve the quantum numbers and may therefore explore states outside the target sector. We develop symmetry-guided algorithms based on the quantum-accessible Hilbert-Schmidt asymmetry AHS, which quantifies the deviation of a quantum state from invariance under a specified symmetry group. This quantity guides the optimization toward a highly reduced symmetry-based target sector, without enforcing the symmetry on the preparation circuit. We demonstrate the approach as a proof of principle in variational quantum eigensolver calculations targeting singlet ground states with collective SU(2) symmetry. The applications include a five-qubit S-wave p+3He two-cluster Hamiltonian, deduced from ab initio many-body calculations, and collective spin models with up to 12 particles, which provide a many-particle benchmark of asymmetry-guided optimization. Across these applications, AHS-based guidance increases the singlet probability. Overall, the proposed algorithms improve energy accuracy during optimization and ground-state fidelity compared with direct energy minimization, with substantial fidelity improvements in the larger spin systems. These results demonstrate the utility of an asymmetry objective determined by the group action, independently of the Hamiltonian energy, for improving the reliability of variational quantum optimization.
Qubit-based variational quantum algorithms have undergone rapid development in recent years but still face several challenges. Here, we introduce a symmetry-based enhancement to digitized counterdiabatic quantum algorithms, applicable for qudits of any dimension. This approach offers three types of compression compared to conventional variational circuits. First, compression in the circuit depth is achieved by counterdiabatic protocols. Second, information about the problem is compressed by replacing qubits with qudits, allowing for a more efficient representation of the problem. Finally, the number of parameters is reduced by employing the symmetries of the system. We illustrate this approach by tackling a graph-based optimization problem -3-, a highly entangled state preparation, the qutrit W state, and a two-body only antiferromagnetic Ising problem. As our numerical results show, we achieve a better convergence with a lower circuit depth and less measurement overhead, albeit with some identified limitations for which we propose a work-around. This work leads to a better design of shallow variational quantum circuits, improving the feasibility of their implementation on near-term qudit devices.
Quantum computing holds the promise of tackling problems that are intractable for classical machines, yet the path from current noisy intermediate-scale quantum (NISQ) devices to fault-tolerant processors demands both better algorithms and a deeper understanding of how to exploit the full structure of quantum hardware. A key direction in this effort is the move beyond qubits: exploiting higher-dimensional local Hilbert spaces — qudits — to encode information, enforce constraints, and simulate complex physical systems more naturally and efficiently. This thesis investigates two interconnected research fronts in which the qudit framework provides concrete benefits: quantum optimization and the quantum simulation of lattice gauge theories (LGTs). On the optimization side, we show how a single ancilla qudit can enforce inequality constraints in the Quantum Approximate Optimization Algorithm (QAOA) without inflating the solution space, and how counterdiabatic driving, enhanced by symmetry reduction, improves variational performance for qudit-based algorithms. We additionally study the noise robustness of variational algorithms on real hardware, and investigate how nonstabilizerness builds up and relates to optimization performance across both qubit and qutrit protocols. On the simulation side, we analyze the ground-state structure and phase transitions of non-Abelian lattice gauge theories with dihedral symmetry, characterizing confinement and string breaking in DN models, and probing the quantum complexity of ground states across ZN , D3, and SU(2) gauge theories. Together, these results clarify where and how the qudit framework provides algorithmic and representational advantages over the standard qubit paradigm, and contribute to the broader effort of developing practical quantum simulation and optimization tools for near- term hardware