Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
Any quantum algorithm has to be implemented by quantum circuit. However, due to the existence of decoherence time and the difficulty of importing ancillae qubits, we introduce a new method which can greatly reduce the operating time steps by making good use of relaxing qubits without new ancillae qubits. This concept presented in this paper can be generalized to the other quantum networks.