Pati, Arun Kumar ; Pradhan, Biswajit ; Agrawal, Pankaj (2012) Entangled brachistochrone: minimum time to reach the target entangled state Quantum Information Processing, 11 (3). pp. 841-851. ISSN 1570-0755
Full text not available from this repository.
Official URL: http://link.springer.com/article/10.1007/s11128-01...
Related URL: http://dx.doi.org/10.1007/s11128-011-0309-z
Abstract
We address the question: Given an arbitrary initial state and a general physical interaction what is the minimum time for reaching a target entangled state? We show that the minimum time is inversely proportional to the quantum mechanical uncertainty in the non-local Hamiltonian. We find that the presence of initial entanglement helps to minimize the waiting time. We bring out a connection between the entangled brachistochrone and the entanglement rate. Furthermore, we find that in a bi-local rotating frame the entangling capability is actually a geometric quantity. We give a bound for the time average of entanglement rate for general quantum systems which goes as Γ ≤ 2 log N(ΔH/hS0). The time average of entanglement rate does not depend on the particular Hamiltonian, rather on the fluctuation in the Hamiltonian. There can be infinite number of nonlocal Hamiltonians which may give same average entanglement rate. We also prove a composition law for minimum time when the system evolves under a composite Hamiltonian.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Springer. |
Keywords: | Quantum Entanglement; Geometric Uncertainty Relation; Composite Hamiltonian; Quantum Computation |
ID Code: | 105398 |
Deposited On: | 09 Mar 2018 11:40 |
Last Modified: | 09 Mar 2018 11:40 |
Repository Staff Only: item control page