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

Elsevier eBooks

The Operator j and Complex Numbers

Published Jan 1, 1966• 0 citations
Publisher
DOI
10.1016/b978-0-08-011978-6.50018-1

Related papers

The Operator j and Complex Numbers

Elsevier eBooks•Jan 1, 1966•0 citations

Math interlude A: Complex numbers and linear operators

WORLD SCIENTIFIC eBooks•Mar 26, 2024•0 citations

Relation of operator Schmidt decomposition and CNOT complexity

Mark W. Coffey, Ron Deiotte

We consider two-qubit operators and provide a correspondence between their Schmidt number and controlled-NOT (CNOT) complexity, where the CNOT complexity is up to local unitary operations. The results are obtained by complementary means, and a number of examples are given.

Bulletin of the American Physical Society•Mar 19, 2009•0 citations

Complex Number and Linear Algebra

Biao Wu

Springer eBooks•Jan 1, 2023•0 citations

Representation of complex rational numbers in quantum mechanics

Paul A. Benioff

A representation of complex rational numbers in quantum mechanics is described that is not based on logical or physical qubits. It stems from noting that the 0's in a product qubit state do not contribute to the number. They serve only as place holders. The representation is based on the distribution of four types of systems on an integer lattice. The four types, labeled as positive real, negative real, positive imaginary, and negative imaginary, are represented by creation and annihilation operators acting on the system vacuum state. Complex rational number states correspond to products of creation operators acting on the vacuum. Various operators, including those for the basic arithmetic operations, are described. The representation used here is based on occupation number states and is given for bosons and fermions.

arXiv:quant-ph/0503154•Physical Review A•Sep 13, 2005•6 citations

Complexity analysis of Grover’s algorithm based on matrix representation

Yuxuan Lin, Xiang Zhou

Abstract For unstructured database search problems, Grover’s algorithm has query complexity O ( N ) , which is lower than the O ( N ) query complexity of classical algorithms. This work constructs the matrix forms of the oracle and diffusion operators using a matrix representation. The quantum state is projected onto a two-dimensional subspace spanned by the target and non-target states. The Grover iteration operator is reduced to a rotation matrix whose angle depends on the database size. Based on this reduction, we present the evolution of the quantum state after multiple iterations. We also show the quantitative relationship between the success probability and the number of iterations. When the number of iterations is chosen appropriately, the success probability approaches 1. We further analyze the algebraic structure of the Grover iteration operator. This operator can be decomposed into the identity matrix plus a finite number of rank-one matrices. Multiplication of a single matrix-vector can be performed with complexity O ( N ) . With the optimal number of iterations, the total classical simulation cost is O ( N 3 / 2 ) , whereas the quantum query complexity is O ( N ) .

Laser Physics•Nov 6, 2026•0 citations
A representation of complex rational numbers in quantum mechanics is described that is not based on logical or physical qubits. It stems from noting that the 0's in a product qubit state do not contribute to the number. They serve only as place holders. The representation is based on the distribution of four types of systems on an integer lattice. The four types, labeled as positive real, negative real, positive imaginary, and negative imaginary, are represented by creation and annihilation operators acting on the system vacuum state. Complex rational number states correspond to products of creation operators acting on the vacuum. Various operators, including those for the basic arithmetic operations, are described. The representation used here is based on occupation number states and is given for bosons and fermions.
Abstract For unstructured database search problems, Grover’s algorithm has query complexity O ( N ) , which is lower than the O ( N ) query complexity of classical algorithms. This work constructs the matrix forms of the oracle and diffusion operators using a matrix representation. The quantum state is projected onto a two-dimensional subspace spanned by the target and non-target states. The Grover iteration operator is reduced to a rotation matrix whose angle depends on the database size. Based on this reduction, we present the evolution of the quantum state after multiple iterations. We also show the quantitative relationship between the success probability and the number of iterations. When the number of iterations is chosen appropriately, the success probability approaches 1. We further analyze the algebraic structure of the Grover iteration operator. This operator can be decomposed into the identity matrix plus a finite number of rank-one matrices. Multiplication of a single matrix-vector can be performed with complexity O ( N ) . With the optimal number of iterations, the total classical simulation cost is O ( N 3 / 2 ) , whereas the quantum query complexity is O ( N ) .