Simplifying continuous-time quantum walks on dynamic graphs

Herrman, Rebekah; Wong, Thomas G.

doi:10.1007/s11128-021-03403-7

Cited by 5 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Introductionmentioning

confidence: 99%

Decoherence and classicalization of continuous-time quantum walks on graphs

Bressanini,

Benedetti,

Paris

2022

Preprint

View full text Add to dashboard Cite

We address decoherence and classicalization of continuous-time quantum walks (CTQWs) on graphs. In particular, we investigate three different models of decoherence, and employ the quantum-classical (QC) dynamical distance as a figure of merit to assess whether, and to which extent, decoherence classicalizes the CTQW, i.e. turns it into the analogue classical process. We show that the dynamics arising from intrinsic decoherence, i.e. dephasing in the energy basis, do not fully classicalize the walker and partially preserves quantum features. On the other hand, dephasing in the position basis, as described by the Haken-Strobl master equation or by the quantum stochastic walk (QSW) model, asymptotically destroys the quantumness of the walker, making it equivalent to a classical random walk. We also investigate the speed of the classicalization process, and observe a faster convergence of the QC-distance to its asymptotic value for intrinsic decoherence and the QSW models, whereas in the Haken-Strobl scenario, larger values of the decoherence rate induce localization of the walker.

show abstract

Section: Introductionmentioning

confidence: 99%

Decoherence and classicalization of continuous-time quantum walks on graphs

Bressanini,

Benedetti,

Paris

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Quantum walks on graphs are used to describe the transport of energy or information across a given structure in several physical, chemical and biological systems [8][9][10][11]. They also proved to be powerful tools for building quantum algorithms [12,13] and provide a universal model of quantum computation [14][15][16]. Experimental implementations of quantum walks unavoidably involve the interaction with an external environment, and a question arises on whether, and to which extent, the open quantum system dynamics of a quantum walker is detrimental to its quantum features.…”

mentioning

confidence: 99%

Decoherence and classicalization of continuous-time quantum walks on graphs

Gabriele

Benedetti

Paris

2022

Quantum Inf Process

View full text Add to dashboard Cite

We address decoherence and classicalization of continuous-time quantum walks (CTQWs) on graphs. In particular, we investigate three different models of decoherence and employ the quantum-classical (QC) dynamical distance as a figure of merit to assess whether, and to which extent, decoherence classicalizes the CTQW, i.e. turns it into the analogue classical process. We show that the dynamics arising from intrinsic decoherence, i.e. dephasing in the energy basis, do not fully classicalize the walker and partially preserves quantum features. On the other hand, dephasing in the position basis, as described by the Haken–Strobl master equation or by the quantum stochastic walk (QSW) model, asymptotically destroys the quantumness of the walker, making it equivalent to a classical random walk. We also investigate how fast is the classicalization process and observe a larger rate of convergence of the QC-distance to its asymptotic value for intrinsic decoherence and the QSW models, whereas in the Haken–Strobl scenario, larger values of the decoherence rate induce localization of the walker.

show abstract

n-qubit operations on sphere and queueing scaling limits for programmable quantum computer

Dai

2023

Quantum Inf Process

View full text Add to dashboard Cite

Simplifying continuous-time quantum walks on dynamic graphs

Cited by 5 publications

References 16 publications

Decoherence and classicalization of continuous-time quantum walks on graphs

Decoherence and classicalization of continuous-time quantum walks on graphs

Decoherence and classicalization of continuous-time quantum walks on graphs

n-qubit operations on sphere and queueing scaling limits for programmable quantum computer

Contact Info

Product

Resources

About