Accelerating quantum information transfer in a three-level system via a specified intermediate Hamiltonian

Abstract We propose a general approach to speed up quantum adiabatic processes for fast quantum information transfer in a three-level system. In the approach, by using an intermediate Hamiltonian which is assumed to be formed by the original Hamiltonian <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:msub> <mml:mi>H</mml:mi> <mml:mrow> <mml:mn>0</mml:mn> </mml:mrow> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>t</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> and its counterdiabatic driving Hamiltonian <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:msub> <mml:mi>H</mml:mi> <mml:mtext>cd</mml:mtext> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>t</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> with a simple linear relationship, we design exact dynamics following the eigenstates of the intermediate Hamiltonian to speed up the desired population processes. We apply the present approach to a three-level system to show that by suitably choosing the parameters, not only the population processes could be sped up, but also the existence of the undesired off-diagonal terms, the populations of the intermediate states, and even the shapes of the pulses would be controllable in the speeding up scheme.

Authors

Institutions

Publication Details

Journal
Laser Physics Letters
Published
2024-10-23
DOI
https://doi.org/10.1088/1612-202x/ad724e
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accelerating quantum information transfer in a three-level system via a specified intermediate Hamiltonian

Ye‐Hong Chen, Chuankun Huang
Laser Physics Letters
Quantum Information and Cryptography
article

Accelerating quantum information transfer in a three-level system via a specified intermediate Hamiltonian

Ye‐Hong Chen, Chuankun Huang
article en

Abstract

Abstract We propose a general approach to speed up quantum adiabatic processes for fast quantum information transfer in a three-level system. In the approach, by using an intermediate Hamiltonian which is assumed to be formed by the original Hamiltonian <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:msub> <mml:mi>H</mml:mi> <mml:mrow> <mml:mn>0</mml:mn> </mml:mrow> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>t</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> and its counterdiabatic driving Hamiltonian <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:msub> <mml:mi>H</mml:mi> <mml:mtext>cd</mml:mtext> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>t</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> with a simple linear relationship, we design exact dynamics following the eigenstates of the intermediate Hamiltonian to speed up the desired population processes. We apply the present approach to a three-level system to show that by suitably choosing the parameters, not only the population processes could be sped up, but also the existence of the undesired off-diagonal terms, the populations of the intermediate states, and even the shapes of the pulses would be controllable in the speeding up scheme.

Laser Physics LettersVol. 21(12)
Fujian Special Equipment Inspection Institute (CN), Fuzhou University (CN)
Openalex Percentile: Top 84%
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.