arXiv (All)
open access
Simplification Rules for Continuous-Time Quantum Walks on Dynamic Graphs
Continuous-time quantum walks (CTQWs) on dynamic graphs realize quantum gates as sequences of time-evolving graph Hamiltonians, but naive constructions produce long sequences with redundancy. Simplification rules, which are graph rewrite rules that shorten a dynamic graph sequence while preserving t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The optimal search on graph by continuous-time quantum walks#821630
- One-Shot and Concurrent Hitting Times for Grover-Coined Quantum Walks on Cubelike Graphs#927788
- Complexity of Normalized Persistence Problems for Topological Data Analysis and Local Hamiltonians#1141588
- Self-Trapping Bounds for Continuous-Time Nonlinear Quantum Walks on Path and Cycle Graphs#971809
- Fractional Topological Phases, Flat Bands, and Protected Zero-Energy Edge States in Small Cyclic Quantum Walks#820383
Record · ID 1012645
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive