Qudits and high-dimensional quantum computing
- URL: http://arxiv.org/abs/2008.00959v4
- Date: Wed, 11 Nov 2020 15:47:45 GMT
- Title: Qudits and high-dimensional quantum computing
- Authors: Yuchen Wang, Zixuan Hu, Barry C. Sanders, and Sabre Kais
- Abstract summary: Qudit is a multi-level computational unit alternative to the conventional 2-level qubit.
This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods.
- Score: 4.2066457491320115
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Qudit is a multi-level computational unit alternative to the conventional
2-level qubit. Compared to qubit, qudit provides a larger state space to store
and process information, and thus can provide reduction of the circuit
complexity, simplification of the experimental setup and enhancement of the
algorithm efficiency. This review provides an overview of qudit-based quantum
computing covering a variety of topics ranging from circuit building, algorithm
design, to experimental methods. We first discuss the qudit gate universality
and a variety of qudit gates including the pi/8 gate, the SWAP gate, and the
multi-level-controlled gate. We then present the qudit version of several
representative quantum algorithms including the Deutsch-Jozsa algorithm, the
quantum Fourier transform, and the phase estimation algorithm. Finally we
discuss various physical realizations for qudit computation such as the
photonic platform, iron trap, and nuclear magnetic resonance.
Related papers
- Implementing multi-controlled X gates using the quantum Fourier transform [0.0]
We show how a quantum arithmetic-based approach can be efficiently used to implement many complex quantum gates.
We show how the depth of the circuit can be significantly reduced using only a few ancilla qubits.
arXiv Detail & Related papers (2024-07-25T13:22:00Z) - 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) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Resource Bounds for Quantum Circuit Mapping via Quantum Circuit
Complexity [1.0879875537360844]
We show that a minimal SWAP gate count for executing a quantum circuit on a device emerges via the minimization of the distance between quantum states.
This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.
arXiv Detail & Related papers (2024-02-01T10:32:05Z) - 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) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - 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) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z) - Variational quantum compiling with double Q-learning [0.37798600249187286]
We propose a variational quantum compiling (VQC) algorithm based on reinforcement learning (RL)
An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by double Q-learning.
It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices.
arXiv Detail & Related papers (2021-03-22T06:46:35Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - 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.