Robust quantum searching with spontaneously decaying qubits
Robert J. C. Spreeuw, Tom W. Hijmans
Abstract
We present a modification of the standard single-item quantum search procedure that acquires robustness from spontaneous decay of the qubits. This damps the usual oscillation of populations, driving the system to a steady state with a strongly enhanced population of the solution. Numerical evaluation of the steady state was performed for up to 36 qubits. The huge size of the state space in our analysis is dealt with by exploiting a symmetry in the master equation that reduces the scaling of computer resources from exponential to polynomial. Based on these results we estimate that an error-free solution can be retrieved from the steady state after O(log log N) repetitions, with near-unit probability. This brings the overall scaling to O(sqrtN log log N), only slightly worse than for the ideal quantum case.
Create a lesson
Related papers
Spectral Fingerprints of Gauge Theories on a Quantum Computer
Graham Van Goffrier, Debasish Banerjee, Bipasha Chakraborty et al.
Dynamics of local quantum information in random unitary circuits
Ratul Thakur, Sthitadhi Roy
Factorized Boolean representations for efficient quantum synthesis
Mehul Shah, Robert Fiszer, Marek Perkowski
Detuning- and Stark-robust Rydberg gates
Elie Bataille, Gyohei Nomura, Manuel Endres
Krylov Break Times from an Inhomogeneous Lieb--Robinson Light Cone
Shunji Matsuura, Yoji Kawamura, Joseph Salfi et al.
Stochastic transport of a Goldstone mode in a self-organized atomic crystal
Zhanhai Yu, Di Xiang, Xiaotian Zhang et al.