arXiv (All)
open access
Faster Computation with the Generalized Laplacian Quantum Walk
Quantum walks are the quantum analogues of classical random walks or Markov chains. They are universal models of quantum computing, and they underpin a variety of quantum algorithms. We prove that a continuous-time quantum walk effected by a generalized Laplacian, which can arise in spin chains, can
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
- On the optimality of the radical-pair quantum compass#146997
- Probabilistic Storage and Retrieval of Quantum Superchannels for "Retrospective" Intervention#1141578
- Temporal Rate and Quantum Probability: Consistency Theorems and a Falsifiability Framework for Temporal Rate Ontology#690221
- Quantum Stochastic Walks on the Permutation Group#1160765
- Continuous-Time Quantum Walks based Graph Neural Network#659292
Record · ID 997312
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