Decoherence suppression by parallelization


Autoria(s): Roy, Kallol; Srikanth, R; Srinivas, T
Data(s)

2011

Resumo

Decoherence as an obstacle in quantum computation is viewed as a struggle between two forces [1]: the computation which uses the exponential dimension of Hilbert space, and decoherence which destroys this entanglement by collapse. In this model of decohered quantum computation, a sequential quantum computer loses the battle, because at each time step, only a local operation is carried out but g*(t) number of gates collapse. With quantum circuits computing in parallel way the situation is different- g(t) number of gates can be applied at each time step and number gates collapse because of decoherence. As g(t) ≈ g*(t) competition here is even [1]. Our paper improves on this model by slowing down g*(t) by encoding the circuit in parallel computing architectures and running it in Single Instruction Multiple Data (SIMD) paradigm. We have proposed a parallel ion trap architecture for single-bit rotation of a qubit.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/46114/1/CDAMOP_roy_2011.pdf

Roy, Kallol and Srikanth, R and Srinivas, T (2011) Decoherence suppression by parallelization. In: 3rd International Conference on Current Developments in Atomic, Molecular,Optical & Nano Physics with Applications, 14-16 December 2011 , University of Delhi, Delhi.

Publicador

Laser Science and Technology Centre

Relação

http://www.tbimice.com/cdamop2011/about-conference.asp

http://eprints.iisc.ernet.in/46114/

Palavras-Chave #Electrical Communication Engineering
Tipo

Conference Paper

PeerReviewed