From String Detection to Orthogonal Vector Problem
Intuition
DOI:
10.48550/arxiv.2209.11452
Publication Date:
2022-01-01
AUTHORS (3)
ABSTRACT
Considering Grover's Search Algorithm (GSA) with the standard diffuser stage applied, we revisit $3$-qubit unique String Detection Problem (SDP) and extend algorithm to $4$-qubit SDP multiple winners. We then investigate unstructured search problems non-uniform distributions define Orthogonal Vector (OVP) under quantum settings. Although no numerically stable results is reached original GSA framework, provide intuition behind our implementation further observations on OVP. perform a special case analysis modified framework which aims stabilize final measurement arbitrary initial distribution. Based result of analysis, generalize condition neither nor modification works. Instead utilizing GSA, also propose short-depth circuit that can calculate orthogonal pair for given vector represented as binary string constant runtime.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES ()
CITATIONS ()
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....