Programmable quantum logic gates using teleportation with non-maximally entangled states
A scheme is proposed for involving programmable quantum logic gates via teleportation, which is a unique technique in quantum mechanics. In our scheme, considering the inevitable decoherence caused by noisy environment, the quantum states are not maximally entangled. We show the implementation of si...
        Saved in:
      
    
          | Published in | Optoelectronics letters Vol. 8; no. 1; pp. 63 - 66 | 
|---|---|
| Main Author | |
| Format | Journal Article | 
| Language | English | 
| Published | 
        Heidelberg
          Tianjin University of Technology
    
        2012
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1673-1905 1993-5013  | 
| DOI | 10.1007/s11801-012-1035-1 | 
Cover
| Summary: | A scheme is proposed for involving programmable quantum logic gates via teleportation, which is a unique technique in quantum mechanics. In our scheme, considering the inevitable decoherence caused by noisy environment, the quantum states are not maximally entangled. We show the implementation of single qubit quantum gates and controlled-NOT (C- NOT) gate, which are universal quantum gates. Hence, any quantum gate can be implemented by using teleportation with non-maximally entangled states. Furthermore, two schemes in differet connections of universal gates are proposed and compared, and our results show the parallel connection outperforms the cascade connection. | 
|---|---|
| Bibliography: | 12-1370/TN A scheme is proposed for involving programmable quantum logic gates via teleportation, which is a unique technique in quantum mechanics. In our scheme, considering the inevitable decoherence caused by noisy environment, the quantum states are not maximally entangled. We show the implementation of single qubit quantum gates and controlled-NOT (C- NOT) gate, which are universal quantum gates. Hence, any quantum gate can be implemented by using teleportation with non-maximally entangled states. Furthermore, two schemes in differet connections of universal gates are proposed and compared, and our results show the parallel connection outperforms the cascade connection.  | 
| ISSN: | 1673-1905 1993-5013  | 
| DOI: | 10.1007/s11801-012-1035-1 |