Searcharxiv⌕ Search

arXiv subjects

Julio Cesar Siqueira Rocha

Publications and source records attributed to Julio Cesar Siqueira Rocha.

5 recordsLinked to original sources

A Kernel-Based Density of States Estimator for Quantum Computing

The density of states (DoS) encodes the thermodynamic and spectral properties of quantum many-body systems, yet its reconstruction becomes intractable for Hilbert spaces too large to diagonalize. Classically, the kernel polynomial method (KPM) addresses this by combining stochastic trace estimation with a smoothing kernel. Here we show that the Rodeo algorithm---one of the simplest eigenvalue-location protocols for near-term quantum hardware---provides a direct quantum analogue of this approach. Averaging the Rodeo response over Haar-random input states yields the DoS convolved with a spectral kernel fixed entirely by the distribution of evolution times: the random states play the role of stochastic trace estimation, and the temporal sampling distribution that of the damping kernel. The construction requires only the standard single-ancilla circuit, and quantum typicality suppresses the statistical error as the Hilbert-space dimension grows. We derive the estimator and its uncertainties, establish an explicit dictionary between signal-processing window functions and quantum reconstruction kernels, and validate the method on the one-dimensional transverse-field Ising and spin-1 models.

quant-ph↗

Qudit Implementation of the Rodeo Algorithm for Quantum Spectral Filtering

Qudits, the multi-level generalization of qubits, provide a natural extension of the binary paradigm in quantum computation and offer new opportunities to enhance algorithmic performance. Beyond their direct applicability to the simulation of multi-level quantum systems, higher-dimensional ancillae can improve sampling efficiency in quantum algorithms by enabling the simultaneous implementation of multiple control operations, thereby reducing circuit complexity. In this work, we pursue three main objectives. First, we present a formulation of the Rodeo algorithm employing a general $d$-level ancilla qudit. Second, we introduce the concept of the \emph{Rodeo kernel}, defined as a two-frequency interferometer, which acts as a spectral filter in the energy domain. Finally, we propose a microcanonical protocol for the Rodeo algorithm. This protocol enables the estimation of entropic quantities through a single energy sweep and admits a natural interpretation as a Gaussian convolution of the density of states. To support the theoretical analysis, we perform numerical evaluations of the corresponding quantum circuit using ancilla qudits of dimensions three, four, and five. The simulations are performed for the one-dimensional Ising model, considering both spin-$\frac{1}{2}$ and spin-$1$ particles. The ancilla qutrit implementation exhibits an $18\%$ reduction in fluctuations compared to the qubit implementation. Our results show that the qudits provide a framework for spectral analysis and thermodynamic characterization of multi-level quantum systems.

quant-ph↗

A Microcanonical Inflection Point Analysis via Parametric Curves and its Relation to the Zeros of the Partition Function

In statistical physics, phase transitions are arguably among the most extensively studied phenomena. In the computational approach to this field, the development of algorithms capable of estimating entropy across the entire energy spectrum in a single execution has highlighted the efficacy of microcanonical inflection point analysis, while Fisher's zeros technique has re-emerged as a powerful methodology for investigating these phenomena. This paper presents an alternative protocol for analyzing phase transitions using a parametrization of the entropy function in the microcanonical ensemble. We also provide a clear demonstration of the relation of the linear pattern of the Fisher's zeros on the complex inverse temperature map (a circle in the complex $x=e^{-β\varepsilon}$ map) with the order of the transition, showing that the latent heat is inversely related to the distance between the zeros. We study various model systems, including the Lennard-Jones cluster, the Ising, the XY, and the Zeeman models. By examining the behavior of thermodynamic quantities such as entropy and its derivatives in the microcanonical ensemble, we identify key features-such as loops and discontinuities in parametric curves-which signal phase transitions' presence and nature. This approach can facilitate the classification of phase transitions across various physical systems.

cond-mat.stat-mech↗

Estimating the Number of States via the Rodeo Algorithm for Quantum Computation

In the realm of statistical physics, the number of states in which a system can be realized with a given energy is a key concept that bridges the microscopic and macroscopic descriptions of physical systems. For quantum systems, many approaches rely on the solution of the Schrödinger equation. In this work, we demonstrate how the recently developed rodeo algorithm can be utilized to determine the number of states associated with all energy levels without any prior knowledge of the eigenstates. Quantum computers, with their innate ability to address the intricacies of quantum systems, make this approach particularly promising for the study of the thermodynamics of those systems. To illustrate the procedure's effectiveness, we apply it to compute the number of states of the 1D transverse-field Ising model and, consequently, its specific heat, proving the reliability of the method presented here.

quant-ph↗

Unraveling Rodeo Algorithm Through the Zeeman Model

We unravel the Rodeo Algorithm to determine the eigenstates and eigenvalues spectrum for a general Hamiltonian considering arbitrary initial states. By presenting a novel methodology, we detail the original method and show how to define all properties without having prior knowledge regarding the eigenstates. To this end, we exploit Pennylane and Qiskit platforms resources to analyze scenarios where the Hamiltonians are described by the Zeeman model for one and two spins. We also introduce strategies and techniques to improve the algorithm's performance by adjusting its intrinsic parameters and reducing the fluctuations inherent to data distribution. First, we explore the dynamics of a single qubit on Xanadu simulators to set the parameters that optimize the method performance and select the best strategies to execute the algorithm. On the sequence, we extend the methodology for bipartite systems to discuss how the algorithm works when degeneracy and entanglement are taken into account. Finally, we compare the predictions with the results obtained on a real superconducting device provided by the IBM Q Experience program, establishing the conditions to increase the protocol efficiency for multi-qubit systems.

quant-ph↗