Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1403.5861 · Scientific Reports

Computational speed-up with a single qudit

Z. Gedik, I. A. Silva, Barış Çakmak, Göktuğ Karpat, Édson Luiz Gea Vidoto, Diogo O. Soares-Pinto, Eduardo Ribeiro DeAzevedo, F. F. Fanchini

Published Oct 8, 2015• 124 citations
arXivHTMLPDF

Abstract

Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For 2d permutation functions defined on a set of d elements, deciding whether a given permutation is even or odd, requires evaluation of the function for at least two elements. We demonstrate that a quantum circuit with a single qudit can determine the parity of the permutation with only one evaluation of the function. Our algorithm provides an example for quantum computation without entanglement since it makes use of the pure state of a qudit. We also present an experimental realization of the proposed quantum algorithm with a quadrupolar nuclear magnetic resonance using a single four-level quantum system, i.e., a ququart.

DOI
10.1038/srep14671

Related papers

Linear optical demonstration of quantum speed-up with a single qudit

Xiang Zhan, Jian Li, Hao Qin +2 more

Quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding quantum physics. We experimentally realize a quantum speed-up algorithm with a single qudit via linear optics and prove that even a single qudit is enough for designing an oracle-based algorithm which can solve a certain problem twice faster than any classical algorithm. The algorithm can be generalized to higher-dimensional systems with the same two-to-one speed-up ratio.

arXiv:1412.2357•Optics Express•Jul 7, 2015•15 citations

Demonstration of quantum permutation parity determine algorithm in a superconducting qutrit

Kunzhe Dai, Peng Zhao, Mengmeng Li +3 more

A quantum algorithm provides a new way in solving certain computing problems and usually faster than classical algorithms. Here we report an implementation of a quantum algorithm to determine the parity of permutation in a single three-dimensional (3D) superconducting transmon qutrit system. The experiment shows the capacity to speed up in a qutrit, which can also be extended to a multi-level system for solving high-dimensional permutation parity determination problem.

Chinese Physics B•Jun 1, 2018•7 citations

Solving mathematical problems with quantum search algorithm

Rubens Viana Ramos, Paulo Benicio Melo de Sousa, David Sena Oliveira

Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical algorithm. It is possible to use Grover algorithm, taking profit of its ability to find a specific value in a unordered database, to find, for example, the zero of a logical function; the minimal or maximal value in a database or to recognize if an odd number is prime or not. Here we show quantum algorithms to solve those cited mathematical problems. The solution requires the use of a quantum bit string comparator being used as oracle. This quantum circuit compares two quantum states and identifies if they are equal or, otherwise, which of them is the largest. Moreover, we also show the quantum bit string comparator allow us to implement conditional statements in quantum computation, a fundamental structure for designing of algorithms.

arXiv:quant-ph/0605003•Apr 29, 2006•4 citations

Demonstration of quantum permutation algorithm with a single photon ququart

Feiran Wang, Yunlong Wang, Ruifeng Liu +4 more

We report an experiment to demonstrate a quantum permutation determining algorithm with linear optical system. By employing photon's polarization and spatial mode, we realize the quantum ququart states and all the essential permutation transformations. The quantum permutation determining algorithm displays the speedup of quantum algorithm by determining the parity of the permutation in only one step of evaluation compared with two for classical algorithm. This experiment is accomplished in single photon level and the method exhibits universality in high-dimensional quantum computation.

arXiv:1501.06798•Scientific Reports•Jun 5, 2015•12 citations

Almost Optimal Synthesis of Reversible Function in Qudit Model

Boqian Xu, Junhong Nie, Xiaoming Sun

Quantum oracles are widely adopted in problems, like query oracle in Grover’s algorithm, cipher in quantum cryptanalytic and data encoder in quantum machine learning. Notably, the bit-flip oracle, capable of flipping the state based on a given classical function, emerges as a fundamental component in the design and construction of quantum algorithms. Devising methods to optimally implement the bit-flip oracle essentially translates to the efficient synthesis of reversible functions. Prior research has primarily focused on the qubit model, leaving the higher dimensional systems, i.e. qudit model, largely unexplored. By allowing more than two computational bases, qudit model can fully utilize the multi-level nature of the underlying physical mechanism. We propose a method to synthesize even permutations inAdnusing Θ(d) (n− 1)-qudit sub-circuits, which achieve asymptotic optimality in the count of sub-circuits. Moreover, we introduce a technique for synthesizing reversible functions employingO(ndn) two-qudit gates and only a single ancilla. This is asymptotically tight in terms of d and asymptotically almost tight in terms ofn.

