Universal quantum computing with qubits embedded in trapped-ion qudits

• URL: http://arxiv.org/abs/2302.02966v3
• Date: Mon, 1 Jul 2024 11:40:25 GMT
• Title: Universal quantum computing with qubits embedded in trapped-ion qudits
• Authors: Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko, Aleksey K. Fedorov,
• Abstract summary: Recent developments in qudit-based quantum computing open interesting possibilities for scaling quantum processors without increasing the number of physical information carriers. We propose a method for compiling quantum circuits in the case, where qubits are embedded into qudits of experimentally relevant dimensionalities.
• Score: 0.70224924046445
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent developments in qudit-based quantum computing, in particular with trapped ions, open interesting possibilities for scaling quantum processors without increasing the number of physical information carriers. In this work, we propose a method for compiling quantum circuits in the case, where qubits are embedded into qudits of experimentally relevant dimensionalities, $d=3,\ldots,8$, for the trapped-ion platform. In particular, we demonstrate how single-qubit, two-qubit, and multiqubit gates can be realized using single-qudit operations and the Molmer-Sorensen (MS) gate as a basic two-particle operation. We expect that our findings are directly applicable to trapped-ion-based qudit processors.

Related papers

• Distributed Quantum Computation via Entanglement Forging and Teleportation [13.135604356093193]
  Distributed quantum computation is a practical method for large-scale quantum computation on quantum processors with limited size. In this paper, we demonstrate the methods to implement a nonlocal quantum circuit on two quantum processors without any quantum correlations.
  arXiv  Detail & Related papers  (2024-09-04T08:10:40Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
  We show that a quantum processor can correctly solve the basic classification task considered. With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Arbitrary quantum circuits on a fully integrated two-qubit computation register for a trapped-ion quantum processor [0.0]
  We report on the implementation of arbitrary circuits on a universal two-qubit register that can act as the computational module in a trapped-ion quantum computer. A universal set of quantum gates is implemented on a two-ion Coulomb crystal of $9$Be$+$ ions using only chip-integrated microwave addressing.
  arXiv  Detail & Related papers  (2024-03-28T19:44:18Z)
• Realization of quantum algorithms with qudits [0.7892577704654171]
  We review several ideas indicating how multilevel quantum systems, also known as qudits, can be used for efficient realization of quantum algorithms. We focus on techniques of leveraging qudits for simplifying decomposition of multiqubit gates, and for compressing quantum information by encoding multiple qubits in a single qudit. These theoretical schemes can be implemented with quantum computing platforms of various nature, such as trapped ions, neutral atoms, superconducting junctions, and quantum light.
  arXiv  Detail & Related papers  (2023-11-20T18:34:19Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Compact quantum kernel-based binary classifier [2.0684234025249717]
  We present the simplest quantum circuit for constructing a kernel-based binary classifier. The number of qubits is reduced by two and the number of steps is reduced linearly. Our design also provides a straightforward way to handle an imbalanced data set.
  arXiv  Detail & Related papers  (2022-02-04T14:30:53Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• A universal qudit quantum processor with trapped ions [1.4675095722281566]
  We demonstrate a universal qudit quantum processor using trapped ions with a local Hilbert space dimension of up to 7. This approach enables native simulation of high-dimensional quantum systems, as well as more efficient implementation of qubit-based algorithms.
  arXiv  Detail & Related papers  (2021-09-14T18:02:25Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.