| doi:10.2201/NiiPi.2006.3.2 |
| Algorithm-based analysis of collective decoherence in quantum search |
| Cyrus P. MASTER1, Shoko UTSUNOMIYA2, Yoshihisa YAMAMOTO3 |
1,2,3 National Institute of Informatics, Tokyo, Japan
1,3 E.L. Ginzton Laboratory, Stanford University, Stanford, CA
2,3 Department of Information and Communication Engineering, The University of Tokyo, Tokyo, Japan
|
(Received: January 31, 2006)
(Revised: March 20, 2006)
(Accepted: March 24, 2006)
|
Abstract:
A major challenge in the implementation of quantum computers is mitigating the impact of undesired couplings with the environment that lead to decoherence. Here, we discuss an error-avoiding strategy that is based upon freedoms inherent in decomposing a quantum algorithm into fundamental gates. Although this approach is specific to a particular algorithm and a collective noise model, it does not the require complicated encodings or significant additional qubit resources of more general error-correcting codes. This paper also includes an overview of quantum computation, including a discussion of the quantum search algorithm.
|
Keywords:
Quantum computation, quantum error-correction, decoherence, quantum algorithms, spin-boson models, decoherenec-free subspaces
|
|
|
| PDF(837KB) | References |
National Institute of Informatics is a member of CrossRef.
|
