Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/140
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRungta, Pranaw-
dc.date.accessioned2013-05-02T07:16:56Z-
dc.date.available2013-05-02T07:16:56Z-
dc.date.issued2012-
dc.identifier.citationPhysical Review A - Atomic, Molecular, and Optical Physics, 85 (3), art. no. 030303en_US
dc.identifier.urihttp://pra.aps.org/abstract/PRA/v85/i3/e030303en_US
dc.identifier.uri10.1103/PhysRevA.85.030303en_US
dc.descriptionOnly IISERM authors are available in the record.-
dc.description.abstractWe 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.language.isoenen_US
dc.publisherAmerican Physical Societyen_US
dc.subjectAlgorithmic approachen_US
dc.subjectCoupling parametersen_US
dc.subjectHamiltonian dynamicsen_US
dc.titleAlgorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of quantum state transferen_US
dc.typeArticleen_US
Appears in Collections:Research Articles

Files in This Item:
File Description SizeFormat 
Need to add pdf.odt8.63 kBOpenDocument TextView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.