225 citations · 582 across the 52 of their papers we have counts for
Showing 1999Show all
2 papers · 1 filter
cs.DS1999★ 1 cited
A decision procedure for well-formed linear quantum cellular automata
Christoph Durr, Huong LeThanh, Miklos Santha
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 i…
quant-ph1999★ 26 cited
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
Wim van Dam, Frederic Magniez, Michele Mosca +1
We consider the design of self-testers for quantum gates. A self-tester for the gates F_1,...,F_m is a classical procedure that, given any gates G_1,...,G_m, decides with high prob…