Tunable Tradeoff between Quantum and Classical Computation via Nonunitary Zeno-like Dynamics
arXiv:2011.10901 · doi:10.1103/PhysRevApplied.18.044060
Abstract
We propose and analyze a nonunitary variant of the continuous time Grover search algorithm based on frequent Zeno-type measurements. We show that the algorithm scales similarly to the pure quantum version by deriving tight analytical lower bounds on its efficiency for arbitrary database sizes and measurement parameters. We also study the behavior of the algorithm subject to noise, and find that under certain oracle and operational errors our measurement-based algorithm outperforms the standard algorithm, showing robustness against these noises. Our analysis is based on deriving a non-hermitian effective description of the algorithm, which yields a deeper insight into components responsible for the quantum and the classical operation of the protocol.
References in corpus (13)
- Quantum Zeno dynamics: mathematical and physical aspects
- Linking Quantum Discord to Entanglement in a Measurement
- Simulating quantum many-body dynamics on a current digital quantum computer
- Quantum computers as universal quantum simulators: state-of-art and perspectives
- Quantum Computing in Plato's Cave
- Long-range entanglement generation via frequent measurements
- Quantum evolution in the stroboscopic limit of repeated measurements
- Two-qubit entanglement generation through non-Hermitian Hamiltonians induced by repeated measurements on an ancilla
- Measurement-induced chaos and quantum state discrimination in an iterated Tavis-Cummings scheme
- Optimal computation with non-unitary quantum walks
- Non adiabatic quantum search algorithms
- Resonant Quantum Search with Monitor Qubits
- Polaron formation in a spin chain by measurement-induced imaginary Zeeman field