Direct implementation of an N-qubit controlled-unitary gate in a single step

Authors:
Preethika Kumar
Affiliations:
Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, USA 67260
Venue:
Quantum Information Processing
Year:
2013

Citing 6
Cited 0

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Quantum Computation and Quantum Information: 10th Anniversary Edition

Quantum Computation and Quantum Information: 10th Anniversary Edition
Universal quantum computing in linear nearest neighbor architectures

Quantum Information & Computation
Optimal realizations of controlled unitary gates

Quantum Information & Computation
On the Reliability of Majority Gates Full Adders

IEEE Transactions on Nanotechnology
A nearest neighbor architecture to overcome dephasing

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new scheme to implement an N-qubit controlled-unitary operation directly in a single step. The main advantage of our scheme is that we do not use conventional gate decomposition protocols to break an N-qubit controlled-unitary gate into one- and two-qubit gates. This greatly reduces the number of computational steps in implementing quantum algorithms and error-correcting codes, which use multi-control unitary operations. We show how to find analytic solutions to the time evolution of the system, so that system parameters can be found to realize the desired N-qubit controlled-unitary operations.