scientific article; zbMATH DE number 7453153
From MaRDI portal
Publication:5020598
zbMath1487.81044arXiv2004.01329MaRDI QIDQ5020598
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/2004.01329
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Cellular automata (computational aspects) (68Q80) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Using quantum computers for quantum simulation
- The role of the representational entity in physical computing
- When does a physical system compute?
- Universal Computation by Multiparticle Quantum Walk
- Heterotic Computing
- QUANTUM WALKS ON GENERAL GRAPHS
- Physical Computation
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- Exponential algorithmic speedup by a quantum walk
- Quantum algorithms: entanglement–enhanced information processing
- Models and reality
- Strengths and Weaknesses of Quantum Computing
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication:
