Quantum search by continuous-time quantum walk on t-designs

Lugão, Pedro H. G.; Portugal, Renato

doi:10.1007/s11128-024-04355-4

Quantum Inf Process

2024

DOI: 10.1007/s11128-024-04355-4

|View full text |Cite

Quantum search by continuous-time quantum walk on t-designs

Pedro H. G. Lugão,

Renato Portugal

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Multimarked Spatial Search by Continuous-Time Quantum Walk

Lugão,

Portugal,

Sabri

et al. 2024

ACM Transactions on Quantum Computing

View full text Add to dashboard Cite

The quantum-walk-based spatial search problem aims to find a marked vertex using a quantum walk on a graph with marked vertices. We describe a framework for determining the computational complexity of spatial search by continuous-time quantum walk on arbitrary graphs by providing a recipe for finding the optimal running time and the success probability of the algorithm. The quantum walk is driven by a Hamiltonian derived from the adjacency matrix of the graph modified by the presence of the marked vertices. The success of our framework depends on the knowledge of the eigenvalues and eigenvectors of the adjacency matrix. The spectrum of the Hamiltonian is subsequently obtained from the roots of the determinant of a real symmetric matrix M , the dimensions of which depend on the number of marked vertices. The eigenvectors are determined from a basis of the kernel of M . We show each step of the framework by solving the spatial searching problem on the Johnson graphs with a fixed diameter and with two marked vertices. Our calculations show that the optimal running time is \(O(\sqrt {N}) \) with an asymptotic probability of 1 + o (1), where N is the number of vertices.

show abstract

Multimarked Spatial Search by Continuous-Time Quantum Walk

Lugão,

Portugal,

Sabri

et al. 2024

ACM Transactions on Quantum Computing

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Quantum search by continuous-time quantum walk on t-designs

Cited by 1 publication

References 25 publications

Multimarked Spatial Search by Continuous-Time Quantum Walk

Multimarked Spatial Search by Continuous-Time Quantum Walk

Contact Info

Product

Resources

About