A decision procedure for unitary linear quantum cellular automata
Conference
·
OSTI ID:457635
- Universite Paris-Sud, Orsay (France)
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution operator has to be a unitary transformation. In this paper we give an efficient algorithm to decide if a linear quantum cellular automaton is unitary. The complexity of the algorithm is O(n 4r-3/r+1) = O(n{sup 4}) if the automaton has a continuous neighborhood of size r.
- OSTI ID:
- 457635
- Report Number(s):
- CONF-961004-; TRN: 97:001036-0006
- Resource Relation:
- Conference: 37. annual symposium on foundations of computer science, Burlington, VT (United States), 13-16 Oct 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the 37th annual symposium on foundations of computer science; PB: 656 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
From quantum cellular automata to quantum lattice gases
Weyl, Dirac, and Maxwell equations on a lattice as unitary cellular automata
Quantum-cellular-automata quantum computing with endohedral fullerenes
Journal Article
·
Sun Dec 01 00:00:00 EST 1996
· Journal of Statistical Physics
·
OSTI ID:457635
Weyl, Dirac, and Maxwell equations on a lattice as unitary cellular automata
Journal Article
·
Wed Jun 15 00:00:00 EDT 1994
· Physical Review, D (Particles Fields); (United States)
·
OSTI ID:457635
Quantum-cellular-automata quantum computing with endohedral fullerenes
Journal Article
·
Thu May 01 00:00:00 EDT 2003
· Physical Review. A
·
OSTI ID:457635