Growing random graphs with quantum rules
From MaRDI portal
Trees (05C05) Random walks on graphs (05C81) Continuous-time Markov processes on general state spaces (60J25) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Symmetry breaking in quantum theory (81R40) Quantum stochastic calculus (81S25) Economics of information (91B44) Social learning (91D15)
Recommendations
Cites work
- A quantum walk with both a continuous-time limit and a continuous-spacetime limit
- Collective dynamics of `small-world' networks
- Communication Theory of Secrecy Systems*
- Complexity of stoquastic frustration-free Hamiltonians
- Emergence of Scaling in Random Networks
- Exploring complex networks
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- On tables of random numbers
- Quantum Walk Algorithm for Element Distinctness
- Quantum walk public-key cryptographic system
- Quantum walks on graphs
- The Monte Carlo Method
- Unified dynamics for microscopic and macroscopic systems
This page was built for publication: Growing random graphs with quantum rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020602)