arXiv subjects

Guilherme E. L. Pexe

Publications and source records attributed to Guilherme E. L. Pexe.

5 recordsLinked to original sources

arXiv2026

Preparing a Thermofield Double State with Feedback Quantum Algorithms

The efficient preparation of correlated thermal states, such as the Thermofield Double (TFD) state, is a fundamental prerequisite for simulating quantum gravity models and many-body thermodynamics on quantum processors. In this work, we investigate the ground state preparation of the Two Coupled Sachdev-Ye-Kitaev model, known as the Maldacena-Qi model, which is dual to a traversable wormhole in $AdS_2$, utilizing feedback-based quantum algorithms. We demonstrate that the standard feedback-based quantum algorithm (FALQON) and its time-rescaled variant (TR-FALQON) face severe kinetic limitations in this system, failing to converge to the highly entangled ground state when initialized in trivial product states. To overcome these barriers, we propose the hybrid ITE-TR-FALQON protocol, which integrates the imaginary-time evolution present in imaginary-time-enhanced FALQON (ITE-FALQON) with the time-rescaling mechanism. Our numerical results indicate that the introduction of non-unitary dynamics is strictly necessary to break symmetry traps and filter out excited states, while time-rescaling drastically accelerates algorithm convergence. The proposed method achieves fidelities close to unity and reproduces the von Neumann and Rényi entropy spectra of the exact TFD state with high precision.

hep-th↗

arXiv2026

PUBO Formulation for MST and Application to Optimum-Path Forest

The Optimum-Path Forest is a graph-based framework for designing classifiers that exploit inter-sample connectivity. A particular variant constructs decision boundaries based on prototypes computed by a Minimum Spanning Tree (MST) over the training data, which might become prohibitive for large-scale datasets. In this context, Quantum Machine Learning has emerged as a promising approach to overcome the high computational burden of combinatorial problems. We propose a quantum-inspired approach for prototype selection in OPF classifiers by reformulating the MST problem as a Polynomial Unconstrained Binary Optimization (PUBO) task and further employing the Feedback-Based Quantum Optimization (FALQON) algorithm for Hamiltonian minimization. The PUBO formulation reduces the need for qubits and eliminates the need for auxiliary variables, thereby addressing scalability constraints in current quantum hardware. Experiments on real-world datasets demonstrate that the FALQON-optimized MST achieves accuracies comparable to those of the classical Prim's algorithm while maintaining prototype quality. While FALQON occasionally reached local minima, it did not significantly impact the accuracy of the prototype selection process.

quant-ph↗

arXiv2026

FALQON-MST: A Fully Quantum Framework for Graph Optimization in Vision Systems

Finding the minimum spanning tree (MST) of a graph is an important task in computer vision, as it enables a sparse and low-cost representation of connectivity among elements (such as superpixels, points, or regions), which is useful for tasks such as segmentation, reconstruction, and clustering. In this work, we propose and evaluate a fully quantum pipeline for computing MSTs using the FALQON algorithm, a feedback-based quantum optimization method that does not require classical optimizers. We construct a Hamiltonian formulation whose ground-state energy encodes the MST of a graph and compare different FALQON strategies: (i) time rescaling (TR-FALQON) and (ii) multi-driver configurations. To avoid domain-specific biases, we adopt graphs with random weights and show that the FALQON variants exhibit significant differences in ground-state fidelity. We discuss the relevance of this approach for computer vision problems that naturally yield graph representations, and experimental results on synthetic instances together with a small demonstrative study on image segmentation illustrate both the potential and the current limitations of the method. Our numerical simulations on randomly weighted graphs show that standard one drive FALQON, although it reduces the expected energy, fails to concentrate amplitude in the MST solution. The multi drive variant succeeds in redistributing probability mass toward the ground state so that the MST appears among the most probable outcomes, and TR FALQON applied over multi drive produces the best results with faster convergence, lower final energy, and the highest solution state probability or fidelity in our tested instances. These improvements were observed on small synthetic graphs, underscoring both the promise of multi drive controls with temporal rescaling and the need for further scaling and hardware validation.

quant-ph↗

arXiv2026

Quantum feedback algorithms for DNA assembly using FALQON variants

Reconstructing DNA sequences without a reference, known as de novo assembly, is a complex computational task involving the alignment of overlapping fragments. To address this problem, a usual strategy is to map the assembly to a Quadratic Unconstrained Binary Optimization (QUBO) formulation, which can be solved by different quantum algorithms. In this work, we focus on three versions of the Feedback-based Algorithm, a protocol that eliminates classical optimization loops via measurement feedback. We analyze long-read DNA fragments from SARS-CoV-2 and human mitochondrial DNA using standard FALQON, second-order FALQON (SO-FALQON), and time-rescaled FALQON (TR-FALQON). Numerical results show that both variants improve convergence to the ground state and increase success probabilities at reduced circuit depths. These findings indicate that enhanced feedback-driven dynamics are effective for solving combinatorial problems on near-term quantum hardware.

quant-ph↗

arXiv2025

Quantum Phases Classification Using Quantum Machine Learning with SHAP-Driven Feature Selection

In this study, we present an innovative methodology to classify quantum phases within the ANNNI (Axial Next-Nearest Neighbor Ising) model by combining Quantum Machine Learning (QML) techniques with the Shapley Additive Explanations (SHAP) algorithm for feature selection and interpretability. Our investigation focuses on two prominent QML algorithms: Quantum Support Vector Machines (QSVM) and Variational Quantum Classifiers (VQC). By leveraging SHAP, we systematically identify the most relevant features within the dataset, ensuring that only the most informative variables are utilized for training and testing. The results reveal that both QSVM and VQC exhibit exceptional predictive accuracy when limited to 5 or 6 key features, thereby enhancing performance and reducing computational overhead. This approach not only demonstrates the effectiveness of feature selection in improving classification outcomes but also offers insights into the interpretability of quantum classification tasks. The proposed framework exemplifies the potential of interdisciplinary solutions for addressing challenges in the classification of quantum systems, contributing to advancements in both machine learning and quantum physics.

quant-ph↗