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

Chinese Physics B

Demonstration of quantum permutation parity determine algorithm in a superconducting qutrit

Kunzhe Dai, Peng Zhao, Mengmeng Li, Xinsheng Tan, Haifeng Yu, Yang Yu

Published Jun 1, 2018• 7 citations
Publisher

Abstract

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.

DOI
10.1088/1674-1056/27/6/060305

Related papers

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

Computational speed-up with a single qudit

Z. Gedik, I. A. Silva, Barış Çakmak +5 more

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.

arXiv:1403.5861•Scientific Reports•Oct 8, 2015•124 citations

Implementation of refined Deutsch–Jozsa algorithm in a superconducting qutrit system

Jie Zhao, Xinsheng Tan, Dong Lan +4 more

Abstract Superconducting quantum circuits are promising candidates for realizing quantum computation due to their intrinsic scalability. Here, we report the implementation of the refined Deutsch–Jozsa algorithm in a 3D superconducting transmon qutrit system. Such 3D superconducting systems usually preserve a relatively long coherence time. A qutrit can take advantage of the third level of a superconducting artificial atom and extends the Hilbert space. Compared with the two‐qubit system used for realizing Deutsch–Jozsa algorithm, the employment of qutrit simplifies the hardware design. This simplification and the intrinsic long coherence time jointly lead to a higher fidelity than in previous transmon implementation [DiCarlo et al., Nature 460 (7252), 240–244 (2009)].

physica status solidi (b)•Nov 25, 2016•1 citation

Two-Qutrit Quantum Algorithms on a Programmable Superconducting Processor

Tanay Roy, Ziqian Li, Eliot Kapit +1 more

Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We demonstrate a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We develop a parametric coupler to achieve excellent connectivity in the nine-dimensional Hilbert space enabling efficient implementations of two-qutrit gates. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Bernstein-Vazirani, and Grover's search. Our hardware-efficient protocols allow us to show that two stages of Grover's amplification can improve the success rates of an unstructured search with quantum advantage. Our results pave the way for building fully programmable ternary quantum processors using transmons as building blocks for a universal quantum computer.

arXiv:2211.06523•Physical Review Applied•Jun 7, 2023•77 citations

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

Quantum computing hardware for HEP algorithms and sensing

M. Sohaib Alam, Sergey A. Belomestnykh, Nicholas Bornman +37 more

Quantum information science harnesses the principles of quantum mechanics to realize computational algorithms with complexities vastly intractable by current computer platforms. Typical applications range from quantum chemistry to optimization problems and also include simulations for high energy physics. The recent maturing of quantum hardware has triggered preliminary explorations by several institutions (including Fermilab) of quantum hardware capable of demonstrating quantum advantage in multiple domains, from quantum computing to communications, to sensing. The Superconducting Quantum Materials and Systems (SQMS) Center, led by Fermilab, is dedicated to providing breakthroughs in quantum computing and sensing, mediating quantum engineering and HEP based material science. The main goal of the Center is to deploy quantum systems with superior performance tailored to the algorithms used in high energy physics. In this Snowmass paper, we discuss the two most promising superconducting quantum architectures for HEP algorithms, i.e. three-level systems (qutrits) supported by transmon devices coupled to planar devices and multi-level systems (qudits with arbitrary N energy levels) supported by superconducting 3D cavities. For each architecture, we demonstrate exemplary HEP algorithms and identify the current challenges, ongoing work and future opportunities. Furthermore, we discuss the prospects and complexities of interconnecting the different architectures and individual computational nodes. Finally, we review several different strategies of error protection and correction and discuss their potential to improve the performance of the two architectures. This whitepaper seeks to reach out to the HEP community and drive progress in both HEP research and QIS hardware.

arXiv:2204.08605•Apr 19, 2022•51 citations
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.
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 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.
Abstract Superconducting quantum circuits are promising candidates for realizing quantum computation due to their intrinsic scalability. Here, we report the implementation of the refined Deutsch–Jozsa algorithm in a 3D superconducting transmon qutrit system. Such 3D superconducting systems usually preserve a relatively long coherence time. A qutrit can take advantage of the third level of a superconducting artificial atom and extends the Hilbert space. Compared with the two‐qubit system used for realizing Deutsch–Jozsa algorithm, the employment of qutrit simplifies the hardware design. This simplification and the intrinsic long coherence time jointly lead to a higher fidelity than in previous transmon implementation [DiCarlo et al., Nature 460 (7252), 240–244 (2009)].
Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We demonstrate a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We develop a parametric coupler to achieve excellent connectivity in the nine-dimensional Hilbert space enabling efficient implementations of two-qutrit gates. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Bernstein-Vazirani, and Grover's search. Our hardware-efficient protocols allow us to show that two stages of Grover's amplification can improve the success rates of an unstructured search with quantum advantage. Our results pave the way for building fully programmable ternary quantum processors using transmons as building blocks for a universal quantum computer.
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 information science harnesses the principles of quantum mechanics to realize computational algorithms with complexities vastly intractable by current computer platforms. Typical applications range from quantum chemistry to optimization problems and also include simulations for high energy physics. The recent maturing of quantum hardware has triggered preliminary explorations by several institutions (including Fermilab) of quantum hardware capable of demonstrating quantum advantage in multiple domains, from quantum computing to communications, to sensing. The Superconducting Quantum Materials and Systems (SQMS) Center, led by Fermilab, is dedicated to providing breakthroughs in quantum computing and sensing, mediating quantum engineering and HEP based material science. The main goal of the Center is to deploy quantum systems with superior performance tailored to the algorithms used in high energy physics. In this Snowmass paper, we discuss the two most promising superconducting quantum architectures for HEP algorithms, i.e. three-level systems (qutrits) supported by transmon devices coupled to planar devices and multi-level systems (qudits with arbitrary N energy levels) supported by superconducting 3D cavities. For each architecture, we demonstrate exemplary HEP algorithms and identify the current challenges, ongoing work and future opportunities. Furthermore, we discuss the prospects and complexities of interconnecting the different architectures and individual computational nodes. Finally, we review several different strategies of error protection and correction and discuss their potential to improve the performance of the two architectures. This whitepaper seeks to reach out to the HEP community and drive progress in both HEP research and QIS hardware.