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

Some remarks on a conditional unitary operator

Osamu Hirota

Published May 1, 1991• 14 citations
Publisher
DOI
10.1016/0375-9601(91)91036-d

Related papers

A remark on the unitary squeeze operators

Felipe Araújo de Oliveira, I. A. Pedrosa, B. Baseia

Il Nuovo cimento della Società italiana di fisica. B/Il Nuovo cimento B•Mar 1, 1993•0 citations

A Generalization of Grover's Algorithm

Luigi Accardi, Ruben Sabbadini

We investigate the necessary and sufficient conditions in order that a unitary operator can amplify a pre-assigned component relative to a particular basis of a generic vector at the expence of the other components. This leads to a general method which allows, given a vector and one of its components we want to amplify, to choose the optimal unitary operator which realizes that goal. Grover’s quantum algorithm is shown to be a particular case of our general method. However the general structure of the unitary we find is remarkably similar to that of Grover’s one: a sign flip of one component combined with a reflection with respect to a vector. In Grover’s case this vector is fixed; in our case it depends on a parameter and this allows optimization. 1 Unitary operators which increase the probability of the |0> component of a pre-assigned vector

•Jan 1, 2000•5 citations

The unitary representation operators

G. Alagar Ramanujam

International Journal of Theoretical Physics•Apr 1, 1975•0 citations

On the Unitary Group and Associated Operators

Atri Mukhopadhyay

Lecture notes in chemistry•Jan 1, 1989•0 citations

A Generalization of Grover's Algorithm

Luigi Accardi, Ruben Sabbadini

We investigate the necessary and sufficient conditions in order that a unitary operator can amplify a pre-assigned component relative to a particular basis of a generic vector at the expense of the other components. This leads to a general method which allows, given a vector and one of its components we want to amplify, to choose the optimal unitary operator which realizes that goal. Grover's quantum algorithm is shown to be a particular case of our general method. However the general structure of the unitary we find is remarkably similar to that of Grover's one: a sign flip of one component combined with a reflection with respect to a vector. In Grover's case this vector is fixed; in our case it depends on a parameter and this allows optimization.

arXiv:quant-ph/0012143•Dec 27, 2000•0 citations

Bound States and the Interaction Representation

S. T.

The temporal development of the state vectors in the interaction representation is investigated for a quantum-mechanical system that has bound states. It is shown that there is a non-unitary operator which determines the variation of the state vectors of the free states. This operator satisfies the same differential equation and initial condition as the unitary operator which transforms a state vector at the remote past to the state vector at a finite time or in the remote future. The present investigation is relevant to a remark made by H. S. Snyder.No iteration process is made use of in the general investigation. Born's method of successive approximations is discussed at the end.

Physical Review•Aug 15, 1952•15 citations
We investigate the necessary and sufficient conditions in order that a unitary operator can amplify a pre-assigned component relative to a particular basis of a generic vector at the expence of the other components. This leads to a general method which allows, given a vector and one of its components we want to amplify, to choose the optimal unitary operator which realizes that goal. Grover’s quantum algorithm is shown to be a particular case of our general method. However the general structure of the unitary we find is remarkably similar to that of Grover’s one: a sign flip of one component combined with a reflection with respect to a vector. In Grover’s case this vector is fixed; in our case it depends on a parameter and this allows optimization. 1 Unitary operators which increase the probability of the |0> component of a pre-assigned vector
We investigate the necessary and sufficient conditions in order that a unitary operator can amplify a pre-assigned component relative to a particular basis of a generic vector at the expense of the other components. This leads to a general method which allows, given a vector and one of its components we want to amplify, to choose the optimal unitary operator which realizes that goal. Grover's quantum algorithm is shown to be a particular case of our general method. However the general structure of the unitary we find is remarkably similar to that of Grover's one: a sign flip of one component combined with a reflection with respect to a vector. In Grover's case this vector is fixed; in our case it depends on a parameter and this allows optimization.
The temporal development of the state vectors in the interaction representation is investigated for a quantum-mechanical system that has bound states. It is shown that there is a non-unitary operator which determines the variation of the state vectors of the free states. This operator satisfies the same differential equation and initial condition as the unitary operator which transforms a state vector at the remote past to the state vector at a finite time or in the remote future. The present investigation is relevant to a remark made by H. S. Snyder.No iteration process is made use of in the general investigation. Born's method of successive approximations is discussed at the end.