Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State

Details Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State

2001-04-05

arxiv.org/abs/quant-ph/0104030v1

Phys. Rev. A64 (2001) 014303

Physics

Quantum Physics

4 pages, 4 figures, accepted by Phys. Rev. A

Scientific paper

10.1103/PhysRevA.64.014303

Preparation of a quantum register is an important step in quantum computation and quantum information processing. It is straightforward to build a simple quantum state such as $|i_1 i_2 ... i_n\ket$ with $i_j$ being either 0 or 1, but is a non-trivial task to construct an {\it arbitrary} superposed quantum state. In this Paper, we present a scheme that can most generally initialize a quantum register with an arbitrary superposition of basis states. Implementation of this scheme requires $O(Nn^2)$ standard 1- and 2-bit gate operations, {\it without introducing additional quantum bits}. Application of the scheme in some special cases is discussed.

Affiliated with

Also associated with

No associations

Rating

Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-657679