Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search
Quantum walks are a powerful framework for simulating complex quantum systems and designing quantum algorithms, particularly for spatial search on graphs, where the goal is to find a marked vertex efficiently. In this work, we present efficient quantum circuits that implement the evolution operator...
Saved in:
| Main Authors: | Renato Portugal, Jalil Khatibi Moqadam |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/27/5/454 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
by: Sergio A Ortega, et al.
Published: (2025-01-01) -
Scalable Structure for Chiral Quantum Routing
by: Giovanni Ragazzi, et al.
Published: (2025-05-01) -
Quantum Circuit Architecture Search on a Superconducting Processor
by: Kehuan Linghu, et al.
Published: (2024-11-01) -
Decomposition of hypercube graphs into paths and cycles having k edges
by: D. Saranya, et al.
Published: (2025-05-01) -
Quantum-Enhanced Generalized Pattern Search Optimization
by: Colton Mikes, et al.
Published: (2024-09-01)