Optimal Quantum Circuits for General Multi‐Qutrit Quantum Computation
GL Jiang, WQ Liu, HR Wei - Advanced Quantum Technologies, 2024 - Wiley Online Library
Quantum circuits of a general quantum gate acting on multiple dd‐level quantum systems
play a prominent role in multi‐valued quantum computation. A recursive Cartan …
play a prominent role in multi‐valued quantum computation. A recursive Cartan …
Realization of quantum algorithms with qudits
The paradigm behind digital quantum computing inherits the idea of using binary
information processing. The nature in fact gives much more rich structures of physical …
information processing. The nature in fact gives much more rich structures of physical …
Multiqubit Toffoli gates and optimal geometry with Rydberg atoms
D Yu, H Wang, JM Liu, SL Su, J Qian, W Zhang - Physical Review Applied, 2022 - APS
Due to its potential for implementing a scalable quantum computer, the multiqubit Toffoli
gate lies in the heart of quantum information processing. In this paper, we demonstrate a …
gate lies in the heart of quantum information processing. In this paper, we demonstrate a …
Optimal synthesis of multi-controlled qudit gates
We propose a linear-size synthesis of the multi-controlled Toffoli gate on qudits with at most
one borrowed ancilla. This one ancilla can even be saved when the qudit dimension is odd …
one borrowed ancilla. This one ancilla can even be saved when the qudit dimension is odd …
QuDiet: A classical simulation platform for qubit‐qudit hybrid quantum systems
In recent years, numerous research advancements have extended the limit of classical
simulation of quantum algorithms. Although, most of the state‐of‐the‐art classical simulators …
simulation of quantum algorithms. Although, most of the state‐of‐the‐art classical simulators …
Fundamentals of quantum computation and basic quantum gates
S Mummadi, B Rudra - … of Research on Quantum Computing for …, 2023 - igi-global.com
Quantum computing plays a major role in modern computation. It can perform operations
exponentially faster when compared to classical computation. It has applications in various …
exponentially faster when compared to classical computation. It has applications in various …
Existence of Pauli-like stabilizers for every quantum error-correcting code
JY Kao, HS Goan - Physical Review A, 2023 - APS
The Pauli stabilizer formalism is perhaps the most thoroughly studied means of procuring
quantum error-correcting codes, whereby the code is obtained through commutative Pauli …
quantum error-correcting codes, whereby the code is obtained through commutative Pauli …
FragQC: An efficient quantum error reduction technique using quantum circuit fragmentation
Quantum computers must meet extremely stringent qualitative and quantitative requirements
on their qubits in order to solve real-life problems. Quantum circuit fragmentation techniques …
on their qubits in order to solve real-life problems. Quantum circuit fragmentation techniques …
Circuit Design of Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems
Quantum search algorithms, such as Grover's algorithm, are expected to efficiently solve
constrained combinatorial optimization problems. However, implementing a quantum search …
constrained combinatorial optimization problems. However, implementing a quantum search …
Robust Implementation of Discrete-time Quantum Walks in Any Finite-dimensional Quantum System
B Nandi, S Singha, A Datta, A Saha… - arxiv preprint arxiv …, 2024 - arxiv.org
Research has shown that quantum walks can accelerate certain quantum algorithms and act
as a universal paradigm for quantum processing. The discrete-time quantum walk (DTQW) …
as a universal paradigm for quantum processing. The discrete-time quantum walk (DTQW) …