Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
arXiv:2104.12028 · doi:10.1007/s11128-016-1464-z
Abstract
This paper describes a novel approach to solving unstructured search problems using a classical, signal-based emulation of a quantum computer. The classical nature of the representation allows one to perform subspace projections in addition to the usual unitary gate operations. Although bandwidth requirements will limit the scale of problems that can be solved by this method, it can nevertheless provide a significant computational advantage for problems of limited size. In particular, we find that, for the same number of noisy oracle calls, the proposed subspace projection method provides a higher probability of success for finding a solution than does an single application of Grover's algorithm on the same device.
References in corpus (15)
- Elementary gates for quantum computation
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Strengths and Weaknesses of Quantum Computing
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems
- Quantum versus Classical Annealing of Ising Spin Glasses
- Effects of Noisy Oracle on Search Algorithm Complexity
- Quantum Computing and Hidden Variables I: Mapping Unitary to Stochastic Matrices
- Noise effect on Grover algorithm
- Noise in Grover's Quantum Search Algorithm
- New quantum algorithm for studying NP-complete problems
- Signal-based classical emulation of a universal quantum computer
- Fetching marked items from an unsorted database in NMR ensemble computing
- Classical emulation of a quantum computer