Showing quant-phShow all
2 papers · 1 filter
quant-ph2000
Quantum Kolmogorov Complexity
Andre Berthiaume, Wim van Dam, Sophie Laplante
In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can…
quant-ph1996
Stabilisation of Quantum Computations by Symmetrisation
Adriano Barenco, Andre` Berthiaume, David Deutsch +3
We propose a method for the stabilisation of quantum computations (including quantum state storage). The method is based on the operation of projection into , the symmetr…