arXiv:2501.05237•IEEE Transactions on Information Theory•Dec 4, 2025•0 citations

Efficient realization of quantum algorithms with qudits

Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko, Aleksey K. Fedorov

Abstract The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, 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 characteristics of a qudit-based processor, such as the number of available qudits and the number of accessible levels. This approach provides a qubit-to-qudit mapping and comparison to a standard realization of quantum algorithms highlighting potential advantages of qudits. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set. We then illustrate our method by considering an example of an efficient implementation of a 6-qubit quantum algorithm with qudits. In this particular example, we demonstrate how using qudits allows a decreasing amount of two-body interactions in the qubit circuit implementation. We expect that our findings are of relevance for ongoing experiments with noisy intermediate-scale quantum devices that operate with information carriers allowing qudit encodings, such as trapped ions and neutral atoms, as well as optical and solid-state systems.

arXiv:2111.04384•EPJ Quantum Technology•Jun 26, 2024•64 citations
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For 2d permutation functions defined on a set of d elements, deciding whether a given permutation is even or odd, requires evaluation of the function for at least two elements. We demonstrate that a quantum circuit with a single qudit can determine the parity of the permutation with only one evaluation of the function. Our algorithm provides an example for quantum computation without entanglement since it makes use of the pure state of a qudit. We also present an experimental realization of the proposed quantum algorithm with a quadrupolar nuclear magnetic resonance using a single four-level quantum system, i.e., a ququart.
Quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding quantum physics. We experimentally realize a quantum speed-up algorithm with a single qudit via linear optics and prove that even a single qudit is enough for designing an oracle-based algorithm which can solve a certain problem twice faster than any classical algorithm. The algorithm can be generalized to higher-dimensional systems with the same two-to-one speed-up ratio.
Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical algorithm. It is possible to use Grover algorithm, taking profit of its ability to find a specific value in a unordered database, to find, for example, the zero of a logical function; the minimal or maximal value in a database or to recognize if an odd number is prime or not. Here we show quantum algorithms to solve those cited mathematical problems. The solution requires the use of a quantum bit string comparator being used as oracle. This quantum circuit compares two quantum states and identifies if they are equal or, otherwise, which of them is the largest. Moreover, we also show the quantum bit string comparator allow us to implement conditional statements in quantum computation, a fundamental structure for designing of algorithms.
We report an experiment to demonstrate a quantum permutation determining algorithm with linear optical system. By employing photon's polarization and spatial mode, we realize the quantum ququart states and all the essential permutation transformations. The quantum permutation determining algorithm displays the speedup of quantum algorithm by determining the parity of the permutation in only one step of evaluation compared with two for classical algorithm. This experiment is accomplished in single photon level and the method exhibits universality in high-dimensional quantum computation.
Quantum oracles are widely adopted in problems, like query oracle in Grover’s algorithm, cipher in quantum cryptanalytic and data encoder in quantum machine learning. Notably, the bit-flip oracle, capable of flipping the state based on a given classical function, emerges as a fundamental component in the design and construction of quantum algorithms. Devising methods to optimally implement the bit-flip oracle essentially translates to the efficient synthesis of reversible functions. Prior research has primarily focused on the qubit model, leaving the higher dimensional systems, i.e. qudit model, largely unexplored. By allowing more than two computational bases, qudit model can fully utilize the multi-level nature of the underlying physical mechanism. We propose a method to synthesize even permutations inAdnusing Θ(d) (n− 1)-qudit sub-circuits, which achieve asymptotic optimality in the count of sub-circuits. Moreover, we introduce a technique for synthesizing reversible functions employingO(ndn) two-qudit gates and only a single ancilla. This is asymptotically tight in terms of d and asymptotically almost tight in terms ofn.
Abstract The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, 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 characteristics of a qudit-based processor, such as the number of available qudits and the number of accessible levels. This approach provides a qubit-to-qudit mapping and comparison to a standard realization of quantum algorithms highlighting potential advantages of qudits. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set. We then illustrate our method by considering an example of an efficient implementation of a 6-qubit quantum algorithm with qudits. In this particular example, we demonstrate how using qudits allows a decreasing amount of two-body interactions in the qubit circuit implementation. We expect that our findings are of relevance for ongoing experiments with noisy intermediate-scale quantum devices that operate with information carriers allowing qudit encodings, such as trapped ions and neutral atoms, as well as optical and solid-state systems.