Fault-ignorant quantum search
We investigate the problem of quantum searching on a noisy quantum computer. Taking a fault-ignorant approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand. We prove lower bounds on the runtime of such algorithms and t...
Main Authors: | Péter Vrana, David Reeb, Daniel Reitzner, Michael M Wolf |
---|---|
Format: | Article |
Language: | English |
Published: |
IOP Publishing
2014-01-01
|
Series: | New Journal of Physics |
Subjects: | |
Online Access: | https://doi.org/10.1088/1367-2630/16/7/073033 |
Similar Items
-
Entanglement in Quantum Search Database: Periodicity Variations and Counting
by: Demosthenes Ellinas, et al.
Published: (2022-07-01) -
Conditions for advantageous quantum Bitcoin mining
by: Robert R. Nerem, et al.
Published: (2023-09-01) -
Quantum Implementation of AIM: Aiming for Low-Depth
by: Kyungbae Jang, et al.
Published: (2024-03-01) -
Quantum Algorithm for Variant Maximum Satisfiability
by: Abdirahman Alasow, et al.
Published: (2022-11-01) -
Quantum Image Steganography Protocol Based on Quantum Image Expansion and Grover Search Algorithm
by: Zhiguo Qu, et al.
Published: (2019-01-01)