activity
19992026
most citedClassical limit in terms of symbolic dynamics for the quantum baker's map

26 citations · 78 across the 21 of their papers we have counts for

collaborators
Showing quant-phShow all

13 papers · 1 filter

quant-ph2005

Bayesian updating of a probability distribution encoded on a quantum register

Andrei N. Soklakov, Ruediger Schack

We investigate the problem of Bayesian updating of a probability distribution encoded in the quantum state of n qubits. The updating procedure takes the form of a quantum algorithm…

quant-ph2005★ 1 cited

Classical predictability and coarse-grained evolution of the quantum baker's map

Artur Scherer, Andrei N. Soklakov, Ruediger Schack

We investigate how classical predictability of the coarse-grained evolution of the quantum baker's map depends on the character of the coarse-graining. Our analysis extends earlier…

quant-ph2004★ 1 cited

Hypothesis elimination on a quantum computer

Andrei N. Soklakov, Ruediger Schack

Hypothesis elimination is a special case of Bayesian updating, where each piece of new data rules out a set of prior hypotheses. We describe how to use Grover's algorithm to perfor…

quant-ph2004★ 2 cited

Decoherence properties of arbitrarily long histories

Artur Scherer, Andrei N. Soklakov

Within the decoherent histories formulation of quantum mechanics, we consider arbitrarily long histories constructed from a fixed projective partition of a finite-dimensional Hilbe…

quant-ph2004★ 4 cited

State preparation based on Grover's algorithm in the presence of global information about the state

Andrei N. Soklakov, Ruediger Schack

In a previous paper [quant-ph/0408045] we described a quantum algorithm to prepare an arbitrary state of a quantum register with arbitrary fidelity. Here we present an alternative…

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…