Algorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of quantum state transfer
| dc.contributor.author | Rungta, Pranaw | |
| dc.date.accessioned | 2013-05-02T07:16:56Z | |
| dc.date.available | 2013-05-02T07:16:56Z | |
| dc.date.issued | 2012 | |
| dc.description | Only IISERM authors are available in the record. | |
| dc.description.abstract | We propose an iterative algorithm to simulate the dynamics generated by any n-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator U (unitary) into a product of different time-step unitaries. The algorithm product-decomposes U in a chosen operator basis by identifying a certain symmetry of U that is intimately related to the number of gates in the decomposition. We illustrate the algorithm by first obtaining a polynomial decomposition in the Pauli basis of the n-qubit quantum state transfer unitary by Di Franco that transports quantum information from one end of a spin chain to the other, and then implement it in nuclear magnetic resonance to demonstrate that the decomposition is experimentally viable. We further experimentally test the resilience of the state transfer to static errors in the coupling parameters of the simulated Hamiltonian. This is done by decomposing and simulating the corresponding imperfect unitaries. | en_US |
| dc.identifier.citation | Physical Review A - Atomic, Molecular, and Optical Physics, 85 (3), art. no. 030303 | en_US |
| dc.identifier.uri | http://pra.aps.org/abstract/PRA/v85/i3/e030303 | en_US |
| dc.identifier.uri | 10.1103/PhysRevA.85.030303 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | American Physical Society | en_US |
| dc.subject | Algorithmic approach | en_US |
| dc.subject | Coupling parameters | en_US |
| dc.subject | Hamiltonian dynamics | en_US |
| dc.title | Algorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of quantum state transfer | en_US |
| dc.type | Article | en_US |