A fast quantum circuit for addition with few qubits
暂无分享,去创建一个
[1] Thomas G. Draper,et al. A logarithmic-depth quantum carry-lookahead adder , 2006, Quantum Inf. Comput..
[2] Yong Zhang,et al. Quantum lower bounds for fanout , 2006, Quantum Inf. Comput..
[3] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[4] Samuel A. Kutin. Shor's algorithm on a nearest-neighbor machine , 2006 .
[5] Barenco,et al. Quantum networks for elementary arithmetic operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[6] Stéphane Beauregard. Circuit for Shor's algorithm using 2n+3 qubits , 2003, Quantum Inf. Comput..
[7] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[8] Christof Zalka. Shor's algorithm with fewer (pure) qubits , 2006, quant-ph/0601097.
[9] Phillip Kaye. Reversible addition circuit using one ancillary bit with application to quantum computing , 2004 .
[10] Yasuhiro Takahashi,et al. A linear-size quantum circuit for addition with no ancillary qubits , 2005, Quantum Inf. Comput..
[11] Barenco,et al. Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[12] Thomas G. Draper. Addition on a Quantum Computer , 2000, quant-ph/0008033.