Scalable quantum computing with qudits on a graph

2019/09/30 by Evgeniy O. Kiktenko, E. O. Kiktenko, A. S. Nikolaeva +5 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computer science #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum circuit #Quantum computer #Quantum error correction #Quantum gate #Quantum mechanics #Quantum-Dot Cellular Automata #Qubit #Realization (probability) #Relation (database) #Scalability #Theoretical computer science #Toffoli gate #Topology (electrical circuits) #cond-mat.quant-gas #quant-ph

paper · pdf · doi:10.1103/physreva.101.022304

published as Phys. Rev. A 101, 022304 (2020) · 7 pages; 3 figures

openalex publication_date 2020/02/05 · arxiv created 2020/02/11 · arxiv updated 2020/02/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

We show a significant reduction of the number of quantum operations and the improvement of the circuit depth for the realization of the Toffoli gate by using qudits. This is done by establishing a general relation between the dimensionality of qudits and their topology of connections for a scalable multiqudit processor, where higher qudit levels are used for substituting ancillas. The suggested model is of importance for the realization of quantum algorithms and as a method of quantum error correction codes for single-qubit operations.

Citations

• Multilevel superconducting circuits as two-qubit systems: Operations, state preparation, and entropic inequalities
• Experimental Quantum Error Correction
• Generalized Toffoli gates using qudit catalysis
• Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces
• Security of Quantum Key Distribution Usingd-Level Systems
• Maximizing the Hilbert Space for a Finite Number of Distinguishable Quantum States
• A fast quantum mechanical algorithm for database search
• Elementary gates for quantum computation
• Implementation of a Toffoli Gate with Superconducting Circuits
• Quantum algorithms: an overview
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Operating Quantum States in Single Magnetic Molecules: Implementation of Grover’s Quantum Algorithm
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited by

• Computing-heightened low-cost high-dimensional controlled-SUM gates