Efficient Implementation of a Quantum Algorithm with a Trapped Ion Qudit

• URL: http://arxiv.org/abs/2506.09371v1
• Date: Wed, 11 Jun 2025 03:35:55 GMT
• Title: Efficient Implementation of a Quantum Algorithm with a Trapped Ion Qudit
• Authors: Xiaoyang Shi, Jasmine Sinanan-Singh, Timothy J. Burke, John Chiaverini, Isaac L. Chuang,
• Abstract summary: qudits ($d$-level systems) offer potential advantages in both hardware efficiency and algorithmic performance.<n>We demonstrate multi-tone control of a single trapped ion qudit of up to eight levels.<n>First implementation of Grover's search algorithm on a qudit with dimension five and eight.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 first implementation of Grover's search algorithm on a qudit with dimension 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 (SSO), 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.

Related papers

• Approximate Quantum Circuit Synthesis for Diagonal Unitary [15.973412320107673]
  diagonal unitary synthesis plays a crucial role in quantum circuit synthesis problems.<n>We propose a quantum circuit synthesis algorithm to design diagonal unitary implementations based on specified quantum resource limits.<n>Our algorithm can synthesize diagonal unitary for quantum circuits with up to 15 qubits on an ordinary laptop.
  arXiv  Detail & Related papers  (2024-12-02T08:54:23Z)
• Distributed Exact Generalized Grover's Algorithm [9.675088142486729]
  We propose a distributed Exactized Grover's Algorithm (DEGGA) to solve a generalized search problem. Our algorithm ensures accuracy, with a theoretical probability of identifying the target states at $100%$. Our method requires a total of $n$ qubits, eliminating the need for auxiliary qubits.
  arXiv  Detail & Related papers  (2024-05-11T09:17:11Z)
• Benchmarking the algorithmic performance of near-term neutral atom processors [0.0]
  We present a characterization of the algorithmic performance of Rydberg atom quantum computers through device simulation. We consider three different quantum algorithm related tests, exploiting the ability to dynamically update qubit connectivity and multi-qubit gates. Our results indicate Rydberg atom processors are a highly competitive near-term platform which, bolstered by the potential for further scalability, can pave the way toward useful quantum computation.
  arXiv  Detail & Related papers  (2024-02-03T11:55:02Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• 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)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Approximate quantum gates compiling with self-navigation algorithm [0.0]
  We propose an algorithm to approximately compile single-qubit gates with arbitrary accuracy. Evaluation results show that the overall rotation distance generated by our algorithm is significantly shorter than the commonly used $U3$ gate.
  arXiv  Detail & Related papers  (2022-04-06T03:07:17Z)
• 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)
• 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.