Robust quantum searching with spontaneously decaying qubits
- 8 August 2007
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 76 (2) , 022306
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 repetitions, with near-unit probability. This brings the overall scaling to , only slightly worse than for the ideal quantum case.
Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Entangled Light from White NoisePhysical Review Letters, 2002
- Entangling atoms and ions in dissipative environmentsJournal of Modern Optics, 2000
- Cavity-loss-induced generation of entangled atomsPhysical Review A, 1999
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Quantum Computation with Phase Drift ErrorsPhysical Review Letters, 1997
- Quantum computers and dissipationProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1996
- Factoring in a dissipative quantum computerPhysical Review A, 1996
- Error Correcting Codes in Quantum TheoryPhysical Review Letters, 1996
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995
- Maintaining coherence in quantum computersPhysical Review A, 1995