A decision procedure for well-formed linear quantum cellular automata
Christoph Durr, Huong LeThanh, Miklos Santha
Abstract
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in an observation as the squared magnitude of its amplitude. We give an efficient algorithm which decides if a linear quantum cellular automaton is well-formed. The complexity of the algorithm is O(n2) in the algebraic model of computation if the input automaton has continuous neighborhood.
Create a lesson
Related papers
Constructive Arboricity in Almost-Linear Time for Dense Graphs
Iman Gholami, Mohammad T. Hajiaghayi, Mahdi JafariRaviz et al.
Tight asymptotic competitive ratio for the Canadian Traveller Problem on unit-weighted grids
Pierre Bergé, Vsevolod Chernyshev, Malory Marin et al.
Breaking Two Barriers for Dynamic Planar Reachability
Adam Karczmarz, Michał Włodarczyk
Deterministic Girth Approximation in Weighted Undirected Graphs
Avi Kadria
Polynomial directed treewidth forces a large bramble with congestion two
Victor A. Campos, Raul Lopes, Rodrigo Nogueira et al.
Minimizing fuzzy Kripke models over residuated lattices
Linh Anh Nguyen