A Decision Procedure for Unitary Linear Quantum Cellular Automata

From MaRDI portal

Publication:2784493

Jump to:navigation, search

DOI10.1137/S0097539797327702zbMath0997.81021MaRDI QIDQ2784493

Miklos Santha, Christoph Dürr

Publication date: 23 April 2002

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

quantum computation reversible cellular automata complexity of the algorithm

Mathematics Subject Classification ID

Quantum computation (81P68) Cellular automata (computational aspects) (68Q80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Quantifying the parameterized monogamy relation for quantum entanglement with equation ⋮ An overview of quantum cellular automata ⋮ One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations ⋮ When is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)? ⋮ Measurement-Based and Universal Blind Quantum Computation ⋮ From Dirac to diffusion: decoherence in quantum lattice gases

This page was built for publication: A Decision Procedure for Unitary Linear Quantum Cellular Automata

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2784493&oldid=15674724"