Qudit Implementation of the Rodeo Algorithm for Quantum Spectral Filtering

• URL: http://arxiv.org/abs/2603.16049v1
• Date: Tue, 17 Mar 2026 01:24:44 GMT
• Title: Qudit Implementation of the Rodeo Algorithm for Quantum Spectral Filtering
• Abstract summary: We present a formulation of the Rodeo algorithm employing a general $d$-level ancilla qudit.<n>Second, we introduce the concept of the emphRodeo kernel, which acts as a spectral filter in the energy domain.<n>Third, we propose a microcanonical protocol for the Rodeo algorithm.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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-$\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.

Related papers

• Spectral Fingerprints of Gauge Theories on a Quantum Computer [0.0]
  Maximally mixed state spectral sampling is an unbiased quantum algorithm that allows for extraction of a finite-resolution spectral distribution from a Hamiltonian over potentially the entire allowed range of energies.<n>We show how it may be focused on any desired area of the spectrum in order to learn about the full textitfingerprint of the model of interest.
  arXiv  Detail & Related papers  (2026-08-27T17:59:51Z)
• Entropy-driven entanglement forging [0.0]
  We show how entropy-driven entanglement forging can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices. Our findings indicate that our method, entropy-driven entanglement forging, can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2024-09-06T16:54:41Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Quantum tensor network algorithms for evaluation of spectral functions on quantum computers [0.0]
  We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems.<n>We demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example.
  arXiv  Detail & Related papers  (2023-09-26T18:01:42Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum Processors [1.195496689595016]
  We study the framework in the context of qudits which are controllable electromagnetic modes of a superconducting cavity system. We showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator.
  arXiv  Detail & Related papers  (2022-01-19T18:55:13Z)
• Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
  We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit. The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$. We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
  arXiv  Detail & Related papers  (2021-12-29T12:33:41Z)
• Near-term Efficient Quantum Algorithms for Entanglement Analysis [5.453850739960517]
  Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. This work proposes three near-term efficient algorithms exploiting the hybrid quantum-classical technique to address this difficulty.
  arXiv  Detail & Related papers  (2021-09-22T15:15:58Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.