Search arXivSearch

arXiv · 2512.04615

Ground state energy and phase transitions of Long-range XXZ using VQE

Abstract

The variational quantum eigen solver (VQE), has been widely used to find the ground state energy of different Hamiltonians with no analytical solutions and are classically difficult to compute. In our work, we have used VQE to identify the phase transition boundary for an infinite order phase transition. We use long-range XXZ (LRXXZ) chain for our study. In order to probe infinite order phase transition, we propose to utilise the ground state energy obtained from VQE. The idea rests on the argument that VQE requires an ansatz circuit; therefore, the accuracy of the VQE will rely on this ansatz circuit. We have designed this circuit such that the estimated ground state energy is sensitive to the phase it is evaluated in. It is achieved by applying the constraint that the net spin remains constant throughout the optimisation process. Consequently, the ansatz works in a certain phase where it gives relatively small random error, as it should, when compared to the error in ground state energy calculations of the other phases, where the ansatz fails. By identifying these changes in the behaviour of the error in ground state energy using VQE, we were able to determine the phase boundaries. Using exact diagonalisation, we also compare the behaviour of the energy gradient and energy gap across both the phase transition boundaries for this model. Further, by increasing the depth of the optimisation circuit, we also accurately evaluate the ground energy of the LRXXZ chain for the value of coupling constant, J equal to -1

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mrinal Dev, Shraddha Sharma. 2026-05-30. Ground state energy and phase transitions of Long-range XXZ using VQE. https://doi.org/10.1103/71qk-dgm6

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph