Abstract
A family of algorithms has been recently considered for sure-success quantum search problems. When the phase inversion operations of these algorithms are identical to those of the standard Grover algorithm, it is found that this family of algorithms is robust against the inevitable phase imperfections.
| Original language | English |
|---|---|
| Pages (from-to) | 637-642 |
| Number of pages | 6 |
| Journal | Chinese Journal of Physics |
| Volume | 45 |
| Issue number | 6 I |
| Publication status | Published - 2007 Dec |
All Science Journal Classification (ASJC) codes
- General Physics and Astronomy