Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by decomposition

DOI10.1016/J.TCS.2006.09.006zbMATH Open1152.81755arXivquant-ph/0511019OpenAlexW2117998470MaRDI QIDQ857397FDOQ857397

Authors: Faisal Shah Khan, Marek A. Perkowski 

Publication date: 14 December 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A further generalization leads to quantum computing with hybrid qudits where two or more qudits have different finite dimensions. Advantages of hybrid and d-valued gates (circuits) and their physical realizations have been studied in detail by Muthukrishnan and Stroud (Physical Review A, 052309, 2000), Daboul et al. (J. Phys. A: Math. Gen. 36 2525-2536, 2003), and Bartlett et al (Physical Review A, Vol.65, 052316, 2002). In both cases, a quantum computation is performed when a unitary evolution operator, acting as a quantum logic gate, transforms the state of qudits in a quantum system. Unitary operators can be represented by square unitary matrices. If the system consists of a single qudit, then Tilma et al (J.Phys. A: Math. Gen. 35 (2002) 10467-10501) have shown that the unitary evolution matrix (gate) can be synthesized in terms of its Euler angle parameterization. However, if the quantum system consists of multiple qudits, then a gate may be synthesized by matrix decomposition techniques such as QR factorization and the Cosine-sine Decomposition (CSD). In this article, we present a CSD based synthesis method for n qudit hybrid quantum gates, and as a consequence, derive a CSD based synthesis method for n qudit gates where all the qudits have the same dimension.

Full work available at URL: https://arxiv.org/abs/quant-ph/0511019

Recommendations

• Quantum gates on hybrid qudits
• Quantum circuit synthesis using a new quantum logic gate library of NCV quantum gates
• Efficient circuits for exact-universal computation with qudits
• Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits
• Synthesis of quantum circuits for \(d\)-level systems by using cosine-sine decomposition

zbMATH Keywords

givens rotationsCosine--sine decompositionhybrid quantum logic synthesisquantum multiplexers

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Numerical Methods for Computing Angles Between Linear Subspaces
• Title not available (Why is that?)
• History and generality of the CS decomposition
• Computing the CS decomposition of a partitioned orthonormal matrix
• Synthesis of multi-qudit hybrid and \(d\)-valued quantum logic circuits by decomposition
• Quantum gates on hybrid qudits
• Generalized Euler angle parametrization forSU(N)

Cited In (18)

• A dynamic programming approach to multi-objective logic synthesis of quantum circuits
• An efficient quantum circuit analyser on qubits and qudits
• Quantum measurement classification with qudits
• Properly quantized history-dependent Parrondo games, Markov processes, and multiplexing circuits
• Synthesis of multi-qudit hybrid and \(d\)-valued quantum logic circuits by decomposition
• Quantum gates on hybrid qudits
• Title not available (Why is that?)
• SAT-based {CNOT, \(T\)} quantum circuit synthesis
• \(Qcompiler\): quantum compilation with the CSD method
• Entangling capability of multivalued bipartite gates and optimal preparation of multivalued bipartite quantum states
• Synthesis of quantum circuits for \(d\)-level systems by using cosine-sine decomposition
• Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity
• Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits
• Controlled gates for multi-level quantum computation
• Title not available (Why is that?)
• Efficient circuits for exact-universal computation with qudits
• Constructing all qutrit controlled Clifford+\(T\) gates in Clifford+\(T\)
• \textit{OptQC}: an optimized parallel quantum compiler

This page was built for publication: Synthesis of multi-qudit hybrid and \(d\)-valued quantum logic circuits by decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857397)