pith. sign in

arxiv: quant-ph/9803019 · v1 · submitted 1998-03-09 · 🪐 quant-ph

Local modification of the Abrams-Lloyd nonlinear algorithm

classification 🪐 quant-ph
keywords algorithmfastabrams-lloydnonlinearunphysicalabramsalgorithmsarbitrarily
0
0 comments X
read the original abstract

The nonlinear algorithms proposed recently by Abrams and Lloyd [Report No. quant-ph/9801041] are fast but make an explicit use of an arbitrarily fast unphysical transfer of information within a quantum computer. It is shown that there exists a simplification of the second Abrams-Lloyd algorithm which eliminates the unphysical effect but keeps the algorithm fast.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.