Qudits for decomposing multiqubit gates and realizing quantum algorithms

• URL: http://arxiv.org/abs/2311.12003v2
• Date: Tue, 03 Jun 2025 17:26:57 GMT
• Title: Qudits for decomposing multiqubit gates and realizing quantum algorithms
• Authors: Evgeniy O. Kiktenko, Anastasiia S. Nikolaeva, Aleksey K. Fedorov,
• Abstract summary: In this Colloquium several ideas are reviewed that indicate how multilevel quantum systems, also known as qudits, can be used for efficient realization of quantum algorithms.<n>The focus in the Colloquium is on techniques for leveraging qudits for simplifying decomposition of multiqubit gates and for compressing quantum information by encoding multiple qubits in a single qudit.
• Score: 0.70224924046445
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially interesting in the quantum-mechanical domain. In this Colloquium several ideas are reviewed that indicate how multilevel quantum systems, also known as qudits, can be used for efficient realization of quantum algorithms, which are represented via standard qubit circuits. The focus in the Colloquium is on techniques for leveraging qudits for simplifying decomposition of multiqubit gates and for compressing quantum information by encoding multiple qubits in a single qudit. As discussed in the Colloquium, these approaches can be efficiently combined. This allows a reduction in the number of entangling (two-body) operations and the number of quantum information carriers used compared to straightforward qubit realizations. These theoretical schemes can be implemented with quantum computing platforms of various natures, such as trapped ions, neutral atoms, superconducting junctions, quantum light, spin systems, and molecules. The Colloquium concludes by summarizing a set of open problems whose resolution will be an important further step toward employing universal qudit-based processors for running qubit algorithms.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis [31.203764035373677]
  We develop Quantivine, an interactive system for exploring and understanding quantum circuits. A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement. The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
  arXiv  Detail & Related papers  (2023-07-18T04:51:28Z)
• 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)
• Parametric Synthesis of Computational Circuits for Complex Quantum Algorithms [0.0]
  The purpose of our quantum synthesizer is enabling users to implement quantum algorithms using higher-level commands. The proposed approach for implementing quantum algorithms has a potential application in the field of machine learning.
  arXiv  Detail & Related papers  (2022-09-20T06:25:47Z)
• Data compression for quantum machine learning [2.119778346188635]
  We address the problem of efficiently compressing and loading classical data for use on a quantum computer. Our proposed methods allow both the required number of qubits and depth of the quantum circuit to be tuned.
  arXiv  Detail & Related papers  (2022-04-24T03:03:14Z)
• 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)
• Efficient realization of quantum algorithms with qudits [0.70224924046445]
  We propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits) Our method uses a transpilation of a circuit in the standard qubit form, which depends on the parameters of a qudit-based processor. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set.
  arXiv  Detail & Related papers  (2021-11-08T11:09:37Z)
• 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)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.