REVIEW 2 cited by
Deterministic Search on Complete Bipartite Graphs by Continuous Time Quantum Walk
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper presents a deterministic search algorithm on complete bipartite graphs. Our algorithm adopts the simple form of alternating iterations of an oracle and a continuous-time quantum walk operator, which is a generalization of Grover's search algorithm. We address the most general case of multiple marked states, so there is a problem of estimating the number of marked states. To this end, we construct a quantum counting algorithm based on the spectrum structure of the search operator. To implement the continuous-time quantum walk operator, we perform Hamiltonian simulation in the quantum circuit model. We achieve simulation in constant time, that is, the complexity of the quantum circuit does not scale with the evolution time.
Forward citations
Cited by 2 Pith papers
-
Deterministic quantum search on all Laplacian integral graphs
A new QPE-based circuit implements the Grover diffusion operator exactly on Laplacian integral graphs, giving deterministic spatial search with O(1/√ε) cost on any connected such graph.
-
A Survey on Continuous Variable Quantum Key Distribution for Secure Data Transmission: Toward the Future of Secured Quantum-Networks
A survey of CV-QKD theory, photonic integration, and machine learning advances, with no new results.
Discussion (0). Continue with ORCID to comment.