26 citations · 78 across the 21 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
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…
Initial states and decoherence of histories
Artur Scherer, Andrei N. Soklakov
We study decoherence properties of arbitrarily long histories constructed from a fixed projective partition of a finite dimensional Hilbert space. We show that decoherence of such…
A simple necessary decoherence condition for a set of histories
Artur Scherer, Andrei N. Soklakov, Ruediger Schack
Within the decoherent histories formulation of quantum mechanics, we investigate necessary conditions for decoherence of arbitrarily long histories. We prove that fine-grained hist…