Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device

DOI10.1007/S11128-016-1464-ZMaRDI QIDQ2411545zbMATH OpenOpenAlexWikidataFDO

Authors Brian R. La Cour, Corey I. Ostrove

Publication date 24 October 2017

Published in Quantum Information Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2104.12028

zbMATH Keywords

analog electronicsGrover's algorithmquantum computingquantum search

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

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.

Recommendations

• Implementation of efficient quantum search algorithms on NISQ computers
• Signal-based classical emulation of a universal quantum computer
• Classical emulation of a quantum computer
• A new hybrid classical-quantum algorithm for continuous global optimization problems
• A framework for structured quantum search.

Cites work

• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Classical emulation of a quantum computer
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5852793 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• New quantum algorithm for studying NP-complete problems
• Quantum computing and hidden variables
• Quantum cooperative search algorithm for 3-sat
• Quantum versus classical annealing of Ising spin glasses
• Signal-based classical emulation of a universal quantum computer
• Skepticism of quantum computing
• Strengths and Weaknesses of Quantum Computing
• Theory of Computational Complexity

Cited in

(3)

• Implementation of efficient quantum search algorithms on NISQ computers
• Quantum decoherence emulated in a classical device
• Signal-based classical emulation of a universal quantum computer

Describes a project that uses

Uses Software

• qHiPSTER
• JBool

This page was built for publication: Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411545)