PIRSA:16060089

Entanglement maximization and dynamics via joint continuous measurement

APA

Chantasri, A. (2016). Entanglement maximization and dynamics via joint continuous measurement. Perimeter Institute for Theoretical Physics. https://pirsa.org/16060089

MLA

Chantasri, Areeya. Entanglement maximization and dynamics via joint continuous measurement. Perimeter Institute for Theoretical Physics, Jun. 06, 2016, https://pirsa.org/16060089

BibTex

          @misc{ scivideos_PIRSA:16060089,
            doi = {10.48660/16060089},
            url = {https://pirsa.org/16060089},
            author = {Chantasri, Areeya},
            keywords = {Quantum Foundations},
            language = {en},
            title = {Entanglement maximization and dynamics via joint continuous measurement},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2016},
            month = {jun},
            note = {PIRSA:16060089 see, \url{https://scivideos.org/index.php/pirsa/16060089}}
          }
          

Areeya Chantasri University of Rochester

Talk numberPIRSA:16060089
Source RepositoryPIRSA
Collection

Abstract

We investigate the quantum trajectories of jointly monitored transmon qubits, tracking measurement-induced entanglement creation as a continuous process.  The quantum trajectories naturally split into low and high entanglement classes corresponding to partial parity collapse.  We theoretically calculate the distribution of concurrence at any given time and show good agreement with the constructed histogram of measured concurrence trajectories.  The distribution exhibits a sharp cut-off in the high concurrence limit, defining a maximal concurrence boundary.  The most probable paths of the two classes, starting in a separable state and ending in either an entangled state or separable state, are found and compared with the experimentally constructed paths of the sub-ensemble.  The most likely time for the transmon qubits to reach their highest concurrence can also be extracted from the most likely path analysis.