2011
DOI: 10.1063/1.3630150
|View full text |Cite
|
Sign up to set email alerts
|

Matrix Algebra for Quantum Search Algorithm: Non Unitary Symmetries and Entanglement

Abstract: An algebraic reformulation of the quantum search algorithm associated to a k-valued oracle function, is introduced in terms of the so called oracle matrix algebra, by means of which a Bloch sphere like description of search is obtained. A parametric family of symmetric completely positive trace preserving (CPTP) maps, that formalize the presence of quantum noise but preserves the complexity of the algorithm, is determined. Dimensional reduction of representations of oracle Lie algebra is introduced in order to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 3 publications
0
3
0
Order By: Relevance
“…Here U is a general U (N) unitary matrix, and The oracle algebra. Next, we reconsider the algorithm from an algebraic viewpoint, and to this end, we define the matrix oracle algebra [23]. Let the set = {1, 2, .…”
Section: Fast Search Via the Oracle Algebramentioning
confidence: 99%
“…Here U is a general U (N) unitary matrix, and The oracle algebra. Next, we reconsider the algorithm from an algebraic viewpoint, and to this end, we define the matrix oracle algebra [23]. Let the set = {1, 2, .…”
Section: Fast Search Via the Oracle Algebramentioning
confidence: 99%
“…], N = 2 n } → {0, 1}, c.f. [14][15][16][17]. The work proceeds by treating a set S of cardinality N as a search-able database with no additional structure.…”
Section: Introductionmentioning
confidence: 99%
“…Joined quantum searches, all of which have equal Hilbert space dimension N and share the same shape complexity, are displayed as a pattern of bold typed integer partitions from 3 to 7 within the Young lattice. The pattern of equal complexities is independent from N. We define as the matrix oracle algebra A f with respect to the characteristic function f of I ⊂ ∆, the set A f = {A : A = αΣ 0 (f ) + βΣ 1 (f ) + γΣ 2 (f ) + δΣ 3 (f )} where α, β, γ, δ ∈ R are arbitrary real [9,15].…”
Section: Rowmentioning
confidence: 99%