3 citations · 3 across the 1 of their papers we have counts for
2 papers
quant-ph2004★ 3 cited
Efficient state preparation for a register of quantum bits
Andrei N. Soklakov, Ruediger Schack
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quan…
cs.LG2000
Complexity analysis for algorithmically simple strings
Andrei N. Soklakov
Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functi…