Multi-bit gates for quantum computing

Preprint

14 March 2001

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.quant-ph/0012055

Abstract

We present a general technique to implement products of many qubit operators communicating via a joint harmonic oscillator degree of freedom in a quantum computer. By conditional displacements and rotations we can implement Hamiltonians which are trigonometric functions of qubit operators. With such operators we can effectively implement higher order gates such as Toffoli gates and C^n-NOT gates, and we show that the entire Grover search algorithm can be implemented in a direct way.

Keywords

IMPLEMENT PRODUCTS
QUANTUM COMPUTING
GENERAL TECHNIQUE
DEGREE OF FREEDOM
QUBIT OPERATORS
TOFFOLI GATES
MULTI BIT
ALGORITHM
BIT GATES

All Related Versions

Version 1, 2000-12-13, ArXiv
Version 2, 2001-03-14, ArXiv
Published version: Physical Review Letters, 86 (17), 3907.

This publication has 0 references indexed in Scilit: