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

Physics Letters A

Probing Weinberg's nonlinear quantum mechanics

Thomas F. Jordan

Published Dec 1, 1990• 6 citations
Publisher
DOI
10.1016/0375-9601(90)90758-g

Related papers

A deficiency of Weinberg's quantum mechanics

Debendranath Sahoo

Letters in Mathematical Physics•Jun 1, 1994•0 citations

Nonlinear quantum mechanics

Gilbert Reinisch

Physica A Statistical Mechanics and its Applications•May 1, 1994•51 citations

Weinberg’s nonlinear quantum mechanics and the Einstein-Podolsky-Rosen paradox

Joseph Polchinski

I show that Weinberg's nonlinear quantum mechanics leads either to communication via Einstein-Podolsky-Rosen correlations, or to communications between branches of the wave function.Received 18 June 1990DOI:https://doi.org/10.1103/PhysRevLett.66.397©1991 American Physical Society

Physical Review Letters•Jan 1, 1991•312 citations

Comments on: ``Weinberg's Nonlinear Quantum Mechanics and Einstein-Podolsky-Rosen paradox'', by Joseph Polchinski

Bogdan Mielnik

Contrary to the opinion of J. Polchinski [Phys.Rev.Lett. {\bf 66}, 397-400 (1991)], the phenomenon of superluminal messages in nonlinear versions of quantum mechanics is not a specific difficulty in a class of theories formulated by S. Weinberg [Ann.Phys. (N.Y.), {\bf 194}, 336-386 (1989)]. It appears in all schemes which try to enlarge the orthodox class of observables, while conserving the traditional structure of the pure and mixed states.

arXiv:quant-ph/0012041•Dec 8, 2000•1 citation

Nonlinear Quantum Mechanics

Pang Xiao Feng

•Oct 19, 2012•2 citations

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
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.