Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2603.16049

Qudit Implementation of the Rodeo Algorithm for Quantum Spectral Filtering

Julio Cesar Siqueira Rocha, Rodrigo Alves Dias

quant-phcond-mat.stat-mechphysics.comp-phSubmitted Mar 17, 2026• Announced Mar 18, 2026• 2 citations• Revised Oct 17, 2026 (v2)
v1 · Mar 17, 2026v2 · Oct 17, 2026
arXivHTMLPDF

Abstract

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-$\sfrac{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 qudits provide a framework for spectral analysis and thermodynamic characterization of multi-level quantum systems.

Comments
19 pages, 6 figures

Related papers

Qudit Implementation of the Rodeo Algorithm for Quantum Spectral Filtering

Julio Rocha, Rodrigo Dias

Abstract 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 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-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.

•Apr 23, 2026•0 citations

A Kernel-Based Density of States Estimator for Quantum Computing

Julio Cesar Siqueira Rocha

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-pharXiv:2607.24972•Jul 29, 2026•0 citations

Efficient implementation of a quantum algorithm with a trapped ion qudit

Xiaoyang Shi, Jasmine Sinanan-Singh, Timothy Burke +2 more

Demonstration of quantum advantage remains challenging due to the increased overhead of controlling large quantum systems. While significant effort has been devoted to qubit-based devices, qudits (d-level systems) offer potential advantages in both hardware efficiency and algorithmic performance. In this paper, we demonstrate multi-tone control of a single trapped ion qudit of up to eight levels, as well as the implementation of Grover’s search algorithm on a qudit with dimensions five and eight, achieving operation fidelity of 96.8(3)% and 69(6)%, respectively, which correspond to 99.9(1)% and 97.1(3) % squared statistical overlap, respectively, with the expected result for a single iteration of the Grover search algorithm. The performance is competitive when compared to qubit-based systems; moreover, the sequence requires only $${{{\mathcal{O}}}}(d)$$ single-qudit gates and no entangling gates. This work highlights the potential of using qudits for efficient implementations of quantum algorithms. The authors demonstrate high-fidelity multi-tone electronic control of trapped-ion qudits up to d=8 levels, enabling efficient SU(d) operations and showcasing advantage by implementing Grover’s search algorithm using encoding in a single qudit, rather than in multiple qubits.

arXiv:2506.09371•Nature Communications•Jan 21, 2026•19 citations

Experimental qudit-assisted quantum operations by dimension expansion and partial measurement

Yulin Chi, Chengkang Pan, Xian Ping Lu +2 more

Many quantum algorithms require ancilla qubits and deep circuits, yet adding and interacting with them are difficult and resource-intensive. Moreover, the high-dimensional properties of quantum systems have been demonstrated to simplify quantum circuits while enhancing efficiency. We propose a novel “Dimension Expansion and Partial Measurement” scheme for quantum information processing based on qudits’ multi-level nature. Given a d-dimensional qudit (expandable to d × r dimensions) and local single-qudit operations in d and r dimensions, we can introduce r-dimensional equivalent ancilla qudits (logically introduced via dimension expansion) and enable quantum operations in deep circuits across d and r dimensions. With successfully generated photons, our scheme efficiently cascades two-qubit/qudit gates with unity theoretical success probability; existing schemes are either probabilistic or need additional particles. In particular, this scheme can be extended to multiple ancilla qudits with measurement feedforward by the “Partially Measure-Reexpand” procedure. This leads to a resource-efficient universal high-dimensional measurement-based quantum computation scheme. On a silicon-photonic chip, starting from 2 qubits (each expandable to a four-dimensional qudit), we implemented a measurement-based quantum computation system equivalent to 5 qubits and experimentally validated our scheme. The proposed scheme applies to simplifying and scaling up various quantum systems.

APL Photonics•May 1, 2026•0 citations

Unraveling the rodeo algorithm through the Zeeman model

Raphael Fortes Infante Gomes, J. C. S. Rocha, W. A. T. Nogueira +1 more

Abstract We unravel the rodeo algorithm to determine the eigenstates and eigenvalues spectrum for a Hamiltonian considering arbitrary initial pure 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, and conclude presenting conditions to increase the protocol efficiency for multi-qubit systems and more complex Hamiltonians.

arXiv:2407.11301•Physica Scripta•May 7, 2025•4 citations

A short review on qudit quantum machine learning

Tiago de Souza Farias, Lucas Friedrich, Jonas Maziero

As quantum devices scale toward practical machine learning applications, the binary qubit paradigm faces expressivity and resource efficiency limitations. Multi-level quantum systems, or qudits, offer a promising alternative by harnessing a larger Hilbert space, enabling richer data embeddings, more compact variational circuits, and support for multi-valued problem structures. In this work, we review the role of qudits in quantum machine learning techniques, mainly variational quantum algorithms and quantum neural networks. Drawing on recent experimental demonstrations, including high-level superconducting transmons, qutrit-based combinatorial optimization, and single-qudit classifiers, we highlight how qudit architectures can reduce circuit depth and parameter counts while maintaining competitive fidelity. We further assess the evolving software ecosystem, from specialized simulators and differentiable-programming libraries to extensions of mainstream frameworks. We also identify key challenges in control complexity, noise management, and tooling maturity.

arXiv:2505.05158•May 8, 2025•3 citations
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 ddd-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-\sfrac12\sfrac{1}{2}\sfrac12 and spin-111 particles. The ancilla qutrit implementation exhibits an 18%18\%18% reduction in fluctuations compared to the qubit implementation. Our results show that qudits provide a framework for spectral analysis and thermodynamic characterization of multi-level quantum systems.
Abstract 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 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-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.
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.
Demonstration of quantum advantage remains challenging due to the increased overhead of controlling large quantum systems. While significant effort has been devoted to qubit-based devices, qudits (d-level systems) offer potential advantages in both hardware efficiency and algorithmic performance. In this paper, we demonstrate multi-tone control of a single trapped ion qudit of up to eight levels, as well as the implementation of Grover’s search algorithm on a qudit with dimensions five and eight, achieving operation fidelity of 96.8(3)% and 69(6)%, respectively, which correspond to 99.9(1)% and 97.1(3) % squared statistical overlap, respectively, with the expected result for a single iteration of the Grover search algorithm. The performance is competitive when compared to qubit-based systems; moreover, the sequence requires only O(d){{{\mathcal{O}}}}(d)O(d) single-qudit gates and no entangling gates. This work highlights the potential of using qudits for efficient implementations of quantum algorithms. The authors demonstrate high-fidelity multi-tone electronic control of trapped-ion qudits up to d=8 levels, enabling efficient SU(d) operations and showcasing advantage by implementing Grover’s search algorithm using encoding in a single qudit, rather than in multiple qubits.
Many quantum algorithms require ancilla qubits and deep circuits, yet adding and interacting with them are difficult and resource-intensive. Moreover, the high-dimensional properties of quantum systems have been demonstrated to simplify quantum circuits while enhancing efficiency. We propose a novel “Dimension Expansion and Partial Measurement” scheme for quantum information processing based on qudits’ multi-level nature. Given a d-dimensional qudit (expandable to d × r dimensions) and local single-qudit operations in d and r dimensions, we can introduce r-dimensional equivalent ancilla qudits (logically introduced via dimension expansion) and enable quantum operations in deep circuits across d and r dimensions. With successfully generated photons, our scheme efficiently cascades two-qubit/qudit gates with unity theoretical success probability; existing schemes are either probabilistic or need additional particles. In particular, this scheme can be extended to multiple ancilla qudits with measurement feedforward by the “Partially Measure-Reexpand” procedure. This leads to a resource-efficient universal high-dimensional measurement-based quantum computation scheme. On a silicon-photonic chip, starting from 2 qubits (each expandable to a four-dimensional qudit), we implemented a measurement-based quantum computation system equivalent to 5 qubits and experimentally validated our scheme. The proposed scheme applies to simplifying and scaling up various quantum systems.
Abstract We unravel the rodeo algorithm to determine the eigenstates and eigenvalues spectrum for a Hamiltonian considering arbitrary initial pure 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, and conclude presenting conditions to increase the protocol efficiency for multi-qubit systems and more complex Hamiltonians.
As quantum devices scale toward practical machine learning applications, the binary qubit paradigm faces expressivity and resource efficiency limitations. Multi-level quantum systems, or qudits, offer a promising alternative by harnessing a larger Hilbert space, enabling richer data embeddings, more compact variational circuits, and support for multi-valued problem structures. In this work, we review the role of qudits in quantum machine learning techniques, mainly variational quantum algorithms and quantum neural networks. Drawing on recent experimental demonstrations, including high-level superconducting transmons, qutrit-based combinatorial optimization, and single-qudit classifiers, we highlight how qudit architectures can reduce circuit depth and parameter counts while maintaining competitive fidelity. We further assess the evolving software ecosystem, from specialized simulators and differentiable-programming libraries to extensions of mainstream frameworks. We also identify key challenges in control complexity, noise management, and tooling maturity.