Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9803019

Local modification of the Abrams-Lloyd nonlinear algorithm

Marek Czachor

Published Mar 9, 1998• 9 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.quant-ph/9803019

Related papers

Notes on nonlinear quantum algorithms

Marek Czachor

Recenty Abrams and Lloyd have proposed a fast algorithm that is based on a nonlinear evolution of a state of a quantum computer. They have explicitly used the fact that nonlinear evolutions in Hilbert spaces do not conserve scalar products of states, and applied a description of separated systems taken from Weinberg's nonlinear quantum mechanics. On the other hand it is known that violation of orthogonality combined with the Weinberg-type description generates unphysical, arbitrarily fast influences between noninteracting systems. It was not therefore clear whether the algorithm is fast because arbitrarily fast unphysical effects are involved. In these notes I show that this is not the case. I analyze both algorithms proposed by Abrams and Lloyd on concrete, simple models of nonlinear evolution. The description I choose is known to be free of the unphysical influences (therefore it is not the Weinberg one). I show, in particular, that the correct local formalism allows even to simplify the algorithm.

arXiv:quant-ph/9802051•Feb 19, 1998•13 citations

Preparation of Approximate Eigenvector by Unitary Operations on Eigenstate in Abrams-Lloyd Quantum Algorithm

Latha S. Warrier

The Abrams-Lloyd quantum algorithm computes an eigenvalue and the corresponding eigenstate of a unitary matrix from an approximate eigenvector Va . The eigenstate is a basis vector in the orthonormal eigenspace. Finding another eigenvalue, using a random approximate eigenvector, may require many trials as the trial may repeatedly result in the eigenvalue measured earlier. We present a method involving orthogonalization of the eigenstate obtained in a trial. It is used as the Va for the next trial. Because of the orthogonal construction, Abrams-Lloyd algorithm will not repeat the eigenvalue measured earlier. Thus, all the eigenvalues are obtained in sequence without repetitions. An operator that anticommutes with a unitary operator orthogonalizes the eigenvectors of the unitary. We implemented the method on the programming language model of quantum computation and tested it on a unitary matrix representing the time evolution operator of a small spin chain. All the eigenvalues of the operator were obtained sequentially. Another use of the first eigenvector from Abrams-Lloyd algorithm is preparing a state that is the uniform superposition of all the eigenvectors. This is possible by nonorthogonalizing the first eigenvector in all dimensions and then applying the Abrams-Lloyd algorithm steps stopping short of the last measurement.

Journal of Computational Methods in Physics•Sep 11, 2013•0 citations

Rapid solution of problems by quantum computation

David Deutsch, Richard Jozsa

Abstract A class of problems is described which can be solved more efficiently by quantum computation than by any classical or stochastic method. The quantum computation solves the problem with certainty in exponentially less time than any classical deterministic computation.

Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences•Dec 8, 1992•2,675 citations

Improvements of the local bosonic algorithm

Beat Jegerlehner

We report on several improvements of the local bosonic algorithm proposed by M. Luescher. We find that preconditioning and over-relaxation works very well. A detailed comparison between the bosonic and the Kramers-algorithms shows comparable performance for the physical situation examined.

•Jan 1, 1996•2 citations

Noisy Effect on Nonlinear Quantum Search Algorithm

J.-P. Tchapet Njafa, S. G. Nana Engo

Abstract In this paper, we investigate the effects of three single‐qubit quantum noise channels on the quantum nonlinear search algorithm proposed by Abrams and Lloyd. We focus on the gates of the nonlinear part of the algorithm and consider the case where the quantum noise channel only affects the qubit on which the gate is proceeding. Assuming that quantum noise effects occur after using the gates of the nonlinear part of the algorithm, we find that the quantum nonlinear search algorithm appears to be very resilient to the quantum noise when the desired state does not exist in the first register and is subject to the phase damping channel or the depolarising channel.

Fortschritte der Physik•Apr 7, 2021•0 citations

Introduction to Quantum Algorithms

Peter W. Shor

These notes discuss the quantum algorithms we know of that can solve problems significantly faster than the corresponding classical algorithms. So far, we have only discovered a few techniques which can produce speed up versus classical algorithms. It is not clear yet whether the reason for this is that we do not have enough intuition to discover more techniques, or that there are only a few problems for which quantum computers can significantly speed up the solution.

arXiv:quant-ph/0005003•Apr 29, 2000•78 citations
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.
Recenty Abrams and Lloyd have proposed a fast algorithm that is based on a nonlinear evolution of a state of a quantum computer. They have explicitly used the fact that nonlinear evolutions in Hilbert spaces do not conserve scalar products of states, and applied a description of separated systems taken from Weinberg's nonlinear quantum mechanics. On the other hand it is known that violation of orthogonality combined with the Weinberg-type description generates unphysical, arbitrarily fast influences between noninteracting systems. It was not therefore clear whether the algorithm is fast because arbitrarily fast unphysical effects are involved. In these notes I show that this is not the case. I analyze both algorithms proposed by Abrams and Lloyd on concrete, simple models of nonlinear evolution. The description I choose is known to be free of the unphysical influences (therefore it is not the Weinberg one). I show, in particular, that the correct local formalism allows even to simplify the algorithm.
The Abrams-Lloyd quantum algorithm computes an eigenvalue and the corresponding eigenstate of a unitary matrix from an approximate eigenvector Va . The eigenstate is a basis vector in the orthonormal eigenspace. Finding another eigenvalue, using a random approximate eigenvector, may require many trials as the trial may repeatedly result in the eigenvalue measured earlier. We present a method involving orthogonalization of the eigenstate obtained in a trial. It is used as the Va for the next trial. Because of the orthogonal construction, Abrams-Lloyd algorithm will not repeat the eigenvalue measured earlier. Thus, all the eigenvalues are obtained in sequence without repetitions. An operator that anticommutes with a unitary operator orthogonalizes the eigenvectors of the unitary. We implemented the method on the programming language model of quantum computation and tested it on a unitary matrix representing the time evolution operator of a small spin chain. All the eigenvalues of the operator were obtained sequentially. Another use of the first eigenvector from Abrams-Lloyd algorithm is preparing a state that is the uniform superposition of all the eigenvectors. This is possible by nonorthogonalizing the first eigenvector in all dimensions and then applying the Abrams-Lloyd algorithm steps stopping short of the last measurement.
Abstract In this paper, we investigate the effects of three single‐qubit quantum noise channels on the quantum nonlinear search algorithm proposed by Abrams and Lloyd. We focus on the gates of the nonlinear part of the algorithm and consider the case where the quantum noise channel only affects the qubit on which the gate is proceeding. Assuming that quantum noise effects occur after using the gates of the nonlinear part of the algorithm, we find that the quantum nonlinear search algorithm appears to be very resilient to the quantum noise when the desired state does not exist in the first register and is subject to the phase damping channel or the depolarising channel.