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. © 2006 National Instiute of Informatics.
Author supplied keywords
Cite
CITATION STYLE
Master, C. P., Utsunomiya, S., & Yamamoto, Y. (2006, April). Algorithm-based analysis of collective decoherence in quantum search. Progress in Informatics. https://doi.org/10.2201/NiiPi.2006.3.2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.