Physics – Quantum Physics
Scientific paper
2009-10-14
Quantum Information and Computation, Vol. 10, No. 9&10, (2010) 0872-0890
Physics
Quantum Physics
17 pages, 5 figures, 1 table, presented at the 9th Asian Conference on Quantum Information Science, 2009
Scientific paper
We first show how to construct an O(n)-depth O(n)-size quantum circuit for addition of two n-bit binary numbers with no ancillary qubits. The exact size is 7n-6, which is smaller than that of any other quantum circuit ever constructed for addition with no ancillary qubits. Using the circuit, we then propose a method for constructing an O(d(n))-depth O(n)-size quantum circuit for addition with O(n/d(n)) ancillary qubits for any d(n)=\Omega(log n). If we are allowed to use unbounded fan-out gates with length O(n^c) for an arbitrary small positive constant c, we can modify the method and construct an O(e(n))-depth O(n)-size circuit with o(n) ancillary qubits for any e(n)=\Omega(log* n). In particular, these methods yield efficient circuits with depth O(log n) and with depth O(log* n), respectively. We apply our circuits to constructing efficient quantum circuits for Shor's discrete logarithm algorithm.
Kunihiro Noboru
Takahashi Yasuhiro
Tani Seiichiro
No associations
LandOfFree
Quantum Addition Circuits and Unbounded Fan-Out 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 Quantum Addition Circuits and Unbounded Fan-Out, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Addition Circuits and Unbounded Fan-Out will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-18718